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) sub# => readint#(X{7})
      (2) sub# => minus#(X{8}, X{9})
      (3) sub# => comp#(readint, minus, X{10})
      (4) sub# => readint#(comp(readint, minus))

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

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