Consider the following premises. exists x_11: T_3(x_11) -> W(x_11). forall x_11: W(x_11) <-> Q_11(x_11). forall x_11: Q_11(x_11) -> R_5(x_11). forall x_11: R_5(x_11) -> R_1(x_11). Can we infer forall x_11: ~(T_3(x_11) -> R_1(x_11)) from them? If possible, name the inference rules being used at each step.
That contradicts the premises. Therefore the answer is no.