Translate the following inference to logic notation: For all x, x is a taxi driver or x is bored. There is at least one x for which if x were a taxi driver, then x is a writer. For all x, if x were bored, then x is a writer. Therefore there is at least one x for which x is a writer.
forall x: P(x) or Q(x). exists x: P(x) -> R(x). forall x: Q(x) -> R(x). Therefore exists x: R(x).