MAYBE

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

Strict Trs:
  { times(x, 0()) -> 0()
  , times(x, s(y)) -> plus(times(x, y), x)
  , plus(x, 0()) -> x
  , plus(x, s(y)) -> s(plus(x, y))
  , plus(0(), x) -> x
  , plus(s(x), y) -> s(plus(x, y)) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..