Translate the following inference to logic notation: For all x, x_12 will take a plane or x_12 is a janitor. For all x, x_12 is not happy. There is at least one x for which if x_12 were a janitor, then x_12 is running. For all x, if x_12 takes a plane, then x_12 is running. For all x, x_12 is happy or x_12 is an artist. Therefore there is at least one x for which x_12 will go running and x_12 is an artist.
forall x: P(x) or Q(x). forall x: ~R(x). exists x: Q(x) -> S(x). forall x: P(x) -> S(x). forall x: R(x) or T(x). Therefore exists x: S(x) and T(x).