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)) => f#(X)
      (2) g#(s(P), s(X1)) => f#(P)
      (3) g#(s(P), s(X1)) => if#(f(P), s(P), s(X1))
      (4) g#(Y1, c(U1)) => g#(s(c(U1)), U1)
      (5) g#(Y1, c(U1)) => g#(Y1, g(s(c(U1)), U1))
      (6) map#(I1, cons(P1, X2)) => map#(I1, X2)
      (7) filter#(G2, cons(V2, W2)) => filter2#(G2(V2), G2, V2, W2)
      (8) filter2#(true, J2, X3, Y3) => filter#(J2, Y3)
      (9) filter2#(false, G3, V3, W3) => filter#(G3, W3)

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

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

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

  P3. (1) g#(Y1, c(U1)) => g#(s(c(U1)), U1)
      (2) g#(Y1, c(U1)) => g#(Y1, g(s(c(U1)), U1))

  P4. (1) map#(I1, cons(P1, X2)) => map#(I1, X2)

  P5. (1) filter#(G2, cons(V2, W2)) => filter2#(G2(V2), G2, V2, W2)
      (2) filter2#(true, J2, X3, Y3) => filter#(J2, Y3)
      (3) filter2#(false, G3, V3, W3) => filter#(G3, W3)

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

We use the following projection function:

  nu(f#) = 1

We thus have:

  (1) s(X) |>| X

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

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