Translate the following inference to logic notation: For all x, z_3 will not play a game. For all x, z_3 will play a game or z_3 will not go running. If Barbara reads a book, then Jessica is running. Therefore Barbara is not reading a book.
forall x: ~P(x). forall x: P(x) or ~Q(x). p -> Q(a). Therefore ~p.