Consider the following premises. forall y: W(y) -> ~S(y). forall y: R_3(y) -> S(y). forall y: R_3(y) or U(y). forall y: U(y) -> S(y). Can we infer forall y: ~W(y) from them? If possible, name the inference rules being used at each step.
 From forall y: R_3(y) -> S(y), forall y: U(y) -> S(y), forall y: R_3(y) or U(y) we can infer forall y: S(y) via universal disjunction elimination. Finally, from forall y: W(y) -> ~S(y), forall y: S(y) we can infer forall y: ~W(y) via universal modus tollens. Therefore, the answer is yes.