The TRS could be proven terminating. The proof took 16 ms.
Problem 1 was processed with processor DependencyGraph (3ms).
| h#(x, x, y) | → | g#(x) | g#(a) | → | h#(a, b, a) | |
| i#(x) | → | f#(x, x) |
| f(x, y) | → | x | g(a) | → | h(a, b, a) | |
| i(x) | → | f(x, x) | h(x, x, y) | → | g(x) |
Termination of terms over the following signature is verified: f, g, b, a, h, i