Consider the following premises. s_3 -> q_3. ~q_2. q_3 -> q_2. q_2 -> s_3. Can we infer ~s_3 from them? If possible, name the inference rules being used at each step.
 From s_3 -> q_3, q_3 -> q_2 we can infer s_3 -> q_2 via transitivity. From q_2 -> s_3, s_3 -> q_2 we can infer q_2 <-> s_3 via biconditional introduction. Finally, from q_2 <-> s_3, ~q_2 we can infer ~s_3 via biconditional elimination. Therefore, the answer is yes.