Consider the following premises. forall y_3: R(y_3) or ~W(y_3). forall y_3: W_2(y_3) -> W(y_3). forall y_3: S(y_3) -> W_2(y_3). Can we infer forall y_3: S(y_3) -> R(y_3) from them? If possible, name the inference rules being used at each step.
 From forall y_3: S(y_3) -> W_2(y_3), forall y_3: W_2(y_3) -> W(y_3) we can infer forall y_3: S(y_3) -> W(y_3) via universal transitivity. From forall y_3: R(y_3) or ~W(y_3) we can infer forall y_3: W(y_3) -> R(y_3) via universal rewriting. Finally, from forall y_3: S(y_3) -> W(y_3), forall y_3: W(y_3) -> R(y_3) we can infer forall y_3: S(y_3) -> R(y_3) via universal transitivity. Therefore, the answer is yes.