Consider the following premises. forall x_11: P_6(x_11) or W(x_11). forall x_11: R(x_11) -> T(x_11). forall x_11: ~P_6(x_11) or T(x_11). forall x_11: R(x_11) <-> W(x_11). forall x_11: T(x_11) -> R(x_11). Can we infer forall x_11: R(x_11) from them? If possible, name the inference rules being used at each step.
 From forall x_11: R(x_11) <-> W(x_11) we can infer forall x_11: W(x_11) -> R(x_11) via universal biconditional elimination. From forall x_11: R(x_11) -> T(x_11), forall x_11: T(x_11) -> R(x_11) we can infer forall x_11: R(x_11) <-> T(x_11) via universal biconditional introduction. From forall x_11: P_6(x_11) or W(x_11), forall x_11: ~P_6(x_11) or T(x_11) we can infer forall x_11: W(x_11) or T(x_11) via universal resolution. From forall x_11: R(x_11) <-> T(x_11) we can infer forall x_11: T(x_11) -> R(x_11) via universal biconditional elimination. Finally, from forall x_11: W(x_11) -> R(x_11), forall x_11: T(x_11) -> R(x_11), forall x_11: W(x_11) or T(x_11) we can infer forall x_11: R(x_11) via universal disjunction elimination. Therefore, the answer is yes.