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