Translate the following inference to logic notation: For all x, x_11 is not poor or x_11 will play a game. For all x, if x_11 cooks, then x_11 is a carpenter. For all x, x_11 is poor or x_11 will cook. For all x, x_11 is a writer. There is at least one x for which if x_11 plays a game, then x_11 is a carpenter. Therefore there is at least one x for which x_11 is a carpenter and x_11 is a writer.
forall x: ~P(x) or Q(x). forall x: R(x) -> S(x). forall x: P(x) or R(x). forall x: T(x). exists x: Q(x) -> S(x). Therefore exists x: S(x) and T(x).