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