MAYBE

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

The following DP Processors were used


Problem 1 remains open; application of the following processors failed [DependencyGraph (12ms), SubtermCriterion (6ms), DependencyGraph (4ms), PolynomialLinearRange4iUR (302ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (1069ms), DependencyGraph (5ms), ReductionPairSAT (620ms), DependencyGraph (2ms), SizeChangePrinciple (11ms)].

The following open problems remain:

Open Dependency Pair Problem 1

Dependency Pairs

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

Rewrite Rules

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

Original Signature

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