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#(0, 1, X) => f#(X, X, X)
      (2) map#(H1, cons(W1, P1)) => map#(H1, P1)
      (3) filter#(Z2, cons(U2, V2)) => filter2#(Z2(U2), Z2, U2, V2)
      (4) filter2#(true, I2, P2, X3) => filter#(I2, X3)
      (5) filter2#(false, Z3, U3, V3) => filter#(Z3, V3)

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

Considering the 3 SCCs, this DP problem is split into the following new problems.

  P2. (1) f#(0, 1, X) => f#(X, X, X)

  P3. (1) map#(H1, cons(W1, P1)) => map#(H1, P1)

  P4. (1) filter#(Z2, cons(U2, V2)) => filter2#(Z2(U2), Z2, U2, V2)
      (2) filter2#(true, I2, P2, X3) => filter#(I2, X3)
      (3) filter2#(false, Z3, U3, V3) => filter#(Z3, V3)

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