MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (12ms), SubtermCriterion (5ms), DependencyGraph (6ms), PolynomialLinearRange4iUR (287ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1416ms), DependencyGraph (5ms), ReductionPairSAT (1305ms), DependencyGraph (2ms), SizeChangePrinciple (12ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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