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

  Signature: eval :: Int -> Int -> Int -> o

  Rules: eval(x, y, z) -> eval(x - 1, y, z) | x > z
         eval(x, y, z) -> eval(x - 1, y, z) | y > z /\ x > z
         eval(x, y, z) -> eval(x, y - 1, z) | x > z /\ z >= x /\ y > z
         eval(x, y, z) -> eval(x, y - 1, z) | y > z /\ z >= x
         eval(x, y, z) -> eval(x, y, z) | x > z /\ z >= x /\ z >= y
         eval(x, y, z) -> eval(x, y, z) | y > z /\ z >= x /\ z >= 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_?, i, c), where:

  P1. (1) eval#(x, y, z) => eval#(x - 1, y, z) | x > z
      (2) eval#(x, y, z) => eval#(x - 1, y, z) | y > z /\ x > z
      (3) eval#(x, y, z) => eval#(x, y - 1, z) | x > z /\ z >= x /\ y > z
      (4) eval#(x, y, z) => eval#(x, y - 1, z) | y > z /\ z >= x
      (5) eval#(x, y, z) => eval#(x, y, z) | x > z /\ z >= x /\ z >= y
      (6) eval#(x, y, z) => eval#(x, y, z) | y > z /\ z >= x /\ z >= y

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

We compute a graph approximation with the following edges:

  1: 1 2 4 
  2: 1 2 4 
  3:
  4: 4 
  5:
  6:

There are 2 SCCs.

Processor output: { D2 = (P2, R UNION R_?, i, c) ; D3 = (P3, R UNION R_?, i, c) }, where:

  P2. (1) eval#(x, y, z) => eval#(x, y - 1, z) | y > z /\ z >= x

  P3. (1) eval#(x, y, z) => eval#(x - 1, y, z) | x > z
      (2) eval#(x, y, z) => eval#(x - 1, y, z) | y > z /\ x > z

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

We use the following integer mapping:

  J(eval#) = arg_2 - arg_3

We thus have:

  (1) y > z /\ z >= x |= y - z > y - 1 - z (and y - z >= 0)

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

Processor output: { }.

***** We apply the Integer Function Processor on D3 = (P3, R UNION R_?, i, c).

We use the following integer mapping:

  J(eval#) = arg_1 - arg_3 - 1

We thus have:

  (1) x > z          |= x - z - 1 > x - 1 - z - 1 (and x - z - 1 >= 0)
  (2) y > z /\ x > z |= x - z - 1 > x - 1 - z - 1 (and x - z - 1 >= 0)

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

Processor output: { }.