mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-11-27 15:59:50 +00:00
Code Activity

Move proof dot printing into iuc_proof

Browse source
This commit is contained in:
Arie Gurfinkel 2018-05-16 13:32:28 -07:00
parent 45500ff7d3
commit 07ad67ebad
4 changed files with 545 additions and 633 deletions
Download patch file Download diff file Expand all files Collapse all files

101
src/muz/spacer/spacer_proof_utils.h
View file

@ -22,67 +22,74 @@ Revision History:
namespace spacer {
bool is_arith_lemma(ast_manager& m, proof* pr);
bool is_farkas_lemma(ast_manager& m, proof* pr);
bool is_arith_lemma(ast_manager& m, proof* pr);
bool is_farkas_lemma(ast_manager& m, proof* pr);
/*
* prints the proof pr in dot representation to the file proof.dot
* if iuc_pr is not nullptr, then it is queried for coloring partitions
*/
class iuc_proof;
void pp_proof_dot(ast_manager& m, proof* pr, iuc_proof* iuc_pr = nullptr);
class theory_axiom_reducer {
public:
theory_axiom_reducer(ast_manager& m) : m(m), m_pinned(m) {}
class theory_axiom_reducer
{
public:
theory_axiom_reducer(ast_manager& m) : m(m), m_pinned(m) {}
// reduce theory axioms and return transformed proof
proof_ref reduce(proof* pr);
// reduce theory axioms and return transformed proof
proof_ref reduce(proof* pr);
private:
ast_manager &m;
private:
ast_manager &m;
// tracking all created expressions
expr_ref_vector m_pinned;
// tracking all created expressions
expr_ref_vector m_pinned;
// maps each proof of a clause to the transformed subproof of
// that clause
obj_map<proof, proof*> m_cache;
// maps each proof of a clause to the transformed subproof of that clause
obj_map<proof, proof*> m_cache;
void reset();
};
void reset();
};
class hypothesis_reducer
{
public:
hypothesis_reducer(ast_manager &m) : m(m), m_pinned(m) {}
class hypothesis_reducer
{
public:
hypothesis_reducer(ast_manager &m) : m(m), m_pinned(m) {}
// reduce hypothesis and return transformed proof
proof_ref reduce(proof* pf);
// reduce hypothesis and return transformed proof
proof_ref reduce(proof* pf);
private:
typedef obj_hashtable<expr> expr_set;
typedef obj_hashtable<proof> proof_set;
private:
typedef obj_hashtable<expr> expr_set;
typedef obj_hashtable<proof> proof_set;
ast_manager &m;
ast_manager &m;
// created expressions
expr_ref_vector m_pinned;
expr_ref_vector m_pinned; // tracking all created expressions
ptr_vector<proof_set> m_pinned_active_hyps; // tracking all created sets of active hypothesis
ptr_vector<expr_set> m_pinned_parent_hyps; // tracking all created sets of parent hypothesis
// created sets of active hypothesis
ptr_vector<proof_set> m_pinned_active_hyps;
// created sets of parent hypothesis
ptr_vector<expr_set> m_pinned_parent_hyps;
obj_map<proof, proof*> m_cache; // maps each proof of a clause to the transformed subproof of that clause
obj_map<expr, proof*> m_units; // maps each unit literal to the subproof of that unit
obj_map<proof, proof_set*> m_active_hyps; // maps each proof of a clause to the set of proofs of active hypothesis' of the clause
obj_map<proof, expr_set*> m_parent_hyps; // maps each proof of a clause to the hypothesis-fact, which are transitive parents of that clause, needed to avoid creating cycles in the proof.
// maps a proof to the transformed proof
obj_map<proof, proof*> m_cache;
void reset();
void compute_hypsets(proof* pr); // compute active_hyps and parent_hyps for pr
void collect_units(proof* pr); // compute m_units
proof* compute_transformed_proof(proof* pf);
// maps a unit literal to its derivation
obj_map<expr, proof*> m_units;
proof* mk_lemma_core(proof *pf, expr *fact);
proof* mk_unit_resolution_core(ptr_buffer<proof>& args);
proof* mk_step_core(proof* old_step, ptr_buffer<proof>& args);
};
// maps a proof to the set of proofs of active hypotheses
obj_map<proof, proof_set*> m_active_hyps;
// maps a proof to the hypothesis-fact that are transitive
// parents of that proof. Used for cycle detection and avoidance.
obj_map<proof, expr_set*> m_parent_hyps;
void reset();
// compute active_hyps and parent_hyps for pr
void compute_hypsets(proof* pr);
// compute m_units
void collect_units(proof* pr);
proof* compute_transformed_proof(proof* pf);
proof* mk_lemma_core(proof *pf, expr *fact);
proof* mk_unit_resolution_core(ptr_buffer<proof>& args);
proof* mk_step_core(proof* old_step, ptr_buffer<proof>& args);
};
}
#endif