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

  Signature: if  :: Bool -> Int -> Int -> Int
             pow :: Int -> Int -> Int

  Rules: pow(x, y) -> if(y > 0, x, y)
         if(true, x, y) -> x * pow(x, y - 1)
         if(false, x, y) -> 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, i, c), where:

  P1. (1) pow#(x, y) => if#(y > 0, x, y)
      (2) if#(true, x, y) => pow#(x, y - 1)

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

We chain DPs according to the following mapping:


  if#(true, x, y) => if#(y - 1 > 0, x, y - 1) | true /\ true  is obtained by chaining  if#(true, x, y) => pow#(x, y - 1) and pow#(x', y') => if#(y' > 0, x', y')


The following DPs were deleted:

if#(true, x, y) => pow#(x, y - 1)

pow#(x, y) => if#(y > 0, x, y)


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

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

  P2. (1) if#(true, x, y) => if#(y - 1 > 0, 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).