What can be inferred from the following premises in a single inference step (ignoring inferences that add new predicates or constants)? For all x_11, if x_11 goes running, then x_11 is writing a letter. For all x_11, x_11 will go running or x_11 is not bored. There is at least one x_11 for which x_11 will not write a letter. For all x_11, if x_11 goes running, then x_11 is bored.
There is at least one x_11 for which x_11 will not go running. For all x_11, if x_11 were bored, then x_11 is running.