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