Proof compression
In proof theory, an area of mathematical logic, proof compression is the problem of algorithmically compressing formal proofs. The developed algorithms can be used to improve the proofs generated by automated theorem proving tools such as SAT solvers, SMT-solvers, first-order theorem provers and proof assistants.
Wikipedia contributors, "Proof compression", Wikipedia, revision 1206721463, retrieved 20 November 2026, source, CC BY-SA 4.0.