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) filter#(Z, cons(U, V)) => filtersub#(Z(U), Z, cons(U, V))
      (2) filtersub#(true, I, cons(P, X1)) => filter#(I, X1)
      (3) filtersub#(false, Z1, cons(U1, V1)) => filter#(Z1, V1)

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

We use the following projection function:

  nu(filter#)    = 2
  nu(filtersub#) = 3

We thus have:

  (1) cons(U, V)   |>=| cons(U, V)
  (2) cons(P, X1)  |>|  X1
  (3) cons(U1, V1) |>|  V1

We may remove the strictly oriented DPs, which yields:

  P2. (1) filter#(Z, cons(U, V)) => filtersub#(Z(U), Z, cons(U, V))

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

As there are no SCCs, this DP problem is removed.