Translate the following inference to logic notation: For all x, if x_5 were a cashier, then x_5 is taking a plane. For all x, x_5 is sad or x_5 will go running. There is at least one x for which x_5 will not go running or x_5 is a scientist. For all x, x_5 is not sad or x_5 is a cashier. For all x, if x_5 were a scientist, then x_5 is taking a plane. Therefore there is at least one x for which x_5 will take a plane.
forall x: P(x) -> Q(x). forall x: R(x) or S(x). exists x: ~S(x) or T(x). forall x: ~R(x) or P(x). forall x: T(x) -> Q(x). Therefore exists x: Q(x).