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