Consider the following premises. forall x: R(x) -> T(x). forall x: W(x) <-> S(x). exists x: T(x) -> W(x). Can we infer forall x: ~(R(x) -> S(x)) from them? If possible, name the inference rules being used at each step.
That contradicts the premises. Therefore the answer is no.