Translate the following inference to logic notation: For all x, x_5 is not a lawyer. There is at least one x for which x_5 is curious or x_5 will play a game. For all x, x_5 is a sailor if and only if x_5 is curious. For all x, if x_5 were a sailor, then x_5 is a lawyer. Therefore there is at least one x for which x_5 will play a game.
forall x: ~P(x). exists x: Q(x) or R(x). forall x: S(x) <-> Q(x). forall x: S(x) -> P(x). Therefore exists x: R(x).