Translate the following inference to logic notation: For all x, x_11 is not curious. For all x, x_11 is curious or x_11 will sleep. If Patricia sleeps, then it is snowing. Therefore it is snowing.
forall x: ~P(x). forall x: P(x) or Q(x). Q(a) -> p. Therefore p.