The TRS could be proven terminating. The proof took 57 ms.
Problem 1 was processed with processor SubtermCriterion (1ms). | – Problem 2 was processed with processor DependencyGraph (1ms).
| f#(f(x)) | → | f#(x) | f#(f(x)) | → | g#(f(x)) | |
| g#(g(x)) | → | f#(x) |
| f(f(x)) | → | g(f(x)) | g(g(x)) | → | f(x) |
Termination of terms over the following signature is verified: f, g
The following projection was used:
Thus, the following dependency pairs are removed:
| f#(f(x)) | → | f#(x) | g#(g(x)) | → | f#(x) |
| f#(f(x)) | → | g#(f(x)) |
| f(f(x)) | → | g(f(x)) | g(g(x)) | → | f(x) |
Termination of terms over the following signature is verified: f, g