The TRS could not be proven terminating. The proof attempt took 2185 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (24ms), SubtermCriterion (2ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (173ms), DependencyGraph (5ms), PolynomialLinearRange8NegiUR (719ms), DependencyGraph (6ms), ReductionPairSAT (1090ms), DependencyGraph (6ms), SizeChangePrinciple (20ms)].
| f#(b(x), y) | → | f#(x, b(y)) | f#(x, b(a(y))) | → | f#(b(b(x)), y) | |
| f#(x, a(b(y))) | → | f#(a(a(x)), y) | f#(a(x), y) | → | f#(x, a(y)) |
| f(x, a(b(y))) | → | f(a(a(x)), y) | f(x, b(a(y))) | → | f(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