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(X, Y), X, U) => f#(U, U, U)
      (2) map#(G1, cons(V1, W1)) => map#(G1, W1)
      (3) filter#(F2, cons(Y2, U2)) => filter2#(F2(Y2), F2, Y2, U2)
      (4) filter2#(true, H2, W2, P2) => filter#(H2, P2)
      (5) filter2#(false, F3, Y3, U3) => filter#(F3, U3)

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

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

  P2. (1) f#(g(X, Y), X, U) => f#(U, U, U)

  P3. (1) map#(G1, cons(V1, W1)) => map#(G1, W1)

  P4. (1) filter#(F2, cons(Y2, U2)) => filter2#(F2(Y2), F2, Y2, U2)
      (2) filter2#(true, H2, W2, P2) => filter#(H2, P2)
      (3) filter2#(false, F3, Y3, U3) => filter#(F3, U3)

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