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