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