MAYBE
931.83/297.03	MAYBE
931.83/297.03	
931.83/297.03	We are left with following problem, upon which TcT provides the
931.83/297.03	certificate MAYBE.
931.83/297.03	
931.83/297.03	Strict Trs:
931.83/297.03	  { zeros() -> cons(0(), n__zeros())
931.83/297.03	  , zeros() -> n__zeros()
931.83/297.03	  , cons(X1, X2) -> n__cons(X1, X2)
931.83/297.03	  , 0() -> n__0()
931.83/297.03	  , U11(tt(), L) -> s(length(activate(L)))
931.83/297.03	  , s(X) -> n__s(X)
931.83/297.03	  , length(X) -> n__length(X)
931.83/297.03	  , length(cons(N, L)) ->
931.83/297.03	    U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
931.83/297.03	  , length(nil()) -> 0()
931.83/297.03	  , activate(X) -> X
931.83/297.03	  , activate(n__zeros()) -> zeros()
931.83/297.03	  , activate(n__take(X1, X2)) -> take(X1, X2)
931.83/297.03	  , activate(n__0()) -> 0()
931.83/297.03	  , activate(n__length(X)) -> length(X)
931.83/297.03	  , activate(n__s(X)) -> s(X)
931.83/297.03	  , activate(n__cons(X1, X2)) -> cons(X1, X2)
931.83/297.03	  , activate(n__isNatIList(X)) -> isNatIList(X)
931.83/297.03	  , activate(n__nil()) -> nil()
931.83/297.03	  , activate(n__isNatList(X)) -> isNatList(X)
931.83/297.03	  , activate(n__isNat(X)) -> isNat(X)
931.83/297.03	  , activate(n__and(X1, X2)) -> and(X1, X2)
931.83/297.03	  , U21(tt()) -> nil()
931.83/297.03	  , nil() -> n__nil()
931.83/297.03	  , U31(tt(), IL, M, N) ->
931.83/297.03	    cons(activate(N), n__take(activate(M), activate(IL)))
931.83/297.03	  , and(X1, X2) -> n__and(X1, X2)
931.83/297.03	  , and(tt(), X) -> activate(X)
931.83/297.03	  , isNat(X) -> n__isNat(X)
931.83/297.03	  , isNat(n__0()) -> tt()
931.83/297.03	  , isNat(n__length(V1)) -> isNatList(activate(V1))
931.83/297.03	  , isNat(n__s(V1)) -> isNat(activate(V1))
931.83/297.03	  , isNatList(X) -> n__isNatList(X)
931.83/297.03	  , isNatList(n__take(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatIList(activate(V2)))
931.83/297.03	  , isNatList(n__cons(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatList(activate(V2)))
931.83/297.03	  , isNatList(n__nil()) -> tt()
931.83/297.03	  , isNatIList(V) -> isNatList(activate(V))
931.83/297.03	  , isNatIList(X) -> n__isNatIList(X)
931.83/297.03	  , isNatIList(n__zeros()) -> tt()
931.83/297.03	  , isNatIList(n__cons(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatIList(activate(V2)))
931.83/297.03	  , take(X1, X2) -> n__take(X1, X2)
931.83/297.03	  , take(0(), IL) -> U21(isNatIList(IL))
931.83/297.03	  , take(s(M), cons(N, IL)) ->
931.83/297.03	    U31(and(isNatIList(activate(IL)), n__and(isNat(M), n__isNat(N))),
931.83/297.03	        activate(IL),
931.83/297.03	        M,
931.83/297.03	        N) }
931.83/297.03	Obligation:
931.83/297.03	  innermost runtime complexity
931.83/297.03	Answer:
931.83/297.03	  MAYBE
931.83/297.03	
931.83/297.03	Arguments of following rules are not normal-forms:
931.83/297.03	
931.83/297.03	{ length(cons(N, L)) ->
931.83/297.03	  U11(and(isNatList(activate(L)), n__isNat(N)), activate(L))
931.83/297.03	, length(nil()) -> 0()
931.83/297.03	, take(0(), IL) -> U21(isNatIList(IL))
931.83/297.03	, take(s(M), cons(N, IL)) ->
931.83/297.03	  U31(and(isNatIList(activate(IL)), n__and(isNat(M), n__isNat(N))),
931.83/297.03	      activate(IL),
931.83/297.03	      M,
931.83/297.03	      N) }
931.83/297.03	
931.83/297.03	All above mentioned rules can be savely removed.
931.83/297.03	
931.83/297.03	We are left with following problem, upon which TcT provides the
931.83/297.03	certificate MAYBE.
931.83/297.03	
931.83/297.03	Strict Trs:
931.83/297.03	  { zeros() -> cons(0(), n__zeros())
931.83/297.03	  , zeros() -> n__zeros()
931.83/297.03	  , cons(X1, X2) -> n__cons(X1, X2)
931.83/297.03	  , 0() -> n__0()
931.83/297.03	  , U11(tt(), L) -> s(length(activate(L)))
931.83/297.03	  , s(X) -> n__s(X)
931.83/297.03	  , length(X) -> n__length(X)
931.83/297.03	  , activate(X) -> X
931.83/297.03	  , activate(n__zeros()) -> zeros()
931.83/297.03	  , activate(n__take(X1, X2)) -> take(X1, X2)
931.83/297.03	  , activate(n__0()) -> 0()
931.83/297.03	  , activate(n__length(X)) -> length(X)
931.83/297.03	  , activate(n__s(X)) -> s(X)
931.83/297.03	  , activate(n__cons(X1, X2)) -> cons(X1, X2)
931.83/297.03	  , activate(n__isNatIList(X)) -> isNatIList(X)
931.83/297.03	  , activate(n__nil()) -> nil()
931.83/297.03	  , activate(n__isNatList(X)) -> isNatList(X)
931.83/297.03	  , activate(n__isNat(X)) -> isNat(X)
931.83/297.03	  , activate(n__and(X1, X2)) -> and(X1, X2)
931.83/297.03	  , U21(tt()) -> nil()
931.83/297.03	  , nil() -> n__nil()
931.83/297.03	  , U31(tt(), IL, M, N) ->
931.83/297.03	    cons(activate(N), n__take(activate(M), activate(IL)))
931.83/297.03	  , and(X1, X2) -> n__and(X1, X2)
931.83/297.03	  , and(tt(), X) -> activate(X)
931.83/297.03	  , isNat(X) -> n__isNat(X)
931.83/297.03	  , isNat(n__0()) -> tt()
931.83/297.03	  , isNat(n__length(V1)) -> isNatList(activate(V1))
931.83/297.03	  , isNat(n__s(V1)) -> isNat(activate(V1))
931.83/297.03	  , isNatList(X) -> n__isNatList(X)
931.83/297.03	  , isNatList(n__take(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatIList(activate(V2)))
931.83/297.03	  , isNatList(n__cons(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatList(activate(V2)))
931.83/297.03	  , isNatList(n__nil()) -> tt()
931.83/297.03	  , isNatIList(V) -> isNatList(activate(V))
931.83/297.03	  , isNatIList(X) -> n__isNatIList(X)
931.83/297.03	  , isNatIList(n__zeros()) -> tt()
931.83/297.03	  , isNatIList(n__cons(V1, V2)) ->
931.83/297.03	    and(isNat(activate(V1)), n__isNatIList(activate(V2)))
931.83/297.03	  , take(X1, X2) -> n__take(X1, X2) }
931.83/297.03	Obligation:
931.83/297.03	  innermost runtime complexity
931.83/297.03	Answer:
931.83/297.03	  MAYBE
931.83/297.03	
931.83/297.03	None of the processors succeeded.
931.83/297.03	
931.83/297.03	Details of failed attempt(s):
931.83/297.03	-----------------------------
931.83/297.03	1) 'empty' failed due to the following reason:
931.83/297.03	   
931.83/297.03	   Empty strict component of the problem is NOT empty.
931.83/297.03	
931.83/297.03	2) 'Best' failed due to the following reason:
931.83/297.03	   
931.83/297.03	   None of the processors succeeded.
931.83/297.03	   
931.83/297.03	   Details of failed attempt(s):
931.83/297.03	   -----------------------------
931.83/297.03	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
931.83/297.03	      following reason:
931.83/297.03	      
931.83/297.03	      Computation stopped due to timeout after 297.0 seconds.
931.83/297.03	   
931.83/297.03	   2) 'Best' failed due to the following reason:
931.83/297.03	      
931.83/297.03	      None of the processors succeeded.
931.83/297.03	      
931.83/297.03	      Details of failed attempt(s):
931.83/297.03	      -----------------------------
931.83/297.03	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
931.83/297.03	         seconds)' failed due to the following reason:
931.83/297.03	         
931.83/297.03	         Computation stopped due to timeout after 148.0 seconds.
931.83/297.03	      
931.83/297.03	      2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
931.83/297.03	         failed due to the following reason:
931.83/297.03	         
931.83/297.03	         Computation stopped due to timeout after 24.0 seconds.
931.83/297.03	      
931.83/297.03	      3) 'Best' failed due to the following reason:
931.83/297.03	         
931.83/297.03	         None of the processors succeeded.
931.83/297.03	         
931.83/297.03	         Details of failed attempt(s):
931.83/297.03	         -----------------------------
931.83/297.03	         1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
931.83/297.03	            following reason:
931.83/297.03	            
931.83/297.03	            The input cannot be shown compatible
931.83/297.03	         
931.83/297.03	         2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
931.83/297.03	            to the following reason:
931.83/297.03	            
931.83/297.03	            The input cannot be shown compatible
931.83/297.03	         
931.83/297.03	      
931.83/297.03	   
931.83/297.03	
931.83/297.03	
931.83/297.03	Arrrr..
932.06/297.29	EOF