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
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
|
import sys
import copy
import random
from os.path import basename
import unittest
import pycosat
from pycosat import solve, itersolve
# -------------------------- utility functions ---------------------------
def read_cnf(path):
"""
read a DIMACS cnf formatted file from `path`, and return the clauses
and number of variables
"""
clauses = []
for line in open(path):
parts = line.split()
if not parts or parts[0] == 'c':
continue
if parts[0] == 'p':
assert len(parts) == 4
assert parts[1] == 'cnf'
n_vars, n_clauses = [int(n) for n in parts[2:4]]
continue
if parts[0] == '%':
break
assert parts[-1] == '0'
clauses.append([int(lit) for lit in parts[:-1]])
assert len(clauses) == n_clauses
return clauses, n_vars
def evaluate(clauses, sol):
"""
evaluate the clauses with the solution
"""
sol_vars = {} # variable number -> bool
for i in sol:
sol_vars[abs(i)] = bool(i > 0)
return all(any(sol_vars[abs(i)] ^ bool(i < 0) for i in clause)
for clause in clauses)
def py_itersolve(clauses):
while True:
sol = pycosat.solve(clauses)
if isinstance(sol, list):
yield sol
clauses.append([-x for x in sol])
else: # no more solutions -- stop iteration
return
def process_cnf_file(path):
sys.stdout.write('%30s: ' % basename(path))
sys.stdout.flush()
clauses, n_vars = read_cnf(path)
sys.stdout.write('vars: %6d cls: %6d ' % (n_vars, len(clauses)))
sys.stdout.flush()
n_sol = 0
for sol in itersolve(clauses, n_vars):
sys.stdout.write('.')
sys.stdout.flush()
assert evaluate(clauses, sol)
n_sol += 1
sys.stdout.write("%d\n" % n_sol)
sys.stdout.flush()
return n_sol
# -------------------------- test clauses --------------------------------
# p cnf 5 3
# 1 -5 4 0
# -1 5 3 4 0
# -3 -4 0
nvars1, clauses1 = 5, [[1, -5, 4], [-1, 5, 3, 4], [-3, -4]]
# p cnf 2 2
# -1 0
# 1 0
nvars2, clauses2 = 2, [[-1], [1]]
# p cnf 2 3
# -1 2 0
# -1 -2 0
# 1 -2 0
nvars3, clauses3 = 2, [[-1, 2], [-1, -2], [1, -2]]
# -------------------------- actual unit tests ---------------------------
tests = []
class TestSolve(unittest.TestCase):
def test_wrong_args(self):
self.assertRaises(TypeError, solve, [[1, 2], [-3]], 'A')
self.assertRaises(TypeError, solve, 1)
self.assertRaises(TypeError, solve, 1.0)
self.assertRaises(TypeError, solve, object())
self.assertRaises(TypeError, solve, ['a'])
self.assertRaises(TypeError, solve, [[1, 2], [3, None]], 5)
self.assertRaises(ValueError, solve, [[1, 2], [3, 0]])
def test_no_clauses(self):
for n in range(7):
self.assertEqual(solve([], n), [-i for i in range(1, n + 1)])
def test_cnf1(self):
self.assertEqual(solve(clauses1), [1, -2, -3, -4, 5])
if sys.version_info[0] == 2:
cls = [[long(lit) for lit in clause] for clause in clauses1]
self.assertEqual(solve(cls), [1, -2, -3, -4, 5])
def test_iter_clauses(self):
self.assertEqual(solve(iter(clauses1)), [1, -2, -3, -4, 5])
def test_each_clause_iter(self):
self.assertEqual(solve([iter(clause) for clause in clauses1]),
[1, -2, -3, -4, 5])
def test_tuple_caluses(self):
self.assertEqual(solve(tuple(clauses1)), [1, -2, -3, -4, 5])
def test_each_clause_tuples(self):
self.assertEqual(solve([tuple(clause) for clause in clauses1]),
[1, -2, -3, -4, 5])
def test_gen_clauses(self):
def gen_clauses():
for clause in clauses1:
yield clause
self.assertEqual(solve(gen_clauses()), [1, -2, -3, -4, 5])
def test_each_clause_gen(self):
self.assertEqual(solve([(x for x in clause) for clause in clauses1]),
[1, -2, -3, -4, 5])
def test_bad_iter(self):
class Liar:
def __iter__(self): return None
self.assertRaises(TypeError, solve, Liar())
def test_cnf2(self):
self.assertEqual(solve(clauses2), "UNSAT")
def test_cnf3(self):
self.assertEqual(solve(clauses3), [-1, -2])
def test_cnf3_3vars(self):
self.assertEqual(solve(clauses3, vars=3), [-1, -2, -3])
def test_cnf1_prop_limit(self):
for lim in range(1, 20):
self.assertEqual(solve(clauses1, prop_limit=lim),
"UNKNOWN" if lim < 8 else [1, -2, -3, -4, 5])
def test_cnf1_vars(self):
self.assertEqual(solve(clauses1, vars=7),
[1, -2, -3, -4, 5, -6, -7])
tests.append(TestSolve)
# -----
class TestIterSolve(unittest.TestCase):
def test_wrong_args(self):
self.assertRaises(TypeError, itersolve, [[1, 2], [-3]], 'A')
self.assertRaises(TypeError, itersolve, 1)
self.assertRaises(TypeError, itersolve, 1.0)
self.assertRaises(TypeError, itersolve, object())
self.assertRaises(TypeError, itersolve, ['a'])
self.assertRaises(TypeError, itersolve, [[1, 2], [3, None]], 5)
self.assertRaises(ValueError, itersolve, [[1, 2], [3, 0]])
def test_no_clauses(self):
for n in range(7):
self.assertEqual(len(list(itersolve([], vars=n))), 2 ** n)
def test_iter_clauses(self):
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve(iter(clauses1))))
def test_each_clause_iter(self):
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve([iter(clause) for clause in clauses1])))
def test_tuple_caluses(self):
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve(tuple(clauses1))))
def test_each_clause_tuples(self):
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve([tuple(clause) for clause in clauses1])))
def test_gen_clauses(self):
def gen_clauses():
for clause in clauses1:
yield clause
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve(gen_clauses())))
def test_each_clause_gen(self):
self.assertTrue(all(evaluate(clauses1, sol) for sol in
itersolve([(x for x in clause) for clause in
clauses1])))
def test_bad_iter(self):
class Liar:
def __iter__(self): return None
self.assertRaises(TypeError, itersolve, Liar())
def test_cnf1(self):
for sol in itersolve(clauses1, nvars1):
#sys.stderr.write('%r\n' % repr(sol))
self.assertTrue(evaluate(clauses1, sol))
sols = list(itersolve(clauses1, vars=nvars1))
self.assertEqual(len(sols), 18)
# ensure solutions are unique
self.assertEqual(len(set(tuple(sol) for sol in sols)), 18)
def test_shuffle_clauses(self):
ref_sols = set(tuple(sol) for sol in itersolve(clauses1))
for _ in range(10):
cnf = copy.deepcopy(clauses1)
# shuffling the clauses does not change the solutions
random.shuffle(cnf)
self.assertEqual(set(tuple(sol) for sol in itersolve(cnf)),
ref_sols)
def test_many_clauses(self):
ref_sols = set(tuple(sol) for sol in itersolve(clauses1))
# repeating the clauses many times does not change the solutions
cnf = 100 * copy.deepcopy(clauses1)
self.assertEqual(set(tuple(sol) for sol in itersolve(cnf)),
ref_sols)
def test_cnf2(self):
self.assertEqual(list(itersolve(clauses2, nvars2)), [])
def test_cnf3_3vars(self):
self.assertEqual(list(itersolve(clauses3, 3)),
[[-1, -2, -3], [-1, -2, 3]])
def test_cnf1_prop_limit(self):
self.assertEqual(list(itersolve(clauses1, prop_limit=2)), [])
tests.append(TestIterSolve)
# ------------------------------------------------------------------------
def run(verbosity=1, repeat=1):
print("sys.prefix: %s" % sys.prefix)
print("sys.version: %s" % sys.version)
print("pycosat version: %r" % pycosat.__version__)
suite = unittest.TestSuite()
for cls in tests:
for _ in range(repeat):
suite.addTest(unittest.makeSuite(cls))
runner = unittest.TextTestRunner(verbosity=verbosity)
return runner.run(suite)
if __name__ == '__main__':
if len(sys.argv) == 1:
run()
else:
for path in sys.argv[1:]:
process_cnf_file(path)
|
