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