Translate the following inference to logic notation: Robert is not making tea. For all x, y will make tea if and only if y will go running. For all x, y will make tea if and only if y will go running. Therefore Robert is not running.
~P(a). forall x: P(x) <-> Q(x). forall x: P(x) <-> Q(x). Therefore ~Q(a).