MAYBE
663.13/297.12	MAYBE
663.13/297.12	
663.13/297.12	We are left with following problem, upon which TcT provides the
663.13/297.12	certificate MAYBE.
663.13/297.12	
663.13/297.12	Strict Trs:
663.13/297.12	  { eq(X, Y) -> false()
663.13/297.12	  , eq(n__0(), n__0()) -> true()
663.13/297.12	  , eq(n__s(X), n__s(Y)) -> eq(activate(X), activate(Y))
663.13/297.12	  , activate(X) -> X
663.13/297.12	  , activate(n__0()) -> 0()
663.13/297.12	  , activate(n__s(X)) -> s(X)
663.13/297.12	  , activate(n__inf(X)) -> inf(activate(X))
663.13/297.12	  , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
663.13/297.12	  , activate(n__length(X)) -> length(activate(X))
663.13/297.12	  , inf(X) -> cons(X, n__inf(n__s(X)))
663.13/297.12	  , inf(X) -> n__inf(X)
663.13/297.12	  , take(X1, X2) -> n__take(X1, X2)
663.13/297.12	  , take(0(), X) -> nil()
663.13/297.12	  , take(s(X), cons(Y, L)) ->
663.13/297.12	    cons(activate(Y), n__take(activate(X), activate(L)))
663.13/297.12	  , 0() -> n__0()
663.13/297.12	  , s(X) -> n__s(X)
663.13/297.12	  , length(X) -> n__length(X)
663.13/297.12	  , length(cons(X, L)) -> s(n__length(activate(L)))
663.13/297.12	  , length(nil()) -> 0() }
663.13/297.12	Obligation:
663.13/297.12	  innermost runtime complexity
663.13/297.12	Answer:
663.13/297.12	  MAYBE
663.13/297.12	
663.13/297.12	Arguments of following rules are not normal-forms:
663.13/297.12	
663.13/297.12	{ take(0(), X) -> nil()
663.13/297.12	, take(s(X), cons(Y, L)) ->
663.13/297.12	  cons(activate(Y), n__take(activate(X), activate(L))) }
663.13/297.12	
663.13/297.12	All above mentioned rules can be savely removed.
663.13/297.12	
663.13/297.12	We are left with following problem, upon which TcT provides the
663.13/297.12	certificate MAYBE.
663.13/297.12	
663.13/297.12	Strict Trs:
663.13/297.12	  { eq(X, Y) -> false()
663.13/297.12	  , eq(n__0(), n__0()) -> true()
663.13/297.12	  , eq(n__s(X), n__s(Y)) -> eq(activate(X), activate(Y))
663.13/297.12	  , activate(X) -> X
663.13/297.12	  , activate(n__0()) -> 0()
663.13/297.12	  , activate(n__s(X)) -> s(X)
663.13/297.12	  , activate(n__inf(X)) -> inf(activate(X))
663.13/297.12	  , activate(n__take(X1, X2)) -> take(activate(X1), activate(X2))
663.13/297.12	  , activate(n__length(X)) -> length(activate(X))
663.13/297.12	  , inf(X) -> cons(X, n__inf(n__s(X)))
663.13/297.12	  , inf(X) -> n__inf(X)
663.13/297.12	  , take(X1, X2) -> n__take(X1, X2)
663.13/297.12	  , 0() -> n__0()
663.13/297.12	  , s(X) -> n__s(X)
663.13/297.12	  , length(X) -> n__length(X)
663.13/297.12	  , length(cons(X, L)) -> s(n__length(activate(L)))
663.13/297.12	  , length(nil()) -> 0() }
663.13/297.12	Obligation:
663.13/297.12	  innermost runtime complexity
663.13/297.12	Answer:
663.13/297.12	  MAYBE
663.13/297.12	
663.13/297.12	None of the processors succeeded.
663.13/297.12	
663.13/297.12	Details of failed attempt(s):
663.13/297.12	-----------------------------
663.13/297.12	1) 'empty' failed due to the following reason:
663.13/297.12	   
663.13/297.12	   Empty strict component of the problem is NOT empty.
663.13/297.12	
663.13/297.12	2) 'Best' failed due to the following reason:
663.13/297.12	   
663.13/297.12	   None of the processors succeeded.
663.13/297.12	   
663.13/297.12	   Details of failed attempt(s):
663.13/297.12	   -----------------------------
663.13/297.12	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
663.13/297.12	      following reason:
663.13/297.12	      
663.13/297.12	      Computation stopped due to timeout after 297.0 seconds.
663.13/297.12	   
663.13/297.12	   2) 'Best' failed due to the following reason:
663.13/297.12	      
663.13/297.12	      None of the processors succeeded.
663.13/297.12	      
663.13/297.12	      Details of failed attempt(s):
663.13/297.12	      -----------------------------
663.13/297.12	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
663.13/297.12	         seconds)' failed due to the following reason:
663.13/297.12	         
663.13/297.12	         Computation stopped due to timeout after 148.0 seconds.
663.13/297.12	      
663.13/297.12	      2) 'Best' failed due to the following reason:
663.13/297.12	         
663.13/297.12	         None of the processors succeeded.
663.13/297.12	         
663.13/297.12	         Details of failed attempt(s):
663.13/297.12	         -----------------------------
663.13/297.12	         1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
663.13/297.12	            to the following reason:
663.13/297.12	            
663.13/297.12	            The input cannot be shown compatible
663.13/297.12	         
663.13/297.12	         2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
663.13/297.12	            following reason:
663.13/297.12	            
663.13/297.12	            The input cannot be shown compatible
663.13/297.12	         
663.13/297.12	      
663.13/297.12	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
663.13/297.12	         failed due to the following reason:
663.13/297.12	         
663.13/297.12	         None of the processors succeeded.
663.13/297.12	         
663.13/297.12	         Details of failed attempt(s):
663.13/297.12	         -----------------------------
663.13/297.12	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
663.13/297.12	            failed due to the following reason:
663.13/297.12	            
663.13/297.12	            match-boundness of the problem could not be verified.
663.13/297.12	         
663.13/297.12	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
663.13/297.12	            failed due to the following reason:
663.13/297.12	            
663.13/297.12	            match-boundness of the problem could not be verified.
663.13/297.12	         
663.13/297.12	      
663.13/297.12	   
663.13/297.12	
663.13/297.12	
663.13/297.12	Arrrr..
663.13/297.14	EOF