MAYBE
The TRS could not be proven terminating. The proof attempt took 1086 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 (91ms), DependencyGraph (1ms), PolynomialLinearRange8NegiUR (277ms), DependencyGraph (0ms), ReductionPairSAT (482ms), DependencyGraph (1ms), SizeChangePrinciple (5ms)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| f#(x, f(a, a)) | → | f#(f(x, a), x) |
Rewrite Rules
| f(x, f(a, a)) | → | f(f(x, a), x) |
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#(x, a) | | f#(x, f(a, a)) | → | f#(f(x, a), x) |
Rewrite Rules
| f(x, f(a, a)) | → | f(f(x, a), x) |
Original Signature
Termination of terms over the following signature is verified: f, a
Strategy
Polynomial Interpretation
- a: 0
- f(x,y): 2
- f#(x,y): y + x
Improved Usable rules
| f(x, f(a, a)) | → | f(f(x, a), x) |
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#(x, a) |