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