The proof database to start from.
The name of the root proof to start with
The first order export of the preprocessed characteristic sequent set (preprocessed_css), together with the map of replacing constants.
The simulation of the ral_refutation on the projections i.e.
The simulation of the ral_refutation on the projections i.e. an LKsk proof where cuts only work on atom formulas
The characteristic sequent set of the preprocessed_input_proof.
The expansion proof of the cut-free proof acnf.
A first-order conversion of the deep formula of the expansion_proof.
Exports the preprocessed characteristic sequent (preprocessed_css) set to the TPTP THF format
Exports the preprocessed characteristic sequent (preprocessed_css) set to the TPTP THF format
The name of the file to export to
The first order export of the preprocessed characteristic sequent set (preprocessed_css), together with the map of replacing constants.
The first order refutation of the first order characteristic sequent set (fol_css)
The expansion proof of the first-order refutation (fol_refutation).
The input LK proof, extracted by the name root_proof from the proof database (proofdb)
The processed input proof converted to LKsk.
The characteristic sequent set (css) after removal of labels and subsumption
The input proof (TAPEPROOF) after definition elimination(preprocessed_input_proof1, expansion of logical axioms to atomic axioms (preprocessed_input_proof2) and regularization (preprocessed_input_proof3)
The input proof (TAPEPROOF) after preprocessing step 1: definition elimination
The input proof after preprocessing step 2: expansion of logical axioms to atomic axioms
The input proof preprocessing step 3: regularization
Prints the preprocessed characteristic sequent set in TPTP THF format.
Prints the preprocessed characteristic sequent set in TPTP THF format. Use export_thf to write it to a file.
The set of projections of the preprocessed_input_proof.
The ral version of the first-order refutation (fol_refutation), with all necessary simplifications undone
The proof of the deep formula of the expansion_proof.
Determines if and which cuts should be taken into accoutn for cut-elimination.
Determines if and which cuts should be taken into accoutn for cut-elimination. Default: propositional cuts are skipped.
The struct of the proof.
The struct of the proof. It is an intermediate representation of the characteristic sequent set.
Timeout for call to theorem provers.
Timeout for call to theorem provers.
the timeout as duration. default: 60 seconds
The generic template for using ceres_omega to analyze a proof. It performs the following steps:
1) eliminate definitions (AnalysisWithCeresOmega.input_proof
2) eliminate definitions (AnalysisWithCeresOmega.preprocessed_input_proof1
3) expand non-atomic axioms (AnalysisWithCeresOmega.preprocessed_input_proof2)
4) make the proof regular (AnalysisWithCeresOmega.preprocessed_input_proof)
5) convert it to lk_sk (AnalysisWithCeresOmega.lksk_proof)
6) compute the struct, css and projections (AnalysisWithCeresOmega.css,
AnalysisWithCeresOmega.projections, AnalysisWithCeresOmega.struct)
7) map the css to first-order by lambda lifting and erasure of types (AnalysisWithCeresOmega.fol_css)
8) try to find a refutation of the css (AnalysisWithCeresOmega.fol_refutation)
9) reintroduce types (might fail because type erasure is a heuristic which is unsound in general) (no method available, included in step 11)
10) reintroduce terms abstracted away by lambda lifting (no method available, included in step 11)
11) construct an r_al proof from the refutation (AnalysisWithCeresOmega.ral_refutation)
12) construct the acnf (AnalysisWithCeresOmega.acnf)
13) construct the expansion proof (with atomic cuts) (AnalysisWithCeresOmega.expansion_proof)
14) print statistics (AnalysisWithCeresOmega.printStatistics)