MAYBE
1004.39/297.03	MAYBE
1004.39/297.03	
1004.39/297.03	We are left with following problem, upon which TcT provides the
1004.39/297.03	certificate MAYBE.
1004.39/297.03	
1004.39/297.03	Strict Trs:
1004.39/297.03	  { filter(X1, X2, X3) -> n__filter(X1, X2, X3)
1004.39/297.03	  , filter(cons(X, Y), 0(), M) ->
1004.39/297.03	    cons(0(), n__filter(activate(Y), M, M))
1004.39/297.03	  , filter(cons(X, Y), s(N), M) ->
1004.39/297.03	    cons(X, n__filter(activate(Y), N, M))
1004.39/297.03	  , activate(X) -> X
1004.39/297.03	  , activate(n__filter(X1, X2, X3)) ->
1004.39/297.03	    filter(activate(X1), activate(X2), activate(X3))
1004.39/297.03	  , activate(n__sieve(X)) -> sieve(activate(X))
1004.39/297.03	  , activate(n__nats(X)) -> nats(activate(X))
1004.39/297.03	  , activate(n__s(X)) -> s(activate(X))
1004.39/297.03	  , s(X) -> n__s(X)
1004.39/297.03	  , sieve(X) -> n__sieve(X)
1004.39/297.03	  , sieve(cons(0(), Y)) -> cons(0(), n__sieve(activate(Y)))
1004.39/297.03	  , sieve(cons(s(N), Y)) ->
1004.39/297.03	    cons(s(N), n__sieve(n__filter(activate(Y), N, N)))
1004.39/297.03	  , nats(N) -> cons(N, n__nats(n__s(N)))
1004.39/297.03	  , nats(X) -> n__nats(X)
1004.39/297.03	  , zprimes() -> sieve(nats(s(s(0())))) }
1004.39/297.03	Obligation:
1004.39/297.03	  innermost runtime complexity
1004.39/297.03	Answer:
1004.39/297.03	  MAYBE
1004.39/297.03	
1004.39/297.03	Arguments of following rules are not normal-forms:
1004.39/297.03	
1004.39/297.03	{ filter(cons(X, Y), s(N), M) ->
1004.39/297.03	  cons(X, n__filter(activate(Y), N, M))
1004.39/297.03	, sieve(cons(s(N), Y)) ->
1004.39/297.03	  cons(s(N), n__sieve(n__filter(activate(Y), N, N))) }
1004.39/297.03	
1004.39/297.03	All above mentioned rules can be savely removed.
1004.39/297.03	
1004.39/297.03	We are left with following problem, upon which TcT provides the
1004.39/297.03	certificate MAYBE.
1004.39/297.03	
1004.39/297.03	Strict Trs:
1004.39/297.03	  { filter(X1, X2, X3) -> n__filter(X1, X2, X3)
1004.39/297.03	  , filter(cons(X, Y), 0(), M) ->
1004.39/297.03	    cons(0(), n__filter(activate(Y), M, M))
1004.39/297.03	  , activate(X) -> X
1004.39/297.03	  , activate(n__filter(X1, X2, X3)) ->
1004.39/297.03	    filter(activate(X1), activate(X2), activate(X3))
1004.39/297.03	  , activate(n__sieve(X)) -> sieve(activate(X))
1004.39/297.03	  , activate(n__nats(X)) -> nats(activate(X))
1004.39/297.03	  , activate(n__s(X)) -> s(activate(X))
1004.39/297.03	  , s(X) -> n__s(X)
1004.39/297.03	  , sieve(X) -> n__sieve(X)
1004.39/297.03	  , sieve(cons(0(), Y)) -> cons(0(), n__sieve(activate(Y)))
1004.39/297.03	  , nats(N) -> cons(N, n__nats(n__s(N)))
1004.39/297.03	  , nats(X) -> n__nats(X)
1004.39/297.03	  , zprimes() -> sieve(nats(s(s(0())))) }
1004.39/297.03	Obligation:
1004.39/297.03	  innermost runtime complexity
1004.39/297.03	Answer:
1004.39/297.03	  MAYBE
1004.39/297.03	
1004.39/297.03	None of the processors succeeded.
1004.39/297.03	
1004.39/297.03	Details of failed attempt(s):
1004.39/297.03	-----------------------------
1004.39/297.03	1) 'empty' failed due to the following reason:
1004.39/297.03	   
1004.39/297.03	   Empty strict component of the problem is NOT empty.
1004.39/297.03	
1004.39/297.03	2) 'Best' failed due to the following reason:
1004.39/297.03	   
1004.39/297.03	   None of the processors succeeded.
1004.39/297.03	   
1004.39/297.03	   Details of failed attempt(s):
1004.39/297.03	   -----------------------------
1004.39/297.03	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1004.39/297.03	      following reason:
1004.39/297.03	      
1004.39/297.03	      Computation stopped due to timeout after 297.0 seconds.
1004.39/297.03	   
1004.39/297.03	   2) 'Best' failed due to the following reason:
1004.39/297.03	      
1004.39/297.03	      None of the processors succeeded.
1004.39/297.03	      
1004.39/297.03	      Details of failed attempt(s):
1004.39/297.03	      -----------------------------
1004.39/297.03	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1004.39/297.03	         seconds)' failed due to the following reason:
1004.39/297.03	         
1004.39/297.03	         Computation stopped due to timeout after 148.0 seconds.
1004.39/297.03	      
1004.39/297.03	      2) 'Best' failed due to the following reason:
1004.39/297.03	         
1004.39/297.03	         None of the processors succeeded.
1004.39/297.03	         
1004.39/297.03	         Details of failed attempt(s):
1004.39/297.03	         -----------------------------
1004.39/297.03	         1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1004.39/297.03	            following reason:
1004.39/297.03	            
1004.39/297.03	            The input cannot be shown compatible
1004.39/297.03	         
1004.39/297.03	         2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1004.39/297.03	            to the following reason:
1004.39/297.03	            
1004.39/297.03	            The input cannot be shown compatible
1004.39/297.03	         
1004.39/297.03	      
1004.39/297.03	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1004.39/297.03	         failed due to the following reason:
1004.39/297.03	         
1004.39/297.03	         None of the processors succeeded.
1004.39/297.03	         
1004.39/297.03	         Details of failed attempt(s):
1004.39/297.03	         -----------------------------
1004.39/297.03	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
1004.39/297.03	            failed due to the following reason:
1004.39/297.03	            
1004.39/297.03	            match-boundness of the problem could not be verified.
1004.39/297.03	         
1004.39/297.03	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1004.39/297.03	            failed due to the following reason:
1004.39/297.03	            
1004.39/297.03	            match-boundness of the problem could not be verified.
1004.39/297.03	         
1004.39/297.03	      
1004.39/297.03	   
1004.39/297.03	
1004.39/297.03	
1004.39/297.03	Arrrr..
1004.81/297.41	EOF