YES(?,PRIMREC)

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

Strict Trs:
  { exp(x, 0()) -> s(0())
  , exp(x, s(y)) -> *(x, exp(x, y))
  , *(0(), y) -> 0()
  , *(s(x), y) -> +(y, *(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

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

Hurray, we answered YES(?,PRIMREC)