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