The system is accessible function passing by a sort ordering that equates all sorts.

We start by computing the following initial DP problem:

  P1. (1) cu#(true, x) => exp#(10, 2)
      (2) cu#(true, x) => cu#(x < exp(10, 2), x + 1)
      (3) exp#(x, y) => if#(y > 0, x, y)
      (4) if#(true, x, y) => exp#(x, y - 1)

***** We apply the Graph Processor on P1.

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

  P2. (1) exp#(x, y) => if#(y > 0, x, y)
      (2) if#(true, x, y) => exp#(x, y - 1)

***** We apply the Theory Arguments Processor on P2.

We use the following theory arguments function:

  exp# : [1, 2]
  if#  : [1, 2, 3]

This yields the following new DP problems:

  P3. (1) exp#(x, y) => if#(y > 0, x, y)
      (2) if#(true, x, y) => exp#(x, y - 1) { x, y }

  P4. (1) if#(true, x, y) => exp#(x, y - 1)

***** We apply the Theory Arguments Processor on P3.

We use the following theory arguments function:

  exp# : [1, 2]
  if#  : [1, 2, 3]

This yields the following new DP problems:

  P5. (1) exp#(x, y) => if#(y > 0, x, y) { x, y }
      (2) if#(true, x, y) => exp#(x, y - 1) { x, y }

  P6. (1) exp#(x, y) => if#(y > 0, x, y)

***** We apply the Graph Processor on P4.

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

***** No progress could be made on DP problem P5.