The TRS could be proven terminating. The proof took 21 ms.
Problem 1 was processed with processor SubtermCriterion (0ms).
| f#(g(X)) | → | f#(X) |
| f(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#(g(X)) | → | f#(X) |