YES

The TRS could be proven terminating. The proof took 98 ms.

The following DP Processors were used


Problem 1 was processed with processor PolynomialLinearRange4iUR (79ms).

Problem 1: PolynomialLinearRange4iUR



Dependency Pair Problem

Dependency Pairs

f#(s(x), y, y)f#(y, x, s(x))

Rewrite Rules

f(s(x), y, y)f(y, x, s(x))

Original Signature

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

Strategy


Polynomial Interpretation

There are no usable rules

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

f#(s(x), y, y)f#(y, x, s(x))