Translate the following inference to logic notation: There is at least one x for which if x_8 were a police officer, then x_8 is a janitor. For all x, x_8 will take a plane or x_8 is a police officer. For all x, if x_8 takes a plane, then x_8 is a janitor. Therefore there is at least one x for which x_8 is a janitor or x_8 is bored.
exists x: P(x) -> Q(x). forall x: R(x) or P(x). forall x: R(x) -> Q(x). Therefore exists x: Q(x) or S(x).