The TRS could be proven terminating. The proof took 18 ms.
Problem 1 was processed with processor DependencyGraph (3ms).
| activate#(n__f(X)) | → | f#(X) | f#(f(a)) | → | f#(g(n__f(a))) |
| f(f(a)) | → | f(g(n__f(a))) | f(X) | → | n__f(X) | |
| activate(n__f(X)) | → | f(X) | activate(X) | → | X |
Termination of terms over the following signature is verified: f, activate, g, a, n__f