SAT, SMT and constraint solvers that verify chips and software and settle combinatorial questions by search.
Conflict-driven clause-learning solvers decide Boolean satisfiability on formulas with millions of variables, powering hardware and software verification, planning and computer-assisted mathematics.
The annual SAT Competition ranks solvers on hundreds of instances with certified answers, and the Global Benchmark Database records instance families and which are still unsolved.