Translate the following inference to logic notation: For all x, z_1 will play squash or z_1 will not work. For all x, if z_1 plays a game, then z_1 is working. For all x, z_1 will not play squash. Therefore for all x, z_1 will not play a game.
forall x: P(x) or ~Q(x). forall x: R(x) -> Q(x). forall x: ~P(x). Therefore forall x: ~R(x).