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
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
/*++
Copyright (c) 2013 Microsoft Corporation
Module Name:
pb_preprocess_tactic.h
Abstract:
Pre-process pseudo-Boolean inequalities using
generalized Davis Putnam (resolution) to eliminate variables.
Author:
Nikolaj Bjorner (nbjorner) 2013-12-23
Documentation:
## Tactic pb-preprocess
### Short Description:
The tactic eliminates variables from pseudo-Boolean inequalities and performs algebraic simplifcations on formulas
### Long Description
Resolution for PB constraints require the implicit
inequalities that each variable ranges over [0,1]
so not all resolvents produce smaller sets of clauses.
We here implement subsumption resolution.
```
x + y >= 1
A~x + B~y + Cz >= k
---------------------
Cz >= k - B
```
where `A <= B` and `x, y` do not occur elsewhere.
### Example
```z3
(declare-const x Bool)
(declare-const y Bool)
(declare-const z Bool)
(declare-const u Bool)
(declare-const v Bool)
(assert ((_ pbge 1 1 1 2) (not x) (not y) (not z)))
(assert ((_ pbge 1 1 1 2) x u v))
(assert (not (and y v)))
(assert (not (and z u)))
(apply pb-preprocess)
```
### Notes
* supports unsat cores
* does not support proof terms
--*/
class ast_manager;
class tactic;
tactic * ;
/*
ADD_TACTIC("pb-preprocess", "pre-process pseudo-Boolean constraints a la Davis Putnam.", "mk_pb_preprocess_tactic(m, p)")
*/