Translate the following inference to logic notation: For all x, if x_13 goes running, then x_13 is curious. Jennifer is playing a game or Sarah is not running. For all x, if x_13 were curious, then x_13 is running. Therefore if Sarah were curious, then Jennifer is playing a game.
forall x: P(x) -> Q(x). p or ~P(a). forall x: Q(x) -> P(x). Therefore Q(a) -> p.