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) le#(s(V), s(W)) => le#(V, W)
      (2) minus#(P, X1) => le#(P, X1)
      (3) minus#(P, X1) => if#(le(P, X1), P, X1)
      (4) if#(false, V1, W1) => p#(V1)
      (5) if#(false, V1, W1) => minus#(p(V1), W1)
      (6) map#(F2, cons(Y2, U2)) => map#(F2, U2)
      (7) filter#(I2, cons(P2, X3)) => filter2#(I2(P2), I2, P2, X3)
      (8) filter2#(true, Z3, U3, V3) => filter#(Z3, V3)
      (9) 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) le#(s(V), s(W)) => le#(V, W)

  P3. (1) minus#(P, X1) => if#(le(P, X1), P, X1)
      (2) if#(false, V1, W1) => minus#(p(V1), W1)

  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)

***** We apply the Subterm Criterion Processor on P2.

We use the following projection function:

  nu(le#) = 1

We thus have:

  (1) s(V) |>| V

All DPs are strictly oriented, and may be removed.  Hence, this DP problem is finite.

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