Translate the following inference to logic notation: It is cloudy or Mary is bored. For all x, if x_13 were bored, then x_13 is making tea. For all x, x_13 will not make tea. For all x, if x_13 makes tea, then x_13 is bored. It is not cloudy or Patricia is happy. Therefore Patricia is happy.
p or P(a). forall x: P(x) -> Q(x). forall x: ~Q(x). forall x: Q(x) -> P(x). ~p or q. Therefore q.