Intermediate data structure intendend for the proof replay in the TPTP proof import.
Intermediate data structure intendend for the proof replay in the TPTP proof import.
A refutation sketch is a list of clauses, where each clause is either an axiom (that occurs in the CNF of the original end-sequent) or is a first-order consequence of previous ones.
These two cases are modelled as SketchAxiom and SketchInference.
Axiom in a refutation sketch.
Axiom in a refutation sketch.
The clause axiom occurs as a clause in the CNF of the end-sequent we're proving.
Clause of the CNF.
Inference in a refutation sketch.
Inference in a refutation sketch.
The clause from should be a first-order consequence of the conclusions of from.
This rule corresponds to a line in a TPTP proof which just indicates the previous lines from which it follows, but does not specify the precise inference rule employed.
Conclusion of the inference.
Premises of the inference.