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