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#(s(X)) => g#(X, X)
      (2) f#(s(X)) => f#(g(X, X))
      (3) g#(0, 1) => 0#
      (4) map#(G, cons(V, W)) => map#(G, W)
      (5) filter#(F1, cons(Y1, U1)) => filter2#(F1(Y1), F1, Y1, U1)
      (6) filter2#(true, H1, W1, P1) => filter#(H1, P1)
      (7) filter2#(false, F2, Y2, U2) => filter#(F2, U2)

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

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

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

  P3. (1) map#(G, cons(V, W)) => map#(G, W)

  P4. (1) filter#(F1, cons(Y1, U1)) => filter2#(F1(Y1), F1, Y1, U1)
      (2) filter2#(true, H1, W1, P1) => filter#(H1, P1)
      (3) filter2#(false, F2, Y2, U2) => filter#(F2, U2)

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