MAYBE

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

Strict Trs:
  { minus(x, 0()) -> x
  , minus(s(x), s(y)) -> minus(x, y)
  , le(0(), y) -> true()
  , le(s(x), 0()) -> false()
  , le(s(x), s(y)) -> le(x, y)
  , quot(0(), s(y)) -> 0()
  , quot(s(x), s(y)) -> s(quot(minus(s(x), s(y)), s(y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..