MAYBE
882.73/297.13	MAYBE
882.73/297.13	
882.73/297.13	We are left with following problem, upon which TcT provides the
882.73/297.13	certificate MAYBE.
882.73/297.13	
882.73/297.13	Strict Trs:
882.73/297.13	  { active(U11(X1, X2)) -> U11(active(X1), X2)
882.73/297.13	  , active(U11(tt(), N)) -> mark(N)
882.73/297.13	  , active(U21(X1, X2, X3)) -> U21(active(X1), X2, X3)
882.73/297.13	  , active(U21(tt(), M, N)) -> mark(s(plus(N, M)))
882.73/297.13	  , active(s(X)) -> s(active(X))
882.73/297.13	  , active(plus(X1, X2)) -> plus(X1, active(X2))
882.73/297.13	  , active(plus(X1, X2)) -> plus(active(X1), X2)
882.73/297.13	  , active(plus(N, s(M))) -> mark(U21(and(isNat(M), isNat(N)), M, N))
882.73/297.13	  , active(plus(N, 0())) -> mark(U11(isNat(N), N))
882.73/297.13	  , active(and(X1, X2)) -> and(active(X1), X2)
882.73/297.13	  , active(and(tt(), X)) -> mark(X)
882.73/297.13	  , active(isNat(s(V1))) -> mark(isNat(V1))
882.73/297.13	  , active(isNat(plus(V1, V2))) -> mark(and(isNat(V1), isNat(V2)))
882.73/297.13	  , active(isNat(0())) -> mark(tt())
882.73/297.13	  , U11(mark(X1), X2) -> mark(U11(X1, X2))
882.73/297.13	  , U11(ok(X1), ok(X2)) -> ok(U11(X1, X2))
882.73/297.13	  , U21(mark(X1), X2, X3) -> mark(U21(X1, X2, X3))
882.73/297.13	  , U21(ok(X1), ok(X2), ok(X3)) -> ok(U21(X1, X2, X3))
882.73/297.13	  , s(mark(X)) -> mark(s(X))
882.73/297.13	  , s(ok(X)) -> ok(s(X))
882.73/297.13	  , plus(X1, mark(X2)) -> mark(plus(X1, X2))
882.73/297.13	  , plus(mark(X1), X2) -> mark(plus(X1, X2))
882.73/297.13	  , plus(ok(X1), ok(X2)) -> ok(plus(X1, X2))
882.73/297.13	  , and(mark(X1), X2) -> mark(and(X1, X2))
882.73/297.13	  , and(ok(X1), ok(X2)) -> ok(and(X1, X2))
882.73/297.13	  , isNat(ok(X)) -> ok(isNat(X))
882.73/297.13	  , proper(U11(X1, X2)) -> U11(proper(X1), proper(X2))
882.73/297.13	  , proper(tt()) -> ok(tt())
882.73/297.13	  , proper(U21(X1, X2, X3)) ->
882.73/297.13	    U21(proper(X1), proper(X2), proper(X3))
882.73/297.13	  , proper(s(X)) -> s(proper(X))
882.73/297.13	  , proper(plus(X1, X2)) -> plus(proper(X1), proper(X2))
882.73/297.13	  , proper(and(X1, X2)) -> and(proper(X1), proper(X2))
882.73/297.13	  , proper(isNat(X)) -> isNat(proper(X))
882.73/297.13	  , proper(0()) -> ok(0())
882.73/297.13	  , top(mark(X)) -> top(proper(X))
882.73/297.13	  , top(ok(X)) -> top(active(X)) }
882.73/297.13	Obligation:
882.73/297.13	  innermost runtime complexity
882.73/297.13	Answer:
882.73/297.13	  MAYBE
882.73/297.13	
882.73/297.13	None of the processors succeeded.
882.73/297.13	
882.73/297.13	Details of failed attempt(s):
882.73/297.13	-----------------------------
882.73/297.13	1) 'empty' failed due to the following reason:
882.73/297.13	   
882.73/297.13	   Empty strict component of the problem is NOT empty.
882.73/297.13	
882.73/297.13	2) 'Best' failed due to the following reason:
882.73/297.13	   
882.73/297.13	   None of the processors succeeded.
882.73/297.13	   
882.73/297.13	   Details of failed attempt(s):
882.73/297.13	   -----------------------------
882.73/297.13	   1) 'With Problem ... (timeout of 297 seconds)' failed due to the
882.73/297.13	      following reason:
882.73/297.13	      
882.73/297.13	      Computation stopped due to timeout after 297.0 seconds.
882.73/297.13	   
882.73/297.13	   2) 'Best' failed due to the following reason:
882.73/297.13	      
882.73/297.13	      None of the processors succeeded.
882.73/297.13	      
882.73/297.13	      Details of failed attempt(s):
882.73/297.13	      -----------------------------
882.73/297.13	      1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
882.73/297.13	         seconds)' failed due to the following reason:
882.73/297.13	         
882.73/297.13	         Computation stopped due to timeout after 148.0 seconds.
882.73/297.13	      
882.73/297.13	      2) 'Best' failed due to the following reason:
882.73/297.13	         
882.73/297.13	         None of the processors succeeded.
882.73/297.13	         
882.73/297.13	         Details of failed attempt(s):
882.73/297.13	         -----------------------------
882.73/297.13	         1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
882.73/297.13	            following reason:
882.73/297.13	            
882.73/297.13	            The input cannot be shown compatible
882.73/297.13	         
882.73/297.13	         2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
882.73/297.13	            to the following reason:
882.73/297.13	            
882.73/297.13	            The input cannot be shown compatible
882.73/297.13	         
882.73/297.13	      
882.73/297.13	      3) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
882.73/297.13	         failed due to the following reason:
882.73/297.13	         
882.73/297.13	         None of the processors succeeded.
882.73/297.13	         
882.73/297.13	         Details of failed attempt(s):
882.73/297.13	         -----------------------------
882.73/297.13	         1) 'Bounds with minimal-enrichment and initial automaton 'match''
882.73/297.13	            failed due to the following reason:
882.73/297.13	            
882.73/297.13	            match-boundness of the problem could not be verified.
882.73/297.13	         
882.73/297.13	         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
882.73/297.13	            failed due to the following reason:
882.73/297.13	            
882.73/297.13	            match-boundness of the problem could not be verified.
882.73/297.13	         
882.73/297.13	      
882.73/297.13	   
882.73/297.13	
882.73/297.13	
882.73/297.13	Arrrr..
882.87/297.29	EOF