Consider the following premises. forall x_9: S(x_9) -> U_1(x_9). forall x_9: Q_3(x_9). forall x_9: U_1(x_9) -> S(x_9). exists x_9: S(x_9) -> ~Q_3(x_9). Can we infer exists x_9: ~U_1(x_9) from them?
 From forall x_9: U_1(x_9) -> S(x_9), forall x_9: S(x_9) -> U_1(x_9) we can infer forall x_9: U_1(x_9) <-> S(x_9). From exists x_9: S(x_9) -> ~Q_3(x_9), forall x_9: Q_3(x_9) we can infer exists x_9: ~S(x_9). Finally, from forall x_9: U_1(x_9) <-> S(x_9), exists x_9: ~S(x_9) we can infer exists x_9: ~U_1(x_9). Therefore, the answer is yes.