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