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
|
; 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 "term-tests")
(%interactive)
;; (clause.term-paths x)
;;
;; We walk down the term and create lists of all the if expressions we
;; encounter along the way. I.e., these paths show you each set of choices you
;; would need to make in order to get to every tip of a term.
(%autoadmit clause.flag-term-paths)
(%autoadmit clause.term-paths)
(%autoadmit clause.term-paths-list)
(%autoprove definition-of-clause.term-paths
(%restrict default clause.flag-term-paths (equal x 'x))
(%enable default clause.term-paths clause.term-paths-list))
(%autoprove definition-of-clause.term-paths-list
(%restrict default clause.flag-term-paths (equal x 'x))
(%enable default clause.term-paths clause.term-paths-list))
(%autoprove clause.flag-term-paths-of-term-removal
(%enable default clause.term-paths))
(%autoprove clause.flag-term-paths-of-list-removal
(%enable default clause.term-paths-list))
(%autoprove clause.term-paths-when-logic.constantp
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-logic.variablep
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-non-if-logic.functionp
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-bad-args-logic.functionp
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-if-logic.functionp
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-logic.lambdap
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-when-degenerate
(%restrict default definition-of-clause.term-paths (equal x 'x)))
(%autoprove clause.term-paths-list-when-not-consp
(%restrict default definition-of-clause.term-paths-list (equal x 'x)))
(%autoprove clause.term-paths-list-of-cons
(%restrict default definition-of-clause.term-paths-list (equal x '(cons a x))))
(%autoprove clause.term-paths-list-when-len-three)
(%create-theory clause.term-paths-openers)
(%enable clause.term-paths-openers
clause.term-paths-when-logic.constantp
clause.term-paths-when-logic.variablep
clause.term-paths-when-non-if-logic.functionp
clause.term-paths-when-bad-args-logic.functionp
clause.term-paths-when-if-logic.functionp
clause.term-paths-when-logic.lambdap
clause.term-paths-when-degenerate
clause.term-paths-list-when-not-consp
clause.term-paths-list-of-cons
clause.term-paths-list-when-len-three)
(%autoprove lemma-for-clause.term-paths-when-clause.simple-termp
(%clause.simple-term-induction flag x))
(%autoprove clause.term-paths-when-clause.simple-termp
(%use (%instance (%thm lemma-for-clause.term-paths-when-clause.simple-termp)
(flag 'term))))
(%autoprove clause.term-paths-list-when-clause.simple-term-listp
(%use (%instance (%thm lemma-for-clause.term-paths-when-clause.simple-termp)
(flag 'list))))
(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-subsetp-rules
unusual-memberp-rules
unusual-consp-rules
usual-consp-rules
same-length-prefixes-equal-cheap
clause.term-paths-openers
subsetp-when-not-consp-two
subsetp-when-not-consp
app-when-not-consp-two
app-when-not-consp
logic.term-list-listp-when-not-consp
clause.simple-term-listp-of-cdr-when-clause.simple-term-listp
logic.term-listp-when-subset-of-somep-alt
logic.term-list-listp-when-all-superset-of-somep-alt))
(%autoprove lemma-for-forcing-logic.term-list-listp-of-clause.term-paths
(%clause.simple-term-induction flag x)
(%disable default common-disables)
(%auto)
(%enable default
clause.term-paths-openers
unusual-consp-rules))
(%autoprove forcing-logic.term-list-listp-of-clause.term-paths
(%use (%instance (%thm lemma-for-forcing-logic.term-list-listp-of-clause.term-paths)
(flag 'term))))
(%autoprove forcing-logic.term-list-listp-of-clause.term-paths-list
(%use (%instance (%thm lemma-for-forcing-logic.term-list-listp-of-clause.term-paths)
(flag 'list))))
(%autoprove lemma-for-forcing-consp-of-clause.term-paths
(%clause.simple-term-induction flag x)
(%disable default common-disables)
(%auto)
(%enable default
clause.term-paths-openers
unusual-consp-rules))
(%autoprove forcing-consp-of-clause.term-paths
(%use (%instance (%thm lemma-for-forcing-consp-of-clause.term-paths)
(flag 'term))))
(%autoprove forcing-consp-of-clause.term-paths-list
(%use (%instance (%thm lemma-for-forcing-consp-of-clause.term-paths)
(flag 'list))))
(%autoprove disjoint-from-nonep-of-clause.term-paths-when-memberp
(%cdr-induction x)
(%disable default common-disables))
(%autoprove lemma-for-disjoint-from-nonep-of-clause.simple-tests-and-clause.term-paths
(%clause.simple-term-induction flag x)
(%disable default common-disables)
(%auto)
(%enable default
clause.term-paths-openers
unusual-consp-rules))
(%autoprove disjoint-from-nonep-of-clause.simple-tests-and-clause.term-paths
(%use (%instance (%thm lemma-for-disjoint-from-nonep-of-clause.simple-tests-and-clause.term-paths)
(flag 'term))))
(%autoprove disjoint-from-nonep-of-clause.simple-tests-list-and-clause.term-paths-list
(%use (%instance (%thm lemma-for-disjoint-from-nonep-of-clause.simple-tests-and-clause.term-paths)
(flag 'list))))
|
