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

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

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

  P2. (1) f#(x, y) => f#(x, round(x)) | x >= 1 /\ y = x - 1

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