YES
The TRS could be proven terminating. The proof took 478 ms.
The following DP Processors were used
Problem 1 was processed with processor PolynomialLinearRange4iUR (188ms).
Problem 1: PolynomialLinearRange4iUR
Dependency Pair Problem
Dependency Pairs
| app#(app(app(uncurry, f), x), y) | → | app#(app(f, x), y) | | app#(app(app(uncurry, f), x), y) | → | app#(f, x) |
Rewrite Rules
| app(app(app(uncurry, f), x), y) | → | app(app(f, x), y) |
Original Signature
Termination of terms over the following signature is verified: app, uncurry
Strategy
Polynomial Interpretation
- app(x,y): 3y + x
- app#(x,y): 2x
- uncurry: 1
Improved Usable rules
| app(app(app(uncurry, f), x), y) | → | app(app(f, x), y) |
The following dependency pairs are strictly oriented by an ordering on the given polynomial interpretation, thus they are removed:
| app#(app(app(uncurry, f), x), y) | → | app#(app(f, x), y) | | app#(app(app(uncurry, f), x), y) | → | app#(f, x) |