Translate the following inference to logic notation: For all x, if x_8 were a cashier, then x_8 is not making tea. There is at least one x for which if x_8 were poor, then x_8 is making tea. For all x, if x_8 were a police officer, then x_8 is making tea. For all x, x_8 is a police officer or x_8 is poor. Therefore there is at least one x for which x_8 is not a cashier.
forall x: P(x) -> ~Q(x). exists x: R(x) -> Q(x). forall x: S(x) -> Q(x). forall x: S(x) or R(x). Therefore exists x: ~P(x).