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) merge#(nil, cons(Y, U), V) => merge#(U, nil, cons(Y, V))
      (2) merge#(cons(W, P), X1, Y1) => merge#(X1, P, cons(W, Y1))
      (3) map#(H1, cons(W1, P1)) => map#(H1, P1)

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

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

  P2. (1) merge#(nil, cons(Y, U), V) => merge#(U, nil, cons(Y, V))
      (2) merge#(cons(W, P), X1, Y1) => merge#(X1, P, cons(W, Y1))

  P3. (1) map#(H1, cons(W1, P1)) => map#(H1, P1)

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