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