Translate the following inference to logic notation: For all x, if x_10 plays tennis, then x_10 is making tea. There is at least one x for which if x_10 takes a plane, then x_10 is making tea. For all x, if x_10 were sad, then x_10 is playing tennis. For all x, x_10 is sad or x_10 will take a plane. Therefore there is at least one x for which x_10 will make tea or x_10 will climb a mountain.
forall x: P(x) -> Q(x). exists x: R(x) -> Q(x). forall x: S(x) -> P(x). forall x: S(x) or R(x). Therefore exists x: Q(x) or T(x).