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
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
|
(**************************************************************************)
(* *)
(* SMTCoq *)
(* Copyright (C) 2011 - 2021 *)
(* *)
(* See file "AUTHORS" for the list of authors *)
(* *)
(* This file is distributed under the terms of the CeCILL-C licence *)
(* *)
(**************************************************************************)
Add Rec LoadPath "../src" as SMTCoq.
Require Import SMTCoq.
Require Import Bool PArray Int63 List ZArith.
Local Open Scope int63_scope.
(* First a tactic, to test the universe computation in an empty
environment. *)
Lemma check_univ (x1: bool):
(x1 && (negb x1)) = false.
Proof using.
zchaff.
Qed.
(* zChaff tactic *)
Goal forall a, a || negb a.
Proof using.
zchaff.
Qed.
Goal forall a, negb (a || negb a) = false.
Proof using.
zchaff.
Qed.
Goal forall a, negb (negb (a || negb a)).
Proof using.
zchaff.
Qed.
Goal forall a, (a && negb a) = false.
Proof using.
zchaff.
Qed.
Goal forall a, negb (a && negb a).
Proof using.
zchaff.
Qed.
Goal forall a, implb a a.
Proof using.
zchaff.
Qed.
Goal forall a, negb (implb a a) = false.
Proof using.
zchaff.
Qed.
Goal forall a , (xorb a a) || negb (xorb a a).
Proof using.
zchaff.
Qed.
Goal forall a, (a||negb a) || negb (a||negb a).
Proof using.
zchaff.
Qed.
Goal true.
Proof using.
zchaff.
Qed.
Goal negb false.
Proof using.
zchaff.
Qed.
Goal forall a, Bool.eqb a a.
Proof using.
zchaff.
Qed.
Goal forall (a:bool), a = a.
Proof using.
zchaff.
Qed.
(* sat2.smt *)
(* ((a ∧ b) ∨ (b ∧ c)) ∧ ¬b = ⊥ *)
Goal forall a b c, (((a && b) || (b && c)) && (negb b)) = false.
Proof using.
zchaff.
Qed.
(* sat3.smt *)
(* (a ∨ a) ∧ ¬a = ⊥ *)
Goal forall a, ((a || a) && (negb a)) = false.
Proof using.
zchaff.
Qed.
(* sat4.smt *)
(* ¬(a ∨ ¬a) = ⊥ *)
Goal forall a, (negb (a || (negb a))) = false.
Proof using.
zchaff.
Qed.
(* sat5.smt *)
(* (a ∨ b ∨ c) ∧ (¬a ∨ ¬b ∨ ¬c) ∧ (¬a ∨ b) ∧ (¬b ∨ c) ∧ (¬c ∨ a) = ⊥ *)
Goal forall a b c,
(a || b || c) && ((negb a) || (negb b) || (negb c)) && ((negb a) || b) && ((negb b) || c) && ((negb c) || a) = false.
Proof using.
zchaff.
Qed.
(* The same, but with a, b and c being concrete terms *)
Goal forall i j k,
((i == j) || (j == k) || (k == i)) && ((negb (i == j)) || (negb (j == k)) || (negb (k == i))) && ((negb (i == j)) || (j == k)) && ((negb (j == k)) || (k == i)) && ((negb (k == i)) || (i == j)) = false.
Proof using.
zchaff.
Qed.
Goal forall i j k,
let a := i == j in
let b := j == k in
let c := k == i in
(a || b || c) && ((negb a) || (negb b) || (negb c)) && ((negb a) || b) && ((negb b) || c) && ((negb c) || a) = false.
Proof using.
zchaff.
Qed.
(* sat6.smt *)
(* (a ∧ b) ∧ (c ∨ d) ∧ ¬(c ∨ (a ∧ b ∧ d)) = ⊥ *)
Goal forall a b c d, ((a && b) && (c || d) && (negb (c || (a && b && d)))) = false.
Proof using.
zchaff.
Qed.
(* sat7.smt *)
(* a ∧ b ∧ c ∧ (¬a ∨ ¬b ∨ d) ∧ (¬d ∨ ¬c) = ⊥ *)
Goal forall a b c d, (a && b && c && ((negb a) || (negb b) || d) && ((negb d) || (negb c))) = false.
Proof using.
zchaff.
Qed.
(* Other connectives *)
Goal (false || true) && false = false.
Proof using.
zchaff.
Qed.
Goal negb true = false.
Proof using.
zchaff.
Qed.
Goal false = false.
Proof using.
zchaff.
Qed.
Goal forall x y, Bool.eqb (xorb x y) ((x && (negb y)) || ((negb x) && y)).
Proof using.
zchaff.
Qed.
Goal forall x y, Bool.eqb (implb x y) ((x && y) || (negb x)).
Proof using.
zchaff.
Qed.
Goal forall x y z, Bool.eqb (ifb x y z) ((x && y) || ((negb x) && z)).
Proof using.
zchaff.
Qed.
(* Multiple negations *)
Goal forall a, orb a (negb (negb (negb a))) = true.
Proof using.
zchaff.
Qed.
(* Polarities *)
Goal forall a b, andb (orb a b) (negb (orb a b)) = false.
Proof using.
zchaff.
Qed.
Goal forall a b, andb (orb a b) (andb (negb a) (negb b)) = false.
Proof using.
zchaff.
Qed.
(* Pigeon hole: 4 holes, 5 pigeons. xij stands for "pidgeon i goes to
hole j". *)
Goal forall x11 x12 x13 x14 x15 x21 x22 x23 x24 x25 x31 x32 x33 x34 x35 x41 x42 x43 x44 x45, (
(orb (negb x11) (negb x21)) &&
(orb (negb x11) (negb x31)) &&
(orb (negb x11) (negb x41)) &&
(orb (negb x21) (negb x31)) &&
(orb (negb x21) (negb x41)) &&
(orb (negb x31) (negb x41)) &&
(orb (negb x12) (negb x22)) &&
(orb (negb x12) (negb x32)) &&
(orb (negb x12) (negb x42)) &&
(orb (negb x22) (negb x32)) &&
(orb (negb x22) (negb x42)) &&
(orb (negb x32) (negb x42)) &&
(orb (negb x13) (negb x23)) &&
(orb (negb x13) (negb x33)) &&
(orb (negb x13) (negb x43)) &&
(orb (negb x23) (negb x33)) &&
(orb (negb x23) (negb x43)) &&
(orb (negb x33) (negb x43)) &&
(orb (negb x14) (negb x24)) &&
(orb (negb x14) (negb x34)) &&
(orb (negb x14) (negb x44)) &&
(orb (negb x24) (negb x34)) &&
(orb (negb x24) (negb x44)) &&
(orb (negb x34) (negb x44)) &&
(orb (negb x15) (negb x25)) &&
(orb (negb x15) (negb x35)) &&
(orb (negb x15) (negb x45)) &&
(orb (negb x25) (negb x35)) &&
(orb (negb x25) (negb x45)) &&
(orb (negb x35) (negb x45)) &&
(orb (negb x11) (negb x12)) &&
(orb (negb x11) (negb x13)) &&
(orb (negb x11) (negb x14)) &&
(orb (negb x11) (negb x15)) &&
(orb (negb x12) (negb x13)) &&
(orb (negb x12) (negb x14)) &&
(orb (negb x12) (negb x15)) &&
(orb (negb x13) (negb x14)) &&
(orb (negb x13) (negb x15)) &&
(orb (negb x14) (negb x15)) &&
(orb (negb x21) (negb x22)) &&
(orb (negb x21) (negb x23)) &&
(orb (negb x21) (negb x24)) &&
(orb (negb x21) (negb x25)) &&
(orb (negb x22) (negb x23)) &&
(orb (negb x22) (negb x24)) &&
(orb (negb x22) (negb x25)) &&
(orb (negb x23) (negb x24)) &&
(orb (negb x23) (negb x25)) &&
(orb (negb x24) (negb x25)) &&
(orb (negb x31) (negb x32)) &&
(orb (negb x31) (negb x33)) &&
(orb (negb x31) (negb x34)) &&
(orb (negb x31) (negb x35)) &&
(orb (negb x32) (negb x33)) &&
(orb (negb x32) (negb x34)) &&
(orb (negb x32) (negb x35)) &&
(orb (negb x33) (negb x34)) &&
(orb (negb x33) (negb x35)) &&
(orb (negb x34) (negb x35)) &&
(orb (negb x41) (negb x42)) &&
(orb (negb x41) (negb x43)) &&
(orb (negb x41) (negb x44)) &&
(orb (negb x41) (negb x45)) &&
(orb (negb x42) (negb x43)) &&
(orb (negb x42) (negb x44)) &&
(orb (negb x42) (negb x45)) &&
(orb (negb x43) (negb x44)) &&
(orb (negb x43) (negb x45)) &&
(orb (negb x44) (negb x45)) &&
(orb (orb (orb x11 x21) x31) x41) &&
(orb (orb (orb x12 x22) x32) x42) &&
(orb (orb (orb x13 x23) x33) x43) &&
(orb (orb (orb x14 x24) x34) x44) &&
(orb (orb (orb x15 x25) x35) x45)) = false.
Proof using.
zchaff.
Qed.
(* Counter examples *)
(*
Goal forall x, x && (negb x).
Proof using.
zchaff.
Abort.
Goal forall x y, (implb (implb x y) (implb y x)).
Proof using.
zchaff.
Abort.
(* Pigeon hole: 4 holes, 4 pigeons. xij stands for "pidgeon i goes to
hole j". *)
Goal forall x11 x12 x13 x14 x21 x22 x23 x24 x31 x32 x33 x34 x41 x42 x43 x44, (
(orb (negb x11) (negb x21)) &&
(orb (negb x11) (negb x31)) &&
(orb (negb x11) (negb x41)) &&
(orb (negb x21) (negb x31)) &&
(orb (negb x21) (negb x41)) &&
(orb (negb x31) (negb x41)) &&
(orb (negb x12) (negb x22)) &&
(orb (negb x12) (negb x32)) &&
(orb (negb x12) (negb x42)) &&
(orb (negb x22) (negb x32)) &&
(orb (negb x22) (negb x42)) &&
(orb (negb x32) (negb x42)) &&
(orb (negb x13) (negb x23)) &&
(orb (negb x13) (negb x33)) &&
(orb (negb x13) (negb x43)) &&
(orb (negb x23) (negb x33)) &&
(orb (negb x23) (negb x43)) &&
(orb (negb x33) (negb x43)) &&
(orb (negb x14) (negb x24)) &&
(orb (negb x14) (negb x34)) &&
(orb (negb x14) (negb x44)) &&
(orb (negb x24) (negb x34)) &&
(orb (negb x24) (negb x44)) &&
(orb (negb x34) (negb x44)) &&
(orb (negb x11) (negb x12)) &&
(orb (negb x11) (negb x13)) &&
(orb (negb x11) (negb x14)) &&
(orb (negb x12) (negb x13)) &&
(orb (negb x12) (negb x14)) &&
(orb (negb x13) (negb x14)) &&
(orb (negb x21) (negb x22)) &&
(orb (negb x21) (negb x23)) &&
(orb (negb x21) (negb x24)) &&
(orb (negb x22) (negb x23)) &&
(orb (negb x22) (negb x24)) &&
(orb (negb x23) (negb x24)) &&
(orb (negb x31) (negb x32)) &&
(orb (negb x31) (negb x33)) &&
(orb (negb x31) (negb x34)) &&
(orb (negb x32) (negb x33)) &&
(orb (negb x32) (negb x34)) &&
(orb (negb x33) (negb x34)) &&
(orb (negb x41) (negb x42)) &&
(orb (negb x41) (negb x43)) &&
(orb (negb x41) (negb x44)) &&
(orb (negb x42) (negb x43)) &&
(orb (negb x42) (negb x44)) &&
(orb (negb x43) (negb x44)) &&
(orb (orb (orb x11 x21) x31) x41) &&
(orb (orb (orb x12 x22) x32) x42) &&
(orb (orb (orb x13 x23) x33) x43) &&
(orb (orb (orb x14 x24) x34) x44)) = false.
Proof using.
zchaff.
Abort.
*)
|
