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
|
; 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 "casesplit")
(include-book "term-paths")
(include-book "unlifted-subterms")
(include-book "depth-1")
(%interactive)
;; BOZO I think this could be split up a lot better. Lots of this doesn't seem
;; to need deepest.
(%autoadmit clause.deepest)
(%autoprove clause.deepest-when-not-consp
(%restrict default clause.deepest (equal x 'x)))
(%autoprove clause.deepest-of-cons
(%restrict default clause.deepest (equal x '(cons a x))))
(%autoprove clause.deepest-of-list-fix
(%cdr-induction x))
(%autoprove clause.deepest-of-app
;; BOZO ugly acl2 proof enables clause.deepest instead of using cdr-induction.
(%cdr-induction x))
(%autoprove memberp-of-clause.deepest
(%cdr-induction x))
(%autoprove positiveness-of-clause.depth-of-clause.deepest
(%cdr-induction x))
(%autoprove clause.deepest-weakly-deeper-than-any-member
(%cdr-induction x))
(%autoprove clause.depth-list-redefinition
(%cdr-induction x)
(%forcingp nil))
(local (%create-theory common-disables))
(local (%enable common-disables
expensive-arithmetic-rules
expensive-arithmetic-rules-two
type-set-like-rules
formula-decomposition
expensive-term/formula-inference
unusual-consp-rules
same-length-prefixes-equal-cheap
clause.term-tests-openers
clause.term-paths-openers
clause.lifted-termp-openers
clause.simple-termp-openers
clause.unlifted-subterms-openers
clause.factor-openers
app-when-not-consp-two
forcing-logic.function-of-logic.function-name-and-logic.function-args-free
clause.depth-list-when-not-consp
clause.depth-list-when-clause.simple-term-listp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
clause.simple-termp-of-car-when-clause.simple-term-listp
clause.depth-when-clause.simple-termp
clause.unlifted-subterms-when-clause.simple-termp))
(%autoprove clause.unlifted-subterms-weakly-decreases-clause.depth
(%clause.unlifted-subterms-induction x)
(%disable default common-disables)
(%restrict default clause.unlifted-subterms (equal x 'x))
(%restrict default definition-of-clause.depth (equal x 'x))
(%auto)
(%enable default
trichotomy-of-<
antisymmetry-of-<
expensive-arithmetic-rules-two
expensive-term/formula-inference
unusual-consp-rules))
(%autoprove forcing-clause.simple-termp-of-clause.deepest
(%cdr-induction x))
(%autoprove lemma-for-clause.factor-when-irrelevant-tests
(%clause.simple-term-induction flag x)
(%disable default common-disables)
(%disable default
disjointp-when-subsetp-of-other-one
disjointp-when-subsetp-of-other-two
disjointp-when-subsetp-of-disjointp-four
disjointp-when-subsetp-of-disjointp-three
disjointp-when-subsetp-of-disjointp-two
disjointp-when-subsetp-of-disjointp-one)
(%enable default
clause.term-tests-openers
clause.factor-openers)
(%auto)
(%enable default
formula-decomposition
expensive-term/formula-inference
unusual-consp-rules))
(%autoprove clause.factor-when-irrelevant-tests
(%use (%instance (%thm lemma-for-clause.factor-when-irrelevant-tests)
(flag 'term))))
(%autoprove clause.factor-list-when-irrelevant-tests
(%use (%instance (%thm lemma-for-clause.factor-when-irrelevant-tests)
(flag 'list))))
(%autoprove lemma-for-clause.depth-of-clause.factor-weak
(%clause.simple-term-induction flag x)
(%disable default common-disables)
(%restrict default definition-of-clause.depth (equal x 'x))
(%auto)
(%enable default
clause.simple-termp-openers
clause.factor-openers)
(%auto)
(%enable default
antisymmetry-of-<
expensive-arithmetic-rules-two
expensive-term/formula-inference
unusual-consp-rules)
(%disable default
clause.simple-termp-openers
clause.factor-openers
one-plus-trick
less-when-zp-left-cheap
clause.factor-openers
squeeze-law-one
squeeze-law-two
squeeze-law-three))
(%autoprove clause.depth-of-clause.factor-weak
(%use (%instance (%thm lemma-for-clause.depth-of-clause.factor-weak) (flag 'term))))
(%autoprove clause.depth-of-clause.factor-list-weak
(%use (%instance (%thm lemma-for-clause.depth-of-clause.factor-weak) (flag 'list))))
(%autoprove lemma-2-for-clause.depth-of-clause.factor-strong
(%disable default ;; speed hack
type-set-like-rules
squeeze-law-two
same-length-prefixes-equal-cheap
clause.depth-when-clause.simple-termp
clause.factor-when-irrelevant-tests)
(%use (%instance (%thm |a <= b, b <= c --> a < 1+c|)
(a (clause.depth (clause.factor a assignment)))
(b (clause.depth a))
(c (clause.depth b)))))
(%autoprove lemma-for-clause.depth-of-clause.factor-strong
;; BOZO expensive terrible proof
(%clause.simple-term-induction flag x)
(%auto :strategy (cleanup split urewrite))
(%restrict default definition-of-clause.depth (equal x 'x))
(%cheapen default
disjoint-from-nonep-of-subsetp-when-disjoint-from-nonep
disjointp-when-memberp-of-disjoint-from-nonep
disjointp-when-subsetp-of-other-two
disjointp-when-subsetp-of-other-one
disjointp-when-subsetp-of-disjointp-four
clause.factor-when-irrelevant-tests
clause.factor-list-when-irrelevant-tests
clause.simple-termp-when-memberp-of-clause.simple-term-listp
clause.depth-when-clause.simple-termp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
clause.simple-termp-of-car-when-clause.simple-term-listp)
(%disable default
type-set-like-rules
expensive-arithmetic-rules
expensive-arithmetic-rules-two
same-length-prefixes-equal-cheap
subsetp-when-prefixp-cheap
forcing-logic.function-of-logic.function-name-and-logic.function-args-free
logic.formulap-when-logic.termp
logic.termp-when-logic.formulap)
(%crewrite default)
(%auto :strategy (cleanup split urewrite))
(%enable default
lemma-2-for-clause.depth-of-clause.factor-strong)
(%crewrite default)
(%enable default
expensive-arithmetic-rules
expensive-arithmetic-rules-two
type-set-like-rules))
(%autoprove clause.depth-of-clause.factor-strong
(%use (%instance (%thm lemma-for-clause.depth-of-clause.factor-strong)
(flag 'term))))
(%autoprove clause.depth-list-of-clause.factor-list-strong
(%use (%instance (%thm lemma-for-clause.depth-of-clause.factor-strong)
(flag 'list))))
(%autoprove clause.depth-list-of-clause.unlifted-subterms-of-clause.casesplit
(%clause.cases-induction cases assignment)
(%disable default
expensive-arithmetic-rules
expensive-arithmetic-rules-two
same-length-prefixes-equal-cheap
type-set-like-rules
expensive-term/formula-inference
formula-decomposition
unusual-consp-rules)
(%cheapen default
clause.depth-when-clause.simple-termp
clause.depth-list-when-clause.simple-term-listp
clause.simple-termp-when-memberp-of-clause.simple-term-listp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
clause.simple-termp-of-car-when-clause.simple-term-listp))
(%autoprove lemma-for-clause.casesplit-strongly-reduces-clause.depth
(%disable default
clause.unlifted-subterms-weakly-decreases-clause.depth
[outside]clause.unlifted-subterms-weakly-decreases-clause.depth
expensive-arithmetic-rules
type-set-like-rules)
(%cheapen default
clause.depth-when-clause.simple-termp
clause.depth-list-when-clause.simple-term-listp
clause.simple-termp-when-memberp-of-clause.simple-term-listp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
clause.simple-termp-of-car-when-clause.simple-term-listp)
(%use (%instance (%thm clause.unlifted-subterms-weakly-decreases-clause.depth)
(x (clause.factor x assignment)))))
(%autoprove clause.casesplit-strongly-reduces-clause.depth
(%clause.cases-induction cases assignment)
(%disable default
type-set-like-rules
expensive-arithmetic-rules
expensive-arithmetic-rules-two
same-length-prefixes-equal-cheap
formula-decomposition
expensive-term/formula-inference
unusual-consp-rules)
(%cheapen default
clause.depth-when-clause.simple-termp
clause.depth-list-when-clause.simple-term-listp
clause.simple-termp-when-memberp-of-clause.simple-term-listp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
clause.simple-termp-of-car-when-clause.simple-term-listp)
(%enable default lemma-for-clause.casesplit-strongly-reduces-clause.depth))
|
