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