Translate the following inference to logic notation: For all x, x_7 is bored if and only if x_7 will go running. Jennifer is not running. Jennifer is bored or it is sunny. Therefore it is sunny.
forall x: P(x) <-> Q(x). ~Q(a). P(a) or p. Therefore p.