The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the following initial DP problem:

  P1 [empty DP problem]

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

As there are no SCCs, this DP problem is removed.