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) until#(J, I, X1) => until#(J, I, I(X1))
      (2) until#(J, I, X1) => if#(J(X1), X1, until(J, I, I(X1)))

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

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

  P2. (1) until#(J, I, X1) => until#(J, I, I(X1))

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