MAYBE
1013.50/297.02	MAYBE
1013.50/297.02	
1013.50/297.02	We are left with following problem, upon which TcT provides the
1013.50/297.02	certificate MAYBE.
1013.50/297.02	
1013.50/297.02	Strict Trs:
1013.50/297.02	  { a__incr(X) -> incr(X)
1013.50/297.02	  , a__incr(nil()) -> nil()
1013.50/297.02	  , a__incr(cons(X, L)) -> cons(s(mark(X)), incr(L))
1013.50/297.02	  , mark(nil()) -> nil()
1013.50/297.02	  , mark(cons(X1, X2)) -> cons(mark(X1), X2)
1013.50/297.02	  , mark(s(X)) -> s(mark(X))
1013.50/297.02	  , mark(incr(X)) -> a__incr(mark(X))
1013.50/297.02	  , mark(adx(X)) -> a__adx(mark(X))
1013.50/297.02	  , mark(0()) -> 0()
1013.50/297.02	  , mark(zeros()) -> a__zeros()
1013.50/297.02	  , mark(nats()) -> a__nats()
1013.50/297.02	  , mark(head(X)) -> a__head(mark(X))
1013.50/297.02	  , mark(tail(X)) -> a__tail(mark(X))
1013.50/297.02	  , a__adx(X) -> adx(X)
1013.50/297.02	  , a__adx(nil()) -> nil()
1013.50/297.02	  , a__adx(cons(X, L)) -> a__incr(cons(mark(X), adx(L)))
1013.50/297.02	  , a__nats() -> a__adx(a__zeros())
1013.50/297.02	  , a__nats() -> nats()
1013.50/297.02	  , a__zeros() -> cons(0(), zeros())
1013.50/297.02	  , a__zeros() -> zeros()
1013.50/297.02	  , a__head(X) -> head(X)
1013.50/297.02	  , a__head(cons(X, L)) -> mark(X)
1013.50/297.02	  , a__tail(X) -> tail(X)
1013.50/297.02	  , a__tail(cons(X, L)) -> mark(L) }
1013.50/297.02	Obligation:
1013.50/297.02	  innermost runtime complexity
1013.50/297.02	Answer:
1013.50/297.02	  MAYBE
1013.50/297.02	
1013.50/297.02	None of the processors succeeded.
1013.50/297.02	
1013.50/297.02	Details of failed attempt(s):
1013.50/297.02	-----------------------------
1013.50/297.02	1) 'empty' failed due to the following reason:
1013.50/297.02	   
1013.50/297.02	   Empty strict component of the problem is NOT empty.
1013.50/297.02	
1013.50/297.02	2) 'Best' failed due to the following reason:
1013.50/297.02	   
1013.50/297.02	   None of the processors succeeded.
1013.50/297.02	   
1013.50/297.02	   Details of failed attempt(s):
1013.50/297.02	   -----------------------------
1013.50/297.02	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1013.50/297.02	      following reason:
1013.50/297.02	      
1013.50/297.02	      Computation stopped due to timeout after 297.0 seconds.
1013.50/297.02	   
1013.50/297.02	   2) 'Best' failed due to the following reason:
1013.50/297.02	      
1013.50/297.02	      None of the processors succeeded.
1013.50/297.02	      
1013.50/297.02	      Details of failed attempt(s):
1013.50/297.02	      -----------------------------
1013.50/297.02	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1013.50/297.02	         seconds)' failed due to the following reason:
1013.50/297.02	         
1013.50/297.02	         Computation stopped due to timeout after 148.0 seconds.
1013.50/297.02	      
1013.50/297.02	      2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1013.50/297.02	         failed due to the following reason:
1013.50/297.02	         
1013.50/297.02	         Computation stopped due to timeout after 24.0 seconds.
1013.50/297.02	      
1013.50/297.02	      3) 'Best' failed due to the following reason:
1013.50/297.02	         
1013.50/297.02	         None of the processors succeeded.
1013.50/297.02	         
1013.50/297.02	         Details of failed attempt(s):
1013.50/297.02	         -----------------------------
1013.50/297.02	         1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1013.50/297.02	            to the following reason:
1013.50/297.02	            
1013.50/297.02	            The input cannot be shown compatible
1013.50/297.02	         
1013.50/297.02	         2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1013.50/297.02	            following reason:
1013.50/297.02	            
1013.50/297.02	            The input cannot be shown compatible
1013.50/297.02	         
1013.50/297.02	      
1013.50/297.02	   
1013.50/297.02	
1013.50/297.02	
1013.50/297.02	Arrrr..
1013.62/297.14	EOF