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

  Signature: cond :: Bool -> Int -> Int
             f91  :: Int -> Int

  Rules: f91(n) -> cond(n <= 100, n) | n = n
         cond(true, n) -> f91(f91(n + 11)) | n = n
         cond(false, n) -> n - 10 | n = n

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, i, c), where:

  P1. (1) f91#(n) => cond#(n <= 100, n) | n = n
      (2) cond#(true, n) => f91#(n + 11) | n = n
      (3) cond#(true, n) => f91#(f91(n + 11)) | n = n

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