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

  Signature: 0     :: c
             cons  :: a -> b -> b
             div   :: c -> c -> c
             map   :: (a -> a) -> b -> b
             minus :: c -> c -> c
             nil   :: b
             p     :: c -> c
             s     :: c -> c

  Rules: map(F, nil) -> nil
         map(Z, cons(U, V)) -> cons(Z(U), map(Z, V))
         minus(W, 0) -> W
         minus(s(P), s(X1)) -> minus(p(s(P)), p(s(X1)))
         p(s(Y1)) -> Y1
         div(0, s(U1)) -> 0
         div(s(V1), s(W1)) -> s(div(minus(V1, W1), s(W1)))

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_?, i, c), where:

  P1. (1) map#(Z, cons(U, V)) => map#(Z, V)
      (2) minus#(s(P), s(X1)) => p#(s(P))
      (3) minus#(s(P), s(X1)) => p#(s(X1))
      (4) minus#(s(P), s(X1)) => minus#(p(s(P)), p(s(X1)))
      (5) div#(s(V1), s(W1)) => minus#(V1, W1)
      (6) div#(s(V1), s(W1)) => div#(minus(V1, W1), s(W1))

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

We compute a graph approximation with the following edges:

  1: 1 
  2:
  3:
  4: 2 3 4 
  5: 2 3 4 
  6: 5 6 

There are 3 SCCs.

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

  P2. (1) map#(Z, cons(U, V)) => map#(Z, V)

  P3. (1) minus#(s(P), s(X1)) => minus#(p(s(P)), p(s(X1)))

  P4. (1) div#(s(V1), s(W1)) => div#(minus(V1, W1), s(W1))

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

We use the following projection function:

  nu(map#) = 2

We thus have:

  (1) cons(U, V) |>| V

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

Processor output: { }.

***** No progress could be made on DP problem D3 = (P3, R UNION R_?, i, c).