MAYBE
1014.72/297.21	MAYBE
1014.72/297.21	
1014.72/297.21	We are left with following problem, upon which TcT provides the
1014.72/297.21	certificate MAYBE.
1014.72/297.21	
1014.72/297.21	Strict Trs:
1014.72/297.21	  { active(app(X1, X2)) -> app(X1, active(X2))
1014.72/297.21	  , active(app(X1, X2)) -> app(active(X1), X2)
1014.72/297.21	  , active(app(nil(), YS)) -> mark(YS)
1014.72/297.21	  , active(app(cons(X, XS), YS)) -> mark(cons(X, app(XS, YS)))
1014.72/297.21	  , active(cons(X1, X2)) -> cons(active(X1), X2)
1014.72/297.21	  , active(from(X)) -> mark(cons(X, from(s(X))))
1014.72/297.21	  , active(from(X)) -> from(active(X))
1014.72/297.21	  , active(s(X)) -> s(active(X))
1014.72/297.21	  , active(zWadr(X1, X2)) -> zWadr(X1, active(X2))
1014.72/297.21	  , active(zWadr(X1, X2)) -> zWadr(active(X1), X2)
1014.72/297.21	  , active(zWadr(XS, nil())) -> mark(nil())
1014.72/297.21	  , active(zWadr(nil(), YS)) -> mark(nil())
1014.72/297.21	  , active(zWadr(cons(X, XS), cons(Y, YS))) ->
1014.72/297.21	    mark(cons(app(Y, cons(X, nil())), zWadr(XS, YS)))
1014.72/297.21	  , active(prefix(L)) -> mark(cons(nil(), zWadr(L, prefix(L))))
1014.72/297.21	  , active(prefix(X)) -> prefix(active(X))
1014.72/297.21	  , app(X1, mark(X2)) -> mark(app(X1, X2))
1014.72/297.21	  , app(mark(X1), X2) -> mark(app(X1, X2))
1014.72/297.21	  , app(ok(X1), ok(X2)) -> ok(app(X1, X2))
1014.72/297.21	  , cons(mark(X1), X2) -> mark(cons(X1, X2))
1014.72/297.21	  , cons(ok(X1), ok(X2)) -> ok(cons(X1, X2))
1014.72/297.21	  , from(mark(X)) -> mark(from(X))
1014.72/297.21	  , from(ok(X)) -> ok(from(X))
1014.72/297.21	  , s(mark(X)) -> mark(s(X))
1014.72/297.21	  , s(ok(X)) -> ok(s(X))
1014.72/297.21	  , zWadr(X1, mark(X2)) -> mark(zWadr(X1, X2))
1014.72/297.21	  , zWadr(mark(X1), X2) -> mark(zWadr(X1, X2))
1014.72/297.21	  , zWadr(ok(X1), ok(X2)) -> ok(zWadr(X1, X2))
1014.72/297.21	  , prefix(mark(X)) -> mark(prefix(X))
1014.72/297.21	  , prefix(ok(X)) -> ok(prefix(X))
1014.72/297.21	  , proper(app(X1, X2)) -> app(proper(X1), proper(X2))
1014.72/297.21	  , proper(nil()) -> ok(nil())
1014.72/297.21	  , proper(cons(X1, X2)) -> cons(proper(X1), proper(X2))
1014.72/297.21	  , proper(from(X)) -> from(proper(X))
1014.72/297.21	  , proper(s(X)) -> s(proper(X))
1014.72/297.21	  , proper(zWadr(X1, X2)) -> zWadr(proper(X1), proper(X2))
1014.72/297.21	  , proper(prefix(X)) -> prefix(proper(X))
1014.72/297.21	  , top(mark(X)) -> top(proper(X))
1014.72/297.21	  , top(ok(X)) -> top(active(X)) }
1014.72/297.21	Obligation:
1014.72/297.21	  innermost runtime complexity
1014.72/297.21	Answer:
1014.72/297.21	  MAYBE
1014.72/297.21	
1014.72/297.21	None of the processors succeeded.
1014.72/297.21	
1014.72/297.21	Details of failed attempt(s):
1014.72/297.21	-----------------------------
1014.72/297.21	1) 'empty' failed due to the following reason:
1014.72/297.21	   
1014.72/297.21	   Empty strict component of the problem is NOT empty.
1014.72/297.21	
1014.72/297.21	2) 'Best' failed due to the following reason:
1014.72/297.21	   
1014.72/297.21	   None of the processors succeeded.
1014.72/297.21	   
1014.72/297.21	   Details of failed attempt(s):
1014.72/297.21	   -----------------------------
1014.72/297.21	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1014.72/297.21	      following reason:
1014.72/297.21	      
1014.72/297.21	      Computation stopped due to timeout after 297.0 seconds.
1014.72/297.21	   
1014.72/297.21	   2) 'Best' failed due to the following reason:
1014.72/297.21	      
1014.72/297.21	      None of the processors succeeded.
1014.72/297.21	      
1014.72/297.21	      Details of failed attempt(s):
1014.72/297.21	      -----------------------------
1014.72/297.21	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1014.72/297.21	         seconds)' failed due to the following reason:
1014.72/297.21	         
1014.72/297.21	         Computation stopped due to timeout after 148.0 seconds.
1014.72/297.21	      
1014.72/297.21	      2) 'Best' failed due to the following reason:
1014.72/297.21	         
1014.72/297.21	         None of the processors succeeded.
1014.72/297.21	         
1014.72/297.21	         Details of failed attempt(s):
1014.72/297.21	         -----------------------------
1014.72/297.21	         1) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1014.72/297.21	            to the following reason:
1014.72/297.21	            
1014.72/297.21	            The input cannot be shown compatible
1014.72/297.21	         
1014.72/297.21	         2) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1014.72/297.21	            following reason:
1014.72/297.21	            
1014.72/297.21	            The input cannot be shown compatible
1014.72/297.21	         
1014.72/297.21	      
1014.72/297.21	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1014.72/297.21	         failed due to the following reason:
1014.72/297.21	         
1014.72/297.21	         None of the processors succeeded.
1014.72/297.21	         
1014.72/297.21	         Details of failed attempt(s):
1014.72/297.21	         -----------------------------
1014.72/297.21	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
1014.72/297.21	            failed due to the following reason:
1014.72/297.21	            
1014.72/297.21	            match-boundness of the problem could not be verified.
1014.72/297.21	         
1014.72/297.21	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1014.72/297.21	            failed due to the following reason:
1014.72/297.21	            
1014.72/297.21	            match-boundness of the problem could not be verified.
1014.72/297.21	         
1014.72/297.21	      
1014.72/297.21	   
1014.72/297.21	
1014.72/297.21	
1014.72/297.21	Arrrr..
1015.30/297.74	EOF