Translate the following inference to logic notation: For all x, x_5 is bored. For all x, x_5 will not go running. For all x, x_5 will go running if and only if x_5 is bored. Therefore for all x, x_5 will work.
forall x: P(x). forall x: ~Q(x). forall x: Q(x) <-> P(x). Therefore forall x: R(x).