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