Translate the following inference to logic notation: For all x, x_8 is poor or x_8 is happy. For all x, x_8 is not poor or x_8 is a cashier. For all x, x_8 will play squash if and only if x_8 is happy. There is at least one x for which x_8 will not play squash. Therefore there is at least one x for which x_8 is a cashier.
forall x: P(x) or Q(x). forall x: ~P(x) or R(x). forall x: S(x) <-> Q(x). exists x: ~S(x). Therefore exists x: R(x).