Translate the following inference to logic notation: For all x, x will take a plane. There is at least one x for which x will sleep. Therefore there is at least one x for which x will take a plane or x is bored.
forall x: P(x). exists x: Q(x). Therefore exists x: P(x) or R(x).