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) cu#(true, x) => exp#(x)
      (2) cu#(true, x) => cu#(x < exp(x), x + 1)

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

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