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#(G) => g#(G, X{3})
      (2) f#(G) => f#(g(G))

***** 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#(G) => f#(g(G))

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