What (who) is Proof compression - definition

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.

https://en.wikipedia.org/wiki/Proof_compression

Mathematical proof

RIGOROUS DEMONSTRATION THAT A MATHEMATICAL STATEMENT FOLLOWS FROM ITS PREMISES

TheoremProving; Proof (mathematics); Proof (math); Mathematical Proof; Proving (math); Maths proofs; Mathematical proofs; Proof techniques; Proof Techniques; Demonstration (proof); Derivation (mathematical logic); Methods of proof; Proof method; Skipped step; Essential step; Theorem-proving; Two-column proof; Mathing; Types of proof; Math proof; History of mathematical proof; Mathematical derivation; Geometric proof; Geometrical proof

A mathematical proof is an inferential argument for a mathematical statement, showing that the stated assumptions logically guarantee the conclusion. The argument may use other previously established statements, such as theorems; but every proof can, in principle, be constructed using only certain basic or original assumptions known as axioms, along with the accepted rules of inference.

https://en.wikipedia.org/wiki/Mathematical_proof

Mathing

RIGOROUS DEMONSTRATION THAT A MATHEMATICAL STATEMENT FOLLOWS FROM ITS PREMISES

The act of doing Math...If one who is using paint is painting, then one who is using numbers and equations should be described as mathing.
The calculus students were in the lounge mathing before class.