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