MAYBE

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

The following DP Processors were used


Problem 1 was processed with processor PolynomialLinearRange4iUR (0ms).
 | – Problem 2 remains open; application of the following processors failed [DependencyGraph (1ms), PolynomialLinearRange4iUR (174ms), DependencyGraph (0ms), PolynomialLinearRange8NegiUR (1394ms), DependencyGraph (0ms), ReductionPairSAT (2147ms), DependencyGraph (1ms), SizeChangePrinciple (7ms)].

The following open problems remain:



Open Dependency Pair Problem 2

Dependency Pairs

f#(x, f(a, a))f#(f(f(a, a), a), f(x, a))

Rewrite Rules

f(x, f(a, a))f(f(f(a, a), a), f(x, a))

Original Signature

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


Problem 1: PolynomialLinearRange4iUR



Dependency Pair Problem

Dependency Pairs

f#(x, f(a, a))f#(f(a, a), a)f#(x, f(a, a))f#(a, a)
f#(x, f(a, a))f#(x, a)f#(x, f(a, a))f#(f(f(a, a), a), f(x, a))

Rewrite Rules

f(x, f(a, a))f(f(f(a, a), a), f(x, a))

Original Signature

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

Strategy


Polynomial Interpretation

Improved Usable rules

f(x, f(a, a))f(f(f(a, a), a), f(x, a))

The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:

f#(x, f(a, a))f#(f(a, a), a)f#(x, f(a, a))f#(a, a)
f#(x, f(a, a))f#(x, a)