def test_minimal_unsatisfiable_subset():
def sat(val):
return Clauses(max(abs(v) for v in chain(*val))).sat(val)
assert raises(ValueError, lambda: minimal_unsatisfiable_subset([[1]], sat))
clauses = [[-10], [1], [5], [2, 3], [3, 4], [5, 2], [-7], [2], [3],
[-2, -3, 5], [7, 8, 9, 10], [-8], [-9]]
res = minimal_unsatisfiable_subset(clauses, sat)
assert sorted(res) == [[-10], [-9], [-8], [-7], [7, 8, 9, 10]]
assert not sat(res)
clauses = [[1, 3], [2, 3], [-1], [4], [3], [-3]]
for perm in permutations(clauses):
res = minimal_unsatisfiable_subset(clauses, sat)
assert sorted(res) == [[-3], [3]]
assert not sat(res)
clauses = [[1], [-1], [2], [-2], [3, 4], [4]]
for perm in permutations(clauses):
res = minimal_unsatisfiable_subset(perm, sat)
assert sorted(res) in [[[-1], [1]], [[-2], [2]]]
assert not sat(res)
def test_minimal_unsatisfiable_subset():
def sat(val):
return Clauses(max(abs(v) for v in chain(*val))).sat(val)
assert raises(ValueError, lambda: minimal_unsatisfiable_subset([[1]], sat))
clauses = [[-10], [1], [5], [2, 3], [3, 4], [5, 2], [-7], [2], [3],
[-2, -3, 5], [7, 8, 9, 10], [-8], [-9]]
res = minimal_unsatisfiable_subset(clauses, sat)
assert sorted(res) == [[-10], [-9], [-8], [-7], [7, 8, 9, 10]]
assert not sat(res)
clauses = [[1, 3], [2, 3], [-1], [4], [3], [-3]]
for perm in permutations(clauses):
res = minimal_unsatisfiable_subset(clauses, sat)
assert sorted(res) == [[-3], [3]]
assert not sat(res)
clauses = [[1], [-1], [2], [-2], [3, 4], [4]]
for perm in permutations(clauses):
res = minimal_unsatisfiable_subset(perm, sat)
assert sorted(res) in [[[-1], [1]], [[-2], [2]]]
assert not sat(res)