Translate the following inference to logic notation: For all x, x_8 is bored if and only if x_8 is a server. For all x, x_8 is not a server. There is at least one x for which x_8 will play squash if and only if x_8 is bored. Therefore there is at least one x for which x_8 will not play squash.
forall x: P(x) <-> Q(x). forall x: ~Q(x). exists x: R(x) <-> P(x). Therefore exists x: ~R(x).