Translate the following inference to logic notation: If Mary goes running, then it is cloudy. If it is cloudy, then Mary is working. For all x, if x_12 works, then x_12 is running. Therefore if it is cloudy, then Mary is running.
P(a) -> p. p -> Q(a). forall x: Q(x) -> P(x). Therefore p -> P(a).