MAYBE
1042.46/297.02	MAYBE
1042.46/297.02	
1042.46/297.02	We are left with following problem, upon which TcT provides the
1042.46/297.02	certificate MAYBE.
1042.46/297.02	
1042.46/297.02	Strict Trs:
1042.46/297.02	  { f(c(c(a(), y, a()), b(x, z), a())) -> b(y, f(c(f(a()), z, z)))
1042.46/297.02	  , f(b(b(x, f(y)), z)) -> c(z, x, f(b(b(f(a()), y), y)))
1042.46/297.02	  , c(b(a(), a()), b(y, z), x) -> b(a(), b(z, z)) }
1042.46/297.02	Obligation:
1042.46/297.02	  runtime complexity
1042.46/297.02	Answer:
1042.46/297.02	  MAYBE
1042.46/297.02	
1042.46/297.02	None of the processors succeeded.
1042.46/297.02	
1042.46/297.02	Details of failed attempt(s):
1042.46/297.02	-----------------------------
1042.46/297.02	1) 'With Problem ... (timeout of 297 seconds)' failed due to the
1042.46/297.02	   following reason:
1042.46/297.02	   
1042.46/297.02	   Computation stopped due to timeout after 297.0 seconds.
1042.46/297.02	
1042.46/297.02	2) 'Best' failed due to the following reason:
1042.46/297.02	   
1042.46/297.02	   None of the processors succeeded.
1042.46/297.02	   
1042.46/297.02	   Details of failed attempt(s):
1042.46/297.02	   -----------------------------
1042.46/297.02	   1) 'With Problem ... (timeout of 148 seconds) (timeout of 297
1042.46/297.02	      seconds)' failed due to the following reason:
1042.46/297.02	      
1042.46/297.02	      Computation stopped due to timeout after 148.0 seconds.
1042.46/297.02	   
1042.46/297.02	   2) 'Fastest (timeout of 24 seconds) (timeout of 297 seconds)'
1042.46/297.02	      failed due to the following reason:
1042.46/297.02	      
1042.46/297.02	      None of the processors succeeded.
1042.46/297.02	      
1042.46/297.02	      Details of failed attempt(s):
1042.46/297.02	      -----------------------------
1042.46/297.02	      1) 'Bounds with minimal-enrichment and initial automaton 'match''
1042.46/297.02	         failed due to the following reason:
1042.46/297.02	         
1042.46/297.02	         match-boundness of the problem could not be verified.
1042.46/297.02	      
1042.46/297.02	      2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
1042.46/297.02	         failed due to the following reason:
1042.46/297.02	         
1042.46/297.02	         match-boundness of the problem could not be verified.
1042.46/297.02	      
1042.46/297.02	   
1042.46/297.02	   3) 'Best' failed due to the following reason:
1042.46/297.02	      
1042.46/297.02	      None of the processors succeeded.
1042.46/297.02	      
1042.46/297.02	      Details of failed attempt(s):
1042.46/297.02	      -----------------------------
1042.46/297.02	      1) 'bsearch-popstar (timeout of 297 seconds)' failed due to the
1042.46/297.02	         following reason:
1042.46/297.02	         
1042.46/297.02	         The processor is inapplicable, reason:
1042.46/297.02	           Processor only applicable for innermost runtime complexity analysis
1042.46/297.02	      
1042.46/297.02	      2) 'Polynomial Path Order (PS) (timeout of 297 seconds)' failed due
1042.46/297.02	         to the following reason:
1042.46/297.02	         
1042.46/297.02	         The processor is inapplicable, reason:
1042.46/297.02	           Processor only applicable for innermost runtime complexity analysis
1042.46/297.02	      
1042.46/297.02	   
1042.46/297.02	
1042.46/297.02	3) 'Weak Dependency Pairs (timeout of 297 seconds)' failed due to
1042.46/297.02	   the following reason:
1042.46/297.02	   
1042.46/297.02	   We add the following weak dependency pairs:
1042.46/297.02	   
1042.46/297.02	   Strict DPs:
1042.46/297.02	     { f^#(c(c(a(), y, a()), b(x, z), a())) ->
1042.46/297.02	       c_1(y, f^#(c(f(a()), z, z)))
1042.46/297.02	     , f^#(b(b(x, f(y)), z)) -> c_2(c^#(z, x, f(b(b(f(a()), y), y))))
1042.46/297.02	     , c^#(b(a(), a()), b(y, z), x) -> c_3(z, z) }
1042.46/297.02	   
1042.46/297.02	   and mark the set of starting terms.
1042.46/297.02	   
1042.46/297.02	   We are left with following problem, upon which TcT provides the
1042.46/297.02	   certificate MAYBE.
1042.46/297.02	   
1042.46/297.02	   Strict DPs:
1042.46/297.02	     { f^#(c(c(a(), y, a()), b(x, z), a())) ->
1042.46/297.02	       c_1(y, f^#(c(f(a()), z, z)))
1042.46/297.02	     , f^#(b(b(x, f(y)), z)) -> c_2(c^#(z, x, f(b(b(f(a()), y), y))))
1042.46/297.02	     , c^#(b(a(), a()), b(y, z), x) -> c_3(z, z) }
1042.46/297.02	   Strict Trs:
1042.46/297.02	     { f(c(c(a(), y, a()), b(x, z), a())) -> b(y, f(c(f(a()), z, z)))
1042.46/297.02	     , f(b(b(x, f(y)), z)) -> c(z, x, f(b(b(f(a()), y), y)))
1042.46/297.02	     , c(b(a(), a()), b(y, z), x) -> b(a(), b(z, z)) }
1042.46/297.02	   Obligation:
1042.46/297.02	     runtime complexity
1042.46/297.02	   Answer:
1042.46/297.02	     MAYBE
1042.46/297.02	   
1042.46/297.02	   Empty strict component of the problem is NOT empty.
1042.46/297.02	
1042.46/297.02	
1042.46/297.02	Arrrr..
1042.77/297.38	EOF