Consider the following premises. W(a_5) or s. forall x_13: P_13(x_13) -> Q(x_13). forall x_13: Q_13(x_13) -> Q(x_13). forall x_13: P_13(x_13) or Q_13(x_13). forall x_13: W(x_13) -> ~Q(x_13). Can we infer s from them? If possible, name the inference rules being used at each step.
 From forall x_13: P_13(x_13) -> Q(x_13), forall x_13: Q_13(x_13) -> Q(x_13), forall x_13: P_13(x_13) or Q_13(x_13) we can infer forall x_13: Q(x_13) via universal disjunction elimination. From forall x_13: W(x_13) -> ~Q(x_13), forall x_13: Q(x_13) we can infer forall x_13: ~W(x_13) via universal modus tollens. From forall x_13: ~W(x_13) we can infer ~W(a_5) via universal instantiation. Finally, from W(a_5) or s, ~W(a_5) we can infer s via disjunctive syllogism. Therefore, the answer is yes.