Translate the following inference to logic notation: For all x, x_11 will cook or x_11 is not a lawyer. There is at least one x for which x_11 is a lawyer and x_11 will sleep. Therefore there is at least one x for which x_11 will cook.
forall x: P(x) or ~Q(x). exists x: Q(x) and R(x). Therefore exists x: P(x).