YES(?,ELEMENTARY)

'epo* (timeout of 60.0 seconds)'
--------------------------------
Answer:           YES(?,ELEMENTARY)
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  f(X) -> g(n__h(n__f(X)))
     , h(X) -> n__h(X)
     , f(X) -> n__f(X)
     , activate(n__h(X)) -> h(activate(X))
     , activate(n__f(X)) -> f(activate(X))
     , activate(X) -> X}

Proof Output:    
  Strict Rules in Predicative Notation:
   {  f(; X) -> g(; n__h(; n__f(; X)))
    , h(; X) -> n__h(; X)
    , f(; X) -> n__f(; X)
    , activate(n__h(; X);) -> h(; activate(X;))
    , activate(n__f(; X);) -> f(; activate(X;))
    , activate(X;) -> X}
  Safe Mapping:
   safe(f) = {1}, safe(g) = {1}, safe(n__h) = {1}, safe(n__f) = {1},
   safe(h) = {1}, safe(activate) = {}
  Argument Permutation:
   mu(f) = [1], mu(h) = [1], mu(activate) = [1]
  Precedence:
   activate ~ activate, activate > h, activate > f, h ~ h, h ~ f,
   f ~ h, f ~ f