Translate the following inference to logic notation: If Robert plays a game, then Robert is making tea. For all x, y will not make tea. If Robert makes tea, then Robert is playing a game. Therefore Robert is not playing a game.
p -> P(a). forall x: ~P(x). P(a) -> p. Therefore ~p.