We consider termination of the LCTRS with only rule scheme Calc:

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

  Rules: f(true, x, y, z) -> f(x > y /\ x > z, x, y + 1, z)
         f(true, x, y, z) -> f(x > y /\ x > z, x, y, z + 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, f, c), where:

  P1. (1) f#(true, x, y, z) => f#(x > y /\ x > z, x, y + 1, z)
      (2) f#(true, x, y, z) => f#(x > y /\ x > z, x, y, z + 1)

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