Given a TRS R this techniques tries to find a reduction order > with
l ≥ r for all rules l → r ∈ R and l > r for at least some rules.
If this succeeds all strictly decreasing rules are removed from R.
See [GZ03, Zan04] for references.
Application and Configuration
AProVE always uses linear polynomial orders as reduction orders for this technique.
The user can configure the maximum value of the coefficients with the range-spinner.
This technique is always used repeatedly: if one can remove some rules then the
technique is tried directly again afterwards until it finally cannot be applied further with the
given coefficient-range.
One should use this technique as a fast preprocessor on TRSs. Its application does not cost much time
and one can get rid of some rules if the TRS is not to difficult.