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#(0, 1, g(X, Y), U) => g#(X, Y)
      (2)  f#(0, 1, g(X, Y), U) => g#(X, Y)
      (3)  f#(0, 1, g(X, Y), U) => g#(X, Y)
      (4)  f#(0, 1, g(X, Y), U) => h#(X)
      (5)  f#(0, 1, g(X, Y), U) => f#(g(X, Y), g(X, Y), g(X, Y), h(X))
      (6)  h#(g(V, W)) => h#(V)
      (7)  map#(F1, cons(Y1, U1)) => map#(F1, U1)
      (8)  filter#(I1, cons(P1, X2)) => filter2#(I1(P1), I1, P1, X2)
      (9)  filter2#(true, Z2, U2, V2) => filter#(Z2, V2)
      (10) filter2#(false, I2, P2, X3) => filter#(I2, X3)

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

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

  P2. (1) h#(g(V, W)) => h#(V)

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

  P4. (1) map#(F1, cons(Y1, U1)) => map#(F1, U1)

  P5. (1) filter#(I1, cons(P1, X2)) => filter2#(I1(P1), I1, P1, X2)
      (2) filter2#(true, Z2, U2, V2) => filter#(Z2, V2)
      (3) filter2#(false, I2, P2, X3) => filter#(I2, X3)

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

We use the following projection function:

  nu(h#) = 1

We thus have:

  (1) g(V, W) |>| 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.