MAYBE

We are left with following problem, upon which TcT provides the
certificate MAYBE.

Strict Trs:
  { plus(x, s(s(y))) -> s(plus(s(x), y))
  , plus(s(s(x)), y) -> s(plus(x, s(y)))
  , plus(s(0()), y) -> s(y)
  , plus(0(), y) -> y
  , ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y)))
  , ack(s(x), 0()) -> ack(x, s(0()))
  , ack(0(), y) -> s(y) }
Obligation:
  runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'WithProblem (timeout of 60 seconds)' failed due to the
   following reason:
   
   Computation stopped due to timeout after 60.0 seconds.

2) 'Best' failed due to the following reason:
   
   None of the processors succeeded.
   
   Details of failed attempt(s):
   -----------------------------
   1) 'WithProblem (timeout of 30 seconds) (timeout of 60 seconds)'
      failed due to the following reason:
      
      Computation stopped due to timeout after 30.0 seconds.
   
   2) 'Best' failed due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'bsearch-popstar (timeout of 60 seconds)' failed due to the
         following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
      2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
         to the following reason:
         
         The processor is inapplicable, reason:
           Processor only applicable for innermost runtime complexity analysis
      
   
   3) 'Fastest (timeout of 5 seconds) (timeout of 60 seconds)' failed
      due to the following reason:
      
      None of the processors succeeded.
      
      Details of failed attempt(s):
      -----------------------------
      1) 'Bounds with perSymbol-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
      2) 'Bounds with minimal-enrichment and initial automaton 'match''
         failed due to the following reason:
         
         match-boundness of the problem could not be verified.
      
   

3) 'Innermost Weak Dependency Pairs (timeout of 60 seconds)' failed
   due to the following reason:
   
   We add the following weak dependency pairs:
   
   Strict DPs:
     { plus^#(x, s(s(y))) -> c_1(plus^#(s(x), y))
     , plus^#(s(s(x)), y) -> c_2(plus^#(x, s(y)))
     , plus^#(s(0()), y) -> c_3(y)
     , plus^#(0(), y) -> c_4(y)
     , ack^#(s(x), s(y)) -> c_5(ack^#(x, plus(y, ack(s(x), y))))
     , ack^#(s(x), 0()) -> c_6(ack^#(x, s(0())))
     , ack^#(0(), y) -> c_7(y) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { plus^#(x, s(s(y))) -> c_1(plus^#(s(x), y))
     , plus^#(s(s(x)), y) -> c_2(plus^#(x, s(y)))
     , plus^#(s(0()), y) -> c_3(y)
     , plus^#(0(), y) -> c_4(y)
     , ack^#(s(x), s(y)) -> c_5(ack^#(x, plus(y, ack(s(x), y))))
     , ack^#(s(x), 0()) -> c_6(ack^#(x, s(0())))
     , ack^#(0(), y) -> c_7(y) }
   Strict Trs:
     { plus(x, s(s(y))) -> s(plus(s(x), y))
     , plus(s(s(x)), y) -> s(plus(x, s(y)))
     , plus(s(0()), y) -> s(y)
     , plus(0(), y) -> y
     , ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y)))
     , ack(s(x), 0()) -> ack(x, s(0()))
     , ack(0(), y) -> s(y) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..