MAYBE

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

Strict Trs:
  { table() -> gen(s(0()))
  , gen(x) -> if1(le(x, 10()), x)
  , if1(false(), x) -> nil()
  , if1(true(), x) -> if2(x, x)
  , le(s(x), s(y)) -> le(x, y)
  , le(s(x), 0()) -> false()
  , le(0(), y) -> true()
  , 10() -> s(s(s(s(s(s(s(s(s(s(0()))))))))))
  , if2(x, y) -> if3(le(y, 10()), x, y)
  , if3(false(), x, y) -> gen(s(x))
  , if3(true(), x, y) -> cons(entry(x, y, times(x, y)), if2(x, s(y)))
  , times(s(x), y) -> plus(y, times(x, y))
  , times(0(), y) -> 0()
  , plus(s(x), y) -> s(plus(x, y))
  , plus(0(), y) -> y }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..