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) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i, j + 1) | j < bn /\ i < an
      (2) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i + 1, j) | j < bn /\ i < an
      (3) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i + 1, j) | j >= bn /\ i < an
      (4) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i, j + 1) | j < bn /\ i >= an

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

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

  P2. (1) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i, j + 1) | j < bn /\ i >= an

  P3. (1) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i + 1, j) | j >= bn /\ i < an

  P4. (1) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i, j + 1) | j < bn /\ i < an
      (2) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i + 1, j) | j < bn /\ i < an

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

We use the following integer mapping:

  J(eval#) = arg_2 - arg_5 - 1

We thus have:

  (1) j < bn /\ i >= an |= bn - j - 1 > bn - (j + 1) - 1 (and bn - j - 1 >= 0)

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

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

We use the following integer mapping:

  J(eval#) = arg_1 - arg_4

We thus have:

  (1) j >= bn /\ i < an |= an - i > an - (i + 1) (and an - i >= 0)

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

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

We use the following integer mapping:

  J(eval#) = arg_2 - arg_5

We thus have:

  (1) j < bn /\ i < an |= bn - j >  bn - (j + 1) (and bn - j >= 0)
  (2) j < bn /\ i < an |= bn - j >= bn - j

We may remove the strictly oriented DPs, which yields:

  P5. (1) eval#(an, bn, cn, i, j) => eval#(an, bn, cn + 1, i + 1, j) | j < bn /\ i < an

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

We use the following integer mapping:

  J(eval#) = arg_1 - arg_4 - 1

We thus have:

  (1) j < bn /\ i < an |= an - i - 1 > an - (i + 1) - 1 (and an - i - 1 >= 0)

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