Translate the following inference to logic notation: For all x, x_8 will take a plane or x_8 is not a janitor. For all x, if x_8 takes a plane, then x_8 is bored. For all x, x_8 will write a letter. For all x, if x_8 writes a letter, then x_8 is taking a plane. Therefore for all x, x_8 is bored.
forall x: P(x) or ~Q(x). forall x: P(x) -> R(x). forall x: S(x). forall x: S(x) -> P(x). Therefore forall x: R(x).