Translate the following inference to logic notation: For all x, x_9 will take a plane. For all x, if x_9 sleeps, then x_9 is not writing a letter. For all x, x_9 will sleep or x_9 will go running. For all x, x_9 will write a letter. Therefore Michael is running.
forall x: P(x). forall x: Q(x) -> ~R(x). forall x: Q(x) or S(x). forall x: R(x). Therefore S(a).