Translate the following inference to logic notation: For all x, x_4 is curious or x_4 is a musician. For all x, if x_4 were a musician, then x_4 is a bartender. There is at least one x for which if x_4 were a bartender, then x_4 is a poet. For all x, if x_4 were curious, then x_4 is a bartender. Therefore there is at least one x for which x_4 is a poet.
forall x: P(x) or Q(x). forall x: Q(x) -> R(x). exists x: R(x) -> S(x). forall x: P(x) -> R(x). Therefore exists x: S(x).