mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-06-06 22:23:22 +00:00
Code Activity

change lemma display utility to use updated pretty printer

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2018-03-14 12:15:13 -07:00
parent 776a7d4e6c
commit 46048d5150
1 changed files with 30 additions and 22 deletions
Download patch file Download diff file Expand all files Collapse all files

52
src/smt/smt_context_pp.cpp
View file

@ -19,7 +19,7 @@ Revision History:
#include "smt/smt_context.h" #include "smt/smt_context.h"
#include "ast/ast_ll_pp.h" #include "ast/ast_ll_pp.h"
#include "ast/ast_pp.h" #include "ast/ast_pp.h"
#include "ast/ast_smt_pp.h" #include "ast/ast_pp_util.h"
#include "util/stats.h" #include "util/stats.h"
namespace smt { namespace smt {
@ -413,19 +413,23 @@ namespace smt {
} }
void context::display_lemma_as_smt_problem(std::ostream & out, unsigned num_antecedents, literal const * antecedents, literal consequent, symbol const& logic) const { void context::display_lemma_as_smt_problem(std::ostream & out, unsigned num_antecedents, literal const * antecedents, literal consequent, symbol const& logic) const {
ast_smt_pp pp(m_manager); ast_pp_util visitor(m_manager);
pp.set_benchmark_name("lemma"); expr_ref_vector fmls(m_manager);
pp.set_status("unsat"); visitor.collect(fmls);
pp.set_logic(logic); expr_ref n(m_manager);
for (unsigned i = 0; i < num_antecedents; i++) { for (unsigned i = 0; i < num_antecedents; i++) {
literal l = antecedents[i]; literal l = antecedents[i];
expr_ref n(m_manager);
literal2expr(l, n); literal2expr(l, n);
pp.add_assumption(n); fmls.push_back(n);
} }
expr_ref n(m_manager); if (consequent != false_literal) {
literal2expr(~consequent, n); literal2expr(~consequent, n);
pp.display_smt2(out, n); fmls.push_back(n);
}
if (logic != symbol::null) out << "(set-logic " << logic << ")\n";
visitor.collect(fmls);
visitor.display_decls(out);
visitor.display_asserts(out, fmls, true);
} }
static unsigned g_lemma_id = 0; static unsigned g_lemma_id = 0;
@ -448,25 +452,29 @@ namespace smt {
void context::display_lemma_as_smt_problem(std::ostream & out, unsigned num_antecedents, literal const * antecedents, void context::display_lemma_as_smt_problem(std::ostream & out, unsigned num_antecedents, literal const * antecedents,
unsigned num_eq_antecedents, enode_pair const * eq_antecedents, unsigned num_eq_antecedents, enode_pair const * eq_antecedents,
literal consequent, symbol const& logic) const { literal consequent, symbol const& logic) const {
ast_smt_pp pp(m_manager); ast_pp_util visitor(m_manager);
pp.set_benchmark_name("lemma"); expr_ref_vector fmls(m_manager);
pp.set_status("unsat"); visitor.collect(fmls);
pp.set_logic(logic); expr_ref n(m_manager);
for (unsigned i = 0; i < num_antecedents; i++) { for (unsigned i = 0; i < num_antecedents; i++) {
literal l = antecedents[i]; literal l = antecedents[i];
expr_ref n(m_manager);
literal2expr(l, n); literal2expr(l, n);
pp.add_assumption(n); fmls.push_back(n);
} }
for (unsigned i = 0; i < num_eq_antecedents; i++) { for (unsigned i = 0; i < num_eq_antecedents; i++) {
enode_pair const & p = eq_antecedents[i]; enode_pair const & p = eq_antecedents[i];
expr_ref eq(m_manager); n = m_manager.mk_eq(p.first->get_owner(), p.second->get_owner());
eq = m_manager.mk_eq(p.first->get_owner(), p.second->get_owner()); fmls.push_back(n);
pp.add_assumption(eq);
} }
expr_ref n(m_manager); if (consequent != false_literal) {
literal2expr(~consequent, n); literal2expr(~consequent, n);
pp.display_smt2(out, n); fmls.push_back(n);
}
if (logic != symbol::null) out << "(set-logic " << logic << ")\n";
visitor.collect(fmls);
visitor.display_decls(out);
visitor.display_asserts(out, fmls, true);
} }
void context::display_lemma_as_smt_problem(unsigned num_antecedents, literal const * antecedents, void context::display_lemma_as_smt_problem(unsigned num_antecedents, literal const * antecedents,