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) rec#(G, V, s(W)) => rec#(G, V, W)

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

We use the following projection function:

  nu(rec#) = 3

We thus have:

  (1) s(W) |>| W

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