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