MAYBE

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

Strict Trs:
  { plus(x, y) -> ifPlus(isZero(x), x, inc(y))
  , ifPlus(true(), x, y) -> p(y)
  , ifPlus(false(), x, y) -> plus(p(x), y)
  , isZero(0()) -> true()
  , isZero(s(0())) -> false()
  , isZero(s(s(x))) -> isZero(s(x))
  , inc(x) -> s(x)
  , inc(0()) -> s(0())
  , inc(s(x)) -> s(inc(x))
  , p(0()) -> 0()
  , p(s(x)) -> x
  , p(s(s(x))) -> s(p(s(x)))
  , times(x, y) -> timesIter(0(), x, y, 0())
  , timesIter(i, x, y, z) -> ifTimes(ge(i, x), i, x, y, z)
  , ifTimes(true(), i, x, y, z) -> z
  , ifTimes(false(), i, x, y, z) ->
    timesIter(inc(i), x, y, plus(z, y))
  , ge(x, 0()) -> true()
  , ge(0(), s(y)) -> false()
  , ge(s(x), s(y)) -> ge(x, y)
  , f0(x, y, z) -> d()
  , f0(0(), y, x) -> f1(x, y, x)
  , f1(x, y, z) -> f2(x, y, z)
  , f1(x, y, z) -> c()
  , f2(x, 1(), z) -> f0(x, z, z) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

None of the processors succeeded.

Details of failed attempt(s):
-----------------------------
1) 'empty' failed due to the following reason:
   
   Empty strict component of the problem is NOT empty.

2) 'Best' failed due to the following reason:
   
   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 input cannot be shown compatible
         
         2) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
      
      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.
         
      
   


Arrrr..