YES(?,PRIMREC)

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

Strict Trs:
  { d(x) -> e(u(x))
  , d(u(x)) -> c(x)
  , c(u(x)) -> b(x)
  , b(u(x)) -> a(e(x))
  , v(e(x)) -> x }
Obligation:
  innermost runtime complexity
Answer:
  YES(?,PRIMREC)

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

 d > e, d > u, d > a, u > e, u > a, c > e, c > u, c > a, b > e,
 b > u, b > a, v > e, v > u, v > a, d ~ c, d ~ b, d ~ v, e ~ a,
 c ~ b, c ~ v, b ~ v .

Hurray, we answered YES(?,PRIMREC)