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
|
; Milawa - A Reflective Theorem Prover
; Copyright (C) 2005-2009 Kookamara LLC
;
; Contact:
;
; Kookamara LLC
; 11410 Windermere Meadows
; Austin, TX 78759, USA
; http://www.kookamara.com/
;
; License: (An MIT/X11-style license)
;
; Permission is hereby granted, free of charge, to any person obtaining a
; copy of this software and associated documentation files (the "Software"),
; to deal in the Software without restriction, including without limitation
; the rights to use, copy, modify, merge, publish, distribute, sublicense,
; and/or sell copies of the Software, and to permit persons to whom the
; Software is furnished to do so, subject to the following conditions:
;
; The above copyright notice and this permission notice shall be included in
; all copies or substantial portions of the Software.
;
; THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
; IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
; FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
; AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
; LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
; FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
; DEALINGS IN THE SOFTWARE.
;
; Original author: Jared Davis <jared@kookamara.com>
(in-package "MILAWA")
(include-book "prop")
(include-book "pequal")
(include-book "equal")
(include-book "iff")
(include-book "if")
(include-book "not")
(include-book "disjoined-update-clause-bldr")
(%interactive)
(%autoadmit level3.step-okp)
(encapsulate
()
(local (%enable default level3.step-okp))
(%autoprove soundness-of-level3.step-okp)
;; BOZO we might want this to be when level2-step-okp instead
(%autoprove level3.step-okp-when-level2.step-okp
(%enable default level2.step-okp logic.appeal-step-okp)
(%auto :strategy (cleanup split urewrite)))
(%autoprove level3.step-okp-when-not-consp
(%enable default logic.method)))
(encapsulate
()
(local (%disable default forcing-true-listp-of-logic.subproofs))
(%autoadmit level3.flag-proofp-aux))
(%autoadmit level3.proofp-aux)
(%autoadmit level3.proof-listp-aux)
(%autoprove definition-of-level3.proofp-aux
(%enable default level3.proofp-aux level3.proof-listp-aux)
(%restrict default level3.flag-proofp-aux (equal x 'x)))
(%autoprove definition-of-level3.proof-listp-aux
(%enable default level3.proofp-aux level3.proof-listp-aux)
(%restrict default level3.flag-proofp-aux (equal x 'x)))
(%autoprove level3.proofp-aux-when-not-consp (%restrict default definition-of-level3.proofp-aux (equal x 'x)))
(%autoprove level3.proof-listp-aux-when-not-consp (%restrict default definition-of-level3.proof-listp-aux (equal x 'x)))
(%autoprove level3.proof-listp-aux-of-cons (%restrict default definition-of-level3.proof-listp-aux (equal x '(cons a x))))
(%autoprove lemma-for-booleanp-of-level3.proofp-aux
(%logic.appeal-induction flag x)
(%disable default forcing-true-listp-of-logic.subproofs)
(%auto)
(%restrict default definition-of-level3.proofp-aux (equal x 'x)))
(%autoprove booleanp-of-level3.proofp-aux (%use (%instance (%thm lemma-for-booleanp-of-level3.proofp-aux) (flag 'proof))))
(%autoprove booleanp-of-level3.proof-listp-aux (%use (%instance (%thm lemma-for-booleanp-of-level3.proofp-aux) (flag 'list))))
(%deflist level3.proof-listp-aux (x axioms thms atbl)
(level3.proofp-aux x axioms thms atbl))
(%autoprove lemma-for-logic.provablep-when-level3.proofp-aux
(%logic.appeal-induction flag x)
(%disable default forcing-true-listp-of-logic.subproofs)
;; Using the urewrite here cleans up tons of simple clauses, reducing the proof size
;; from 1.7B to 188M
(%auto :strategy (cleanup urewrite split))
(%auto)
(%restrict default definition-of-level3.proofp-aux (equal x 'x)))
(%autoprove logic.provablep-when-level3.proofp-aux
(%use (%instance (%thm lemma-for-logic.provablep-when-level3.proofp-aux) (flag 'proof))))
(%autoprove logic.provable-listp-when-level3.proof-listp-aux
(%use (%instance (%thm lemma-for-logic.provablep-when-level3.proofp-aux) (flag 'list))))
(%autoprove lemma-for-level3.proofp-aux-when-logic.proofp
(%logic.appeal-induction flag x)
(%disable default forcing-true-listp-of-logic.subproofs)
(%auto)
(%restrict default definition-of-level3.proofp-aux (equal x 'x))
(%restrict default definition-of-logic.proofp (equal x 'x)))
(%autoprove level3.proofp-aux-when-logic.proofp
(%use (%instance (%thm lemma-for-level3.proofp-aux-when-logic.proofp) (flag 'proof))))
(%autoprove level3.proof-listp-aux-when-logic.proof-listp
(%use (%instance (%thm lemma-for-level3.proofp-aux-when-logic.proofp) (flag 'list))))
(%autoprove forcing-level3.proofp-aux-of-logic.provable-witness
(%enable default level3.proofp-aux-when-logic.proofp))
(%autoadmit level3.proofp)
(%autoprove booleanp-of-level3.proofp
(%enable default level3.proofp))
(%autoprove logic.provablep-when-level3.proofp
(%enable default level3.proofp))
(defsection level3-transition
(%install-new-proofp level3.proofp)
(%auto)
(%qed-install))
;; Propositional rules
(%switch-builder build.modus-ponens-list build.modus-ponens-list-high)
(%switch-builder build.disjoined-modus-ponens-list build.disjoined-modus-ponens-list-high)
(%switch-builder build.generic-subset build.generic-subset-high)
(%switch-builder build.disjoined-subset build.generic-subset-high)
(%switch-builder build.multi-expansion build.multi-expansion-high)
(%switch-builder build.multi-or-expansion build.multi-or-expansion-high)
(%switch-builder build.rev-disjunction build.rev-disjunction-high)
(%switch-builder build.ordered-subset build.ordered-subset-high)
(%switch-builder build.disjoined-rev-disjunction build.disjoined-rev-disjunction-high)
(%switch-builder build.multi-assoc-expansion build.multi-assoc-expansion-high)
(%switch-builder clause.aux-disjoined-update-clause-twiddle clause.aux-disjoined-update-clause-twiddle-high)
;; Pequal rules
(%switch-builder build.reflexivity build.reflexivity-high)
(%switch-builder build.commute-pequal build.commute-pequal-high)
(%switch-builder build.disjoined-commute-pequal build.disjoined-commute-pequal-high)
(%switch-builder build.commute-not-pequal build.commute-not-pequal-high)
(%switch-builder build.disjoined-commute-not-pequal build.disjoined-commute-not-pequal-high)
(%switch-builder build.substitute-into-not-pequal build.substitute-into-not-pequal-high)
(%switch-builder build.disjoined-substitute-into-not-pequal build.disjoined-substitute-into-not-pequal-high)
(%switch-builder build.transitivity-of-pequal build.transitivity-of-pequal-high)
(%switch-builder build.disjoined-transitivity-of-pequal build.disjoined-transitivity-of-pequal-high)
(%switch-builder build.not-nil-from-t build.not-nil-from-t-high)
(%switch-builder build.disjoined-not-nil-from-t build.disjoined-not-nil-from-t-high)
(%switch-builder build.not-t-from-nil build.not-t-from-nil-high)
(%switch-builder build.disjoined-not-t-from-nil build.disjoined-not-t-from-nil-high)
;; Equal rules
(%switch-builder build.equal-reflexivity build.equal-reflexivity-high)
(%switch-builder build.equal-t-from-not-nil build.equal-t-from-not-nil-high)
(%switch-builder build.disjoined-equal-t-from-not-nil build.disjoined-equal-t-from-not-nil-high)
(%switch-builder build.equal-nil-from-not-t build.equal-nil-from-not-t-high)
(%switch-builder build.disjoined-equal-nil-from-not-t build.disjoined-equal-nil-from-not-t-high)
(%switch-builder build.pequal-from-equal build.pequal-from-equal-high)
(%switch-builder build.disjoined-pequal-from-equal build.disjoined-pequal-from-equal-high)
(%switch-builder build.not-equal-from-not-pequal build.not-equal-from-not-pequal-high)
(%switch-builder build.disjoined-not-equal-from-not-pequal build.disjoined-not-equal-from-not-pequal-high)
(%switch-builder build.commute-equal build.commute-equal-high)
(%switch-builder build.disjoined-commute-equal build.disjoined-commute-equal-high)
(%switch-builder build.equal-from-pequal build.equal-from-pequal-high)
(%switch-builder build.disjoined-equal-from-pequal build.disjoined-equal-from-pequal-high)
(%switch-builder build.not-pequal-from-not-equal build.not-pequal-from-not-equal-high)
(%switch-builder build.disjoined-not-pequal-from-not-equal build.disjoined-not-pequal-from-not-equal-high)
(%switch-builder build.transitivity-of-equal build.transitivity-of-equal-high)
(%switch-builder build.disjoined-transitivity-of-equal build.disjoined-transitivity-of-equal-high)
(%switch-builder build.not-pequal-constants build.not-pequal-constants-high)
;; If rules
(%switch-builder build.if-when-not-nil build.if-when-not-nil-high)
(%switch-builder build.if-when-nil build.if-when-nil-high)
;; Iff rules
(%switch-builder build.iff-t-from-not-pequal-nil build.iff-t-from-not-pequal-nil-high)
(%switch-builder build.disjoined-iff-t-from-not-pequal-nil build.disjoined-iff-t-from-not-pequal-nil-high)
(%switch-builder build.not-pequal-nil-from-iff-t build.not-pequal-nil-from-iff-t-high)
(%switch-builder build.disjoined-not-pequal-nil-from-iff-t build.disjoined-not-pequal-nil-from-iff-t-high)
(%switch-builder build.iff-t-from-not-nil build.iff-t-from-not-nil-high)
(%switch-builder build.disjoined-iff-t-from-not-nil build.disjoined-iff-t-from-not-nil-high)
(%switch-builder build.iff-reflexivity build.iff-reflexivity-high)
(%switch-builder build.commute-iff build.commute-iff-high)
(%switch-builder build.disjoined-commute-iff build.disjoined-commute-iff-high)
(%switch-builder build.transitivity-of-iff build.transitivity-of-iff-high)
(%switch-builder build.disjoined-transitivity-of-iff build.disjoined-transitivity-of-iff-high)
(%switch-builder build.iff-from-pequal build.iff-from-pequal-high)
(%switch-builder build.disjoined-iff-from-pequal build.disjoined-iff-from-pequal-high)
(%switch-builder build.iff-from-equal build.iff-from-equal-high)
(%switch-builder build.disjoined-iff-from-equal build.disjoined-iff-from-equal-high)
;; Not rules
(%switch-builder build.disjoined-negative-lit-from-pequal-nil build.disjoined-negative-lit-from-pequal-nil-high)
(%switch-builder build.disjoined-pequal-nil-from-negative-lit build.disjoined-pequal-nil-from-negative-lit-high)
(%switch-builder build.disjoined-iff-when-not-nil build.disjoined-iff-when-not-nil-high)
(%finish "level3")
(%save-events "level3.events")
;; Clear out the thmfiles table since we'll use the saved image from now on.
(ACL2::table tactic-harness 'thmfiles nil)
|
