Consider the following premises. forall x_14: Q_14(x_14) -> Q(x_14). forall x_14: P_14(x_14). t_1 -> ~Q(i_2). forall x_14: P_14(x_14) -> Q_14(x_14). Can we infer t_1 from them? If possible, name the inference rules being used at each step.
 From forall x_14: P_14(x_14) -> Q_14(x_14), forall x_14: P_14(x_14) we can infer forall x_14: Q_14(x_14) via universal modus ponens. From forall x_14: Q_14(x_14) -> Q(x_14), forall x_14: Q_14(x_14) we can infer forall x_14: Q(x_14) via universal modus ponens. From forall x_14: Q(x_14) we can infer Q(i_2) via universal instantiation. Finally, from t_1 -> ~Q(i_2), Q(i_2) we can infer ~t_1 via modus tollens, which contradicts t_1. Therefore, the answer is no.