MAYBE

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

Strict Trs:
  { f(tt(), x) -> f(isNat(x), s(x))
  , isNat(s(x)) -> isNat(x)
  , isNat(0()) -> tt() }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..