MAYBE

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

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

The input cannot be shown compatible

Arrrr..