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