mirror of
https://github.com/Z3Prover/z3
synced 2025-04-10 19:27:06 +00:00
54 lines
1.4 KiB
C++
54 lines
1.4 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
qfnra_tactic.cpp
|
|
|
|
Abstract:
|
|
|
|
Tactic for QF_NRA
|
|
|
|
Author:
|
|
|
|
Leonardo (leonardo) 2012-02-28
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#include"tactical.h"
|
|
#include"simplify_tactic.h"
|
|
#include"propagate_values_tactic.h"
|
|
#include"nla2bv_tactic.h"
|
|
#include"smt_tactic.h"
|
|
#include"qfnra_nlsat_tactic.h"
|
|
|
|
static tactic * mk_qfnra_sat_solver(ast_manager& m, params_ref const& p, unsigned bv_size) {
|
|
params_ref nra2sat_p = p;
|
|
nra2sat_p.set_uint(":nla2bv-max-bv-size", p.get_uint(":nla2bv-max-bv-size", bv_size));
|
|
|
|
return and_then(mk_nla2bv_tactic(m, nra2sat_p),
|
|
mk_smt_tactic(),
|
|
mk_fail_if_undecided_tactic());
|
|
}
|
|
|
|
tactic * mk_qfnra_tactic(ast_manager & m, params_ref const& p) {
|
|
params_ref p1 = p;
|
|
p1.set_uint(":seed", 11);
|
|
p1.set_bool(":factor", false);
|
|
params_ref p2 = p;
|
|
p2.set_uint(":seed", 13);
|
|
p2.set_bool(":factor", false);
|
|
|
|
return and_then(mk_simplify_tactic(m, p),
|
|
mk_propagate_values_tactic(m, p),
|
|
or_else(try_for(mk_qfnra_nlsat_tactic(m, p), 5000),
|
|
try_for(mk_qfnra_nlsat_tactic(m, p1), 10000),
|
|
mk_qfnra_sat_solver(m, p, 4),
|
|
and_then(try_for(mk_smt_tactic(), 5000), mk_fail_if_undecided_tactic()),
|
|
mk_qfnra_sat_solver(m, p, 6),
|
|
mk_qfnra_nlsat_tactic(m, p2)));
|
|
}
|
|
|
|
|