YES(?,PRIMREC)

We are left with following problem, upon which TcT provides the
certificate YES(?,PRIMREC).

Strict Trs:
  { +(0(), y) -> y
  , +(s(x), y) -> s(+(x, y))
  , -(x, 0()) -> x
  , -(0(), y) -> 0()
  , -(s(x), s(y)) -> -(x, y) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

The input was oriented with the instance of'multiset path order' as
induced by the precedence

 + > 0, + > s, s > 0, - > 0, - > s, + ~ - .

Hurray, we answered YES(?,PRIMREC)