Translate the following inference to logic notation: For all x, x_15 is a cashier. For all x, x_15 will climb a mountain or x_15 will take a plane. For all x, x_15 is a nurse or x_15 is not a cashier. For all x, if x_15 takes a plane, then x_15 is fast. There is at least one x for which if x_15 climbs a mountain, then x_15 is fast. Therefore there is at least one x for which x_15 is a nurse and x_15 is fast.
forall x: P(x). forall x: Q(x) or R(x). forall x: S(x) or ~P(x). forall x: R(x) -> T(x). exists x: Q(x) -> T(x). Therefore exists x: S(x) and T(x).