mirror of
https://github.com/Z3Prover/z3
synced 2025-05-06 15:25:46 +00:00
add bounded-int and pb2bv solvers to fd_solver, use sorting networks for pb2bv rewriter when applicable, hoist to pb2bv_rewriter module and remove it from the pb2bv_tactic
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
6d3430c689
commit
3778048eb4
26 changed files with 1424 additions and 700 deletions
|
@ -182,8 +182,8 @@ struct check_logic::imp {
|
|||
m_quantifiers = false;
|
||||
}
|
||||
else if (logic == "QF_FD") {
|
||||
m_bvs = true;
|
||||
m_uf = true;
|
||||
m_bvs = true;
|
||||
m_uf = true;
|
||||
m_ints = true;
|
||||
}
|
||||
else {
|
||||
|
|
|
@ -547,6 +547,7 @@ bool cmd_context::logic_has_arith_core(symbol const & s) const {
|
|||
s == "QF_BVFP" ||
|
||||
s == "QF_S" ||
|
||||
s == "ALL" ||
|
||||
s == "QF_FD" ||
|
||||
s == "HORN";
|
||||
}
|
||||
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue