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