MAYBE
1060.63/297.02	MAYBE
1060.63/297.02	
1060.63/297.02	We are left with following problem, upon which TcT provides the
1060.63/297.02	certificate MAYBE.
1060.63/297.02	
1060.63/297.02	Strict Trs:
1060.63/297.02	  { active(f(X1, X2)) -> f(active(X1), X2)
1060.63/297.02	  , active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
1060.63/297.02	  , active(g(X)) -> g(active(X))
1060.63/297.02	  , f(mark(X1), X2) -> mark(f(X1, X2))
1060.63/297.02	  , f(ok(X1), ok(X2)) -> ok(f(X1, X2))
1060.63/297.02	  , g(mark(X)) -> mark(g(X))
1060.63/297.02	  , g(ok(X)) -> ok(g(X))
1060.63/297.02	  , proper(f(X1, X2)) -> f(proper(X1), proper(X2))
1060.63/297.02	  , proper(g(X)) -> g(proper(X))
1060.63/297.02	  , top(mark(X)) -> top(proper(X))
1060.63/297.02	  , top(ok(X)) -> top(active(X)) }
1060.63/297.02	Obligation:
1060.63/297.02	  runtime complexity
1060.63/297.02	Answer:
1060.63/297.02	  MAYBE
1060.63/297.02	
1060.63/297.02	None of the processors succeeded.
1060.63/297.02	
1060.63/297.02	Details of failed attempt(s):
1060.63/297.02	-----------------------------
1060.63/297.02	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1060.63/297.02	   following reason:
1060.63/297.02	   
1060.63/297.02	   Computation stopped due to timeout after 297.0 seconds.
1060.63/297.02	
1060.63/297.02	2) 'Best' failed due to the following reason:
1060.63/297.02	   
1060.63/297.02	   None of the processors succeeded.
1060.63/297.02	   
1060.63/297.02	   Details of failed attempt(s):
1060.63/297.02	   -----------------------------
1060.63/297.02	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1060.63/297.03	      seconds)' failed due to the following reason:
1060.63/297.03	      
1060.63/297.03	      Computation stopped due to timeout after 148.0 seconds.
1060.63/297.03	   
1060.63/297.03	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1060.63/297.03	      failed due to the following reason:
1060.63/297.03	      
1060.63/297.03	      None of the processors succeeded.
1060.63/297.03	      
1060.63/297.03	      Details of failed attempt(s):
1060.63/297.03	      -----------------------------
1060.63/297.03	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
1060.63/297.03	         failed due to the following reason:
1060.63/297.03	         
1060.63/297.03	         match-boundness of the problem could not be verified.
1060.63/297.03	      
1060.63/297.03	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1060.63/297.03	         failed due to the following reason:
1060.63/297.03	         
1060.63/297.03	         match-boundness of the problem could not be verified.
1060.63/297.03	      
1060.63/297.03	   
1060.63/297.03	   3) 'Best' failed due to the following reason:
1060.63/297.03	      
1060.63/297.03	      None of the processors succeeded.
1060.63/297.03	      
1060.63/297.03	      Details of failed attempt(s):
1060.63/297.03	      -----------------------------
1060.63/297.03	      1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1060.63/297.03	         following reason:
1060.63/297.03	         
1060.63/297.03	         The processor is inapplicable, reason:
1060.63/297.03	           Processor only applicable for innermost runtime complexity analysis
1060.63/297.03	      
1060.63/297.03	      2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1060.63/297.03	         to the following reason:
1060.63/297.03	         
1060.63/297.03	         The processor is inapplicable, reason:
1060.63/297.03	           Processor only applicable for innermost runtime complexity analysis
1060.63/297.03	      
1060.63/297.03	   
1060.63/297.03	
1060.63/297.03	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
1060.63/297.03	   the following reason:
1060.63/297.03	   
1060.63/297.03	   We add the following weak dependency pairs:
1060.63/297.03	   
1060.63/297.03	   Strict DPs:
1060.63/297.03	     { active^#(f(X1, X2)) -> c_1(f^#(active(X1), X2))
1060.63/297.03	     , active^#(f(g(X), Y)) -> c_2(f^#(X, f(g(X), Y)))
1060.63/297.03	     , active^#(g(X)) -> c_3(g^#(active(X)))
1060.63/297.03	     , f^#(mark(X1), X2) -> c_4(f^#(X1, X2))
1060.63/297.03	     , f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2))
1060.63/297.03	     , g^#(mark(X)) -> c_6(g^#(X))
1060.63/297.03	     , g^#(ok(X)) -> c_7(g^#(X))
1060.63/297.03	     , proper^#(f(X1, X2)) -> c_8(f^#(proper(X1), proper(X2)))
1060.63/297.03	     , proper^#(g(X)) -> c_9(g^#(proper(X)))
1060.63/297.03	     , top^#(mark(X)) -> c_10(top^#(proper(X)))
1060.63/297.03	     , top^#(ok(X)) -> c_11(top^#(active(X))) }
1060.63/297.03	   
1060.63/297.03	   and mark the set of starting terms.
1060.63/297.03	   
1060.63/297.03	   We are left with following problem, upon which TcT provides the
1060.63/297.03	   certificate MAYBE.
1060.63/297.03	   
1060.63/297.03	   Strict DPs:
1060.63/297.03	     { active^#(f(X1, X2)) -> c_1(f^#(active(X1), X2))
1060.63/297.03	     , active^#(f(g(X), Y)) -> c_2(f^#(X, f(g(X), Y)))
1060.63/297.03	     , active^#(g(X)) -> c_3(g^#(active(X)))
1060.63/297.03	     , f^#(mark(X1), X2) -> c_4(f^#(X1, X2))
1060.63/297.03	     , f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2))
1060.63/297.03	     , g^#(mark(X)) -> c_6(g^#(X))
1060.63/297.03	     , g^#(ok(X)) -> c_7(g^#(X))
1060.63/297.03	     , proper^#(f(X1, X2)) -> c_8(f^#(proper(X1), proper(X2)))
1060.63/297.03	     , proper^#(g(X)) -> c_9(g^#(proper(X)))
1060.63/297.03	     , top^#(mark(X)) -> c_10(top^#(proper(X)))
1060.63/297.03	     , top^#(ok(X)) -> c_11(top^#(active(X))) }
1060.63/297.03	   Strict Trs:
1060.63/297.03	     { active(f(X1, X2)) -> f(active(X1), X2)
1060.63/297.03	     , active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
1060.63/297.03	     , active(g(X)) -> g(active(X))
1060.63/297.03	     , f(mark(X1), X2) -> mark(f(X1, X2))
1060.63/297.03	     , f(ok(X1), ok(X2)) -> ok(f(X1, X2))
1060.63/297.03	     , g(mark(X)) -> mark(g(X))
1060.63/297.03	     , g(ok(X)) -> ok(g(X))
1060.63/297.03	     , proper(f(X1, X2)) -> f(proper(X1), proper(X2))
1060.63/297.03	     , proper(g(X)) -> g(proper(X))
1060.63/297.03	     , top(mark(X)) -> top(proper(X))
1060.63/297.03	     , top(ok(X)) -> top(active(X)) }
1060.63/297.03	   Obligation:
1060.63/297.03	     runtime complexity
1060.63/297.03	   Answer:
1060.63/297.03	     MAYBE
1060.63/297.03	   
1060.63/297.03	   Consider the dependency graph:
1060.63/297.03	   
1060.63/297.03	     1: active^#(f(X1, X2)) -> c_1(f^#(active(X1), X2))
1060.63/297.03	        -->_1 f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2)) :5
1060.63/297.03	        -->_1 f^#(mark(X1), X2) -> c_4(f^#(X1, X2)) :4
1060.63/297.03	     
1060.63/297.03	     2: active^#(f(g(X), Y)) -> c_2(f^#(X, f(g(X), Y)))
1060.63/297.03	        -->_1 f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2)) :5
1060.63/297.03	        -->_1 f^#(mark(X1), X2) -> c_4(f^#(X1, X2)) :4
1060.63/297.03	     
1060.63/297.03	     3: active^#(g(X)) -> c_3(g^#(active(X)))
1060.63/297.03	        -->_1 g^#(ok(X)) -> c_7(g^#(X)) :7
1060.63/297.03	        -->_1 g^#(mark(X)) -> c_6(g^#(X)) :6
1060.63/297.03	     
1060.63/297.03	     4: f^#(mark(X1), X2) -> c_4(f^#(X1, X2))
1060.63/297.03	        -->_1 f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2)) :5
1060.63/297.03	        -->_1 f^#(mark(X1), X2) -> c_4(f^#(X1, X2)) :4
1060.63/297.03	     
1060.63/297.03	     5: f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2))
1060.63/297.03	        -->_1 f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2)) :5
1060.63/297.03	        -->_1 f^#(mark(X1), X2) -> c_4(f^#(X1, X2)) :4
1060.63/297.03	     
1060.63/297.03	     6: g^#(mark(X)) -> c_6(g^#(X))
1060.63/297.03	        -->_1 g^#(ok(X)) -> c_7(g^#(X)) :7
1060.63/297.03	        -->_1 g^#(mark(X)) -> c_6(g^#(X)) :6
1060.63/297.03	     
1060.63/297.03	     7: g^#(ok(X)) -> c_7(g^#(X))
1060.63/297.03	        -->_1 g^#(ok(X)) -> c_7(g^#(X)) :7
1060.63/297.03	        -->_1 g^#(mark(X)) -> c_6(g^#(X)) :6
1060.63/297.03	     
1060.63/297.03	     8: proper^#(f(X1, X2)) -> c_8(f^#(proper(X1), proper(X2)))
1060.63/297.03	        -->_1 f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2)) :5
1060.63/297.03	        -->_1 f^#(mark(X1), X2) -> c_4(f^#(X1, X2)) :4
1060.63/297.03	     
1060.63/297.03	     9: proper^#(g(X)) -> c_9(g^#(proper(X)))
1060.63/297.03	        -->_1 g^#(ok(X)) -> c_7(g^#(X)) :7
1060.63/297.03	        -->_1 g^#(mark(X)) -> c_6(g^#(X)) :6
1060.63/297.03	     
1060.63/297.03	     10: top^#(mark(X)) -> c_10(top^#(proper(X)))
1060.63/297.03	        -->_1 top^#(ok(X)) -> c_11(top^#(active(X))) :11
1060.63/297.03	        -->_1 top^#(mark(X)) -> c_10(top^#(proper(X))) :10
1060.63/297.03	     
1060.63/297.03	     11: top^#(ok(X)) -> c_11(top^#(active(X)))
1060.63/297.03	        -->_1 top^#(ok(X)) -> c_11(top^#(active(X))) :11
1060.63/297.03	        -->_1 top^#(mark(X)) -> c_10(top^#(proper(X))) :10
1060.63/297.03	     
1060.63/297.03	   
1060.63/297.03	   Only the nodes {4,5,6,7,10,11} are reachable from nodes
1060.63/297.03	   {4,5,6,7,10,11} that start derivation from marked basic terms. The
1060.63/297.03	   nodes not reachable are removed from the problem.
1060.63/297.03	   
1060.63/297.03	   We are left with following problem, upon which TcT provides the
1060.63/297.03	   certificate MAYBE.
1060.63/297.03	   
1060.63/297.03	   Strict DPs:
1060.63/297.03	     { f^#(mark(X1), X2) -> c_4(f^#(X1, X2))
1060.63/297.03	     , f^#(ok(X1), ok(X2)) -> c_5(f^#(X1, X2))
1060.63/297.03	     , g^#(mark(X)) -> c_6(g^#(X))
1060.63/297.03	     , g^#(ok(X)) -> c_7(g^#(X))
1060.63/297.03	     , top^#(mark(X)) -> c_10(top^#(proper(X)))
1060.63/297.03	     , top^#(ok(X)) -> c_11(top^#(active(X))) }
1060.63/297.03	   Strict Trs:
1060.63/297.03	     { active(f(X1, X2)) -> f(active(X1), X2)
1060.63/297.03	     , active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
1060.63/297.03	     , active(g(X)) -> g(active(X))
1060.63/297.03	     , f(mark(X1), X2) -> mark(f(X1, X2))
1060.63/297.03	     , f(ok(X1), ok(X2)) -> ok(f(X1, X2))
1060.63/297.03	     , g(mark(X)) -> mark(g(X))
1060.63/297.03	     , g(ok(X)) -> ok(g(X))
1060.63/297.03	     , proper(f(X1, X2)) -> f(proper(X1), proper(X2))
1060.63/297.03	     , proper(g(X)) -> g(proper(X))
1060.63/297.03	     , top(mark(X)) -> top(proper(X))
1060.63/297.03	     , top(ok(X)) -> top(active(X)) }
1060.63/297.03	   Obligation:
1060.63/297.03	     runtime complexity
1060.63/297.03	   Answer:
1060.63/297.03	     MAYBE
1060.63/297.03	   
1060.63/297.03	   Empty strict component of the problem is NOT empty.
1060.63/297.03	
1060.63/297.03	
1060.63/297.03	Arrrr..
1060.76/297.14	EOF