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

We start by computing the following initial DP problem:

  P1. (1) fmap#(fcons(Z, U), V) => fmap#(U, V)

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

We use the following projection function:

  nu(fmap#) = 1

We thus have:

  (1) fcons(Z, U) |>| U

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