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