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

  Signature: eval_1 :: Int -> Int -> o
             eval_2 :: Int -> Int -> o

  Rules: eval_1(x, y) -> eval_2(x, y) | x > 0
         eval_2(x, y) -> eval_2(x, y - 1) | x > 0 /\ y > 0
         eval_2(x, y) -> eval_1(x - 1, y) | x > 0 /\ 0 >= 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, f, c), where:

  P1. (1) eval_1#(x, y) => eval_2#(x, y) | x > 0
      (2) eval_2#(x, y) => eval_2#(x, y - 1) | x > 0 /\ y > 0
      (3) eval_2#(x, y) => eval_1#(x - 1, y) | x > 0 /\ 0 >= y

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

We use the following theory arguments function:

  eval_1# : [1, 2]
  eval_2# : [1, 2]

Processor output: { D2 = (P2, R, f, c) ; D3 = (P3, R, f, c) }, where:

  P2. (1) eval_1#(x, y) => eval_2#(x, y) | x > 0 { x, y }
      (2) eval_2#(x, y) => eval_2#(x, y - 1) | x > 0 /\ y > 0
      (3) eval_2#(x, y) => eval_1#(x - 1, y) | x > 0 /\ 0 >= y

  P3. (1) eval_1#(x, y) => eval_2#(x, y) | x > 0

***** We apply the Integer Function Processor on D2 = (P2, R, f, c).

We use the following integer mapping:

  J(eval_1#) = arg_2 - 1
  J(eval_2#) = arg_2 - 1

We thus have:

  (1) x > 0           |= y - 1 >= y - 1
  (2) x > 0 /\ y > 0  |= y - 1 >  y - 1 - 1 (and y - 1 >= 0)
  (3) x > 0 /\ 0 >= y |= y - 1 >= y - 1

We may remove the strictly oriented DPs, which yields:

Processor output: { D4 = (P4, R, f, c) }, where:

  P4. (1) eval_1#(x, y) => eval_2#(x, y) | x > 0 { x, y }
      (2) eval_2#(x, y) => eval_1#(x - 1, y) | x > 0 /\ 0 >= y

***** We apply the Graph Processor on D3 = (P3, R, f, c).

We compute a graph approximation with the following edges:

  1:

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

Processor output: { }.

***** We apply the Integer Function Processor on D4 = (P4, R, f, c).

We use the following integer mapping:

  J(eval_1#) = arg_1
  J(eval_2#) = arg_1

We thus have:

  (1) x > 0           |= x >= x
  (2) x > 0 /\ 0 >= y |= x >  x - 1 (and x >= 0)

We may remove the strictly oriented DPs, which yields:

Processor output: { D5 = (P5, R, f, c) }, where:

  P5. (1) eval_1#(x, y) => eval_2#(x, y) | x > 0 { x, y }

***** We apply the Graph Processor on D5 = (P5, R, f, c).

We compute a graph approximation with the following edges:

  1:

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

Processor output: { }.