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