Translate the following inference to logic notation: For all x, x_16 will play a game if and only if x_16 will drink water. For all x, if x_16 drinks water, then x_16 is curious. For all x, x_16 will make tea. There is at least one x for which if x_16 makes tea, then x_16 is playing a game. Therefore there is at least one x for which x_16 is curious.
forall x: P(x) <-> Q(x). forall x: Q(x) -> R(x). forall x: S(x). exists x: S(x) -> P(x). Therefore exists x: R(x).