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

  Signature: cons :: Int -> list -> list
             f    :: Int -> Int -> list -> list
             nil  :: list

  Rules: f(x, y, z) -> f(y - 2, x + 1, cons(0, z)) | y > 0 /\ x = x
         f(x, y, z) -> z | y <= 0 /\ x = x

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#(x, y, z) => f#(y - 2, x + 1, cons(0, z)) | y > 0 /\ x = x

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