YES(?,PRIMREC)

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

Strict Trs:
  { f(X) -> g(n__h(n__f(X)))
  , f(X) -> n__f(X)
  , h(X) -> n__h(X)
  , activate(X) -> X
  , activate(n__h(X)) -> h(activate(X))
  , activate(n__f(X)) -> f(activate(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 > g, f > n__h, f > n__f, h > f, h > g, h > n__h, h > n__f,
 activate > f, activate > g, activate > n__h, activate > n__f,
 activate > h, g ~ n__h, g ~ n__f, n__h ~ n__f .

Hurray, we answered YES(?,PRIMREC)