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) init#(F, X{8}) => fsum#(F, X{9})
      (2) init#(F, X{8}) => map#(fsum(F), X{8})
      (3) map#(F, cons(H, T)) => map#(F, T)
      (4) fsum#(F, N) => fsum#(F, N - 1) | N != 0

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

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

  P2. (1) fsum#(F, N) => fsum#(F, N - 1) | N != 0

  P3. (1) map#(F, cons(H, T)) => map#(F, T)

***** No progress could be made on DP problem P2.