The TRS could not be proven terminating. The proof attempt took 2085 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (19ms), SubtermCriterion (1ms), DependencyGraph (8ms), PolynomialLinearRange4iUR (176ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (609ms), DependencyGraph (3ms), ReductionPairSAT (1130ms), DependencyGraph (2ms), SizeChangePrinciple (13ms)].
| f#(b(x), y) | → | f#(x, b(y)) | f#(a(x), y) | → | f#(x, a(y)) | |
| f#(x, a(b(y))) | → | f#(a(b(b(x))), y) |
| f(x, a(b(y))) | → | f(a(b(b(x))), y) | f(a(x), y) | → | f(x, a(y)) | |
| f(b(x), y) | → | f(x, b(y)) |
Termination of terms over the following signature is verified: f, b, a