Consider the following premises. forall x_19: T(x_19) -> S_19(x_19). p -> ~q_4. t_3 or T(a_19). t_3 -> q_4. S_19(a_19) -> q_4. Can we infer ~p from them? If possible, name the inference rules being used at each step.
 From forall x_19: T(x_19) -> S_19(x_19) we can infer T(a_19) -> S_19(a_19) via universal instantiation. From T(a_19) -> S_19(a_19), S_19(a_19) -> q_4 we can infer T(a_19) -> q_4 via transitivity. From t_3 -> q_4, T(a_19) -> q_4, t_3 or T(a_19) we can infer q_4 via disjunction elimination. Finally, from p -> ~q_4, q_4 we can infer ~p via modus tollens. Therefore, the answer is yes.