MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (21ms), SubtermCriterion (0ms), DependencyGraph (7ms), PolynomialLinearRange4iUR (441ms), DependencyGraph (6ms), PolynomialLinearRange8NegiUR (4224ms), DependencyGraph (5ms), ReductionPairSAT (2495ms), DependencyGraph (6ms), SizeChangePrinciple (11ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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