Consider the following premises. forall x_15: Q_15(x_15). forall x_15: T(x_15) or ~Q_15(x_15). T(d) -> q_2. Can we infer ~q_2 from them? If possible, name the inference rules being used at each step.
 From forall x_15: T(x_15) or ~Q_15(x_15) we can infer forall x_15: Q_15(x_15) -> T(x_15) via universal rewriting. From forall x_15: Q_15(x_15) -> T(x_15), forall x_15: Q_15(x_15) we can infer forall x_15: T(x_15) via universal modus ponens. From forall x_15: T(x_15) we can infer T(d) via universal instantiation. Finally, from T(d) -> q_2, T(d) we can infer q_2 via modus ponens, which contradicts ~q_2. Therefore, the answer is no.