Consider the following premises. forall x_13: T(x_13) -> W(x_13). forall x_13: T(x_13) or Q_13(x_13). forall x_13: Q_13(x_13) -> W(x_13). p. Can we infer p and W(a_9) from them? If possible, name the inference rules being used at each step.
 From forall x_13: T(x_13) -> W(x_13), forall x_13: Q_13(x_13) -> W(x_13), forall x_13: T(x_13) or Q_13(x_13) we can infer forall x_13: W(x_13) via universal disjunction elimination. From forall x_13: W(x_13) we can infer W(a_9) via universal instantiation. Finally, from p, W(a_9) we can infer p and W(a_9) via conjunction. Therefore, the answer is yes.