MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (12ms), SubtermCriterion (1ms), DependencyGraph (5ms), PolynomialLinearRange4iUR (296ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1173ms), DependencyGraph (3ms), ReductionPairSAT (1315ms), DependencyGraph (2ms), SizeChangePrinciple (9ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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