Translate the following inference to logic notation: For all x, x_17 is not rich. For all x, x_17 will play squash or x_17 is rich. For all x, x_17 will not play squash. If Mary were a server, then David is not happy. Therefore Mary is not a server.
forall x: ~P(x). forall x: Q(x) or P(x). forall x: ~Q(x). p -> ~R(a). Therefore ~p.