Given a TRS R this techniques tries to find a reduction order > with
l > r for all rules l → r ∈ R in order to prove termination of R.
Application and Configuration
AProVE lets the user choose which reduction order should be used. Most of these orders
can be configured in more detail by pressing the configure-button.
One can use this technique as a fast try to show termination but it is not very powerful.
The reason is that beside the polynomial order all available orders are simplification orders.