Translate the following inference to logic notation: For all x, x_11 is an electrician or x_11 will cook. There is at least one x for which x_11 will make tea. For all x, if x_11 reads a book, then x_11 is working. For all x, if x_11 were an electrician, then x_11 is reading a book. For all x, x_11 will cook if and only if x_11 will read a book. Therefore there is at least one x for which x_11 will make tea and x_11 will work.
forall x: P(x) or Q(x). exists x: R(x). forall x: S(x) -> T(x). forall x: P(x) -> S(x). forall x: Q(x) <-> S(x). Therefore exists x: R(x) and T(x).