Assertions of the proof.
Assertions of the proof.
Attention: this is interpreted as assertions.toNegConjunction --> conclusion.toDisjunction
These assertions indicate the splitting assumptions this proof depends on.
A list of lists containing the auxiliary formulas of the rule.
A list of lists containing the auxiliary formulas of the rule. The first list constains the auxiliary formulas in the first premise and so on.
A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule.
A list of lists of SequentIndices denoting the auxiliary formula(s) of the rule. The first list contains the auxiliary formulas in the first premise and so on.
The conclusion of the rule.
The conclusion of the rule.
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
Operations that view the sub-proofs as a DAG, which ignore duplicate sub-proofs, see DagProof.DagLikeOps for a list.
All definitions introduced by any subproof.
All definitions introduced by any subproof.
Exception
if inconsistent definitions are used
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
Depth of the proof, which is the maximum length of a path you can take via immediateSubProofs.
The immediate subproofs of this rule.
Definitions introduced by the bottom-most inference rule.
Definitions introduced by the bottom-most inference rule.
Is this a proof of the empty clause with empty assertions, and consistent definitions?
Is this a proof of the empty clause with empty assertions, and consistent definitions?
The name of this rule (in words).
The name of this rule (in words).
The list of main formulas of the rule.
The list of main formulas of the rule.
A list of SequentIndices denoting the main formula(s) of the rule.
A list of SequentIndices denoting the main formula(s) of the rule.
The name of this rule (in symbols).
The name of this rule (in symbols).
A list of occurrence connectors, one for each immediate subproof.
A list of occurrence connectors, one for each immediate subproof.
The upper sequents of the rule.
The upper sequents of the rule.
Set of all (transitive) sub-proofs including this.
Set of all (transitive) sub-proofs including this.
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
Operations that view the sub-proofs as a tree, see DagProof.TreeLikeOps for a list.
Paramodulation.