MAYBE
837.06/297.03	MAYBE
837.06/297.03	
837.06/297.03	We are left with following problem, upon which TcT provides the
837.06/297.03	certificate MAYBE.
837.06/297.03	
837.06/297.03	Strict Trs:
837.06/297.03	  { from(X) -> cons(X, n__from(n__s(X)))
837.06/297.03	  , from(X) -> n__from(X)
837.06/297.03	  , sel(0(), cons(X, XS)) -> X
837.06/297.03	  , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
837.06/297.03	  , s(X) -> n__s(X)
837.06/297.03	  , activate(X) -> X
837.06/297.03	  , activate(n__from(X)) -> from(activate(X))
837.06/297.03	  , activate(n__s(X)) -> s(activate(X))
837.06/297.03	  , activate(n__zWquot(X1, X2)) -> zWquot(activate(X1), activate(X2))
837.06/297.03	  , minus(X, 0()) -> 0()
837.06/297.03	  , minus(s(X), s(Y)) -> minus(X, Y)
837.06/297.03	  , quot(0(), s(Y)) -> 0()
837.06/297.03	  , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
837.06/297.03	  , zWquot(X1, X2) -> n__zWquot(X1, X2)
837.06/297.03	  , zWquot(XS, nil()) -> nil()
837.06/297.03	  , zWquot(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	    cons(quot(X, Y), n__zWquot(activate(XS), activate(YS)))
837.06/297.03	  , zWquot(nil(), XS) -> nil() }
837.06/297.03	Obligation:
837.06/297.03	  runtime complexity
837.06/297.03	Answer:
837.06/297.03	  MAYBE
837.06/297.03	
837.06/297.03	None of the processors succeeded.
837.06/297.03	
837.06/297.03	Details of failed attempt(s):
837.06/297.03	-----------------------------
837.06/297.03	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
837.06/297.03	   following reason:
837.06/297.03	   
837.06/297.03	   Computation stopped due to timeout after 297.0 seconds.
837.06/297.03	
837.06/297.03	2) 'Best' failed due to the following reason:
837.06/297.03	   
837.06/297.03	   None of the processors succeeded.
837.06/297.03	   
837.06/297.03	   Details of failed attempt(s):
837.06/297.03	   -----------------------------
837.06/297.03	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
837.06/297.03	      seconds)' failed due to the following reason:
837.06/297.03	      
837.06/297.03	      Computation stopped due to timeout after 148.0 seconds.
837.06/297.03	   
837.06/297.03	   2) 'Best' failed due to the following reason:
837.06/297.03	      
837.06/297.03	      None of the processors succeeded.
837.06/297.03	      
837.06/297.03	      Details of failed attempt(s):
837.06/297.03	      -----------------------------
837.06/297.03	      1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
837.06/297.03	         to the following reason:
837.06/297.03	         
837.06/297.03	         The processor is inapplicable, reason:
837.06/297.03	           Processor only applicable for innermost runtime complexity analysis
837.06/297.03	      
837.06/297.03	      2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
837.06/297.03	         following reason:
837.06/297.03	         
837.06/297.03	         The processor is inapplicable, reason:
837.06/297.03	           Processor only applicable for innermost runtime complexity analysis
837.06/297.03	      
837.06/297.03	   
837.06/297.03	   3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
837.06/297.03	      failed due to the following reason:
837.06/297.03	      
837.06/297.03	      None of the processors succeeded.
837.06/297.03	      
837.06/297.03	      Details of failed attempt(s):
837.06/297.03	      -----------------------------
837.06/297.03	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
837.06/297.03	         failed due to the following reason:
837.06/297.03	         
837.06/297.03	         match-boundness of the problem could not be verified.
837.06/297.03	      
837.06/297.03	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
837.06/297.03	         failed due to the following reason:
837.06/297.03	         
837.06/297.03	         match-boundness of the problem could not be verified.
837.06/297.03	      
837.06/297.03	   
837.06/297.03	
837.06/297.03	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
837.06/297.03	   the following reason:
837.06/297.03	   
837.06/297.03	   We add the following weak dependency pairs:
837.06/297.03	   
837.06/297.03	   Strict DPs:
837.06/297.03	     { from^#(X) -> c_1(X, X)
837.06/297.03	     , from^#(X) -> c_2(X)
837.06/297.03	     , sel^#(0(), cons(X, XS)) -> c_3(X)
837.06/297.03	     , sel^#(s(N), cons(X, XS)) -> c_4(sel^#(N, activate(XS)))
837.06/297.03	     , s^#(X) -> c_5(X)
837.06/297.03	     , activate^#(X) -> c_6(X)
837.06/297.03	     , activate^#(n__from(X)) -> c_7(from^#(activate(X)))
837.06/297.03	     , activate^#(n__s(X)) -> c_8(s^#(activate(X)))
837.06/297.03	     , activate^#(n__zWquot(X1, X2)) ->
837.06/297.03	       c_9(zWquot^#(activate(X1), activate(X2)))
837.06/297.03	     , zWquot^#(X1, X2) -> c_14(X1, X2)
837.06/297.03	     , zWquot^#(XS, nil()) -> c_15()
837.06/297.03	     , zWquot^#(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	       c_16(quot^#(X, Y), activate^#(XS), activate^#(YS))
837.06/297.03	     , zWquot^#(nil(), XS) -> c_17()
837.06/297.03	     , minus^#(X, 0()) -> c_10()
837.06/297.03	     , minus^#(s(X), s(Y)) -> c_11(minus^#(X, Y))
837.06/297.03	     , quot^#(0(), s(Y)) -> c_12()
837.06/297.03	     , quot^#(s(X), s(Y)) -> c_13(s^#(quot(minus(X, Y), s(Y)))) }
837.06/297.03	   
837.06/297.03	   and mark the set of starting terms.
837.06/297.03	   
837.06/297.03	   We are left with following problem, upon which TcT provides the
837.06/297.03	   certificate MAYBE.
837.06/297.03	   
837.06/297.03	   Strict DPs:
837.06/297.03	     { from^#(X) -> c_1(X, X)
837.06/297.03	     , from^#(X) -> c_2(X)
837.06/297.03	     , sel^#(0(), cons(X, XS)) -> c_3(X)
837.06/297.03	     , sel^#(s(N), cons(X, XS)) -> c_4(sel^#(N, activate(XS)))
837.06/297.03	     , s^#(X) -> c_5(X)
837.06/297.03	     , activate^#(X) -> c_6(X)
837.06/297.03	     , activate^#(n__from(X)) -> c_7(from^#(activate(X)))
837.06/297.03	     , activate^#(n__s(X)) -> c_8(s^#(activate(X)))
837.06/297.03	     , activate^#(n__zWquot(X1, X2)) ->
837.06/297.03	       c_9(zWquot^#(activate(X1), activate(X2)))
837.06/297.03	     , zWquot^#(X1, X2) -> c_14(X1, X2)
837.06/297.03	     , zWquot^#(XS, nil()) -> c_15()
837.06/297.03	     , zWquot^#(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	       c_16(quot^#(X, Y), activate^#(XS), activate^#(YS))
837.06/297.03	     , zWquot^#(nil(), XS) -> c_17()
837.06/297.03	     , minus^#(X, 0()) -> c_10()
837.06/297.03	     , minus^#(s(X), s(Y)) -> c_11(minus^#(X, Y))
837.06/297.03	     , quot^#(0(), s(Y)) -> c_12()
837.06/297.03	     , quot^#(s(X), s(Y)) -> c_13(s^#(quot(minus(X, Y), s(Y)))) }
837.06/297.03	   Strict Trs:
837.06/297.03	     { from(X) -> cons(X, n__from(n__s(X)))
837.06/297.03	     , from(X) -> n__from(X)
837.06/297.03	     , sel(0(), cons(X, XS)) -> X
837.06/297.03	     , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
837.06/297.03	     , s(X) -> n__s(X)
837.06/297.03	     , activate(X) -> X
837.06/297.03	     , activate(n__from(X)) -> from(activate(X))
837.06/297.03	     , activate(n__s(X)) -> s(activate(X))
837.06/297.03	     , activate(n__zWquot(X1, X2)) -> zWquot(activate(X1), activate(X2))
837.06/297.03	     , minus(X, 0()) -> 0()
837.06/297.03	     , minus(s(X), s(Y)) -> minus(X, Y)
837.06/297.03	     , quot(0(), s(Y)) -> 0()
837.06/297.03	     , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
837.06/297.03	     , zWquot(X1, X2) -> n__zWquot(X1, X2)
837.06/297.03	     , zWquot(XS, nil()) -> nil()
837.06/297.03	     , zWquot(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	       cons(quot(X, Y), n__zWquot(activate(XS), activate(YS)))
837.06/297.03	     , zWquot(nil(), XS) -> nil() }
837.06/297.03	   Obligation:
837.06/297.03	     runtime complexity
837.06/297.03	   Answer:
837.06/297.03	     MAYBE
837.06/297.03	   
837.06/297.03	   We estimate the number of application of {11,13,14,16} by
837.06/297.03	   applications of Pre({11,13,14,16}) = {1,2,3,5,6,9,10,12,15}. Here
837.06/297.03	   rules are labeled as follows:
837.06/297.03	   
837.06/297.03	     DPs:
837.06/297.03	       { 1: from^#(X) -> c_1(X, X)
837.06/297.03	       , 2: from^#(X) -> c_2(X)
837.06/297.03	       , 3: sel^#(0(), cons(X, XS)) -> c_3(X)
837.06/297.03	       , 4: sel^#(s(N), cons(X, XS)) -> c_4(sel^#(N, activate(XS)))
837.06/297.03	       , 5: s^#(X) -> c_5(X)
837.06/297.03	       , 6: activate^#(X) -> c_6(X)
837.06/297.03	       , 7: activate^#(n__from(X)) -> c_7(from^#(activate(X)))
837.06/297.03	       , 8: activate^#(n__s(X)) -> c_8(s^#(activate(X)))
837.06/297.03	       , 9: activate^#(n__zWquot(X1, X2)) ->
837.06/297.03	            c_9(zWquot^#(activate(X1), activate(X2)))
837.06/297.03	       , 10: zWquot^#(X1, X2) -> c_14(X1, X2)
837.06/297.03	       , 11: zWquot^#(XS, nil()) -> c_15()
837.06/297.03	       , 12: zWquot^#(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	             c_16(quot^#(X, Y), activate^#(XS), activate^#(YS))
837.06/297.03	       , 13: zWquot^#(nil(), XS) -> c_17()
837.06/297.03	       , 14: minus^#(X, 0()) -> c_10()
837.06/297.03	       , 15: minus^#(s(X), s(Y)) -> c_11(minus^#(X, Y))
837.06/297.03	       , 16: quot^#(0(), s(Y)) -> c_12()
837.06/297.03	       , 17: quot^#(s(X), s(Y)) -> c_13(s^#(quot(minus(X, Y), s(Y)))) }
837.06/297.03	   
837.06/297.03	   We are left with following problem, upon which TcT provides the
837.06/297.03	   certificate MAYBE.
837.06/297.03	   
837.06/297.03	   Strict DPs:
837.06/297.03	     { from^#(X) -> c_1(X, X)
837.06/297.03	     , from^#(X) -> c_2(X)
837.06/297.03	     , sel^#(0(), cons(X, XS)) -> c_3(X)
837.06/297.03	     , sel^#(s(N), cons(X, XS)) -> c_4(sel^#(N, activate(XS)))
837.06/297.03	     , s^#(X) -> c_5(X)
837.06/297.03	     , activate^#(X) -> c_6(X)
837.06/297.03	     , activate^#(n__from(X)) -> c_7(from^#(activate(X)))
837.06/297.03	     , activate^#(n__s(X)) -> c_8(s^#(activate(X)))
837.06/297.03	     , activate^#(n__zWquot(X1, X2)) ->
837.06/297.03	       c_9(zWquot^#(activate(X1), activate(X2)))
837.06/297.03	     , zWquot^#(X1, X2) -> c_14(X1, X2)
837.06/297.03	     , zWquot^#(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	       c_16(quot^#(X, Y), activate^#(XS), activate^#(YS))
837.06/297.03	     , minus^#(s(X), s(Y)) -> c_11(minus^#(X, Y))
837.06/297.03	     , quot^#(s(X), s(Y)) -> c_13(s^#(quot(minus(X, Y), s(Y)))) }
837.06/297.03	   Strict Trs:
837.06/297.03	     { from(X) -> cons(X, n__from(n__s(X)))
837.06/297.03	     , from(X) -> n__from(X)
837.06/297.03	     , sel(0(), cons(X, XS)) -> X
837.06/297.03	     , sel(s(N), cons(X, XS)) -> sel(N, activate(XS))
837.06/297.03	     , s(X) -> n__s(X)
837.06/297.03	     , activate(X) -> X
837.06/297.03	     , activate(n__from(X)) -> from(activate(X))
837.06/297.03	     , activate(n__s(X)) -> s(activate(X))
837.06/297.03	     , activate(n__zWquot(X1, X2)) -> zWquot(activate(X1), activate(X2))
837.06/297.03	     , minus(X, 0()) -> 0()
837.06/297.03	     , minus(s(X), s(Y)) -> minus(X, Y)
837.06/297.03	     , quot(0(), s(Y)) -> 0()
837.06/297.03	     , quot(s(X), s(Y)) -> s(quot(minus(X, Y), s(Y)))
837.06/297.03	     , zWquot(X1, X2) -> n__zWquot(X1, X2)
837.06/297.03	     , zWquot(XS, nil()) -> nil()
837.06/297.03	     , zWquot(cons(X, XS), cons(Y, YS)) ->
837.06/297.03	       cons(quot(X, Y), n__zWquot(activate(XS), activate(YS)))
837.06/297.03	     , zWquot(nil(), XS) -> nil() }
837.06/297.03	   Weak DPs:
837.06/297.03	     { zWquot^#(XS, nil()) -> c_15()
837.06/297.03	     , zWquot^#(nil(), XS) -> c_17()
837.06/297.03	     , minus^#(X, 0()) -> c_10()
837.06/297.03	     , quot^#(0(), s(Y)) -> c_12() }
837.06/297.03	   Obligation:
837.06/297.03	     runtime complexity
837.06/297.03	   Answer:
837.06/297.03	     MAYBE
837.06/297.03	   
837.06/297.03	   Empty strict component of the problem is NOT empty.
837.06/297.03	
837.06/297.03	
837.06/297.03	Arrrr..
837.17/297.19	EOF