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