MAYBE
The TRS could not be proven terminating. The proof attempt took 4993 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 (3ms), PolynomialLinearRange4iUR (327ms), DependencyGraph (3ms), PolynomialLinearRange8NegiUR (2712ms), DependencyGraph (2ms), ReductionPairSAT (1267ms), DependencyGraph (2ms), SizeChangePrinciple (7ms)].
The following open problems remain:
Open Dependency Pair Problem 2
Dependency Pairs
| f#(f(a, b), x) | → | f#(a, f(a, x)) | | f#(x, f(y, z)) | → | f#(f(x, y), z) |
| f#(f(b, a), x) | → | f#(b, f(b, x)) |
Rewrite Rules
| f(f(a, b), x) | → | f(a, f(a, x)) | | f(f(b, a), x) | → | f(b, f(b, x)) |
| f(x, f(y, z)) | → | f(f(x, y), z) |
Original Signature
Termination of terms over the following signature is verified: f, b, a
Problem 1: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| f#(f(b, a), x) | → | f#(b, x) | | f#(f(a, b), x) | → | f#(a, f(a, x)) |
| f#(x, f(y, z)) | → | f#(x, y) | | f#(f(a, b), x) | → | f#(a, x) |
| f#(x, f(y, z)) | → | f#(f(x, y), z) | | f#(f(b, a), x) | → | f#(b, f(b, x)) |
Rewrite Rules
| f(f(a, b), x) | → | f(a, f(a, x)) | | f(f(b, a), x) | → | f(b, f(b, x)) |
| f(x, f(y, z)) | → | f(f(x, y), z) |
Original Signature
Termination of terms over the following signature is verified: f, b, a
Strategy
Polynomial Interpretation
- a: 0
- b: 0
- f(x,y): y + x + 1
- f#(x,y): 2y + 2x
Improved Usable rules
| f(x, f(y, z)) | → | f(f(x, y), z) | | f(f(a, b), x) | → | f(a, f(a, x)) |
| f(f(b, a), x) | → | f(b, f(b, x)) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| f#(f(b, a), x) | → | f#(b, x) | | f#(x, f(y, z)) | → | f#(x, y) |
| f#(f(a, b), x) | → | f#(a, x) |