Translate the following inference to logic notation: There is at least one x for which if x_14 were happy, then x_14 is climbing a mountain. For all x, if x_14 were happy, then x_14 is playing squash. For all x, x_14 will play squash if and only if x_14 is a doctor. For all x, if x_14 plays squash, then x_14 is happy. Therefore there is at least one x for which if x_14 were a doctor, then x_14 is climbing a mountain.
exists x: P(x) -> Q(x). forall x: P(x) -> R(x). forall x: R(x) <-> S(x). forall x: R(x) -> P(x). Therefore exists x: S(x) -> Q(x).