The system is accessible function passing by a sort ordering with b = c ≻ a.

We start by computing the following initial DP problem:

  P1. (1) map#(Z, cons(U, V)) => map#(Z, V)
      (2) treemap#(I, node(P, X1)) => treemap#(I, X{7})
      (3) treemap#(I, node(P, X1)) => map#(treemap(I), X1)

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

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

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

  P3. (1) treemap#(I, node(P, X1)) => treemap#(I, X{7})

***** 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.