Translate the following inference to logic notation: For all x, x_1 is bored or x_1 will work. It is snowing. For all x, x_1 is not bored. Therefore Mary is working and it is snowing.
forall x: P(x) or Q(x). p. forall x: ~P(x). Therefore Q(a) and p.