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) h#(F, G, s(Y)) => if#(F(Y), Y, 0)
      (2) h#(F, G, s(Y)) => h#(F, G, if(F(Y), Y, 0))

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

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

  P2. (1) h#(F, G, s(Y)) => h#(F, G, if(F(Y), Y, 0))

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