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
|
; 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")
(%interactive)
;; BOZO these don't go here -- need them for compile lemmas.
;; but we apparently don't introduce them anywhere else? should we be using
;; other rules, perhaps?
(%defderiv build.disjoined-if-when-nil)
(%defderiv build.disjoined-if-when-not-nil)
(%deftheorem theorem-if-when-same)
(%defderiv build.disjoined-if-when-same)
;; </BOZO>
(%autoadmit logic.compile-formula)
(%autoprove forcing-logic.termp-of-logic.compile-formula
(%autoinduct logic.compile-formula)
(%restrict default logic.compile-formula (equal x 'x)))
(%autoprove forcing-logic.term-atblp-of-logic.compile-formula
(%autoinduct logic.compile-formula)
(%restrict default logic.compile-formula (equal x 'x)))
(%defderiv build.compile-formula-lemma-1)
(%defderiv build.compile-formula-lemma-2)
(%autoadmit build.compile-formula)
;; BOZO unlocalize+rename in clauses/compile-formula
(encapsulate
()
(local (in-theory (acl2::current-theory 'build.compile-formula)))
(defthm lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula
(implies (logic.formulap x)
(let ((result (logic.compile-formula x))
(proofs (build.compile-formula x)))
(and (logic.appealp (first proofs))
(logic.appealp (second proofs))
(equal (logic.conclusion (first proofs)) (logic.por (logic.pnot x) (logic.pequal result ''t)))
(equal (logic.conclusion (second proofs)) (logic.por x (logic.pequal result ''nil)))
)))
:rule-classes nil
:hints(("Goal"
:induct (logic.compile-formula x)
:in-theory (enable logic.compile-formula
build.compile-formula
axiom-equal-when-same
axiom-equal-when-diff)))))
(%autoprove lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula
(%autoinduct logic.compile-formula)
(%disable default
type-set-like-rules
expensive-term/formula-inference
formula-decomposition
expensive-arithmetic-rules
expensive-arithmetic-rules-two)
(%auto)
(%restrict default logic.compile-formula (equal x 'x))
(%restrict default build.compile-formula (equal a 'x))
(%enable default
axiom-equal-when-same
axiom-equal-when-diff)
(%auto)
(%enable default formula-decomposition))
(%autoprove forcing-logic.appealp-of-first-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula))))
(%autoprove forcing-logic.appealp-of-second-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula))))
(%autoprove forcing-logic.conclusion-of-first-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula))))
(%autoprove forcing-logic.conclusion-of-second-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.appealp-of-first-of-build.compile-formula))))
;; BOZO unlocalize+rename in clauses/compile-formula
;; NOTE: need to add rule-classes nil, also
(encapsulate
()
(local (in-theory (acl2::current-theory 'forcing-logic.proofp-of-first-of-build.compile-formula)))
(defthm@ lemma-for-forcing-logic.proofp-of-first-of-build.compile-formula
(implies (and (logic.formulap x)
(logic.formula-atblp x atbl)
(equal (cdr (lookup 'equal atbl)) 2)
(equal (cdr (lookup 'if atbl)) 3)
(@obligations build.compile-formula))
(and (logic.proofp (first (build.compile-formula x)) axioms thms atbl)
(logic.proofp (second (build.compile-formula x)) axioms thms atbl)))
:rule-classes nil
:hints(("Goal" :in-theory (enable build.compile-formula
logic.compile-formula
axiom-equal-when-same
axiom-equal-when-diff)))))
(%autoprove lemma-for-forcing-logic.proofp-of-first-of-build.compile-formula
(%autoinduct logic.compile-formula)
(%disable default
type-set-like-rules
expensive-term/formula-inference
formula-decomposition
expensive-arithmetic-rules
expensive-arithmetic-rules-two)
(%auto :strategy (cleanup split urewrite crewrite))
(%restrict default logic.compile-formula (equal x 'x))
(%restrict default build.compile-formula (equal a 'x))
(%enable default
axiom-equal-when-same
axiom-equal-when-diff)
(%auto))
(%autoprove forcing-logic.proofp-of-first-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.proofp-of-first-of-build.compile-formula))))
(%autoprove forcing-logic.proofp-of-second-of-build.compile-formula
(%use (%instance (%thm lemma-for-forcing-logic.proofp-of-first-of-build.compile-formula))))
(%defprojection
:list (logic.compile-formula-list x)
:element (logic.compile-formula x)
:nil-preservingp t)
(%autoprove forcing-logic.term-listp-of-logic.compile-formula-list
(%cdr-induction x))
(%autoprove forcing-logic.term-list-atblp-of-logic.compile-formula-list
(%cdr-induction x))
(%autoadmit build.compile-formula-list-comm-2)
(%autoprove len-of-build.compile-formula-list-comm-2
(%cdr-induction x)
(%restrict default build.compile-formula-list-comm-2 (equal x 'x)))
(%autoprove logic.appeal-listp-of-build.compile-formula-list-comm-2
(%cdr-induction x)
(%restrict default build.compile-formula-list-comm-2 (equal x 'x)))
(%autoprove logic.strip-conclusions-of-logic.compile-formula-list-bldr3
;; BOZO misnamed
(%cdr-induction x)
(%restrict default build.compile-formula-list-comm-2 (equal x 'x)))
(%autoprove logic.proof-listp-of-build.compile-formula-list-comm-2
(%cdr-induction x)
(%restrict default build.compile-formula-list-comm-2 (equal x 'x)))
(%ensure-exactly-these-rules-are-missing "../../build/formula-compiler")
|
