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) f#(true, x) => ft#(true, x, y)
      (2) ft#(true, x, y) => ft#(y >= x, x + 1, y)

***** We apply the Graph Processor on P1.

There is only one SCC, so all DPs not inside the SCC can be removed:

  P2. (1) ft#(true, x, y) => ft#(y >= x, x + 1, y)

***** No progress could be made on DP problem P2.