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
|
; 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 "compiler")
(%interactive)
;; These get expensive with so many (memberp (thm-blah-blah) thms) in our goals
(local (%disable default
memberp-when-not-consp
unusual-memberp-rules))
(%autoadmit level11.step-okp)
(encapsulate
()
(local (%enable default level11.step-okp))
(%autoprove soundness-of-level11.step-okp)
(%autoprove level11.step-okp-when-level10.step-okp
(%enable default level10.step-okp)
(%auto)
(%enable default level9.step-okp)
(%auto)
(%enable default level8.step-okp)
(%auto)
(%enable default level7.step-okp)
(%auto)
(%enable default level6.step-okp)
(%auto)
(%enable default level5.step-okp)
(%auto)
(%enable default level4.step-okp)
(%auto)
(%enable default level3.step-okp)
(%auto)
(%enable default level2.step-okp)
(%auto)
(%enable default logic.appeal-step-okp)
(%auto))
(%autoprove level11.step-okp-when-not-consp
(%enable default logic.method)))
(encapsulate
()
(local (%forcingp nil))
(local (%enable default expensive-arithmetic-rules))
(%autoadmit level11.flag-proofp-aux))
(%autoadmit level11.proofp-aux)
(%autoadmit level11.proof-listp-aux)
(%autoprove definition-of-level11.proofp-aux
(%enable default level11.proofp-aux level11.proof-listp-aux)
(%restrict default level11.flag-proofp-aux (equal x 'x)))
(%autoprove definition-of-level11.proof-listp-aux
(%enable default level11.proofp-aux level11.proof-listp-aux)
(%restrict default level11.flag-proofp-aux (equal x 'x)))
(%autoprove level11.proofp-aux-when-not-consp
(%enable default definition-of-level11.proofp-aux))
(%autoprove level11.proof-listp-aux-when-not-consp
(%restrict default definition-of-level11.proof-listp-aux (equal x 'x)))
(%autoprove level11.proof-listp-aux-of-cons
(%restrict default definition-of-level11.proof-listp-aux (equal x '(cons a x))))
(%autoprove lemma-for-booleanp-of-level11.proofp-aux
(%logic.appeal-induction flag x)
(%enable default
definition-of-level11.proofp-aux
expensive-arithmetic-rules)
(%forcingp nil))
(%autoprove booleanp-of-level11.proofp-aux
(%use (%instance (%thm lemma-for-booleanp-of-level11.proofp-aux)
(flag 'proof))))
(%autoprove booleanp-of-level11.proof-listp-aux
(%use (%instance (%thm lemma-for-booleanp-of-level11.proofp-aux)
(flag 'list))))
(%deflist level11.proof-listp-aux (x worlds defs axioms thms atbl)
(level11.proofp-aux x worlds defs axioms thms atbl))
(%autoprove lemma-for-logic.provablep-when-level11.proofp-aux
(%logic.appeal-induction flag x)
(%splitlimit 2)
(%liftlimit 8)
(%disable default
forcing-true-listp-of-logic.subproofs
MEMBERP-WHEN-NOT-CONSP
CONSP-WHEN-CONSP-OF-CDR-CHEAP
LOOKUP-WHEN-NOT-CONSP
CONSP-WHEN-TRUE-LISTP-CHEAP
memberp-when-memberp-of-cdr
memberp-when-not-subset-of-somep-cheap
memberp-when-not-superset-of-somep-cheap
type-set-like-rules
unusual-consp-rules
unusual-memberp-rules
unusual-subsetp-rules
same-length-prefixes-equal-cheap
expensive-arithmetic-rules
expensive-arithmetic-rules-two
formula-decomposition
expensive-term/formula-inference
logic.provable-listp-of-logic.strip-conclusions-when-provable-first-and-rest)
(%waterfall default 110)
(%restrict default definition-of-level11.proofp-aux (equal x 'x))
(%enable default
expensive-arithmetic-rules
type-set-like-rules)
(%waterfall default 110))
(%autoprove logic.provablep-when-level11.proofp-aux
(%use (%instance (%thm lemma-for-logic.provablep-when-level11.proofp-aux)
(flag 'proof))))
(%autoprove logic.provable-listp-when-level11.proof-listp-aux
(%use (%instance (%thm lemma-for-logic.provablep-when-level11.proofp-aux)
(flag 'list))))
(%autoprove lemma-for-level11.proofp-aux-when-logic.proofp
(%logic.appeal-induction flag x)
(%disable default forcing-true-listp-of-logic.subproofs)
(%auto)
(%restrict default definition-of-level11.proofp-aux (equal x 'x))
(%restrict default definition-of-logic.proofp (equal x 'x))
(%enable default expensive-arithmetic-rules))
(%autoprove level11.proofp-aux-when-logic.proofp
(%use (%instance (%thm lemma-for-level11.proofp-aux-when-logic.proofp)
(flag 'proof))))
(%autoprove level11.proof-listp-aux-when-logic.proof-listp
(%use (%instance (%thm lemma-for-level11.proofp-aux-when-logic.proofp)
(flag 'list))))
(%autoprove forcing-level11.proofp-aux-of-logic.provable-witness
(%enable default level11.proofp-aux-when-logic.proofp))
(%autoadmit level11.static-checksp)
(%enable default level11.static-checksp)
(%autoadmit level11.proofp)
(%autoprove booleanp-of-level11.proofp
(%enable default level11.proofp))
(%autoprove logic.provablep-when-level11.proofp
(%enable default level11.proofp)
(%disable default
logic.provablep-when-level11.proofp-aux
unusual-memberp-rules
memberp-when-memberp-of-cdr
memberp-when-not-consp
unusual-consp-rules
expensive-term/formula-inference
expensive-arithmetic-rules
expensive-arithmetic-rules-two
type-set-like-rules
formula-decomposition
)
(%use (%instance (%thm logic.provablep-when-level11.proofp-aux)
(x (third (logic.extras x)))
(defs (first (logic.extras x)))
(worlds (second (logic.extras x)))))
(%auto :strategy (cleanup split crewrite))
(%enable default expensive-term/formula-inference))
(defsection level11-transition
(%install-new-proofp level11.proofp)
(%auto)
(%qed-install))
(ACL2::table tactic-harness 'current-adapter 'level11.adapter)
(%switch-builder tactic.compile-skeleton tactic.compile-skeleton-high)
(%finish "level11")
(%save-events "level11.events")
;; Clear out the thmfiles table since we'll use the saved image from now on.
(ACL2::table tactic-harness 'thmfiles nil)
|
