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

  Signature: f :: nat -> nat -> nat
             g :: (nat -> nat) -> nat

  Rules: f(g(X), g(X)) -> X(g(X))

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