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