Keep going deeper until we find a successful reduction. When found, finish tests at current depth and restart from top depth (new iteration). If we reach the bottom (depth with no nodes on it), we're done.
See Implementation
Keep going deeper until we find a successful reduction. When found, finish tests at current depth and restart from top depth (new iteration). If we reach the bottom (depth with no nodes on it), we're done.