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
↳ QTRS
↳ DependencyPairsProof
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
ACTIVATE(n__f(X)) → F(activate(X))
ACTIVATE(n__h(X)) → ACTIVATE(X)
ACTIVATE(n__f(X)) → ACTIVATE(X)
ACTIVATE(n__h(X)) → H(activate(X))
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
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
ACTIVATE(n__f(X)) → F(activate(X))
ACTIVATE(n__h(X)) → ACTIVATE(X)
ACTIVATE(n__f(X)) → ACTIVATE(X)
ACTIVATE(n__h(X)) → H(activate(X))
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
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
ACTIVATE(n__h(X)) → ACTIVATE(X)
ACTIVATE(n__f(X)) → ACTIVATE(X)
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
The following pairs can be oriented strictly and are deleted.
The remaining pairs can at least be oriented weakly.
ACTIVATE(n__h(X)) → ACTIVATE(X)
ACTIVATE(n__f(X)) → ACTIVATE(X)
The value of delta used in the strict ordering is 16.
POL(n__f(x1)) = 4 + (4)x_1
POL(ACTIVATE(x1)) = (4)x_1
POL(n__h(x1)) = 4 + x_1
↳ QTRS
↳ DependencyPairsProof
↳ QDP
↳ DependencyGraphProof
↳ QDP
↳ QDPOrderProof
↳ QDP
↳ PisEmptyProof
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