MAYBE

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

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

The input cannot be shown compatible

Arrrr..