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

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

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

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