Translate the following inference to logic notation: For all x, x_12 is curious or x_12 will not drink water. For all x, if x_12 were a writer, then x_12 is drinking water. For all x, x_12 is a writer or x_12 is excited. There is at least one x for which if x_12 were excited, then x_12 is drinking water. Therefore there is at least one x for which x_12 is curious.
forall x: P(x) or ~Q(x). forall x: R(x) -> Q(x). forall x: R(x) or S(x). exists x: S(x) -> Q(x). Therefore exists x: P(x).