MAYBE

The TRS could not be proven terminating. The proof attempt took 2413 ms.

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (16ms), SubtermCriterion (6ms), DependencyGraph (5ms), PolynomialLinearRange4iUR (226ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (1421ms), DependencyGraph (5ms), ReductionPairSAT (611ms), DependencyGraph (2ms), SizeChangePrinciple (9ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

f#(y, f(x, y)) → f#(a, y)f#(y, f(x, y)) → f#(a, x)
f#(y, f(x, y)) → f#(f(a, y), f(a, x))

Rewrite Rules

f(y, f(x, y)) → f(f(a, y), f(a, x))

Original Signature

Termination of terms over the following signature is verified: f, a