1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
/*++
Copyright (c) 2011 Microsoft Corporation
Module Name:
nla2bv_tactic.cpp
Abstract:
Author:
Nikolaj (nbjorner) 2011-05-3
Notes:
Ported to tactic framework on 2012-02-28
Tactic Documentation:
## Tactic nla2bv
### Short Description
Convert quantified NIA problems to bounded bit-vector arithmetic problems.
### Example
```z3
(declare-const x Int)
(declare-const y Int)
(declare-const z Int)
(assert (= (* x x y) (* 2 z y y)))
(apply nla2bv)
```
### Notes
* The tactic creates an under-approximation (a stronger set of formulas)
--*/
#pragma once
#include "util/params.h"
#include "tactic/tactic.h"
class ast_manager;
class tactic;
tactic * mk_nla2bv_tactic(ast_manager & m, params_ref const & p = params_ref());
Z3_ADD_TACTIC(nla2bv, "nla2bv", "convert a nonlinear arithmetic problem into a bit-vector problem, in most cases the resultant goal is an under approximation and is useul for finding models.", mk_nla2bv_tactic(m, p));