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) fold#(G, cons(V, W), P) => fold#(G, W, G(P, V))
      (2) sum#(X1) => fold#(add, X1, 0)

***** We apply the Graph Processor on P1.

There is only one SCC, so all DPs not inside the SCC can be removed:

  P2. (1) fold#(G, cons(V, W), P) => fold#(G, W, G(P, V))

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

We use the following projection function:

  nu(fold#) = 2

We thus have:

  (1) cons(V, W) |>| W

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