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) implode#(cons(H, T), F, X) => implode#(T, F, F(X))
      (2) explode#(cons(H, T), F, X) => op#(F, F, X{15})
      (3) explode#(cons(H, T), F, X) => explode#(T, op(F, F), F(X))

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

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

  P2. (1) implode#(cons(H, T), F, X) => implode#(T, F, F(X))

  P3. (1) explode#(cons(H, T), F, X) => explode#(T, op(F, F), F(X))

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

We use the following projection function:

  nu(implode#) = 1

We thus have:

  (1) cons(H, T) |>| T

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

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

We use the following projection function:

  nu(explode#) = 1

We thus have:

  (1) cons(H, T) |>| T

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