MAYBE
The TRS could not be proven terminating. The proof attempt took 3124 ms.
Problem 1 remains open; application of the following processors failed [DependencyGraph (25ms), SubtermCriterion (1ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (328ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (864ms), DependencyGraph (3ms), ReductionPairSAT (1766ms), DependencyGraph (3ms), SizeChangePrinciple (10ms)].
f#(f(f(a, x), y), z) | → | f#(f(x, z), f(y, z)) | f#(f(f(a, x), y), z) | → | f#(x, z) | |
f#(f(f(a, x), y), z) | → | f#(y, z) |
f(f(f(a, x), y), z) | → | f(f(x, z), f(y, z)) | f(f(b, x), y) | → | x | |
f(c, y) | → | y |
Termination of terms over the following signature is verified: f, b, c, a