MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (28ms), SubtermCriterion (1ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (303ms), DependencyGraph (6ms), PolynomialLinearRange8NegiUR (4903ms), DependencyGraph (3ms), ReductionPairSAT (1906ms), DependencyGraph (3ms), SizeChangePrinciple (60ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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