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) map#(Z, cons(U, V)) => map#(Z, V)
      (2) twice#(Z1, X{8}) => comp#(Z1, Z1, X{8})

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

There is only one SCC, so all DPs not inside the SCC can be removed:

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

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

We use the following projection function:

  nu(map#) = 2

We thus have:

  (1) cons(U, V) |>| V

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