Translate the following inference to logic notation: For all x, if x_14 were a server, then x_14 is a poet. For all x, if x_14 were a poet, then x_14 is a server. For all x, x_14 is a poet if and only if x_14 is a writer. There is at least one x for which if x_14 were a server, then x_14 is a janitor. Therefore there is at least one x for which if x_14 were a writer, then x_14 is a janitor.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). forall x: Q(x) <-> R(x). exists x: P(x) -> S(x). Therefore exists x: R(x) -> S(x).