Translate the following inference to logic notation: For all x, x_14 will make tea if and only if x_14 is a poet. For all x, x_14 is an office clerk if and only if x_14 is an artist. There is at least one x for which x_14 will not make tea. For all x, x_14 is a poet if and only if x_14 is an office clerk. Therefore there is at least one x for which x_14 is not an artist.
forall x: P(x) <-> Q(x). forall x: R(x) <-> S(x). exists x: ~P(x). forall x: Q(x) <-> R(x). Therefore exists x: ~S(x).