Translate the following inference to logic notation: For all x, x_9 will write a letter. For all x, x_9 will cook or x_9 will play squash. There is at least one x for which if x_9 cooks, then x_9 is curious. For all x, if x_9 plays squash, then x_9 is curious. Therefore there is at least one x for which x_9 is curious.
forall x: P(x). forall x: Q(x) or R(x). exists x: Q(x) -> S(x). forall x: R(x) -> S(x). Therefore exists x: S(x).