File: ppr1-experiments-thm-1-ppr1.lisp

package info (click to toggle)
acl2 8.6%2Bdfsg-3
  • links: PTS
  • area: main
  • in suites: sid
  • size: 1,138,276 kB
  • sloc: lisp: 17,818,294; java: 125,359; python: 28,122; javascript: 23,458; cpp: 18,851; ansic: 11,569; perl: 7,678; xml: 5,591; sh: 3,978; makefile: 3,840; ruby: 2,633; yacc: 1,126; ml: 763; awk: 295; csh: 233; lex: 197; php: 178; tcl: 49; asm: 23; haskell: 17
file content (58 lines) | stat: -rw-r--r-- 2,288 bytes parent folder | download | duplicates (2)
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
; Copyright (C) 2023, ForrestHunt, Inc.
; Written by J Strother Moore
; License: A 3-clause BSD license.  See the LICENSE file distributed with ACL2.
; Release approved by DARPA with "DISTRIBUTION STATEMENT A. Approved
; for public release. Distribution is unlimited."

; Seven Proofs that PPR1 returns a PPR-TUPLE-P
; -- the Really Slow Proof

; J Moore
; October, 2023

; This book carries out the proofs of THM-1-PPR1 and THM-1-PPR1-LST that are
; skipped in ppr1-experiments.lisp because they are so slow.  For a description
; of the entire ppr1-experiment, see

; :DOC induction-coarse-v-fine-grained

; To see how long it took inspect the .cert.out file after a certification.  In
; September, 2023, it took 2165.19 seconds running the proto-Version 8.6 in CCL
; on a MacBook Pro.

(in-package "ACL2")

(include-book "ppr1-experiments")

; -----------------------------------------------------------------
; Scenario 1

(in-theory (enable ppr1 ppr1-lst))

(defthm-coarse-induction-scheme ; coarse, enabled, :expand
  (defthm thm-1-ppr1
    (implies (and
              (unsigned-byte-p #.*small-nat-bits* width)
              (unsigned-byte-p #.*small-nat-bits* rpc)
              (symbol-to-fixnat-alistp
               (table-alist 'ppr-special-syms (w state))))
             (ppr-tuple-p (ppr1 x print-base print-radix width rpc state eviscp)))
    :flag ppr1
    :rule-classes nil)
  (defthm thm-1-ppr1-lst
    (implies (and
              (unsigned-byte-p #.*small-nat-bits* width)
              (unsigned-byte-p #.*small-nat-bits* rpc)
              (symbol-to-fixnat-alistp
               (table-alist 'ppr-special-syms (w state))))
             (ppr-tuple-lst-p (ppr1-lst lst print-base print-radix width rpc
                                        pair-keywords-p state eviscp)))
    :flag ppr1-lst
    :rule-classes nil)
  :hints (("Goal" 
           :expand ((:free (print-base print-radix width rpc state eviscp)
                           (ppr1 x print-base print-radix width rpc state eviscp))
                    (:free (print-base print-radix width rpc
                                       pair-keywords-p state eviscp)
                           (ppr1-lst lst print-base print-radix width rpc
                                     pair-keywords-p state eviscp))))))