Translate the following inference to logic notation: For all x, if x_15 climbs a mountain, then x_15 is not playing a game. There is at least one x for which if x_15 were a doctor, then x_15 is a nurse. For all x, if x_15 were a poet, then x_15 is a doctor. For all x, if x_15 were a nurse, then x_15 is playing a game. For all x, x_15 is a poet. Therefore there is at least one x for which x_15 will not climb a mountain.
forall x: P(x) -> ~Q(x). exists x: R(x) -> S(x). forall x: T(x) -> R(x). forall x: S(x) -> Q(x). forall x: T(x). Therefore exists x: ~P(x).