Translate the following inference to logic notation: For all x, if x_17 were a bartender, then x_17 is making tea. There is at least one x for which x_17 is a bartender or x_17 will go running. For all x, if x_17 were a poet, then x_17 is not making tea. For all x, if x_17 goes running, then x_17 is making tea. For all x, x_17 is a poet if and only if x_17 is an electrician. Therefore there is at least one x for which x_17 is not an electrician.
forall x: P(x) -> Q(x). exists x: P(x) or R(x). forall x: S(x) -> ~Q(x). forall x: R(x) -> Q(x). forall x: S(x) <-> T(x). Therefore exists x: ~T(x).