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