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), s(0), Y) => g#(X)
      (2) f#(g(X), s(0), Y) => f#(Y, Y, g(X))
      (3) g#(s(U)) => g#(U)
      (4) map#(I, cons(P, X1)) => map#(I, X1)
      (5) filter#(G1, cons(V1, W1)) => filter2#(G1(V1), G1, V1, W1)
      (6) filter2#(true, J1, X2, Y2) => filter#(J1, Y2)
      (7) filter2#(false, G2, V2, W2) => filter#(G2, W2)

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

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

  P2. (1) g#(s(U)) => g#(U)

  P3. (1) f#(g(X), s(0), Y) => f#(Y, Y, g(X))

  P4. (1) map#(I, cons(P, X1)) => map#(I, X1)

  P5. (1) filter#(G1, cons(V1, W1)) => filter2#(G1(V1), G1, V1, W1)
      (2) filter2#(true, J1, X2, Y2) => filter#(J1, Y2)
      (3) filter2#(false, G2, V2, W2) => filter#(G2, W2)

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

We use the following projection function:

  nu(g#) = 1

We thus have:

  (1) s(U) |>| U

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

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