Translate the following inference to logic notation: There is at least one x for which x_6 will play squash or x_6 is rich. For all x, x_6 will not play squash or x_6 will write a letter. For all x, x_6 is not curious. For all x, x_6 is curious if and only if x_6 is rich. Therefore there is at least one x for which x_6 will write a letter.
exists x: P(x) or Q(x). forall x: ~P(x) or R(x). forall x: ~S(x). forall x: S(x) <-> Q(x). Therefore exists x: R(x).