YES(?,PRIMREC)

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

Strict Trs:
  { and(tt(), X) -> X
  , plus(N, 0()) -> N
  , plus(N, s(M)) -> s(plus(N, M)) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

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

 tt > and, tt > s, plus > and, plus > s, 0 > and, 0 > s, s > and,
 tt ~ plus, tt ~ 0, plus ~ 0 .

Hurray, we answered YES(?,PRIMREC)