With the size change principle one can prove termination of a TRS R by finding
a well-founded, non-duplicating, and stable order > over
constructor terms such that in every infinite sequence of
size-change graphs of R there is an infinite descent regarding >
[TG '03].
Application and Configuration
This technique can not be configured in AProVE.
The order AProVE uses is the embedding order on constructors.
One can use this technique as a fast try to show termination but it is not very powerful.
If successful one not only has shown termination but simple termination of R.