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

  Signature: f :: Bool -> Int -> o

  Rules: f(true, x) -> f(x > y /\ x >= 0, y) | x = x /\ y = 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) f#(true, x) => f#(x > y /\ x >= 0, y) | x = x /\ y = y

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