MAYBE

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

Strict Trs:
  { p(0()) -> 0()
  , p(s(X)) -> X
  , leq(0(), Y) -> true()
  , leq(s(X), 0()) -> false()
  , leq(s(X), s(Y)) -> leq(X, Y)
  , if(true(), X, Y) -> X
  , if(false(), X, Y) -> Y
  , diff(X, Y) -> if(leq(X, Y), 0(), s(diff(p(X), Y))) }
Obligation:
  innermost runtime complexity
Answer:
  MAYBE

The input cannot be shown compatible

Arrrr..