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