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
|
; 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 "terms-2")
(%interactive)
(%autoadmit logic.lambdap)
(%autoadmit logic.lambda)
(%autoadmit logic.lambda-formals)
(%autoadmit logic.lambda-body)
(%autoadmit logic.lambda-actuals)
(%autoprove booleanp-of-logic.lambdap
(%enable default logic.lambdap))
(%autoprove consp-when-logic.lambdap-cheap
(%enable default logic.lambdap))
(%autoprove logic.variablep-when-logic.lambdap-cheap
(%enable default logic.lambdap logic.variablep))
(%autoprove logic.constantp-when-logic.lambdap-cheap
(%enable default logic.lambdap logic.constantp))
(%noexec logic.lambda)
(%autoprove consp-of-logic.lambda
(%enable default logic.lambda))
(%autoprove logic.lambda-under-iff
(%enable default logic.lambda))
(%autoprove logic.constantp-of-logic.lambda
(%enable default logic.lambda logic.constantp))
(%autoprove logic.variablep-of-logic.lambda
(%enable default logic.lambda logic.variablep))
(%autoprove forcing-logic.termp-of-logic.lambda
(%enable default logic.lambda)
(%restrict default definition-of-logic.termp (equal x '(cons (cons 'lambda (cons formals (cons body 'nil))) actuals)))
(%auto :strategy (cleanup split crewrite)))
(%autoprove logic.lambdap-of-logic.lambda
(%enable default logic.lambdap logic.lambda))
(%autoprove equal-of-logic.lambda-and-logic.lambda
(%enable default logic.lambda))
(%autoprove forcing-true-listp-of-logic.lambda-formals
(%enable default logic.lambdap logic.lambda-formals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-logic.variable-listp-of-logic.lambda-formals
(%enable default logic.lambdap logic.lambda-formals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-uniquep-of-logic.lambda-formals
(%enable default logic.lambdap logic.lambda-formals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove logic.lambda-formals-of-logic.lambda
(%enable default logic.lambda-formals logic.lambda))
(%autoprove forcing-logic.termp-of-logic.lambda-body
(%enable default logic.lambdap logic.lambda-body)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove logic.lambda-body-of-logic.lambda
(%enable default logic.lambda-body logic.lambda))
(%autoprove rank-of-logic.lambda-body
(%enable default logic.lambda-body))
(%autoprove forcing-subsetp-of-logic.term-vars-of-logic.lambda-body-with-logic.lambda-formals
(%enable default logic.lambdap logic.lambda-body logic.lambda-formals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-true-listp-of-logic.lambda-actuals
(%enable default logic.lambdap logic.lambda-actuals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-logic.term-listp-of-logic.lambda-actuals
(%enable default logic.lambdap logic.lambda-actuals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove logic.lambda-actuals-of-logic.lambda
(%enable default logic.lambda-actuals logic.lambda))
(%autoprove forcing-equal-lens-of-logic.lambda-formals-and-logic.lambda-actuals
(%enable default logic.lambdap logic.lambda-formals logic.lambda-actuals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-logic.lambda-of-logic.lambda-formals-body-and-actuals
(%enable default logic.lambdap logic.lambda logic.lambda-formals logic.lambda-body logic.lambda-actuals)
(%restrict default definition-of-logic.termp (equal x 'x))
(%restrict default tuplep (or (equal n ''3) (equal n ''2) (equal n ''1) (equal n ''0)))
(%betamode nil)
(%auto :strategy (cleanup split crewrite))
(%betamode once)
(%auto :strategy (cleanup split crewrite)))
(%autoprove forcing-logic.lambda-of-logic.lambda-formals-body-and-actuals-free)
(%autoprove rank-of-logic.lambda-actuals
(%enable default logic.lambda-actuals))
(%autoprove rank-of-first-of-logic.lambda-actuals
(%enable default logic.lambda-actuals))
(%autoprove rank-of-second-of-logic.lambda-actuals
(%enable default logic.lambda-actuals))
(%autoprove rank-of-third-of-logic.lambda-actuals
(%enable default logic.lambda-actuals))
(%autoprove logic.lambdap-when-consp-of-car-cheap
(%enable default logic.lambdap))
|
