mirror of
https://github.com/Z3Prover/z3
synced 2025-04-10 03:07:07 +00:00
101 lines
2.7 KiB
C++
101 lines
2.7 KiB
C++
/*++
|
|
Copyright (c) 2006 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
smt_literal.cpp
|
|
|
|
Abstract:
|
|
|
|
<abstract>
|
|
|
|
Author:
|
|
|
|
Leonardo de Moura (leonardo) 2008-02-18.
|
|
|
|
Revision History:
|
|
|
|
--*/
|
|
#include"smt_literal.h"
|
|
#include"ast_pp.h"
|
|
#include"ast_ll_pp.h"
|
|
|
|
namespace smt {
|
|
|
|
void literal::display(std::ostream & out, ast_manager & m, expr * const * bool_var2expr_map) const {
|
|
if (*this == true_literal)
|
|
out << "true";
|
|
else if (*this == false_literal)
|
|
out << "false";
|
|
else if (sign())
|
|
out << "(not " << mk_pp(bool_var2expr_map[var()], m) << ")";
|
|
else
|
|
out << mk_pp(bool_var2expr_map[var()], m);
|
|
}
|
|
|
|
void literal::display_compact(std::ostream & out, expr * const * bool_var2expr_map) const {
|
|
if (*this == true_literal)
|
|
out << "true";
|
|
else if (*this == false_literal)
|
|
out << "false";
|
|
else if (sign())
|
|
out << "(not #" << bool_var2expr_map[var()]->get_id() << ")";
|
|
else
|
|
out << "#" << bool_var2expr_map[var()]->get_id();
|
|
}
|
|
|
|
std::ostream & operator<<(std::ostream & out, literal l) {
|
|
if (l == true_literal)
|
|
out << "true";
|
|
else if (l == false_literal)
|
|
out << "false";
|
|
else if (l.sign())
|
|
out << "(not p" << l.var() << ")";
|
|
else
|
|
out << "p" << l.var();
|
|
return out;
|
|
}
|
|
|
|
std::ostream & operator<<(std::ostream & out, const literal_vector & v) {
|
|
display(out, v.begin(), v.end());
|
|
return out;
|
|
}
|
|
|
|
void display_compact(std::ostream & out, unsigned num_lits, literal const * lits, expr * const * bool_var2expr_map) {
|
|
for (unsigned i = 0; i < num_lits; i++) {
|
|
if (i > 0)
|
|
out << " ";
|
|
lits[i].display_compact(out, bool_var2expr_map);
|
|
}
|
|
}
|
|
|
|
void display_verbose(std::ostream & out, ast_manager& m, unsigned num_lits, literal const * lits, expr * const * bool_var2expr_map) {
|
|
for (unsigned i = 0; i < num_lits; i++) {
|
|
if (i > 0)
|
|
out << " ";
|
|
lits[i].display(out, m, bool_var2expr_map);
|
|
}
|
|
}
|
|
|
|
/**
|
|
\brief Return true if lits1 subsumes lits2.
|
|
That is every literal in lits1 is in lits2
|
|
*/
|
|
bool backward_subsumption(unsigned num_lits1, literal const * lits1, unsigned num_lits2, literal const * lits2) {
|
|
unsigned i = 0;
|
|
for (; i < num_lits1; i++) {
|
|
literal l1 = lits1[i];
|
|
unsigned j = 0;
|
|
for (; j < num_lits2; j++)
|
|
if (l1 == lits2[j])
|
|
break;
|
|
if (j == num_lits2)
|
|
break;
|
|
}
|
|
return i == num_lits1;
|
|
}
|
|
|
|
|
|
};
|
|
|