Translate the following inference to logic notation: For all x, if x_13 were an astronaut, then x_13 is rich. There is at least one x for which x_13 is not a sailor or x_13 is an astronaut. For all x, x_13 is a sailor. For all x, if x_13 cooks, then x_13 is rich. For all x, x_13 will play squash. Therefore there is at least one x for which x_13 is rich and x_13 will play squash.
forall x: P(x) -> Q(x). exists x: ~R(x) or P(x). forall x: R(x). forall x: S(x) -> Q(x). forall x: T(x). Therefore exists x: Q(x) and T(x).