The first order export of the preprocessed characteristic sequent set (preprocessed_css), together with the map of replacing constants.
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 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.
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 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 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 input LK proof, extracted by the name root_proof from the proof database (proofdb)
The processed input proof converted to LKsk.
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 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 (TAPEPROOF) after preprocessing step 1: definition elimination
The input proof after preprocessing step 2: expansion of logical axioms to atomic axioms
The input proof after preprocessing step 2: expansion of logical axioms to atomic axioms
The input proof preprocessing step 3: regularization
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 set of projections of the preprocessed_input_proof.
The proof database to start from.
The ral version of the first-order refutation (fol_refutation), with all necessary simplifications undone
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.
The proof of the deep formula of the expansion_proof.
The name of the root proof to start with
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
Version 5 of the higher-order n-Tape proof, where if-then-else is directly axiomatized i.e. it has 2 additional axioms P -> if code(P) then t else f = t and -P -> if code(P) then t else f = f which were theorems before. In contrast to nTape4 it cuts on instances of the theorem C for specific upper bounds n. Since the instantiated proofs were generated manually, only nTape5(2) to nTape5(4) work.