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