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
53
54
55
56
57
58
59
60
/*++
Copyright (c) 2017 Microsoft Corporation
Module Name:
dom_simplify_tactic.cpp
Abstract:
Dominator-based context simplifer.
Author:
Nikolaj and Nuno
Tactic Documentation:
## Tactic dom-simplify
### Short Description
Apply dominator simplification rules
### Long Description
Dominator-based simplification is a context dependent simplification function that uses a dominator tree to control the number of paths it
visits during simplification. The expression DAG may have an exponential number of paths, but only paths corresponding to a dominator
tree are visited. Since the paths selected by the dominator trees are limited, the simplifier may easily fail to simplify within a context.
### Example
```z3
(declare-const a Bool)
(declare-const b Bool)
(assert (and a (or a b)))
(apply dom-simplify)
```
--*/
#pragma once
#include "ast/ast.h"
#include "ast/expr_substitution.h"
#include "ast/rewriter/dom_simplifier.h"
#include "tactic/tactic.h"
#include "tactic/dependent_expr_state_tactic.h"
#include "ast/simplifiers/dominator_simplifier.h"
#include "ast/simplifiers/dependent_expr_state.h"
inline tactic* mk_dom_simplify_tactic(ast_manager& m, params_ref const& p) {
return alloc(dependent_expr_state_tactic, m, p,
[](auto& m, auto& p, auto& s) -> dependent_expr_simplifier* { return alloc(dominator_simplifier, m, s, mk_expr_substitution_simplifier(m), p); });
}
Z3_ADD_TACTIC(dom_simplify, "dom-simplify", "apply dominator simplification rules.", mk_dom_simplify_tactic(m, p));
Z3_ADD_SIMPLIFIER(dom_simplify, "dom-simplify", "apply dominator simplification rules.", alloc(dominator_simplifier, m, s, mk_expr_substitution_simplifier(m), p));