Translate the following inference to logic notation: For all x, z_4 is not a server. For all x, z_4 is a server if and only if z_4 will play squash. For all x, z_4 is poor if and only if z_4 will play squash. For all x, if z_4 plays squash, then z_4 is poor. Therefore for all x, z_4 is not poor.
forall x: ~P(x). forall x: P(x) <-> Q(x). forall x: R(x) <-> Q(x). forall x: Q(x) -> R(x). Therefore forall x: ~R(x).