Consider the following premises. r or S_4(g). forall z: S_4(z) -> W_2(z). W_2(g) or ~r. Can we infer W_2(g) from them? If possible, name the inference rules being used at each step.
 From forall z: S_4(z) -> W_2(z) we can infer S_4(g) -> W_2(g) via universal instantiation. From W_2(g) or ~r we can infer r -> W_2(g) via rewriting. Finally, from r -> W_2(g), S_4(g) -> W_2(g), r or S_4(g) we can infer W_2(g) via disjunction elimination. Therefore, the answer is yes.