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

  Signature: f     :: Int -> Int -> o
             round :: Int -> Int

  Rules: f(x, y) -> f(x, round(x)) | x >= 1 /\ y = x - 1
         round(x) -> x
         round(x) -> x + 1

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

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

We compute a graph approximation with the following edges:

  1:
  2: 1 2 

There is only one SCC, so all DPs not inside the SCC can be removed.

Processor output: { D2 = (P2, R UNION R_?, f, c) }, where:

  P2. (1) f#(x, y) => f#(x, round(x)) | x >= 1 /\ y = x - 1

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