The TRS could be proven terminating. The proof took 21 ms.
Problem 1 was processed with processor DependencyGraph (1ms).
| f#(X, g(X), Y) | → | f#(Y, Y, Y) |
| f(X, g(X), Y) | → | f(Y, Y, Y) | g(b) | → | c | |
| b | → | c |
Termination of terms over the following signature is verified: f, g, b, c
Context-sensitive strategy:
μ(f) = μ(T) = μ(f#) = μ(b) = μ(c) = μ(b#) = ∅
μ(g) = μ(g#) = {1}