MAYBE

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

Strict Trs:
  { times(x, y) -> sum(generate(x, y))
  , sum(xs) -> sum2(xs, 0())
  , generate(x, y) -> gen(x, y, 0())
  , gen(x, y, z) -> if(ge(z, x), x, y, z)
  , if(true(), x, y, z) -> nil()
  , if(false(), x, y, z) -> cons(y, gen(x, y, s(z)))
  , ge(x, 0()) -> true()
  , ge(0(), s(y)) -> false()
  , ge(s(x), s(y)) -> ge(x, y)
  , sum2(xs, y) -> ifsum(isNil(xs), isZero(head(xs)), xs, y)
  , ifsum(true(), b, xs, y) -> y
  , ifsum(false(), b, xs, y) -> ifsum2(b, xs, y)
  , isNil(nil()) -> true()
  , isNil(cons(x, xs)) -> false()
  , isZero(0()) -> true()
  , isZero(s(0())) -> false()
  , isZero(s(s(x))) -> isZero(s(x))
  , head(nil()) -> error()
  , head(cons(x, xs)) -> x
  , ifsum2(true(), xs, y) -> sum2(tail(xs), y)
  , ifsum2(false(), xs, y) -> sum2(cons(p(head(xs)), tail(xs)), s(y))
  , tail(nil()) -> nil()
  , tail(cons(x, xs)) -> xs
  , p(0()) -> s(s(0()))
  , p(s(0())) -> 0()
  , p(s(s(x))) -> s(p(s(x)))
  , a() -> c()
  , a() -> d() }
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) 'Polynomial Path Order (PS) (timeout of 60 seconds)' failed due
            to the following reason:
            
            The input cannot be shown compatible
         
         2) 'bsearch-popstar (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 minimal-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
         2) 'Bounds with perSymbol-enrichment and initial automaton 'match''
            failed due to the following reason:
            
            match-boundness of the problem could not be verified.
         
      
   


Arrrr..