Consider the following premises. p or t. forall x_16: Q(x_16) and S_16(x_16). p -> ~Q(a_16). Can we infer t from them? If possible, name the inference rules being used at each step.
 From forall x_16: Q(x_16) and S_16(x_16) we can infer Q(a_16) and S_16(a_16) via universal instantiation. From Q(a_16) and S_16(a_16) we can infer Q(a_16) via simplification. From p -> ~Q(a_16), Q(a_16) we can infer ~p via modus tollens. Finally, from p or t, ~p we can infer t via disjunctive syllogism. Therefore, the answer is yes.