Translate the following inference to logic notation: There is at least one x for which x_3 is not a writer. For all x, if x_3 makes tea, then x_3 is playing a game. For all x, if x_3 plays a game, then x_3 is making tea. For all x, if x_3 makes tea, then x_3 is a writer. Therefore there is at least one x for which x_3 will not play a game.
exists x: ~P(x). forall x: Q(x) -> R(x). forall x: R(x) -> Q(x). forall x: Q(x) -> P(x). Therefore exists x: ~R(x).