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) map#(Z, cons(U, V)) => map#(Z, V)
      (2) minus#(s(P), s(X1)) => p#(s(P))
      (3) minus#(s(P), s(X1)) => p#(s(X1))
      (4) minus#(s(P), s(X1)) => minus#(p(s(P)), p(s(X1)))
      (5) div#(s(V1), s(W1)) => minus#(V1, W1)
      (6) div#(s(V1), s(W1)) => div#(minus(V1, W1), s(W1))

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

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

  P2. (1) map#(Z, cons(U, V)) => map#(Z, V)

  P3. (1) minus#(s(P), s(X1)) => minus#(p(s(P)), p(s(X1)))

  P4. (1) div#(s(V1), s(W1)) => div#(minus(V1, W1), s(W1))

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

We use the following projection function:

  nu(map#) = 2

We thus have:

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

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

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