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

  Signature: const :: a -> b -> a
             fix   :: ((f -> g) -> f -> g) -> f -> g
             subst :: (c -> d -> e) -> (c -> d) -> c -> e

  Rules: const(X, Y) -> X
         subst(G, H, W) -> G(W, H(W))
         fix(J, X1) -> J(fix(J), 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_?, i, c), where:

  P1. (1) fix#(J, X1) => fix#(J, fresh1)

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