Translate the following inference to logic notation: For all x, if x_10 sleeps, then x_10 is a mechanic. For all x, if x_10 were a politician, then x_10 is a mechanic. There is at least one x for which x_10 is a politician or x_10 will go running. For all x, if x_10 goes running, then x_10 is sleeping. For all x, x_10 is an electrician. Therefore there is at least one x for which x_10 is a mechanic and x_10 is an electrician.
forall x: P(x) -> Q(x). forall x: R(x) -> Q(x). exists x: R(x) or S(x). forall x: S(x) -> P(x). forall x: T(x). Therefore exists x: Q(x) and T(x).