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