Translate the following inference to logic notation: For all x, x is not poor. If John plays a game, then Robert is not curious. It is cloudy. David is poor or Robert is curious. Therefore it is cloudy.
forall x: ~P(x). p -> ~q. r. P(a) or q. Therefore r.