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