YES(?,PRIMREC)

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

Strict Trs:
  { f(X, X) -> c(X)
  , f(X, c(X)) -> f(s(X), X)
  , f(s(X), X) -> f(X, a(X)) }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

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

 f > s, f > a, s > a, c > s, c > a, f ~ c .

Hurray, we answered YES(?,PRIMREC)