Consider the following premises. exists x_8: S(x_8) or Q_4(x_8). forall x_8: Q_4(x_8) <-> T(x_8). forall x_8: ~S(x_8). Can we infer exists x_8: T(x_8) from them? If possible, name the inference rules being used at each step.
 From exists x_8: S(x_8) or Q_4(x_8), forall x_8: ~S(x_8) we can infer exists x_8: Q_4(x_8) via existential disjunctive syllogism. From forall x_8: Q_4(x_8) <-> T(x_8) we can infer forall x_8: Q_4(x_8) -> T(x_8) via universal biconditional elimination. Finally, from forall x_8: Q_4(x_8) -> T(x_8), exists x_8: Q_4(x_8) we can infer exists x_8: T(x_8) via existential modus ponens. Therefore, the answer is yes.