mirror of
https://github.com/Z3Prover/z3
synced 2025-08-29 22:40:08 +00:00
48 lines
1.3 KiB
C++
48 lines
1.3 KiB
C++
/*++
|
|
Copyright (c) 2012 Microsoft Corporation
|
|
|
|
Module Name:
|
|
|
|
qfauflia_tactic.cpp
|
|
|
|
Abstract:
|
|
|
|
Tactic for QF_AUFLIA
|
|
|
|
Author:
|
|
|
|
Leonardo (leonardo) 2012-02-21
|
|
|
|
Notes:
|
|
|
|
--*/
|
|
#include "tactic/tactical.h"
|
|
#include "tactic/core/simplify_tactic.h"
|
|
#include "tactic/core/propagate_values_tactic.h"
|
|
#include "tactic/arith/propagate_ineqs_tactic.h"
|
|
#include "tactic/core/solve_eqs_tactic.h"
|
|
#include "tactic/core/elim_uncnstr_tactic.h"
|
|
#include "smt/tactic/smt_tactic.h"
|
|
|
|
tactic * mk_qfauflia_tactic(ast_manager & m, params_ref const & p) {
|
|
params_ref main_p;
|
|
main_p.set_bool("elim_and", true);
|
|
main_p.set_bool("som", true);
|
|
main_p.set_bool("sort_store", true);
|
|
|
|
params_ref solver_p;
|
|
solver_p.set_bool("array.simplify", false); // disable array simplifications at old_simplify module
|
|
|
|
tactic * preamble_st = and_then(mk_simplify_tactic(m),
|
|
mk_propagate_values_tactic(m),
|
|
mk_solve_eqs_tactic(m),
|
|
mk_elim_uncnstr_tactic(m),
|
|
mk_simplify_tactic(m)
|
|
);
|
|
|
|
tactic * st = and_then(using_params(preamble_st, main_p),
|
|
using_params(mk_smt_tactic(m), solver_p));
|
|
|
|
st->updt_params(p);
|
|
return st;
|
|
}
|