Translate the following inference to logic notation: For all x, if z_3 were a server, then z_3 is playing a game. For all x, if z_3 plays a game, then z_3 is an electrician. For all x, if z_3 were an electrician, then z_3 is a server. For all x, z_3 is not a server. Therefore for all x, z_3 will not play a game.
forall x: P(x) -> Q(x). forall x: Q(x) -> R(x). forall x: R(x) -> P(x). forall x: ~P(x). Therefore forall x: ~Q(x).