We consider universal computability of the LCTRS with only rule scheme Calc:

  Signature: cons :: Int -> o -> o
             g    :: Int -> o -> o

  Rules: g(x, cons(y, ys)) -> cons(x + y, g(x, ys))

The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the initial DP problem D1 = (P1, R UNION R_?, f, c), where:

  P1. (1) g#(x, cons(y, ys)) => g#(x, ys)

***** We apply the Subterm Criterion Processor on D1 = (P1, R UNION R_?, f, c).

We use the following projection function:

  nu(g#) = 2

We thus have:

  (1) cons(y, ys) |>| ys

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

Processor output: { }.