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

  Signature: eval_1 :: Int -> Int -> o
             eval_2 :: Int -> Int -> o

  Rules: eval_1(x, y) -> eval_2(x, y) | x = y /\ x > 0
         eval_2(x, y) -> eval_2(x - 1, y - 1) | y > 0
         eval_2(x, y) -> eval_1(x, y) | 0 >= y

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) eval_1#(x, y) => eval_2#(x, y) | x = y /\ x > 0
      (2) eval_2#(x, y) => eval_2#(x - 1, y - 1) | y > 0
      (3) eval_2#(x, y) => eval_1#(x, y) | 0 >= y

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

We compute a graph approximation with the following edges:

  1: 2 
  2: 2 3 
  3:

There is only one SCC, so all DPs not inside the SCC can be removed.

Processor output: { D2 = (P2, R UNION R_?, f, c) }, where:

  P2. (1) eval_2#(x, y) => eval_2#(x - 1, y - 1) | y > 0

***** We apply the Integer Function Processor on D2 = (P2, R UNION R_?, f, c).

We use the following integer mapping:

  J(eval_2#) = arg_2

We thus have:

  (1) y > 0 |= y > y - 1 (and y >= 0)

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

Processor output: { }.