Applies the CERES method to a first order proof with equality.
Applies the CERES method to a first order proof with equality. Internally this is handled by the RobinsoToLK method.
The end-sequent of the original proof
The projections of the original proof
A resolution refutation
an LK Proof in Atomic Cut Normal Form (ACNF) i.e. without quantified cuts
Applies the CERES method to a first order proof with equality.
Applies the CERES method to a first order proof with equality. Internally this is handled by the RobinsoToLK method.
a first-order LKProof without strong quantifiers in the end-sequent (i.e. structural rules, cut, logical rules, equational rules but no definitions, schema,higher order)
a predicate to specify which cut formulas to eliminate (e.g. x => containsQuantifiers(x) to keep propositional cuts intact)
an LK Proof in Atomic Cut Normal Form (ACNF) i.e. without quantified cuts
Applies the CERES method to a first order proof with equality.
Applies the CERES method to a first order proof with equality. Internally this is handled by the RobinsoToLK method.
a first-order LKProof (structural rules, cut, logical rules, equational rules but no definitions, schema,higher order) also each formula must be a FOLFormula, since the prover9 interface returns proofs from the FOL layer
an LK Proof in Atomic Cut Normal Form (ACNF) i.e. without quantified cuts
True if the formula is not an equation.
True if the formula is not an equation. Intended use: predicate argument of CERES. In case the only cuts on equations come from a translation of binary equation rules to unary ones, this should provide the same clause sets and projections as the binary rules.
True if the formula is propositional and does not contain free variables other than type i.
True if the formula is propositional and does not contain free variables other than type i. Intended use: predicate argument of CERES. In case the only cuts on equations come from a translation of binary equation rules to unary ones, this should provide the same clause sets and projections as the binary rules.
This implementation of the CERES method does the proof reconstruction via Robinson2LK.