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