(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) Overlay + Local Confluence (EQUIVALENT transformation)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
(2) 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
The set Q consists of the following terms:
f(x0)
h(x0)
activate(x0)
(3) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(X) → F(X)
ACTIVATE(n__h(X)) → H(X)
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
The set Q consists of the following terms:
f(x0)
h(x0)
activate(x0)
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(X) → F(X)
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
The set Q consists of the following terms:
f(x0)
h(x0)
activate(x0)
We have to consider all minimal (P,Q,R)-chains.