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

  Signature: A     :: term -> term -> term
             L     :: (term -> term) -> term
             V     :: term -> term
             noabs :: term -> term

  Rules: noabs(A(X, Y)) -> A(noabs(X), noabs(Y))
         noabs(V(X)) -> V(X)
         A(L(Z), Y) -> Z(noabs(Y))

The system does not satisfy the preconditions to apply static dependency pairs: it is not accessible function passing.