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

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

  Rules: eval(i, j, k) -> eval(j, i + 1, k - 1) | i <= 100 /\ j <= k

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#(i, j, k) => eval#(j, i + 1, k - 1) | i <= 100 /\ j <= k

***** No progress could be made on DP problem D1 = (P1, R UNION R_?, f, c).