Translate the following inference to logic notation: For all x, x_11 will cook or x_11 will play squash. There is at least one x for which if x_11 plays squash, then x_11 is making tea. For all x, if x_11 makes tea, then x_11 is playing a game. For all x, if x_11 cooks, then x_11 is poor. For all x, if x_11 were poor, then x_11 is cooking. For all x, if x_11 plays a game, then x_11 is poor. Therefore there is at least one x for which x_11 is poor.
forall x: P(x) or Q(x). exists x: Q(x) -> R(x). forall x: R(x) -> S(x). forall x: P(x) -> T(x). forall x: T(x) -> P(x). forall x: S(x) -> T(x). Therefore exists x: T(x).