The TRS could not be proven terminating. The proof attempt took 60044 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (30ms), SubtermCriterion (1ms), DependencyGraph (9ms), PolynomialLinearRange4iUR (375ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1829ms), DependencyGraph (4ms), ReductionPairSAT (timeout)].
| f#(b(x), y) | → | f#(x, b(y)) | f#(a(x), y) | → | f#(x, a(y)) | |
| f#(x, a(a(b(b(y))))) | → | f#(a(a(a(b(b(b(x)))))), y) |
| f(x, a(a(b(b(y))))) | → | f(a(a(a(b(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