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

We start by computing the following initial DP problem:

  P1. (1) complist#(fcons(F, t), x) => complist#(t, F(x))

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

We use the following projection function:

  nu(complist#) = 1

We thus have:

  (1) fcons(F, t) |>| t

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