-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathtests.py
141 lines (120 loc) · 4.06 KB
/
tests.py
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
import unittest
from matlog import parse
from matlog.tokens import Literal, Atom, Operator
class TestParse(unittest.TestCase):
def test_literal(self):
self.assertTrue(
parse("0").matches([Literal(0)]),
)
self.assertTrue(
parse("1").matches([Literal(1)]),
)
def test_atom(self):
self.assertTrue(
parse("A").matches([Atom("A")]),
)
def test_unary(self):
self.assertTrue(
parse("~A").matches([Operator("~"), Atom("A")]),
)
self.assertTrue(
parse("~~~A").matches(
[Operator("~"), [Operator("~"), [Operator("~"), Atom("A")]]]
),
)
def test_binary(self):
self.assertTrue(
parse("A & B").matches([Atom("A"), Operator("&"), Atom("B")]),
)
self.assertTrue(
parse("A -> B").matches([Atom("A"), Operator("->"), Atom("B")]),
)
class TestSolve(unittest.TestCase):
def test_literal(self):
self.assertTrue(
parse("1 | 0").solve().matches(Literal(1)),
)
self.assertTrue(
parse("1 & 0").solve().matches(Literal(0)),
)
self.assertTrue(
parse("1 -> 0").solve().matches(Literal(0)),
)
self.assertTrue(
parse("1 <- 0").solve().matches(Literal(1)),
)
self.assertTrue(
parse("1 ^ 0").solve().matches(Literal(1)),
)
self.assertTrue(
parse("1 == 0").solve().matches(Literal(0)),
)
self.assertTrue(
parse("~1").solve().matches(Literal(0)),
)
def test_atom(self):
self.assertTrue(
parse("A").solve(A=0).matches(Literal(0)),
)
self.assertTrue(
parse("A").solve(A=1).matches(Literal(1)),
)
def test_partial(self):
self.assertTrue(
parse("A | B").solve(B=1).matches(Literal(1)),
)
self.assertTrue(
parse("A & B").solve(B=0).matches(Literal(0)),
)
self.assertTrue(
parse("A ^ B").solve(B=0).matches(Atom("A")),
)
self.assertTrue(
parse("A == B").solve(B=1).matches(Atom("A")),
)
self.assertTrue(
parse("A | ~A").solve().matches(Literal(1)),
)
self.assertTrue(
parse("A & ~A").solve().matches(Literal(0)),
)
def test_complex(self):
expr = parse("A & (B -> C)")
self.assertTrue(
expr.solve(A=0).matches(Literal(0)),
)
self.assertTrue(
expr.solve(A=1, B=0).matches(Literal(1)),
)
self.assertTrue(
expr.solve(A=1, B=1, C=0).matches(Literal(0)),
)
class TestSimplify(unittest.TestCase):
expressions = [
parse("A | (A | B)"), # should be A | B
parse("(~A | ~B) & (A | B)"), # should be A ^ B
parse("(A & ~B) | (A & B)"), # should be A
parse("A & (A | B | C | D | E)"), # should be A
parse("(A & B) & (A & C) & (A & ~C) & (A & ~B)"), # should be 0
parse("~A | ~B"), # should be ~(A & B)
]
def test_complexity(self):
for expr in self.expressions:
simplified = expr.simplify()
oversimplified = simplified.simplify()
self.assertLessEqual(
simplified.complexity,
expr.complexity,
msg=f"simplify() with '{expr}' (c: {expr.complexity}) produced '{simplified}' (c: {simplified.complexity})",
)
self.assertTrue(
expr.equals(simplified),
msg=f"simplify() with '{expr}' produced '{simplified}'",
)
self.assertEqual(
simplified.complexity,
oversimplified.complexity,
msg=f"Unfinished simplification with {expr} (c: {expr.complexity}): Produced: {simplified} (c: {simplified.complexity}). Produced on the second step: {oversimplified} (c: {oversimplified.complexity})",
)
if __name__ == "__main__":
unittest.main()