MAYBE

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

Strict Trs:
  { times(x, y) -> sum(generate(x, y))
  , sum(nil()) -> 0()
  , sum(cons(0(), xs)) -> sum(xs)
  , sum(cons(s(x), xs)) -> s(sum(cons(x, xs)))
  , 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) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..