Consider the following premises. q -> ~t. forall z_1: P(z_1) -> U(z_1). U(a_19) -> t. t_2 or P(a_19). t_2 -> t. Can we infer ~q from them? If possible, name the inference rules being used at each step.
 From forall z_1: P(z_1) -> U(z_1) we can infer P(a_19) -> U(a_19) via universal instantiation. From P(a_19) -> U(a_19), U(a_19) -> t we can infer P(a_19) -> t via transitivity. From t_2 -> t, P(a_19) -> t, t_2 or P(a_19) we can infer t via disjunction elimination. Finally, from q -> ~t, t we can infer ~q via modus tollens. Therefore, the answer is yes.