The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the following initial DP problem:

  P1. (1) eval#(x, y, z) => eval#(x, y + 1, z + 1) | x > y /\ x > z

***** We apply the Integer Function Processor on P1.

We use the following integer mapping:

  J(eval#) = arg_1 - arg_3 - 1

We thus have:

  (1) x > y /\ x > z |= x - z - 1 > x - (z + 1) - 1 (and x - z - 1 >= 0)

All DPs are strictly oriented, and may be removed.  Hence, this DP problem is finite.