Translate the following inference to logic notation: For all x, if x_6 were a writer, then x_6 is making tea. There is at least one x for which x_6 is not a writer. For all x, if x_6 makes tea, then x_6 is an electrician. For all x, x_6 is a writer or x_6 is not an electrician. Therefore there is at least one x for which x_6 is not an electrician.
forall x: P(x) -> Q(x). exists x: ~P(x). forall x: Q(x) -> R(x). forall x: P(x) or ~R(x). Therefore exists x: ~R(x).