Consider the following premises. q_11 -> p_2. p_2 or ~q. p_2 -> q_11. ~q_11. Can we infer q from them? If possible, name the inference rules being used at each step.
 From p_2 -> q_11, q_11 -> p_2 we can infer p_2 <-> q_11 via biconditional introduction. From p_2 or ~q we can infer q -> p_2 via rewriting. From p_2 <-> q_11, ~q_11 we can infer ~p_2 via biconditional elimination. Finally, from q -> p_2, ~p_2 we can infer ~q via modus tollens, which contradicts q. Therefore, the answer is no.