The rewrite relation of the following TRS is considered.
f(n__f(n__a)) | → | f(n__g(f(n__a))) | (1) |
f(X) | → | n__f(X) | (2) |
a | → | n__a | (3) |
g(X) | → | n__g(X) | (4) |
activate(n__f(X)) | → | f(X) | (5) |
activate(n__a) | → | a | (6) |
activate(n__g(X)) | → | g(X) | (7) |
activate(X) | → | X | (8) |
activate#(n__g(X)) | → | g#(X) | (9) |
f#(n__f(n__a)) | → | f#(n__a) | (10) |
activate#(n__f(X)) | → | f#(X) | (11) |
activate#(n__a) | → | a# | (12) |
f#(n__f(n__a)) | → | f#(n__g(f(n__a))) | (13) |
The dependency pairs are split into 0 components.