MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (8ms), SubtermCriterion (1ms), DependencyGraph (9ms), PolynomialLinearRange4iUR (148ms), DependencyGraph (2ms), PolynomialLinearRange8NegiUR (250ms), DependencyGraph (2ms), ReductionPairSAT (301ms), DependencyGraph (1ms), SizeChangePrinciple (6ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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