Translate the following inference to logic notation: There is at least one x for which if x_11 were an office clerk, then x_11 is a janitor. For all x, x_11 will not cook. For all x, x_11 will cook or x_11 is a janitor. For all x, if x_11 were a janitor, then x_11 is an office clerk. Therefore there is at least one x for which x_11 is an office clerk.
exists x: P(x) -> Q(x). forall x: ~R(x). forall x: R(x) or Q(x). forall x: Q(x) -> P(x). Therefore exists x: P(x).