Translate the following inference to logic notation: For all x, if x_13 were a server, then x_13 is playing a game. For all x, x_13 is a server if and only if x_13 is a musician. For all x, x_13 is not a server. There is at least one x for which x_13 is poor if and only if x_13 is a musician. For all x, if x_13 plays a game, then x_13 is a musician. Therefore there is at least one x for which x_13 is not poor.
forall x: P(x) -> Q(x). forall x: P(x) <-> R(x). forall x: ~P(x). exists x: S(x) <-> R(x). forall x: Q(x) -> R(x). Therefore exists x: ~S(x).