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

  Signature: sif :: Bool -> Int -> Int -> Int
             sum :: Int -> Int -> Int

  Rules: sum(x, y) -> sif(x >= y, x, y)
         sif(true, x, y) -> y + sum(x, y + 1)
         sif(false, x, y) -> 0

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) sum#(x, y) => sif#(x >= y, x, y)
      (2) sif#(true, x, y) => sum#(x, y + 1)

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

We chain DPs according to the following mapping:


  sif#(true, x, y) => sif#(x >= y + 1, x, y + 1) | true /\ true  is obtained by chaining  sif#(true, x, y) => sum#(x, y + 1) and sum#(x', y') => sif#(x' >= y', x', y')


The following DPs were deleted:

sif#(true, x, y) => sum#(x, y + 1)

sum#(x, y) => sif#(x >= y, x, y)


By chaining, we added 1 DPs and removed 2 DPs.

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

  P2. (1) sif#(true, x, y) => sif#(x >= y + 1, x, y + 1) | true /\ true

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

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

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

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