The rewrite relation of the following TRS is considered.
f(f(a)) | → | f(g(n__f(a))) | (1) |
f(X) | → | n__f(X) | (2) |
activate(n__f(X)) | → | f(X) | (3) |
activate(X) | → | X | (4) |
f#(f(a)) | → | f#(g(n__f(a))) | (5) |
activate#(n__f(X)) | → | f#(X) | (6) |
The dependency pairs are split into 0 components.