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