File: depth-1.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 (136 lines) | stat: -rw-r--r-- 4,362 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
; 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 move these to utilities or wherever max is defined
(defthm max-of-nfix-left
  (equal (max (nfix a) b)
         (max a b)))

(defthm max-of-nfix-right
  (equal (max a (nfix b))
         (max a b)))

(%autoprove max-of-nfix-left)
(%autoprove max-of-nfix-right)


(%autoadmit clause.flag-depth)
(%autoadmit clause.depth)
(%autoadmit clause.depth-list)

(%autoprove definition-of-clause.depth
            (%restrict default clause.flag-depth (equal x 'x))
            (%enable default clause.depth clause.depth-list))

(%autoprove definition-of-clause.depth-list
            (%restrict default clause.flag-depth (equal x 'x))
            (%enable default clause.depth clause.depth-list))

(%autoprove clause.flag-depth-of-term
            (%enable default clause.depth))

(%autoprove clause.flag-depth-of-list
            (%enable default clause.depth-list))



(%autoprove forcing-clause.depth-of-logic.function
            (%restrict default definition-of-clause.depth (memberp x '((logic.function fn args)
                                                                       (logic.function 'if args))))
            (%forcingp nil))

(%autoprove forcing-clause.depth-of-logic.lambda
            (%restrict default definition-of-clause.depth (equal x '(logic.lambda formals body actuals)))
            (%forcingp nil))

(%autoprove clause.depth-list-when-not-consp
            (%restrict default definition-of-clause.depth-list (equal x 'x)))

(%autoprove clause.depth-list-of-cons
            (%restrict default definition-of-clause.depth-list (equal x '(cons a x))))



(%autoprove clause.depth-list-when-length-three
            (%disable default max))


(%autoprove lemma-for-natp-of-clause.depth
            (%clause.simple-term-induction flag x)
            (%restrict default definition-of-clause.depth (equal x 'x)))

(%autoprove natp-of-clause.depth
            (%use (%instance (%thm lemma-for-natp-of-clause.depth) (flag 'term))))

(%autoprove natp-of-clause.depth-list
            (%use (%instance (%thm lemma-for-natp-of-clause.depth) (flag 'list))))


(%autoprove clause.depth-list-of-list-fix
            (%cdr-induction x))

(%autoprove clause.depth-list-of-app
            (%cdr-induction x))

(%autoprove clause.depth-list-of-rev
            (%cdr-induction x))



(%autoprove lemma-for-clause.depth-zero
            (%clause.simple-term-induction flag x)
            (%restrict default definition-of-clause.depth (equal x 'x)))

(%autoprove clause.depth-zero
            (%use (%instance (%thm lemma-for-clause.depth-zero) (flag 'term))))

(%autoprove clause.depth-list-zero
            (%use (%instance (%thm lemma-for-clause.depth-zero) (flag 'list))))



(%autoprove clause.depth-when-clause.simple-termp)

(%autoprove clause.depth-list-when-clause.simple-term-listp)

(%autoprove clause.depth-positive-when-non-clause.simple-termp)

(%autoprove clause.depth-list-positive-when-non-clause.simple-term-listp)