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) fact#(n) => fact2#(n - 1) | n > 0
      (2) fact2#(n) => genlist#(n)
      (3) fact2#(n) => fold#([*], 1, genlist(n))
      (4) genlist#(n) => genlist#(n - 1) | n > 0
      (5) fold#(f, y, cons(x, l)) => fold#(f, y, l)

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

Considering the 2 SCCs, this DP problem is split into the following new problems.

  P2. (1) genlist#(n) => genlist#(n - 1) | n > 0

  P3. (1) fold#(f, y, cons(x, l)) => fold#(f, y, l)

***** We apply the Integer Function Processor on P2.

We use the following integer mapping:

  J(genlist#) = arg_1

We thus have:

  (1) n > 0 |= n > n - 1 (and n >= 0)

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

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

We use the following projection function:

  nu(fold#) = 3

We thus have:

  (1) cons(x, l) |>| l

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