MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (27ms), SubtermCriterion (2ms), DependencyGraph (13ms), PolynomialLinearRange4iUR (275ms), DependencyGraph (7ms), PolynomialLinearRange8NegiUR (1667ms), DependencyGraph (4ms), ReductionPairSAT (3781ms), DependencyGraph (4ms), SizeChangePrinciple (10ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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