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) heightf#(cons(X, Y)) => heightt#(X)
      (2) heightf#(cons(X, Y)) => heightf#(Y)
      (3) heightt#(node(U)) => heightf#(U)

***** We apply the Subterm Criterion Processor on P1.

We use the following projection function:

  nu(heightf#) = 1
  nu(heightt#) = 1

We thus have:

  (1) cons(X, Y) |>| X
  (2) cons(X, Y) |>| Y
  (3) node(U)    |>| U

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