The 008 branch introduces a specialized database pruning and literal block distance (LBD) heuristic. When a solver runs continuously, it learns millions of new clauses. If left unchecked, the database grows exponentially, dragging down the speed of the Boolean Constraint Propagation engine.
: Ensuring only the highest quality version of the set exists. cdcl 008 laurab fixed
Specifically, when a conflict was found at a deep decision level (e.g., Level 45) and the logical root cause dated back to a much earlier stage (e.g., Level 3), the solver attempted to backjump non-chronologically while simultaneously garbage-collecting stale learnt clauses. This caused two fatal failures: The 008 branch introduces a specialized database pruning