Consider the following premises. forall x_13: T(x_13) or ~Q_13(x_13). forall x_13: R(x_13). forall x_13: T(x_13) or ~R(x_13). Can we infer ~T(h) from them? If possible, name the inference rules being used at each step.
 From forall x_13: R(x_13) we can infer forall x_13: R(x_13) or Q_13(x_13) via universal addition. From forall x_13: T(x_13) or ~Q_13(x_13) we can infer forall x_13: Q_13(x_13) -> T(x_13) via universal rewriting. From forall x_13: T(x_13) or ~R(x_13) we can infer forall x_13: R(x_13) -> T(x_13) via universal rewriting. Finally, from forall x_13: R(x_13) -> T(x_13), forall x_13: Q_13(x_13) -> T(x_13), forall x_13: R(x_13) or Q_13(x_13) we can infer forall x_13: T(x_13) via universal disjunction elimination, which contradicts ~T(h). Therefore, the answer is no.