The TRS could not be proven terminating. The proof attempt took 16349 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (24ms), SubtermCriterion (2ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (285ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (1506ms), DependencyGraph (6ms), ReductionPairSAT (14353ms), DependencyGraph (5ms), SizeChangePrinciple (45ms)].
| f#(b(x), y) | → | f#(x, b(y)) | f#(a(x), y) | → | f#(x, a(y)) | |
| f#(c(x), y) | → | f#(x, c(y)) | f#(x, a(b(c(y)))) | → | f#(b(c(a(b(x)))), y) |
| f(x, a(b(c(y)))) | → | f(b(c(a(b(x)))), y) | f(a(x), y) | → | f(x, a(y)) | |
| f(b(x), y) | → | f(x, b(y)) | f(c(x), y) | → | f(x, c(y)) |
Termination of terms over the following signature is verified: f, b, c, a