Translate the following inference to logic notation: For all x, x_6 will not read a book. For all x, if x_6 makes tea, then x_6 is reading a book. If Jessica works, then Karen is making tea. Therefore Jessica is not working.
forall x: ~P(x). forall x: Q(x) -> P(x). p -> Q(a). Therefore ~p.