Translate the following inference to logic notation: For all x, x_4 will go running. For all x, if x_4 writes a letter, then x_4 is working. For all x, x_4 will write a letter. Therefore Patricia is running.
forall x: P(x). forall x: Q(x) -> R(x). forall x: Q(x). Therefore P(a).