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