Consider the following premises. R_17(a_17) -> t. ~t. forall x_17: R_17(x_17) -> S_17(x_17). S_17(a_17) -> R_17(a_17). Can we infer ~S_17(a_17) from them? If possible, name the inference rules being used at each step.
 From forall x_17: R_17(x_17) -> S_17(x_17) we can infer R_17(a_17) -> S_17(a_17) via universal instantiation. From S_17(a_17) -> R_17(a_17), R_17(a_17) -> S_17(a_17) we can infer S_17(a_17) <-> R_17(a_17) via biconditional introduction. From R_17(a_17) -> t, ~t we can infer ~R_17(a_17) via modus tollens. From S_17(a_17) <-> R_17(a_17) we can infer S_17(a_17) -> R_17(a_17) via biconditional elimination. Finally, from S_17(a_17) -> R_17(a_17), ~R_17(a_17) we can infer ~S_17(a_17) via modus tollens. Therefore, the answer is yes.