MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (10ms), SubtermCriterion (1ms), DependencyGraph (11ms), PolynomialLinearRange4iUR (215ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (1003ms), DependencyGraph (1ms), ReductionPairSAT (600ms), DependencyGraph (1ms), SizeChangePrinciple (9ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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