File: level7.lisp

package info (click to toggle)
acl2 8.5dfsg-5
  • links: PTS
  • area: main
  • in suites: bookworm
  • size: 991,452 kB
  • sloc: lisp: 15,567,759; javascript: 22,820; cpp: 13,929; ansic: 12,092; perl: 7,150; java: 4,405; xml: 3,884; makefile: 3,507; sh: 3,187; ruby: 2,633; ml: 763; python: 746; yacc: 723; awk: 295; csh: 186; php: 171; lex: 154; tcl: 49; asm: 23; haskell: 17
file content (160 lines) | stat: -rw-r--r-- 6,466 bytes parent folder | download | duplicates (8)
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
; 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 "split-bldr")
(%interactive)

(%autoadmit level7.step-okp)

(encapsulate
 ()
 (local (%enable default level7.step-okp))
 (%autoprove soundness-of-level7.step-okp)
 (%autoprove level7.step-okp-when-level6.step-okp
             (%forcingp nil)
             (%enable default level6.step-okp)
             (%auto)
             (%enable default level5.step-okp)
             (%auto)
             (%enable default level4.step-okp)
             (%auto)
             (%enable default level3.step-okp)
             (%auto)
             (%enable default level2.step-okp)
             (%auto)
             (%enable default logic.appeal-step-okp))
 (%autoprove level7.step-okp-when-not-consp
             (%enable default logic.method)))

(encapsulate
 ()
 (local (%disable default forcing-true-listp-of-logic.subproofs))
 (%autoadmit level7.flag-proofp-aux))

(%autoadmit level7.proofp-aux)
(%autoadmit level7.proof-listp-aux)
(%autoprove definition-of-level7.proofp-aux
            (%enable default level7.proofp-aux level7.proof-listp-aux)
            (%restrict default level7.flag-proofp-aux (equal x 'x)))
(%autoprove definition-of-level7.proof-listp-aux
            (%enable default level7.proofp-aux level7.proof-listp-aux)
            (%restrict default level7.flag-proofp-aux (equal x 'x)))


(%autoprove level7.proofp-aux-when-not-consp      (%restrict default definition-of-level7.proofp-aux (equal x 'x)))
(%autoprove level7.proof-listp-aux-when-not-consp (%restrict default definition-of-level7.proof-listp-aux (equal x 'x)))
(%autoprove level7.proof-listp-aux-of-cons        (%restrict default definition-of-level7.proof-listp-aux (equal x '(cons a x))))

(%autoprove lemma-for-booleanp-of-level7.proofp-aux
            (%logic.appeal-induction flag x)
            (%disable default forcing-true-listp-of-logic.subproofs)
            (%auto)
            (%restrict default definition-of-level7.proofp-aux (equal x 'x)))

(%autoprove booleanp-of-level7.proofp-aux      (%use (%instance (%thm lemma-for-booleanp-of-level7.proofp-aux) (flag 'proof))))
(%autoprove booleanp-of-level7.proof-listp-aux (%use (%instance (%thm lemma-for-booleanp-of-level7.proofp-aux) (flag 'list))))


(%deflist level7.proof-listp-aux (x axioms thms atbl)
          (level7.proofp-aux x axioms thms atbl))

(%autoprove lemma-for-logic.provablep-when-level7.proofp-aux
            (%logic.appeal-induction flag x)
            (%disable default forcing-true-listp-of-logic.subproofs)
            (%urewrite default)
            (%auto :strategy (cleanup split urewrite))
            (%restrict default definition-of-level7.proofp-aux (equal x 'x))
            (%auto :strategy (cleanup split urewrite))
            (%disable default
                      ;; so many memberp terms that these get expensive
                      memberp-when-memberp-of-cdr
                      memberp-when-not-subset-of-somep-cheap
                      memberp-when-not-superset-of-somep-cheap
                      type-set-like-rules
                      same-length-prefixes-equal-cheap
                      logic.provable-listp-of-logic.strip-conclusions-when-provable-first-and-rest))

(%autoprove logic.provablep-when-level7.proofp-aux
            (%use (%instance (%thm lemma-for-logic.provablep-when-level7.proofp-aux) (flag 'proof))))

(%autoprove logic.provable-listp-when-level7.proof-listp-aux
            (%use (%instance (%thm lemma-for-logic.provablep-when-level7.proofp-aux) (flag 'list))))



(%autoprove lemma-for-level7.proofp-aux-when-logic.proofp
            (%logic.appeal-induction flag x)
            (%disable default forcing-true-listp-of-logic.subproofs)
            (%auto)
            (%restrict default definition-of-level7.proofp-aux (equal x 'x))
            (%restrict default definition-of-logic.proofp (equal x 'x)))

(%autoprove level7.proofp-aux-when-logic.proofp
            (%use (%instance (%thm lemma-for-level7.proofp-aux-when-logic.proofp) (flag 'proof))))

(%autoprove level7.proof-listp-aux-when-logic.proof-listp
            (%use (%instance (%thm lemma-for-level7.proofp-aux-when-logic.proofp) (flag 'list))))

(%autoprove forcing-level7.proofp-aux-of-logic.provable-witness
            (%enable default level7.proofp-aux-when-logic.proofp))



(%autoadmit level7.proofp)
(%autoprove booleanp-of-level7.proofp
            (%enable default level7.proofp))
(%autoprove logic.provablep-when-level7.proofp
            (%enable default level7.proofp))


(defsection level7-transition
  (%install-new-proofp level7.proofp)
  (%auto)
  (%qed-install))


(%switch-builder clause.split-bldr clause.split-bldr-high)

;; And now that cleanup is folded into splitting and is "free", we don't have to worry
;; about how much splitting we do, really.  We still limit lifting, just because the
;; lifting operation gets very slow after this point.
(%splitlimit 0)
(%liftlimit 10)



(%finish "level7")
(%save-events "level7.events")

;; Clear out the thmfiles table since we'll use the saved image from now on.
(ACL2::table tactic-harness 'thmfiles nil)