Builds the final proof out of an extended Herbrand sequent.
Builds the final proof out of an extended Herbrand sequent.
For details, see p.5 of "Algorithmic Introduction of Quantified Cuts (Hetzl et al 2013)".
Computes the canonical solution with multiple quantifiers from a MultiGrammar, i.e.
Computes the canonical solution with multiple quantifiers from a MultiGrammar, i.e. the list \forall x_1...x_n C_1, ...., \forall x_1 C_n.
(Since version 2015-09-03) Use compressToLK instead
(Since version 2015-09-03) Use compressLKProof instead
(Since version 2015-09-03) Use compressToLK instead
(Since version 2015-09-03) Use compressLKProof instead
Tries to introduce many cuts with one quantifier each to the proof represented by the ExpansionSequent.
Tries to introduce many cuts with one quantifier each to the proof represented by the ExpansionSequent.
The expansion sequent representing a proof for introducing a cut.
The (maximum) number of cuts to be introduced
True if the proof represented by es is in a theory modulo equality, false otherwise.
Whether information about the cut-introduction process should be printed on screen.
A list of cut-formulas.
(Since version 2015-09-03) Use compressToLK instead
Tries to introduce many cuts with one quantifier each to the LKProof.
Tries to introduce many cuts with one quantifier each to the LKProof.
The proof for introducing a cut.
The (maximum) number of cuts to be introduced
Whether information about the cut-introduction process should be printed on screen.
A list of cut-formulas.
(Since version 2015-09-03) Use compressLKProof instead
Tries to introduce one cut with as many quantifiers as possible to the proof represented by the ExpansionSequent.
Tries to introduce one cut with as many quantifiers as possible to the proof represented by the ExpansionSequent.
The expansion sequent representing a proof for introducing a cut.
True if the proof represented by es is in a theory modulo equality, false otherwise.
Whether information about the cut-introduction process should be printed on screen.
A proof with one quantified cut.
(Since version 2015-09-03) Use compressToLK instead
Tries to introduce one cut with as many quantifiers as possible to the LKProof.
Tries to introduce one cut with as many quantifiers as possible to the LKProof.
The proof for introducing a cut.
Whether information about the cut-introduction process should be printed on screen.
A proof with one quantified cut.
(Since version 2015-09-03) Use compressLKProof instead
Tries to introduce one cut with one quantifier to the proof represented by the ExpansionSequent.
Tries to introduce one cut with one quantifier to the proof represented by the ExpansionSequent.
The expansion sequent representing a proof for introducing a cut.
True if the proof represented by es is in a theory modulo equality, false otherwise.
Whether information about the cut-introduction process should be printed on screen.
A proof with one quantified cut.
(Since version 2015-09-03) Use compressToLK instead
Tries to introduce one cut with one quantifier to the LKProof.
Tries to introduce one cut with one quantifier to the LKProof.
The proof for introducing a cut.
Whether information about the cut-introduction process should be printed on screen.
A proof with one quantified cut.
(Since version 2015-09-03) Use compressLKProof instead