MAYBE

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

Strict Trs:
  { ack_in(0(), n) -> ack_out(s(n))
  , ack_in(s(m), 0()) -> u11(ack_in(m, s(0())))
  , ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m)
  , u11(ack_out(n)) -> ack_out(n)
  , u21(ack_out(n), m) -> u22(ack_in(m, n))
  , u22(ack_out(n)) -> ack_out(n) }
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:
     { ack_in^#(0(), n) -> c_1(n)
     , ack_in^#(s(m), 0()) -> c_2(u11^#(ack_in(m, s(0()))))
     , ack_in^#(s(m), s(n)) -> c_3(u21^#(ack_in(s(m), n), m))
     , u11^#(ack_out(n)) -> c_4(n)
     , u21^#(ack_out(n), m) -> c_5(u22^#(ack_in(m, n)))
     , u22^#(ack_out(n)) -> c_6(n) }
   
   and mark the set of starting terms.
   
   We are left with following problem, upon which TcT provides the
   certificate MAYBE.
   
   Strict DPs:
     { ack_in^#(0(), n) -> c_1(n)
     , ack_in^#(s(m), 0()) -> c_2(u11^#(ack_in(m, s(0()))))
     , ack_in^#(s(m), s(n)) -> c_3(u21^#(ack_in(s(m), n), m))
     , u11^#(ack_out(n)) -> c_4(n)
     , u21^#(ack_out(n), m) -> c_5(u22^#(ack_in(m, n)))
     , u22^#(ack_out(n)) -> c_6(n) }
   Strict Trs:
     { ack_in(0(), n) -> ack_out(s(n))
     , ack_in(s(m), 0()) -> u11(ack_in(m, s(0())))
     , ack_in(s(m), s(n)) -> u21(ack_in(s(m), n), m)
     , u11(ack_out(n)) -> ack_out(n)
     , u21(ack_out(n), m) -> u22(ack_in(m, n))
     , u22(ack_out(n)) -> ack_out(n) }
   Obligation:
     runtime complexity
   Answer:
     MAYBE
   
   Empty strict component of the problem is NOT empty.


Arrrr..