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) log#(x, y) => log#((x - y) / y, y) | x >= 2 /\ y >= 2

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

We use the following integer mapping:

  J(log#) = arg_1

We thus have:

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

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