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. Please note that the formulas in the different input proofs need to come from the same layer (i.e. both FOL or both HOL)
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 (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
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