MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (29ms), SubtermCriterion (1ms), DependencyGraph (12ms), PolynomialLinearRange4iUR (326ms), DependencyGraph (4ms), PolynomialLinearRange8NegiUR (5123ms), DependencyGraph (3ms), ReductionPairSAT (1758ms), DependencyGraph (3ms), SizeChangePrinciple (13ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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