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

  Signature: condAcc :: Bool -> Int -> Int -> Int
             sqrt    :: Int -> Int
             sqrtAcc :: Int -> Int -> Int

  Rules: sqrt(x) -> sqrtAcc(x, 0) | x = x
         sqrtAcc(x, y) -> condAcc(y * y >= x \/ y < 0, x, y) | x = x /\ y = y
         condAcc(true, x, y) -> y | x = x /\ y = y
         condAcc(false, x, y) -> sqrtAcc(x, y + 1) | x = x /\ y = 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, i, c), where:

  P1. (1) sqrt#(x) => sqrtAcc#(x, 0) | x = x
      (2) sqrtAcc#(x, y) => condAcc#(y * y >= x \/ y < 0, x, y) | x = x /\ y = y
      (3) condAcc#(false, x, y) => sqrtAcc#(x, y + 1) | x = x /\ y = y

***** We apply the Graph Processor on D1 = (P1, R, i, c).

We compute a graph approximation with the following edges:

  1: 2 
  2: 3 
  3: 2 

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

Processor output: { D2 = (P2, R, i, c) }, where:

  P2. (1) sqrtAcc#(x, y) => condAcc#(y * y >= x \/ y < 0, x, y) | x = x /\ y = y
      (2) condAcc#(false, x, y) => sqrtAcc#(x, y + 1) | x = x /\ y = y

***** We apply the Usable Rules Processor on D2 = (P2, R, i, c).

We obtain 0 usable rules (out of 4 rules in the input problem).

Processor output: { D3 = (P2, {}, i, c) }.

***** No progress could be made on DP problem D3 = (P2, {}, i, c).