3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-20 04:43:39 +00:00

add clause proof module, small improvements to bapa

Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2019-05-30 15:57:19 -07:00
parent 48fc3d752e
commit f128398bf9
7 changed files with 101 additions and 33 deletions

View file

@ -996,6 +996,10 @@ extern "C" {
case PR_IFF_FALSE: return Z3_OP_PR_IFF_FALSE;
case PR_COMMUTATIVITY: return Z3_OP_PR_COMMUTATIVITY;
case PR_DEF_AXIOM: return Z3_OP_PR_DEF_AXIOM;
case PR_ASSUMPTION_ADD: return Z3_OP_PR_ASSUMPTION_ADD;
case PR_LEMMA_ADD: return Z3_OP_PR_LEMMA_ADD;
case PR_REDUNDANT_DEL: return Z3_OP_PR_REDUNDANT_DEL;
case PR_CLAUSE_TRAIL: return Z3_OP_PR_CLAUSE_TRAIL;
case PR_DEF_INTRO: return Z3_OP_PR_DEF_INTRO;
case PR_APPLY_DEF: return Z3_OP_PR_APPLY_DEF;
case PR_IFF_OEQ: return Z3_OP_PR_IFF_OEQ;

View file

@ -644,6 +644,18 @@ typedef enum
unfolding the Boolean connectives in the axioms a small
bounded number of steps (=3).
- Z3_OP_PR_ASSUMPTION_ADD
Clausal proof adding axiom
- Z3_OP_PR_LEMMA_ADD
Clausal proof lemma addition
- Z3_OP_PR_REDUNDANT_DEL
Clausal proof lemma deletion
- Z3_OP_PR_CLAUSE_TRAIL,
Clausal proof trail of additions and deletions
- Z3_OP_PR_DEF_INTRO: Introduces a name for a formula/term.
Suppose e is an expression with free variables x, and def-intro
introduces the name n(x). The possible cases are:
@ -1143,6 +1155,10 @@ typedef enum {
Z3_OP_PR_IFF_FALSE,
Z3_OP_PR_COMMUTATIVITY,
Z3_OP_PR_DEF_AXIOM,
Z3_OP_PR_ASSUMPTION_ADD,
Z3_OP_PR_LEMMA_ADD,
Z3_OP_PR_REDUNDANT_DEL,
Z3_OP_PR_CLAUSE_TRAIL,
Z3_OP_PR_DEF_INTRO,
Z3_OP_PR_APPLY_DEF,
Z3_OP_PR_IFF_OEQ,