Translate the following inference to logic notation: For all x, if x_13 were a carpenter, then x_13 is running. For all x, if x_13 goes running, then x_13 is a carpenter. Jessica is a carpenter or it is late. Jessica is running or it is not late. Therefore Jessica is running.
forall x: P(x) -> Q(x). forall x: Q(x) -> P(x). P(a) or p. Q(a) or ~p. Therefore Q(a).