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)  not#(or(Y, U)) => not#(Y)
      (2)  not#(or(Y, U)) => not#(U)
      (3)  not#(or(Y, U)) => and#(not(Y), not(U))
      (4)  not#(and(V, W)) => not#(V)
      (5)  not#(and(V, W)) => not#(W)
      (6)  and#(P, or(X1, Y1)) => and#(P, X1)
      (7)  and#(P, or(X1, Y1)) => and#(P, Y1)
      (8)  and#(or(V1, W1), U1) => and#(U1, V1)
      (9)  and#(or(V1, W1), U1) => and#(U1, W1)
      (10) map#(F2, cons(Y2, U2)) => map#(F2, U2)
      (11) filter#(I2, cons(P2, X3)) => filter2#(I2(P2), I2, P2, X3)
      (12) filter2#(true, Z3, U3, V3) => filter#(Z3, V3)
      (13) filter2#(false, I3, P3, X4) => filter#(I3, X4)

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

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

  P2. (1) and#(P, or(X1, Y1)) => and#(P, X1)
      (2) and#(P, or(X1, Y1)) => and#(P, Y1)
      (3) and#(or(V1, W1), U1) => and#(U1, V1)
      (4) and#(or(V1, W1), U1) => and#(U1, W1)

  P3. (1) not#(or(Y, U)) => not#(Y)
      (2) not#(or(Y, U)) => not#(U)
      (3) not#(and(V, W)) => not#(V)
      (4) not#(and(V, W)) => not#(W)

  P4. (1) map#(F2, cons(Y2, U2)) => map#(F2, U2)

  P5. (1) filter#(I2, cons(P2, X3)) => filter2#(I2(P2), I2, P2, X3)
      (2) filter2#(true, Z3, U3, V3) => filter#(Z3, V3)
      (3) filter2#(false, I3, P3, X4) => filter#(I3, X4)

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