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