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
|
; 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 "crewrite-tracep")
(local (include-book "crewrite-local-settings"))
(%interactive)
(local (%max-proof-size 0))
(local (%quiet t))
(%autoprove lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core
(%autoinduct rw.flag-crewrite)
(%restrict default forcing-lookup-of-logic.function-name (equal atbl 'atbl))
(%restrict default forcing-lookup-of-logic.function-name-free (equal atbl 'atbl))
(%disable default
;; The theory is already really tight, but there are a few things
;; we're missing, probably because we added the syntax evaluator
;; later on and who knows why for consp-when-consp-of-cdr-cheap.
consp-when-consp-of-cdr-cheap
forcing-logic.functionp-when-rewrite.syntaxp-base-evaluablep
logic.constant-listp-of-logic.function-args-when-rewrite.syntaxp-base-evaluablep)
;; Phase 1. Simplify the resulting induction goals before opening up the
;; definitions.
(%forcingp nil)
(%liftlimit 10)
(%splitlimit 2)
(%betamode nil)
(%waterfall default 400)
(%betamode t)
(%enable default
splitters
special-disables-for-fast-pruning)
(%waterfall default 400)
;; restrictions as before
(%restrict default definition-of-rw.crewrite-core (equal x 'x))
(%restrict default definition-of-rw.crewrite-try-rule (equal x 'x) (equal rule[s] 'rule[s]))
(%restrict default definition-of-rw.crewrite-try-match (equal x 'x) (equal sigma[s] 'sigma[s]))
(%restrict default definition-of-rw.crewrite-relieve-hyp (equal x 'x))
(%disable default ;; speed hint
rw.crewrite-try-rules-when-not-consp
rw.crewrite-core-list-when-not-consp
rw.crewrite-relieve-hyps-when-not-consp
rw.crewrite-try-matches-when-not-consp
rw.tracep-when-memberp-of-rw.trace-listp
minus-when-not-less
minus-when-zp-right-cheap
minus-when-zp-left-cheap
logic.termp-when-not-consp-cheap
logic.constant-listp-of-logic.function-args-when-logic.base-evaluablep
forcing-logic.lambda-actuals-of-logic.substitute
forcing-logic.function-args-of-logic.substitute)
;; old size: crewrite-trace-atblp.pcert.out:;; Proof size: 8,515,629,064 conses.
;; new trick: ;; Proof size: 4,604,904,097 conses.
(%betamode t)
(%crewrite default)
(%waterfall default 400)
(%enable default
rw.crewrite-try-rules-when-not-consp
rw.tracep-when-memberp-of-rw.trace-listp
expensive-arithmetic-rules
expensive-arithmetic-rules-two
type-set-like-rules
unusual-consp-rules
unusual-memberp-rules
unusual-subsetp-rules
min
logic.termp-when-invalid-maybe-expensive)
(%disable default
squeeze-law-one
squeeze-law-two
squeeze-law-three
minus-when-not-less
not-equal-when-less
|a <= b, c != 0 --> a < b+c|
one-plus-trick
|a <= b, c != 0 --> a < c+b|
nfix-when-zp-cheap
nfix-when-not-natp-cheap
zp-when-not-natp-cheap
natp-when-zp-cheap
|a <= b, b <= c --> a < 1+c|
equal-of-booleans-rewrite
gather-constants-from-less-of-plus
gather-constants-from-less-of-plus-two
minus-when-zp-left-cheap
minus-when-zp-right-cheap
plus-when-zp-left-cheap
plus-when-zp-right-cheap
gather-constants-from-equal-of-plus
equal-of-non-symbol-and-symbol-cheap
equal-of-non-cons-and-cons-cheap
equal-of-cons-and-non-cons-cheap
equal-of-non-nat-and-nat-cheap
equal-of-nat-and-non-nat-cheap
equal-of-symbol-and-non-symbol-cheap)
(%waterfall default 400)
(%car-cdr-elim)
(%auto))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'term))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-core
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'term))))
(%autoprove forcing-rw.trace-list-atblp-of-rw.cresult->data-of-rw.crewrite-core-list
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'list))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-core-list
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'list))))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-try-rule
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'rule))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-try-rule
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'rule))))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-try-rules
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'rules))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-try-rules
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'rules))))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-try-match
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'match))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-try-match
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'match))))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-try-matches
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'matches))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->cache-of-rw.crewrite-try-matches
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'matches))))
(%autoprove forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-relieve-hyp
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'hyp))))
(%autoprove forcing-rw.cache-atblp-of-rw.cresult->data-of-rw.crewrite-relieve-hyp
;; BOZO bad name. Shoulds say rw.cresult->cache instead of data
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'hyp))))
(%autoprove forcing-rw.trace-list-atblp-of-rw.hypresult->traces-of-rw.crewrite-relieve-hyps
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'hyps))))
(%autoprove forcing-rw.cache-atblp-of-rw.hypresult->cache-of-rw.crewrite-relieve-hyps
(%use (%instance (%thm lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core)
(flag 'hyps))))
#||
old
(%autoprove lemma-for-forcing-rw.trace-atblp-of-rw.cresult->data-of-rw.crewrite-core
(%quiet t)
(%autoinduct rw.flag-crewrite)
(%restrict default forcing-lookup-of-logic.function-name (equal atbl 'atbl))
(%restrict default forcing-lookup-of-logic.function-name-free (equal atbl 'atbl))
;; Interlaced splitting and lightweight rewriting to control case explosion
(%betamode nil)
(%forcingp nil)
(%crewrite default)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 1 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 3 :splitlimit 25)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 0 :splitlimit 0)
(%quiet nil)
(%enable default
splitters
special-disables-for-fast-pruning)
(%betamode once)
(%crewrite default)
(%cleanup)
(%split :liftp t :liftlimit 0 :splitlimit 0)
(%crewrite default)
(%cleanup)
;; This might look a little scary, but observe that no single goal is affected
;; by more than one of these expansions.
(%restrict default definition-of-rw.crewrite-core (equal x 'x))
(%restrict default definition-of-rw.crewrite-try-rule (equal x 'x) (equal rule[s] 'rule[s]))
(%restrict default definition-of-rw.crewrite-try-match (equal x 'x) (equal sigma[s] 'sigma[s]))
(%restrict default definition-of-rw.crewrite-relieve-hyp (equal x 'x))
(%disable default ;; speed hint
rw.crewrite-try-rules-when-not-consp
rw.tracep-when-memberp-of-rw.trace-listp)
(%crewrite default)
(%auto :strategy (split cleanup crewrite))
(%enable default
expensive-term/formula-inference
formula-decomposition
rw.crewrite-try-rules-when-not-consp
rw.tracep-when-memberp-of-rw.trace-listp
expensive-arithmetic-rules
expensive-arithmetic-rules-two
type-set-like-rules
unusual-consp-rules
unusual-memberp-rules
unusual-subsetp-rules
min)
(%auto :strategy (split cleanup urewrite crewrite elim)))
||#
|
