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