The TRS could be proven terminating. The proof took 15 ms.
Problem 1 was processed with processor DependencyGraph (2ms).
| f#(a, b) | → | f#(a, c) | f#(c, d) | → | f#(b, d) |
| f(a, b) | → | f(a, c) | f(c, d) | → | f(b, d) |
Termination of terms over the following signature is verified: f, d, b, c, a