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) g#(x, cons(y, ys)) => g#(x, ys)

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

We use the following projection function:

  nu(g#) = 2

We thus have:

  (1) cons(y, ys) |>| ys

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