and are input nodes.

conclusion is the clause

premises are the conclusion of nodes and (its parents)

The DAG would be

Compression algorithms[edit]

Algorithms for compression of sequent calculus proofs include cut introduction and cut elimination.


Algorithms for compression of propositional resolution proofs include RecycleUnits,[2] RecyclePivots,[2] RecyclePivotsWithIntersection,[1] LowerUnits,[1] LowerUnivalents,[3] Split,[4] Reduce&Reconstruct,[5] and Subsumption.