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) lastbit#(x) => lastbit#(x - 2) | x > 1
      (2) conv#(x) => conv#(x / 2) | x > 0
      (3) conv#(x) => lastbit#(x) | x > 0

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

Considering the 2 SCCs, this DP problem is split into the following new problems.

  P2. (1) lastbit#(x) => lastbit#(x - 2) | x > 1

  P3. (1) conv#(x) => conv#(x / 2) | x > 0

***** We apply the Integer Function Processor on P2.

We use the following integer mapping:

  J(lastbit#) = arg_1

We thus have:

  (1) x > 1 |= x > x - 2 (and x >= 0)

All DPs are strictly oriented, and may be removed.  Hence, this DP problem is finite.

***** We apply the Integer Function Processor on P3.

We use the following integer mapping:

  J(conv#) = arg_1

We thus have:

  (1) x > 0 |= x > x / 2 (and x >= 0)

All DPs are strictly oriented, and may be removed.  Hence, this DP problem is finite.