Termination w.r.t. Q of the given QTRS could be disproven:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

f(X) → g(n__h(f(X)))
h(X) → n__h(X)
activate(n__h(X)) → h(X)
activate(X) → X

Q is empty.

(1) NonTerminationProof (EQUIVALENT transformation)

We used the non-termination processor [OPPELT08] to show that the SRS problem is infinite.

Found the self-embedding DerivationStructure:

f → g n__h f

f → g n__h f
by original rule (OC 1)

(2) NO