The system is accessible function passing by a sort ordering with listf ≻ a.

We start by computing the following initial DP problem:

  P1. (1) lapply#(x, cons(F, lf)) => lapply#(x, lf)

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

We use the following projection function:

  nu(lapply#) = 2

We thus have:

  (1) cons(F, lf) |>| lf

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