The TRS could not be proven terminating. The proof attempt took 4205 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (37ms), SubtermCriterion (1ms), DependencyGraph (23ms), PolynomialLinearRange4iUR (292ms), DependencyGraph (12ms), PolynomialLinearRange8NegiUR (2183ms), DependencyGraph (10ms), ReductionPairSAT (1464ms), DependencyGraph (22ms), SizeChangePrinciple (45ms)].
| f#(b(x), y) | → | f#(x, b(y)) | f#(x, a(b(y))) | → | f#(a(b(x)), y) | |
| f#(x, b(c(y))) | → | f#(b(c(x)), y) | f#(a(x), y) | → | f#(x, a(y)) | |
| f#(c(x), y) | → | f#(x, c(y)) | f#(x, c(a(y))) | → | f#(c(a(x)), y) |
| f(x, a(b(y))) | → | f(a(b(x)), y) | f(x, b(c(y))) | → | f(b(c(x)), y) | |
| f(x, c(a(y))) | → | f(c(a(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