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
|
; RP-REWRITER
; Noe: The license below is based on the template at:
; http://opensource.org/licenses/BSD-3-Clause
; Copyright (C) 2019 Regents of the University of Texas
; All rights reserved.
; Redistribution and use in source and binary forms, with or without
; modification, are permitted provided that the following conditions are
; met:
; o Redistributions of source code must retain the above copyright
; notice, this list of conditions and the following disclaimer.
; o Redistributions in binary form must reproduce the above copyright
; notice, this list of conditions and the following disclaimer in the
; documentation and/or other materials provided with the distribution.
; o Neither the name of the copyright holders nor the names of its
; contributors may be used to endorse or promote products derived
; from this software without specific prior written permission.
; THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
; "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
; LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
; A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
; HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
; SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
; LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
; DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
; THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
; (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
; OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
; Original Author(s):
; Mertcan Temel <mert@utexas.edu>
(in-package "RP")
(include-book "aux-functions")
(include-book "extract-formula")
(include-book "misc")
(encapsulate
nil
(defthm dont-rw-syntaxp-aux-cons
(equal (dont-rw-syntaxp-aux (cons a b))
(AND (OR (atom a)
; (strict-quotep a)
(DONT-RW-SYNTAXP-AUX a))
(DONT-RW-SYNTAXP-AUX b))))
(defthm dont-rw-syntaxp-cons
(equal (dont-rw-syntaxp (cons a b))
(or nil;(strict-quotep (cons a b))
(AND (OR (atom a)
;(strict-quotep a)
(DONT-RW-SYNTAXP-AUX a))
(DONT-RW-SYNTAXP-AUX b))))
:hints (("Goal"
:in-theory (e/d (dont-rw-syntaxp) ())))))
(def-rp-rule make-fast-alist-def
(and (equal (make-fast-alist (cons (cons x y) rest))
(hons-acons x y
(make-fast-alist rest)))
(equal (make-fast-alist nil)
nil)))
(def-rp-rule make-fast-alist-when-already-fast-alist
(implies (syntaxp (and (consp term)
(equal (car term) 'falist)))
(equal (make-fast-alist term)
term)))
(def-rp-rule len-cons
(equal (len (cons a b))
(+ 1 (len b))))
(def-rp-rule atom-cons
(equal (atom (cons a b))
nil))
(def-rp-rule consp-cons
(consp (cons a b)))
(def-rp-rule equal-to-t
(equal (equal a a)
't))
(def-rp-rule boolean-listp-is-booleanp
(booleanp (boolean-listp a))
:hints (("goal"
:in-theory (enable boolean-listp))))
;; add definitions from minimal theory.
(add-rp-rule car-cons)
(add-rp-rule cdr-cons)
(add-rp-rule return-last)
(add-rp-rule mv-nth)
(add-rp-rule the-check)
(add-rp-rule cons-with-hint)
(add-rp-rule iff)
(add-rp-rule wormhole-eval)
(add-rp-rule mv-list)
(add-rp-rule minusp)
(add-rp-rule plusp)
(add-rp-rule zerop)
(add-rp-rule listp)
(add-rp-rule case-split)
(add-rp-rule force)
(add-rp-rule /=)
(add-rp-rule =)
(add-rp-rule atom)
(add-rp-rule null)
(add-rp-rule endp)
(add-rp-rule eql)
(add-rp-rule not :rw-direction :outside-in)
;;(add-rp-rule implies :rw-direction :outside-in)
(add-rp-rule eq)
(add-rp-rule eql)
(add-rp-rule cons-equal)
(add-rp-rule acons)
(add-rp-rule acl2::apply$-primitive)
(rp::disable-rules '((:e APPLY$)))
(def-rp-rule append-of-nil
(equal (append nil x)
x))
#|(def-rp-rule$ t nil
force-fail
(implies
(hard-error
'force-fail
"The below term could not be reduced to 't.
If you want to look at the stack, you can try using
(rp::update-rp-brr t rp::rp-state) and
(rp::pp-rw-stack :omit '()
:evisc-tuple (evisc-tuple 10 12 nil nil)
:frames 50).
Forced term was:~% ~p0 ~% "
(list (cons #\0 forced-term)))
(equal (force forced-term) t))
:hints (("goal"
:in-theory '(return-last hard-error hide))))||#
(def-rp-rule :disabled-for-acl2 t
force$-fail
(implies
(hard-error
'force-fail
"The below term could not be reduced to 't.
If you want to look at the stack, you can enable and view it with
(rp::update-rp-brr t rp::rp-state) and
(rp::pp-rw-stack :omit '()
:evisc-tuple (evisc-tuple 10 12 nil nil)
:frames 50).
This was caused by the rule: ~p0
On the hypothesis: ~p1
Forced term is ~p2 ~% "
(list (cons #\0 rule)
(cons #\1 hyp)
(cons #\2 forced-term)))
(equal (force$ forced-term rule hyp) t))
:hints (("goal"
:in-theory '(return-last hard-error hide))))
(disable-exc-counterpart force$)
(def-rp-rule force$-of-t
(equal (force$ t rule-name hyp)
t))
(defthm return-last-from-mbe
(equal (return-last 'acl2::mbe1-raw x y)
y)
:rule-classes nil)
(add-rp-rule return-last-from-mbe :rw-direction :outside-in)
(add-rp-rule acl2::throw-nonexec-error :rw-direction :outside-in)
(add-rp-rule fmt-to-comment-window)
|
