YES

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

The following DP Processors were used


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

Problem 1: PolynomialLinearRange4iUR

Dependency Pair Problem

Dependency Pairs

and#(not(not(x)), y, not(z)) → and#(y, band(x, z), x)

Rewrite Rules

and(not(not(x)), y, not(z)) → and(y, band(x, z), x)

Original Signature

Termination of terms over the following signature is verified: not, band, and

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:

and#(not(not(x)), y, not(z)) → and#(y, band(x, z), x)