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
|
; 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 "colors")
(include-book "skeletonp")
(include-book "worldp")
(include-book "crewrite-world")
(set-verify-guards-eagerness 2)
(set-case-split-limitations nil)
(set-well-founded-relation ord<)
(set-measure-function rank)
(local
(encapsulate
()
(defthm logic.strip-conclusions-of-restn
;; BOZO this seems to address some of the firstn/restn issues. Move it where it
;; belongs and try using it globally.
(equal (logic.strip-conclusions (restn n x))
(restn n (logic.strip-conclusions x))))
(in-theory (disable restn-of-logic.strip-conclusions))
(ACL2::theory-invariant (ACL2::incompatible (:rewrite logic.strip-conclusions-of-restn)
(:rewrite restn-of-logic.strip-conclusions)))
(defthm logic.strip-conclusions-of-firstn
;; BOZO this seems to address some of the firstn/restn issues. Move it where it
;; belongs and try using it globally.
(equal (logic.strip-conclusions (firstn n x))
(firstn n (logic.strip-conclusions x))))
(in-theory (disable firstn-of-logic.strip-conclusions))
(ACL2::theory-invariant (ACL2::incompatible (:rewrite logic.strip-conclusions-of-firstn)
(:rewrite firstn-of-logic.strip-conclusions)))))
(defund tactic.crewrite-first-okp (x worlds)
(declare (xargs :guard (and (tactic.skeletonp x)
(tactic.world-listp worlds))
:guard-debug t))
(let ((goals (tactic.skeleton->goals x))
(tacname (tactic.skeleton->tacname x))
(extras (tactic.skeleton->extras x))
(history (tactic.skeleton->history x)))
(and (equal tacname 'crewrite-first)
(let* ((windex (first extras))
(plan (second extras))
(world (tactic.find-world windex worlds)))
(and world
(rw.crewrite-clause-planp plan)
(rw.crewrite-clause-plan-okp plan world)
(rw.crewrite-clause-plan->progressp plan)
(let ((old-goals (tactic.skeleton->goals history))
(forced-clauses (clause.make-clauses-from-arbitrary-formulas
(rw.crewrite-clause-plan->forced-goals plan))))
(and (consp old-goals)
(equal (rw.crewrite-clause-plan->clause plan) (car old-goals))
(equal goals
(if (rw.crewrite-clause-plan->provedp plan)
(fast-app (cdr old-goals) forced-clauses)
(cons (rw.crewrite-clause-plan->clause-prime plan)
(fast-app (cdr old-goals) forced-clauses)))))))))))
(defthm booleanp-of-tactic.crewrite-first-okp
(equal (booleanp (tactic.crewrite-first-okp x worlds))
t)
:hints(("Goal" :in-theory (e/d (tactic.crewrite-first-okp)
((:executable-counterpart acl2::force))))))
(defund tactic.crewrite-first-tac (x theoryname fastp world warnp)
(declare (xargs :guard (and (tactic.skeletonp x)
(tactic.worldp world)
(booleanp warnp))))
(let* ((goals (tactic.skeleton->goals x))
(windex (tactic.world->index world))
(findtheory (lookup theoryname (tactic.world->theories world))))
(cond ((not (consp goals))
(and warnp
(ACL2::cw "~s0crewrite-first-tac failure~s1: all clauses have already been proven.~%" *red* *black*)))
((not findtheory)
(and warnp
(ACL2::cw "~s0crewrite-first-tac failure~s1: no theory named ~s2 is defined.~%" *red* *black* theoryname)))
(t
(let* ((plan (rw.make-crewrite-clause-plan (car goals) fastp theoryname world))
(progressp (rw.crewrite-clause-plan->progressp plan))
(provedp (rw.crewrite-clause-plan->provedp plan))
(fgoals (rw.crewrite-clause-plan->forced-goals plan))
(fclauses (clause.make-clauses-from-arbitrary-formulas fgoals)))
(cond ((not progressp)
(ACL2::cw "~s0crewrite-first-tac failure~s1: no progress was made.~%" *red* *black*))
(t
(tactic.extend-skeleton (if provedp
(app (cdr goals) fclauses)
(cons (rw.crewrite-clause-plan->clause-prime plan)
(app (cdr goals) fclauses)))
'crewrite-first
(list windex plan)
x))))))))
(defthm forcing-tactic.skeletonp-of-tactic.crewrite-first-tac
(implies (and (tactic.crewrite-first-tac x theoryname fastp world warnp)
(force (tactic.skeletonp x))
(force (tactic.worldp world)))
(equal (tactic.skeletonp (tactic.crewrite-first-tac x theoryname fastp world warnp))
t))
:hints(("Goal" :in-theory (enable tactic.crewrite-first-tac))))
(defthm forcing-tactic.crewrite-first-okp-of-tactic.crewrite-first-tac
(implies (and (tactic.crewrite-first-tac x theoryname fastp world warnp)
(force (tactic.worldp world))
(force (tactic.world-listp worlds))
(force (tactic.skeletonp x))
(force (equal world (tactic.find-world (tactic.world->index world) worlds))))
(equal (tactic.crewrite-first-okp
(tactic.crewrite-first-tac x theoryname fastp world warnp)
worlds)
t))
:hints(("Goal" :in-theory (enable tactic.crewrite-first-tac
tactic.crewrite-first-okp))))
(defund tactic.crewrite-first-compile (x worlds proofs)
(declare (xargs :guard (and (tactic.skeletonp x)
(tactic.world-listp worlds)
(logic.appeal-listp proofs)
(tactic.crewrite-first-okp x worlds)
(equal (clause.clause-list-formulas (tactic.skeleton->goals x))
(logic.strip-conclusions proofs)))
:verify-guards nil))
(let* ((history (tactic.skeleton->history x))
(old-goals (tactic.skeleton->goals history))
(extras (tactic.skeleton->extras x))
(windex (first extras))
(plan (second extras))
(world (tactic.find-world windex worlds))
(provedp (rw.crewrite-clause-plan->provedp plan))
(fgoals (rw.crewrite-clause-plan->forced-goals plan))
(num-old-proofs (fast-len (cdr old-goals) 0)))
(if provedp
;; We need to generate the first proof from scratch
(let* ((cdr-old-goals-proofs (firstn num-old-proofs proofs))
(forced-proofs (clause.prove-arbitrary-formulas-from-their-clauses
fgoals
(restn num-old-proofs proofs)))
(proof1 (rw.crewrite-clause-plan-compiler plan world nil forced-proofs)))
(cons proof1 cdr-old-goals-proofs))
;; We need to generate the first proof using an existing proof
(let* ((proof1-seed (car proofs))
(cdr-old-goals-proofs (firstn num-old-proofs (cdr proofs)))
(forced-proofs (clause.prove-arbitrary-formulas-from-their-clauses
fgoals
(restn num-old-proofs (cdr proofs))))
(proof1 (rw.crewrite-clause-plan-compiler plan world proof1-seed
forced-proofs)))
(cons proof1 cdr-old-goals-proofs)))))
(defobligations tactic.crewrite-first-compile
(rw.crewrite-clause-plan-compiler
clause.prove-arbitrary-formulas-from-their-clauses))
(encapsulate
()
(local (in-theory (enable tactic.crewrite-first-okp
tactic.crewrite-first-compile)))
(local (ACL2::allow-fertilize t))
(verify-guards tactic.crewrite-first-compile
:hints(("Goal" :do-not-induct t)))
(defthm forcing-logic.appeal-listp-of-tactic.crewrite-first-compile
(implies (force (and (tactic.skeletonp x)
(tactic.world-listp worlds)
(tactic.crewrite-first-okp x worlds)
(logic.appeal-listp proofs)
(equal (clause.clause-list-formulas (tactic.skeleton->goals x))
(logic.strip-conclusions proofs))))
(equal (logic.appeal-listp (tactic.crewrite-first-compile x worlds proofs))
t)))
(defthm forcing-logic.strip-conclusions-of-tactic.crewrite-first-compile
(implies (force (and (tactic.skeletonp x)
(tactic.world-listp worlds)
(tactic.crewrite-first-okp x worlds)
(logic.appeal-listp proofs)
(equal (clause.clause-list-formulas (tactic.skeleton->goals x))
(logic.strip-conclusions proofs))))
(equal (logic.strip-conclusions (tactic.crewrite-first-compile x worlds proofs))
(clause.clause-list-formulas (tactic.skeleton->goals (tactic.skeleton->history x))))))
(defthm@ forcing-logic.proof-listp-of-tactic.crewrite-first-compile
(implies (force (and (tactic.skeletonp x)
(tactic.world-listp worlds)
(tactic.crewrite-first-okp x worlds)
(logic.appeal-listp proofs)
(equal (clause.clause-list-formulas (tactic.skeleton->goals x))
(logic.strip-conclusions proofs))
;; ---
(tactic.skeleton-atblp x atbl)
(tactic.world-list-atblp worlds atbl)
(tactic.world-list-env-okp worlds axioms thms)
(equal (cdr (lookup 'if atbl)) 3)
(equal (cdr (lookup 'iff atbl)) 2)
(equal (cdr (lookup 'equal atbl)) 2)
(equal (cdr (lookup 'not atbl)) 1)
(logic.proof-listp proofs axioms thms atbl)
(@obligations tactic.crewrite-first-compile)))
(equal (logic.proof-listp (tactic.crewrite-first-compile x worlds proofs) axioms thms atbl)
t))))
|
