We consider universal computability of the STRS with no additional rule schemes:

  Signature: 0    :: a
             add  :: a -> a -> a
             cons :: b -> c -> c
             id   :: a -> a
             map  :: (b -> b) -> c -> c
             nil  :: c
             s    :: a -> a

  Rules: id(X) -> X
         add(0) -> id
         add(s(Y), U) -> s(add(Y, U))
         map(H, nil) -> nil
         map(I, cons(P, X1)) -> cons(I(P), map(I, X1))

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 UNION R_?, f, c), where:

  P1. (1) add#(0, arg2) => id#(arg2)
      (2) add#(s(Y), U) => add#(Y, U)
      (3) map#(I, cons(P, X1)) => map#(I, X1)

***** We apply the Graph Processor on D1 = (P1, R UNION R_?, f, c).

We compute a graph approximation with the following edges:

  1:
  2: 1 2 
  3: 3 

There are 2 SCCs.

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

  P2. (1) add#(s(Y), U) => add#(Y, U)

  P3. (1) map#(I, cons(P, X1)) => map#(I, X1)

***** We apply the Subterm Criterion Processor on D2 = (P2, R UNION R_?, f, c).

We use the following projection function:

  nu(add#) = 1

We thus have:

  (1) s(Y) |>| Y

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

Processor output: { }.

***** We apply the Subterm Criterion Processor on D3 = (P3, R UNION R_?, f, c).

We use the following projection function:

  nu(map#) = 2

We thus have:

  (1) cons(P, X1) |>| X1

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

Processor output: { }.