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) add#(s(x), y) => add#(x, s(y))

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

We use the following projection function:

  nu(add#) = 1

We thus have:

  (1) s(x) |>| x

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