YES(?,PRIMREC)

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

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

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

 * > +, 1 > +, * ~ 1 .

Hurray, we answered YES(?,PRIMREC)