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