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

  Signature: cu  :: Bool -> Int -> o
             exp :: Int -> Int

  Rules: cu(true, x) -> cu(x < exp(x), x + 1)
         exp(x) -> 2 * 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, f, c), where:

  P1. (1) cu#(true, x) => exp#(x)
      (2) cu#(true, x) => cu#(x < exp(x), x + 1)

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

We compute a graph approximation with the following edges:

  1:
  2:

As there are no SCCs, this DP problem is removed.

Processor output: { }.