MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (27ms), SubtermCriterion (1ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (311ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (2436ms), DependencyGraph (4ms), ReductionPairSAT (1813ms), DependencyGraph (3ms), SizeChangePrinciple (15ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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