this derivation will be built:
  /nix/store/ax7kw0yaadgx98alhxw51ab6fgvcfhm4-acl2-8.5.drv
building '/nix/store/ax7kw0yaadgx98alhxw51ab6fgvcfhm4-acl2-8.5.drv'
acl2-8.5> unpacking sources
acl2-8.5> unpacking source archive /nix/store/p84v26phjpcynf9bqlkvy4sifw7kfani-source
acl2-8.5> source root is source
acl2-8.5> patching sources
acl2-8.5> applying patch /nix/store/0vygxlkih6j61rj3nwj230brx56b1lbl-0001-Fix-some-paths-for-Nix-build.patch
acl2-8.5> patching file books/build/features.sh
acl2-8.5> patching file books/centaur/ipasir/load-ipasir-sharedlib-raw.lsp
acl2-8.5> patching file books/quicklisp/bundle/software/cl+ssl-20220707-git/src/reload.lisp
acl2-8.5> configuring
acl2-8.5> no configure script, doing nothing
acl2-8.5> building
acl2-8.5> build flags: -j48 SHELL=/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash LISP=/nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl ACL2_MAKE_LOG=NONE
acl2-8.5> make full init
acl2-8.5> make[1]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make acl2r
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f TAGS
acl2-8.5> rm -f workxxx
acl2-8.5> echo '(load "init.lisp")' > workxxx
acl2-8.5> echo '(acl2::make-tags)' >> workxxx
acl2-8.5> echo '(acl2::exit-lisp)' >> workxxx
acl2-8.5> /nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl < workxxx
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> * T
acl2-8.5> * which: no etags in (/nix/store/g2nfbpind37b3v3y6zbszmcgfmrj5v7x-patchelf-0.15.0/bin:/nix/store/wn31i3dzwahz6ccws8bs1nwyqrpgsvj7-gcc-wrapper-11.3.0/bin:/nix/store/sxdx80lmk4zkhb51f4x5dgqvxgmx55wl-gcc-11.3.0/bin:/nix/store/s7ip867mrpnnjlppbnxlcsq10gv13x2x-glibc-2.35-224-bin/bin:/nix/store/h8gvq6r4hgpa71h44dmg9qfx03mj81sv-coreutils-9.1/bin:/nix/store/62fb427ncxaaksa2k59rhbilfg68v20x-binutils-wrapper-2.39/bin:/nix/store/frh9l9nrdysasdi2gs7i241s241ngjw2-binutils-2.39/bin:/nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin:/nix/store/kzw8jpmwjwldkzkf2sha1brg8l19rqh5-which-2.21/bin:/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin:/nix/store/cr4h0vgl6824qqgq8jn021viqchk7ml9-hostname-net-tools-2.10/bin:/nix/store/y9vspi10jhfy13mi3ldznn4c6bmfk2wy-glucose-4.1/bin:/nix/store/h9i8jhmikbz7lwhbk3l9b1kf3mflpgal-minisat-2.2.1/bin:/nix/store/ry7qzs416zk7gc1khqgd0pgilb7pd9n2-abc-verifier-unstable-2022-11-09/bin:/nix/store/al6g1zbk8li6p8mcyp0h60d08jaahf8c-python3-3.10.9/bin:/nix/store/i2zh6pq9zajbfz0dg548mhrj5z12mdvl-z3-4.8.15/bin:/nix/store/yij2m7r5hfbfglywfsbcf2d14gkynwk3-python3-3.10.9-env/bin:/nix/store/h8gvq6r4hgpa71h44dmg9qfx03mj81sv-coreutils-9.1/bin:/nix/store/zml88vnkpm8if114qkbbqd1q7n3ypqqy-findutils-4.9.0/bin:/nix/store/49y3r0gr9m6k20d91kl6dgp4b9a6m72v-diffutils-3.8/bin:/nix/store/5dv5cq1lwvsijr9p16p2kp79g1dbajk3-gnused-4.8/bin:/nix/store/bcvccw6y9bfil6xrl5j7psza7hnd16ry-gnugrep-3.7/bin:/nix/store/l1fp0hyca54xbb85vfhppd16bskzx8dg-gawk-5.1.1/bin:/nix/store/89zbjdkb48ma61k76l2mzn3s0ra0wn2c-gnutar-1.34/bin:/nix/store/qs8qb1swpivkfq7i9yd52n0mw6z4ij81-gzip-1.12/bin:/nix/store/wwkyfg8b34xy16zzc9p6rkh59p4q37qx-bzip2-1.0.8-bin/bin:/nix/store/i0x4pzj96qwvkrm94317l6jbi53a2rdj-gnumake-4.4/bin:/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin:/nix/store/793iwfbjvg7wgpqq7r83a1qjl1yg02sf-patch-2.7.6/bin:/nix/store/a3mwv26f99ycsv9w6hrx0jjjjywvcb1n-xz-5.2.9-bin/bin:/nix/store/camlh5laf1wsklghk0vcaw7gvx4rpzd1-file-5.43/bin)
acl2-8.5> SKIPPING etags: No such program is in the path.
acl2-8.5> 1
acl2-8.5> * rm -f workxxx
acl2-8.5> if [ -f TAGS ] ; then chmod 644 TAGS ; fi
acl2-8.5> make compile
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f workxxx
acl2-8.5> echo '(load "init.lisp")' > workxxx
acl2-8.5> echo '(acl2::compile-acl2 )' >> workxxx
acl2-8.5> echo '(acl2::exit-lisp)' >> workxxx
acl2-8.5> /nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl < workxxx
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> * T
acl2-8.5> * Check completed.
acl2-8.5> NIL
acl2-8.5> * make[3]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make[3]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f acl2-proclaims.lisp
acl2-8.5> make acl2-proclaims.lisp
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f acl2-proclaims.lisp
acl2-8.5> rm -f workxxx
acl2-8.5> rm -f worklispext
acl2-8.5> echo '(load "init.lisp")' > workxxx
acl2-8.5> echo '(in-package "ACL2")' >> workxxx
acl2-8.5> echo '(generate-acl2-proclaims)' >> workxxx
acl2-8.5> echo '(exit-lisp)' >> workxxx
acl2-8.5> /nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl < workxxx
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> * T
acl2-8.5> * #<PACKAGE "ACL2">
acl2-8.5> * NIL
acl2-8.5> * [ -f acl2-proclaims.lisp ]
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make compile USE_ACL2_PROCLAIMS=t
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f workxxx
acl2-8.5> echo '(load "init.lisp")' > workxxx
acl2-8.5> echo '(acl2::compile-acl2 t)' >> workxxx
acl2-8.5> echo '(acl2::exit-lisp)' >> workxxx
acl2-8.5> /nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl < workxxx
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> * T
acl2-8.5> * NIL
acl2-8.5> * make[3]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make[3]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f workxxx
acl2-8.5> rm -f worklispext
acl2-8.5> echo -n "" >> osaved_acl2
acl2-8.5> rm -f osaved_acl2
acl2-8.5> echo '(load "init.lisp")' > workxxx
acl2-8.5> echo '(in-package "ACL2")' >> workxxx
acl2-8.5> echo '(save-acl2 (quote (initialize-acl2 (quote include-book))) "saved_acl2")' >> workxxx
acl2-8.5> echo '(exit-lisp)' >> workxxx
acl2-8.5> /nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl < workxxx
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> * T
acl2-8.5> * #<PACKAGE "ACL2">
acl2-8.5> * ; Note: pushing :RDTSC onto *features*.
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
acl2-8.5>             '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
acl2-8.5>                                 &AUX *PRINT-PPRINT-DISPATCH*
acl2-8.5>                                 &BODY *PRINT-PRETTY* &ENVIRONMENT ...))
acl2-8.5>   (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
acl2-8.5>             '(* ** *** *BREAK-ON-SIGNALS*
acl2-8.5>                 *COMPILE-FILE-PATHNAME*
acl2-8.5>                 *COMPILE-FILE-TRUENAME*
acl2-8.5>                 *COMPILE-PRINT* ...))
acl2-8.5>   (DEFCONST NIL 'NIL)
acl2-8.5>   (DEFCONST T 'T)
acl2-8.5>   (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
acl2-8.5>   (DEFMACRO MAKE-PACKAGE-ENTRY
acl2-8.5>             (&KEY NAME IMPORTS HIDDEN-P
acl2-8.5>                   BOOK-PATH DEFPKG-EVENT-FORM TTERM)
acl2-8.5>             (CONS 'LIST* (CONS NAME #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
acl2-8.5>  *COMMON-LISP-SPECIALS-AND-CONSTANTS*
acl2-8.5>  NIL
acl2-8.5>  T
acl2-8.5>  *STOBJ-INLINE-DECLARE*
acl2-8.5>  MAKE-PACKAGE-ENTRY
acl2-8.5>  FIND-PACKAGE-ENTRY
acl2-8.5>  PACKAGE-ENTRY-NAME
acl2-8.5>  PACKAGE-ENTRY-IMPORTS
acl2-8.5>  PACKAGE-ENTRY-HIDDEN-P
acl2-8.5>  PACKAGE-ENTRY-BOOK-PATH
acl2-8.5>  PACKAGE-ENTRY-DEFPKG-EVENT-FORM
acl2-8.5>  PACKAGE-ENTRY-TTERM
acl2-8.5>  FIND-NON-HIDDEN-PACKAGE-ENTRY
acl2-8.5>  REMOVE-PACKAGE-ENTRY
acl2-8.5>  CHANGE-PACKAGE-ENTRY-HIDDEN-P
acl2-8.5>  GETPROP
acl2-8.5>  GETPROPC
acl2-8.5>  *STANDARD-CO*
acl2-8.5>  *STANDARD-OI*
acl2-8.5>  *STANDARD-CI*
acl2-8.5>  INSIST
acl2-8.5>  IFF
acl2-8.5>  XOR
acl2-8.5>  EQ
acl2-8.5>  BOOLEANP
acl2-8.5>  NIL
acl2-8.5>  IMPLIES
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NOT
acl2-8.5>  NIL
acl2-8.5>  HIDE
acl2-8.5>  REWRITE-EQUIV
acl2-8.5>  REAL/RATIONALP
acl2-8.5>  COMPLEX/COMPLEX-RATIONALP
acl2-8.5>  TRUE-LISTP
acl2-8.5>  LIST-MACRO
acl2-8.5>  LIST
acl2-8.5>  AND-MACRO
acl2-8.5>  AND
acl2-8.5>  OR-MACRO
acl2-8.5>  OR
acl2-8.5>  -
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  INTEGER-ABS
acl2-8.5>  XXXJOIN
acl2-8.5>  +
acl2-8.5>  LEN
acl2-8.5>  LENGTH
acl2-8.5>  ACL2-COUNT
acl2-8.5>  LEN
acl2-8.5>  LENGTH
acl2-8.5>  ACL2-COUNT
acl2-8.5>  COND-CLAUSESP
acl2-8.5>  COND-MACRO
acl2-8.5>  COND
acl2-8.5>  EQLABLEP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  EQLABLE-LISTP
acl2-8.5>  EQL
acl2-8.5>  ATOM
acl2-8.5>  MAKE-CHARACTER-LIST
acl2-8.5>  EQLABLE-ALISTP
acl2-8.5>  ALISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ACONS
acl2-8.5>  ENDP
acl2-8.5>  CAAR
acl2-8.5>  CADR
acl2-8.5>  CDAR
acl2-8.5>  CDDR
acl2-8.5>  CAAAR
acl2-8.5>  CAADR
acl2-8.5>  CADAR
acl2-8.5>  CADDR
acl2-8.5>  CDAAR
acl2-8.5>  CDADR
acl2-8.5>  CDDAR
acl2-8.5>  CDDDR
acl2-8.5>  CAAAAR
acl2-8.5>  CAAADR
acl2-8.5>  CAADAR
acl2-8.5>  CAADDR
acl2-8.5>  CADAAR
acl2-8.5>  CADADR
acl2-8.5>  CADDAR
acl2-8.5>  CADDDR
acl2-8.5>  CDAAAR
acl2-8.5>  CDAADR
acl2-8.5>  CDADAR
acl2-8.5>  CDADDR
acl2-8.5>  CDDAAR
acl2-8.5>  CDDADR
acl2-8.5>  CDDDAR
acl2-8.5>  CDDDDR
acl2-8.5>  NULL
acl2-8.5>  SYMBOL-LISTP
acl2-8.5>  NIL
acl2-8.5>  SYMBOL-DOUBLET-LISTP
acl2-8.5>  REVERSE-STRIP-CARS
acl2-8.5>  STRIP-CARS
acl2-8.5>  REVERSE-STRIP-CDRS
acl2-8.5>  STRIP-CDRS
acl2-8.5>  HARD-ERROR
acl2-8.5>  ILLEGAL
acl2-8.5>  RETURN-LAST
acl2-8.5>  RETURN-LAST-FN
acl2-8.5>  MBE1
acl2-8.5>  MUST-BE-EQUAL
acl2-8.5>  MBE
acl2-8.5>  MBT
acl2-8.5>  MBT*
acl2-8.5>  BINARY-APPEND
acl2-8.5>  APPEND
acl2-8.5>  NIL
acl2-8.5>  CAR-CDR-ELIM
acl2-8.5>  CAR-CONS
acl2-8.5>  CDR-CONS
acl2-8.5>  CONS-EQUAL
acl2-8.5>  NIL
acl2-8.5>  CONCATENATE
acl2-8.5>  STRING-APPEND
acl2-8.5>  STRING-LISTP
acl2-8.5>  STRING-APPEND-LST
acl2-8.5>  GUARD-CHECK-FN
acl2-8.5>  LET-MBE-GUARD-FORM
acl2-8.5>  LET-MBE
acl2-8.5>  DEFUN-WITH-GUARD-CHECK
acl2-8.5>  PROG2$
acl2-8.5>  MEMBER-EQ-EXEC
acl2-8.5>  MEMBER-EQL-EXEC
acl2-8.5>  MEMBER-EQUAL
acl2-8.5>  MEMBER-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MEMBER
acl2-8.5>  SUBSETP-EQ-EXEC
acl2-8.5>  SUBSETP-EQL-EXEC
acl2-8.5>  SUBSETP-EQUAL
acl2-8.5>  SUBSETP-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SUBSETP
acl2-8.5>  SYMBOL-ALISTP
acl2-8.5>  NIL
acl2-8.5>  CHARACTER-ALISTP
acl2-8.5>  NIL
acl2-8.5>  ASSOC-EQ-EXEC
acl2-8.5>  ASSOC-EQL-EXEC
acl2-8.5>  ASSOC-EQUAL
acl2-8.5>  ASSOC-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ASSOC
acl2-8.5>  ASSOC-EQ-EQUAL-ALISTP
acl2-8.5>  ASSOC-EQ-SAFE
acl2-8.5>  ASSOC-EQ-EQUAL
acl2-8.5>  ASSOC-EQ-CADR
acl2-8.5>  ASSOC-EQUAL-CADR
acl2-8.5>  <=
acl2-8.5>  =
acl2-8.5>  /=
acl2-8.5>  >
acl2-8.5>  >=
acl2-8.5>  INT=
acl2-8.5>  ZP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ZIP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NTH
acl2-8.5>  CHAR
acl2-8.5>  SLEEP
acl2-8.5>  PROPER-CONSP
acl2-8.5>  IMPROPER-CONSP
acl2-8.5>  *
acl2-8.5>  NONNEGATIVE-PRODUCT
acl2-8.5>  CONJUGATE
acl2-8.5>  ADD-SUFFIX
acl2-8.5>  *INLINE-SUFFIX*
acl2-8.5>  EC-CALL1
acl2-8.5>  EC-CALL
acl2-8.5>  NON-EXEC
acl2-8.5>  /
acl2-8.5>  CLOSURE
acl2-8.5>  ASSOCIATIVITY-OF-+
acl2-8.5>  COMMUTATIVITY-OF-+
acl2-8.5>  FIX
acl2-8.5>  UNICITY-OF-0
acl2-8.5>  INVERSE-OF-+
acl2-8.5>  ASSOCIATIVITY-OF-*
acl2-8.5>  COMMUTATIVITY-OF-*
acl2-8.5>  UNICITY-OF-1
acl2-8.5>  INVERSE-OF-*
acl2-8.5>  DISTRIBUTIVITY
acl2-8.5>  <-ON-OTHERS
acl2-8.5>  ZERO
acl2-8.5>  TRICHOTOMY
acl2-8.5>  POSITIVE
acl2-8.5>  RATIONAL-IMPLIES1
acl2-8.5>  RATIONAL-IMPLIES2
acl2-8.5>  INTEGER-IMPLIES-RATIONAL
acl2-8.5>  COMPLEX-IMPLIES1
acl2-8.5>  COMPLEX-DEFINITION
acl2-8.5>  NIL
acl2-8.5>  NONZERO-IMAGPART
acl2-8.5>  REALPART-IMAGPART-ELIM
acl2-8.5>  REALPART-COMPLEX
acl2-8.5>  IMAGPART-COMPLEX
acl2-8.5>  NIL
acl2-8.5>  FORCE
acl2-8.5>  *FORCE-XNUME*
acl2-8.5>  IMMEDIATE-FORCE-MODEP
acl2-8.5>  *IMMEDIATE-FORCE-MODEP-XNUME*
acl2-8.5>  CASE-SPLIT
acl2-8.5>  NIL
acl2-8.5>  DISABLE-FORCING
acl2-8.5>  ENABLE-FORCING
acl2-8.5>  DISABLE-IMMEDIATE-FORCE-MODEP
acl2-8.5>  ENABLE-IMMEDIATE-FORCE-MODEP
acl2-8.5>  SYNP
acl2-8.5>  SYNTAXP
acl2-8.5>  BIND-FREE
acl2-8.5>  EXTRA-INFO
acl2-8.5>  NIL
acl2-8.5>  *EXTRA-INFO-FN*
acl2-8.5>  TAU-SYSTEM
acl2-8.5>  *TAU-STATUS-BOOT-STRAP-SETTINGS*
acl2-8.5>  NIL
acl2-8.5>  *TAU-SYSTEM-XNUME*
acl2-8.5>  *TAU-ACL2-NUMBERP-PAIR*
acl2-8.5>  *TAU-INTEGERP-PAIR*
acl2-8.5>  *TAU-RATIONALP-PAIR*
acl2-8.5>  *TAU-BOOLEANP-PAIR*
acl2-8.5>  *TAU-NATP-PAIR*
acl2-8.5>  *TAU-BITP-PAIR*
acl2-8.5>  *TAU-POSP-PAIR*
acl2-8.5>  *TAU-MINUSP-PAIR*
acl2-8.5>  REWRITE-LAMBDA-MODEP
acl2-8.5>  *REWRITE-LAMBDA-MODEP-XNUME*
acl2-8.5>  INTEGER-0
acl2-8.5>  INTEGER-1
acl2-8.5>  INTEGER-STEP
acl2-8.5>  LOWEST-TERMS
acl2-8.5>  NIL
acl2-8.5>  BOOLEANP-CHARACTERP
acl2-8.5>  CHARACTERP-PAGE
acl2-8.5>  CHARACTERP-TAB
acl2-8.5>  CHARACTERP-RUBOUT
acl2-8.5>  CHARACTERP-RETURN
acl2-8.5>  NO-DUPLICATESP-EQ-EXEC
acl2-8.5>  NO-DUPLICATESP-EQL-EXEC
acl2-8.5>  NO-DUPLICATESP-EQUAL
acl2-8.5>  NO-DUPLICATESP-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NO-DUPLICATESP
acl2-8.5>  R-EQLABLE-ALISTP
acl2-8.5>  R-SYMBOL-ALISTP
acl2-8.5>  RASSOC-EQ-EXEC
acl2-8.5>  RASSOC-EQL-EXEC
acl2-8.5>  RASSOC-EQUAL
acl2-8.5>  RASSOC-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  RASSOC
acl2-8.5>  IFIX
acl2-8.5>  RFIX
acl2-8.5>  REALFIX
acl2-8.5>  NFIX
acl2-8.5>  1+
acl2-8.5>  1-
acl2-8.5>  NATP
acl2-8.5>  NIL
acl2-8.5>  NAT-ALISTP
acl2-8.5>  NIL
acl2-8.5>  BITP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  POSP
acl2-8.5>  NIL
acl2-8.5>  O-FINP
acl2-8.5>  O-INFP
acl2-8.5>  O-FIRST-EXPT
acl2-8.5>  O-FIRST-COEFF
acl2-8.5>  O-RST
acl2-8.5>  O<G
acl2-8.5>  O<
acl2-8.5>  O<G
acl2-8.5>  O<
acl2-8.5>  O>
acl2-8.5>  O<=
acl2-8.5>  O>=
acl2-8.5>  O-P
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MAKE-ORD
acl2-8.5>  *STANDARD-CHARS*
acl2-8.5>  STANDARD-CHAR-P
acl2-8.5>  STANDARD-CHAR-P+
acl2-8.5>  STANDARD-CHAR-LISTP
acl2-8.5>  CHARACTER-LISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COERCE-INVERSE-1
acl2-8.5>  COERCE-INVERSE-2
acl2-8.5>  CHARACTER-LISTP-COERCE
acl2-8.5>  NIL
acl2-8.5>  STRING
acl2-8.5>  ALPHA-CHAR-P
acl2-8.5>  UPPER-CASE-P
acl2-8.5>  LOWER-CASE-P
acl2-8.5>  CHAR-UPCASE
acl2-8.5>  CHAR-DOWNCASE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  STRING-DOWNCASE1
acl2-8.5>  NIL
acl2-8.5>  STRING-DOWNCASE
acl2-8.5>  STRING-UPCASE1
acl2-8.5>  NIL
acl2-8.5>  STRING-UPCASE
acl2-8.5>  OUR-DIGIT-CHAR-P
acl2-8.5>  DIGIT-CHAR-P
acl2-8.5>  CHAR-EQUAL
acl2-8.5>  ATOM-LISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  GOOD-ATOM-LISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  STANDARD-STRING-P1
acl2-8.5>  STANDARD-STRING-P
acl2-8.5>  STANDARD-STRING-LISTP
acl2-8.5>  STRING-EQUAL1
acl2-8.5>  STRING-EQUAL
acl2-8.5>  MEMBER-STRING-EQUAL
acl2-8.5>  STANDARD-STRING-ALISTP
acl2-8.5>  NIL
acl2-8.5>  ASSOC-STRING-EQUAL
acl2-8.5>  LIST*-MACRO
acl2-8.5>  LIST*
acl2-8.5>  THROW-OR-ATTACH-CALL
acl2-8.5>  NULL-BODY-ER
acl2-8.5>  *MAIN-LISP-PACKAGE-NAME*
acl2-8.5>  *INITIAL-KNOWN-PACKAGE-ALIST*
acl2-8.5>  STRINGP-SYMBOL-PACKAGE-NAME
acl2-8.5>  SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  SYMBOLP-PKG-WITNESS
acl2-8.5>  INTERN
acl2-8.5>  INTERN$
acl2-8.5>  KEYWORDP
acl2-8.5>  NIL
acl2-8.5>  INTERN-IN-PACKAGE-OF-SYMBOL-SYMBOL-NAME
acl2-8.5>  NIL
acl2-8.5>  *PKG-WITNESS-NAME*
acl2-8.5>  SYMBOL-NAME-PKG-WITNESS
acl2-8.5>  SYMBOL-PACKAGE-NAME-PKG-WITNESS-NAME
acl2-8.5>  MEMBER-SYMBOL-NAME
acl2-8.5>  NIL
acl2-8.5>  SYMBOL-NAME-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  SYMBOL-PACKAGE-NAME-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  INTERN-IN-PACKAGE-OF-SYMBOL-IS-IDENTITY
acl2-8.5>  SYMBOL-LISTP-PKG-IMPORTS
acl2-8.5>  T
acl2-8.5>  NO-DUPLICATESP-EQ-PKG-IMPORTS
acl2-8.5>  COMPLETION-OF-PKG-IMPORTS
acl2-8.5>  NIL
acl2-8.5>  ACL2-INPUT-CHANNEL-PACKAGE
acl2-8.5>  ACL2-OUTPUT-CHANNEL-PACKAGE
acl2-8.5>  ACL2-PACKAGE
acl2-8.5>  KEYWORD-PACKAGE
acl2-8.5>  STRING-IS-NOT-CIRCULAR
acl2-8.5>  NIL-IS-NOT-CIRCULAR
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  CONS-WITH-HINT
acl2-8.5>  REMOVE-EQ-EXEC
acl2-8.5>  REMOVE-EQL-EXEC
acl2-8.5>  REMOVE-EQUAL
acl2-8.5>  REMOVE-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REMOVE
acl2-8.5>  REMOVE1-EQ-EXEC
acl2-8.5>  REMOVE1-EQL-EXEC
acl2-8.5>  REMOVE1-EQUAL
acl2-8.5>  REMOVE1-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REMOVE1
acl2-8.5>  REMOVE-DUPLICATES-EQ-EXEC
acl2-8.5>  REMOVE-DUPLICATES-EQL-EXEC
acl2-8.5>  REMOVE-DUPLICATES-EQUAL
acl2-8.5>  REMOVE-DUPLICATES-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REMOVE-DUPLICATES-LOGIC
acl2-8.5>  REMOVE-DUPLICATES
acl2-8.5>  NIL
acl2-8.5>  FIRST
acl2-8.5>  SECOND
acl2-8.5>  THIRD
acl2-8.5>  FOURTH
acl2-8.5>  FIFTH
acl2-8.5>  SIXTH
acl2-8.5>  SEVENTH
acl2-8.5>  EIGHTH
acl2-8.5>  NINTH
acl2-8.5>  TENTH
acl2-8.5>  REST
acl2-8.5>  IDENTITY
acl2-8.5>  REVAPPEND
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REVERSE
acl2-8.5>  PAIRLIS$-TAILREC
acl2-8.5>  PAIRLIS$
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SET-DIFFERENCE-EQ-EXEC
acl2-8.5>  SET-DIFFERENCE-EQL-EXEC
acl2-8.5>  SET-DIFFERENCE-EQUAL
acl2-8.5>  SET-DIFFERENCE-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SET-DIFFERENCE$
acl2-8.5>  *WINDOW-DESCRIPTIONS*
acl2-8.5>  *VALID-OUTPUT-NAMES*
acl2-8.5>  LISTP
acl2-8.5>  *SUMMARY-TYPES*
acl2-8.5>  WITH-EVISC-TUPLE
acl2-8.5>  LAST
acl2-8.5>  FIRST-N-AC
acl2-8.5>  NIL
acl2-8.5>  TAKE
acl2-8.5>  BUTLAST
acl2-8.5>  MUTUAL-RECURSION-GUARDP
acl2-8.5>  COLLECT-CADRS-WHEN-CAR-MEMBER-EQ
acl2-8.5>  VALUE
acl2-8.5>  LEGAL-CONSTANTP1
acl2-8.5>  VALUE-TRIPLE
acl2-8.5>  ASSERT-EVENT
acl2-8.5>  EVENT-KEYWORD-NAME
acl2-8.5>  EVENT-KEYWORD-NAME-LST
acl2-8.5>  ADD-TO-SET-EQ-EXEC
acl2-8.5>  ADD-TO-SET-EQL-EXEC
acl2-8.5>  ADD-TO-SET-EQUAL
acl2-8.5>  ADD-TO-SET-EQ
acl2-8.5>  ADD-TO-SET-EQL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ADD-TO-SET
acl2-8.5>  KEYWORD-VALUE-LISTP
acl2-8.5>  NIL
acl2-8.5>  THROW-NONEXEC-ERROR
acl2-8.5>  EVENS
acl2-8.5>  ODDS
acl2-8.5>  MV-NTH
acl2-8.5>  MAKE-MV-NTHS
acl2-8.5>  MV
acl2-8.5>  MV?
acl2-8.5>  MV-LET
acl2-8.5>  MV?-LET
acl2-8.5>  LEGAL-CASE-CLAUSESP
acl2-8.5>  CASE-TEST
acl2-8.5>  CASE-LIST
acl2-8.5>  CASE-LIST-CHECK
acl2-8.5>  CASE
acl2-8.5>  NONNEGATIVE-INTEGER-QUOTIENT
acl2-8.5>  TRUE-LIST-LISTP
acl2-8.5>  NIL
acl2-8.5>  LEGAL-LET*-P
acl2-8.5>  WELL-FORMED-TYPE-DECLS-P
acl2-8.5>  SYMBOL-LIST-LISTP
acl2-8.5>  GET-TYPE-DECLS
acl2-8.5>  LET*-MACRO
acl2-8.5>  COLLECT-CDRS-WHEN-CAR-EQ
acl2-8.5>  APPEND-LST
acl2-8.5>  RESTRICT-ALIST
acl2-8.5>  LET*
acl2-8.5>  PROGN
acl2-8.5>  LOGNOT
acl2-8.5>  DIGIT-TO-CHAR
acl2-8.5>  PRINT-BASE-P
acl2-8.5>  EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>  MAKE-VAR-LST1
acl2-8.5>  MAKE-VAR-LST
acl2-8.5>  NTHCDR
acl2-8.5>  NIL
acl2-8.5>  UNION-EQ-EXEC
acl2-8.5>  UNION-EQL-EXEC
acl2-8.5>  UNION-EQUAL
acl2-8.5>  UNION-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  PARSE-ARGS-AND-TEST
acl2-8.5>  UNION-EQUAL-WITH-UNION-EQ-EXEC-GUARD
acl2-8.5>  UNION-EQUAL-WITH-UNION-EQL-EXEC-GUARD
acl2-8.5>  UNION$
acl2-8.5>  *XARGS-KEYWORDS*
acl2-8.5>  PLAUSIBLE-DCLSP1
acl2-8.5>  PLAUSIBLE-DCLSP
acl2-8.5>  STRIP-KEYWORD-LIST
acl2-8.5>  STRIP-DCLS1
acl2-8.5>  STRIP-DCLS
acl2-8.5>  FETCH-DCL-FIELDS2
acl2-8.5>  FETCH-DCL-FIELDS1
acl2-8.5>  FETCH-DCL-FIELDS
acl2-8.5>  FETCH-DCL-FIELD
acl2-8.5>  WITH-OUTPUT-ON-OFF-BINDING-VAL
acl2-8.5>  WITH-OUTPUT-ON-OFF-ARG
acl2-8.5>  MSGP
acl2-8.5>  CTXP
acl2-8.5>  WITH-OUTPUT-FN
acl2-8.5>  WITH-OUTPUT!
acl2-8.5>  WITH-OUTPUT
acl2-8.5>  DEFUN-NX-DCLS
acl2-8.5>  DEFUN-NX-FORM
acl2-8.5>  DEFUN-NX-FN
acl2-8.5>  DEFUN-NX
acl2-8.5>  DEFUND-NX
acl2-8.5>  UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1
acl2-8.5>  UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
acl2-8.5>  ASSOC-KEYWORD
acl2-8.5>  PROGRAM-DECLARED-P2
acl2-8.5>  PROGRAM-DECLARED-P1
acl2-8.5>  PROGRAM-DECLARED-P
acl2-8.5>  SOME-PROGRAM-DECLARED-P
acl2-8.5>  PAIRLIS-X1
acl2-8.5>  PAIRLIS-X2
acl2-8.5>  APPEND?
acl2-8.5>  MUTUAL-RECURSION
acl2-8.5>  VARIABLEP
acl2-8.5>  NVARIABLEP
acl2-8.5>  FQUOTEP
acl2-8.5>  QUOTEP
acl2-8.5>  *T*
acl2-8.5>  *NIL*
acl2-8.5>  *0*
acl2-8.5>  *1*
acl2-8.5>  *-1*
acl2-8.5>  *2*
acl2-8.5>  KWOTE
acl2-8.5>  MAYBE-KWOTE
acl2-8.5>  KWOTE-LST
acl2-8.5>  UNQUOTE
acl2-8.5>  T
acl2-8.5>  (PSEUDO-TERMP PSEUDO-TERM-LISTP)
acl2-8.5>  NIL
acl2-8.5>  T
acl2-8.5>  PSEUDO-TERM-LIST-LISTP
acl2-8.5>  NIL
acl2-8.5>  LAMBDA-OBJECT-FORMALS
acl2-8.5>  LAMBDA-OBJECT-DCL
acl2-8.5>  LAMBDA-OBJECT-BODY
acl2-8.5>  LAMBDA-OBJECT-SHAPEP
acl2-8.5>  MAKE-LAMBDA-OBJECT
acl2-8.5>  FFN-SYMB
acl2-8.5>  FN-SYMB
acl2-8.5>  FARGS
acl2-8.5>  FARGN1
acl2-8.5>  FARGN
acl2-8.5>  (ALL-VARS1 ALL-VARS1-LST)
acl2-8.5>  NIL
acl2-8.5>  ALL-VARS
acl2-8.5>  TRANSLATE-AND-TEST
acl2-8.5>  INTERSECTP-EQ-EXEC
acl2-8.5>  INTERSECTP-EQL-EXEC
acl2-8.5>  INTERSECTP-EQUAL
acl2-8.5>  INTERSECTP-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  INTERSECTP
acl2-8.5>  CHK-NO-STOBJ-INDEX-ALIASING
acl2-8.5>  MAKE-FMT-BINDINGS
acl2-8.5>  *BASE-10-CHARS*
acl2-8.5>  WARNING$
acl2-8.5>  MSG
acl2-8.5>  CHECK-VARS-NOT-FREE-TEST
acl2-8.5>  CHECK-VARS-NOT-FREE
acl2-8.5>  ER-PROGN-FN
acl2-8.5>  ER-PROGN
acl2-8.5>  POSITION-AC-EQ-EXEC
acl2-8.5>  NIL
acl2-8.5>  POSITION-AC-EQL-EXEC
acl2-8.5>  NIL
acl2-8.5>  POSITION-EQUAL-AC
acl2-8.5>  NIL
acl2-8.5>  POSITION-AC-EQUAL
acl2-8.5>  POSITION-EQ-AC
acl2-8.5>  POSITION-AC-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  POSITION-AC
acl2-8.5>  POSITION-EQ-EXEC
acl2-8.5>  POSITION-EQL-EXEC
acl2-8.5>  POSITION-EQUAL
acl2-8.5>  POSITION-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  POSITION
acl2-8.5>  ASH
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  CHAR-CODE-LINEAR
acl2-8.5>  CODE-CHAR-TYPE
acl2-8.5>  CODE-CHAR-CHAR-CODE-IS-IDENTITY
acl2-8.5>  CHAR-CODE-CODE-CHAR-IS-IDENTITY
acl2-8.5>  CHAR<
acl2-8.5>  CHAR>
acl2-8.5>  CHAR<=
acl2-8.5>  CHAR>=
acl2-8.5>  STRING<-L
acl2-8.5>  STRING<
acl2-8.5>  STRING>
acl2-8.5>  STRING<=
acl2-8.5>  STRING>=
acl2-8.5>  SYMBOL<
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SUBSTITUTE-AC
acl2-8.5>  SUBSTITUTE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SUBLIS
acl2-8.5>  SUBST
acl2-8.5>  PPROGN
acl2-8.5>  PROGN$
acl2-8.5>  ACL2-UNWIND-PROTECT
acl2-8.5>  WHEN-LOGIC
acl2-8.5>  IN-PACKAGE
acl2-8.5>  DEFPKG
acl2-8.5>  DEFUN
acl2-8.5>  DEFUNS
acl2-8.5>  VERIFY-TERMINATION
acl2-8.5>  VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>  VERIFY-GUARDS
acl2-8.5>  VERIFY-GUARDS+
acl2-8.5>  DEFMACRO
acl2-8.5>  DEFCONST
acl2-8.5>  DEFTHM
acl2-8.5>  ER
acl2-8.5>  DEFTHMD
acl2-8.5>  DEFAXIOM
acl2-8.5>  DEFLABEL
acl2-8.5>  DEFTHEORY
acl2-8.5>  DEFTHY
acl2-8.5>  DEFTHEORY-STATIC
acl2-8.5>  DEFSTOBJ
acl2-8.5>  IN-THEORY
acl2-8.5>  IN-ARITHMETIC-THEORY
acl2-8.5>  REGENERATE-TAU-DATABASE
acl2-8.5>  PUSH-UNTOUCHABLE
acl2-8.5>  REMOVE-UNTOUCHABLE
acl2-8.5>  SET-BODY
acl2-8.5>  TABLE
acl2-8.5>  ENCAPSULATE
acl2-8.5>  PARTIAL-ENCAPSULATE
acl2-8.5>  *LOAD-COMPILED-FILE-VALUES*
acl2-8.5>  INCLUDE-BOOK
acl2-8.5>  MAKE-EVENT
acl2-8.5>  RECORD-EXPANSION
acl2-8.5>  SKIP-PROOFS
acl2-8.5>  LOCAL
acl2-8.5>  DEFCHOOSE
acl2-8.5>  DEFATTACH
acl2-8.5>  WORLDP
acl2-8.5>  PLIST-WORLDP
acl2-8.5>  NIL
acl2-8.5>  PUTPROP
acl2-8.5>  *ACL2-PROPERTY-UNBOUND*
acl2-8.5>  GETPROP-DEFAULT
acl2-8.5>  FGETPROP
acl2-8.5>  SGETPROP
acl2-8.5>  ORDERED-SYMBOL-ALISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ADD-PAIR
acl2-8.5>  REMOVE1-ASSOC-EQ-EXEC
acl2-8.5>  REMOVE1-ASSOC-EQL-EXEC
acl2-8.5>  REMOVE1-ASSOC-EQUAL
acl2-8.5>  REMOVE1-ASSOC-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REMOVE1-ASSOC
acl2-8.5>  REMOVE-ASSOC-EQ-EXEC
acl2-8.5>  REMOVE-ASSOC-EQL-EXEC
acl2-8.5>  REMOVE-ASSOC-EQUAL
acl2-8.5>  REMOVE-ASSOC-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  REMOVE-ASSOC
acl2-8.5>  GETPROPS1
acl2-8.5>  GETPROPS
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  HAS-PROPSP1
acl2-8.5>  HAS-PROPSP
acl2-8.5>  EXTEND-WORLD
acl2-8.5>  RETRACT-WORLD
acl2-8.5>  GLOBAL-VAL
acl2-8.5>  FUNCTION-SYMBOLP
acl2-8.5>  FCONS-TERM*
acl2-8.5>  CONJOIN2
acl2-8.5>  CONJOIN
acl2-8.5>  CONJOIN-UNTRANSLATED-TERMS
acl2-8.5>  DISJOIN2
acl2-8.5>  DISJOIN
acl2-8.5>  DISJOIN-LST
acl2-8.5>  KWOTE?
acl2-8.5>  CONJOIN?
acl2-8.5>  <=?
acl2-8.5>  >?
acl2-8.5>  DISJOIN?
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD/INTEGER
acl2-8.5>  WEAK-SATISFIES-TYPE-SPEC-P
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD1-GEN
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD1
acl2-8.5>  (TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST)
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD-LST
acl2-8.5>  THE-CHECK
acl2-8.5>  THE-FN
acl2-8.5>  THE
acl2-8.5>  THE-CHECK-FOR-*1*
acl2-8.5>  THE-FN-FOR-*1*
acl2-8.5>  THE-FOR-*1*
acl2-8.5>  *MAXIMUM-POSITIVE-32-BIT-INTEGER*
acl2-8.5>  BOUNDED-INTEGER-ALISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  F-GET-GLOBAL
acl2-8.5>  ARRAY1P
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  BOUNDED-INTEGER-ALISTP2
acl2-8.5>  ASSOC2
acl2-8.5>  ARRAY2P
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  HEADER
acl2-8.5>  DIMENSIONS
acl2-8.5>  MAXIMUM-LENGTH
acl2-8.5>  DEFAULT
acl2-8.5>  AREF1
acl2-8.5>  COMPRESS11
acl2-8.5>  ARRAY-ORDER
acl2-8.5>  COMPRESS1
acl2-8.5>  NIL
acl2-8.5>  ASET1
acl2-8.5>  ASET1-TRUSTED
acl2-8.5>  AREF2
acl2-8.5>  COMPRESS211
acl2-8.5>  COMPRESS21
acl2-8.5>  COMPRESS2
acl2-8.5>  NIL
acl2-8.5>  ASET2
acl2-8.5>  FLUSH-COMPRESS
acl2-8.5>  MAYBE-FLUSH-AND-COMPRESS1
acl2-8.5>  CDRN
acl2-8.5>  MV-LIST
acl2-8.5>  SWAP-STOBJS
acl2-8.5>  UPDATE-NTH
acl2-8.5>  UPDATE-NTH-ARRAY
acl2-8.5>  MAXIMUM-POSITIVE-32-BIT-INTEGER
acl2-8.5>  MINIMUM-NEGATIVE-32-BIT-INTEGER
acl2-8.5>  32-BIT-INTEGERP
acl2-8.5>  NIL
acl2-8.5>  ACL2-NUMBER-LISTP
acl2-8.5>  NIL
acl2-8.5>  RATIONAL-LISTP
acl2-8.5>  NIL
acl2-8.5>  INTEGER-LISTP
acl2-8.5>  NIL
acl2-8.5>  NAT-LISTP
acl2-8.5>  NIL
acl2-8.5>  32-BIT-INTEGER-LISTP
acl2-8.5>  NIL
acl2-8.5>  OPEN-INPUT-CHANNELS
acl2-8.5>  UPDATE-OPEN-INPUT-CHANNELS
acl2-8.5>  OPEN-OUTPUT-CHANNELS
acl2-8.5>  UPDATE-OPEN-OUTPUT-CHANNELS
acl2-8.5>  GLOBAL-TABLE
acl2-8.5>  UPDATE-GLOBAL-TABLE
acl2-8.5>  T-STACK
acl2-8.5>  UPDATE-T-STACK
acl2-8.5>  32-BIT-INTEGER-STACK
acl2-8.5>  UPDATE-32-BIT-INTEGER-STACK
acl2-8.5>  BIG-CLOCK-ENTRY
acl2-8.5>  UPDATE-BIG-CLOCK-ENTRY
acl2-8.5>  IDATES
acl2-8.5>  UPDATE-IDATES
acl2-8.5>  ACL2-ORACLE
acl2-8.5>  UPDATE-ACL2-ORACLE
acl2-8.5>  FILE-CLOCK
acl2-8.5>  UPDATE-FILE-CLOCK
acl2-8.5>  READABLE-FILES
acl2-8.5>  WRITTEN-FILES
acl2-8.5>  UPDATE-WRITTEN-FILES
acl2-8.5>  READ-FILES
acl2-8.5>  UPDATE-READ-FILES
acl2-8.5>  WRITEABLE-FILES
acl2-8.5>  LIST-ALL-PACKAGE-NAMES-LST
acl2-8.5>  UPDATE-LIST-ALL-PACKAGE-NAMES-LST
acl2-8.5>  USER-STOBJ-ALIST1
acl2-8.5>  UPDATE-USER-STOBJ-ALIST1
acl2-8.5>  *INITIAL-CHECKPOINT-PROCESSORS*
acl2-8.5>  *INITIAL-PROGRAM-FNS-WITH-RAW-CODE*
acl2-8.5>  *INITIAL-LOGIC-FNS-WITH-RAW-CODE*
acl2-8.5>  *INITIAL-MACROS-WITH-RAW-CODE*
acl2-8.5>  UNTOUCHABLE-MARKER
acl2-8.5>  DEFMACRO-UNTOUCHABLE
acl2-8.5>  WITH-LIVE-STATE
acl2-8.5>  INIT-IPRINT-AR
acl2-8.5>  *IPRINT-SOFT-BOUND-DEFAULT*
acl2-8.5>  *IPRINT-HARD-BOUND-DEFAULT*
acl2-8.5>  DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
acl2-8.5>  *FMT-SOFT-RIGHT-MARGIN-DEFAULT*
acl2-8.5>  *FMT-HARD-RIGHT-MARGIN-DEFAULT*
acl2-8.5>  *INITIAL-GLOBAL-TABLE*
acl2-8.5>  T
acl2-8.5>  WITH-INFIXP-NIL
acl2-8.5>  ALL-BOUNDP
acl2-8.5>  KNOWN-PACKAGE-ALISTP
acl2-8.5>  NIL
acl2-8.5>  TIMER-ALISTP
acl2-8.5>  NIL
acl2-8.5>  TYPED-IO-LISTP
acl2-8.5>  NIL
acl2-8.5>  *FILE-TYPES*
acl2-8.5>  OPEN-CHANNEL1
acl2-8.5>  NIL
acl2-8.5>  OPEN-CHANNEL-LISTP
acl2-8.5>  OPEN-CHANNELS-P
acl2-8.5>  NIL
acl2-8.5>  FILE-CLOCK-P
acl2-8.5>  NIL
acl2-8.5>  READABLE-FILE
acl2-8.5>  NIL
acl2-8.5>  READABLE-FILES-LISTP
acl2-8.5>  NIL
acl2-8.5>  READABLE-FILES-P
acl2-8.5>  NIL
acl2-8.5>  WRITTEN-FILE
acl2-8.5>  NIL
acl2-8.5>  WRITTEN-FILE-LISTP
acl2-8.5>  NIL
acl2-8.5>  WRITTEN-FILES-P
acl2-8.5>  NIL
acl2-8.5>  READ-FILE-LISTP1
acl2-8.5>  NIL
acl2-8.5>  READ-FILE-LISTP
acl2-8.5>  NIL
acl2-8.5>  READ-FILES-P
acl2-8.5>  NIL
acl2-8.5>  WRITABLE-FILE-LISTP1
acl2-8.5>  NIL
acl2-8.5>  WRITABLE-FILE-LISTP
acl2-8.5>  NIL
acl2-8.5>  WRITEABLE-FILES-P
acl2-8.5>  NIL
acl2-8.5>  STATE-P1
acl2-8.5>  NIL
acl2-8.5>  STATE-P
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  BUILD-STATE
acl2-8.5>  *DEFAULT-STATE*
acl2-8.5>  BUILD-STATE1
acl2-8.5>  COERCE-STATE-TO-OBJECT
acl2-8.5>  COERCE-OBJECT-TO-STATE
acl2-8.5>  NIL
acl2-8.5>  GLOBAL-TABLE-CARS1
acl2-8.5>  GLOBAL-TABLE-CARS
acl2-8.5>  BOUNDP-GLOBAL1
acl2-8.5>  BOUNDP-GLOBAL
acl2-8.5>  F-BOUNDP-GLOBAL
acl2-8.5>  MAKUNBOUND-GLOBAL
acl2-8.5>  GET-GLOBAL
acl2-8.5>  PUT-GLOBAL
acl2-8.5>  F-PUT-GLOBAL
acl2-8.5>  *INITIAL-LD-SPECIAL-BINDINGS*
acl2-8.5>  ALWAYS-BOUNDP-GLOBAL
acl2-8.5>  STATE-GLOBAL-LET*-BINDINGS-P
acl2-8.5>  STATE-GLOBAL-LET*-GET-GLOBALS
acl2-8.5>  STATE-GLOBAL-LET*-PUT-GLOBALS
acl2-8.5>  STATE-GLOBAL-LET*-CLEANUP
acl2-8.5>  WITH-PARALLELISM-HAZARD-WARNINGS
acl2-8.5>  WARN-ABOUT-PARALLELISM-HAZARD
acl2-8.5>  WITH-ENSURED-PARALLELISM-FINISHING
acl2-8.5>  STATE-GLOBAL-LET*
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  INTEGER-RANGE-P
acl2-8.5>  NIL
acl2-8.5>  SIGNED-BYTE-P
acl2-8.5>  UNSIGNED-BYTE-P
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  THE-FIXNUM
acl2-8.5>  ZPF
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-SYMBOL-NAME
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-SYMBOL-PACKAGE-NAME
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  LOGAND
acl2-8.5>  LOGEQV
acl2-8.5>  LOGIOR
acl2-8.5>  LOGXOR
acl2-8.5>  INTEGER-LENGTH
acl2-8.5>  BINARY-LOGAND
acl2-8.5>  LOGNAND
acl2-8.5>  BINARY-LOGIOR
acl2-8.5>  LOGORC1
acl2-8.5>  LOGORC2
acl2-8.5>  LOGANDC1
acl2-8.5>  LOGANDC2
acl2-8.5>  BINARY-LOGEQV
acl2-8.5>  BINARY-LOGXOR
acl2-8.5>  LOGNOR
acl2-8.5>  LOGTEST
acl2-8.5>  *BOOLE-1*
acl2-8.5>  *BOOLE-2*
acl2-8.5>  *BOOLE-AND*
acl2-8.5>  *BOOLE-ANDC1*
acl2-8.5>  *BOOLE-ANDC2*
acl2-8.5>  *BOOLE-C1*
acl2-8.5>  *BOOLE-C2*
acl2-8.5>  *BOOLE-CLR*
acl2-8.5>  *BOOLE-EQV*
acl2-8.5>  *BOOLE-IOR*
acl2-8.5>  *BOOLE-NAND*
acl2-8.5>  *BOOLE-NOR*
acl2-8.5>  *BOOLE-ORC1*
acl2-8.5>  *BOOLE-ORC2*
acl2-8.5>  *BOOLE-SET*
acl2-8.5>  *BOOLE-XOR*
acl2-8.5>  BOOLE$
acl2-8.5>  SET-FORMS-FROM-BINDINGS
acl2-8.5>  *PRINT-CONTROL-DEFAULTS*
acl2-8.5>  ALIST-DIFFERENCE-EQ
acl2-8.5>  WITH-PRINT-DEFAULTS
acl2-8.5>  RESET-PRINT-CONTROL
acl2-8.5>  EXPLODE-ATOM
acl2-8.5>  NIL
acl2-8.5>  EXPLODE-ATOM+
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  OPEN-INPUT-CHANNEL-P1
acl2-8.5>  OPEN-OUTPUT-CHANNEL-P1
acl2-8.5>  OPEN-INPUT-CHANNEL-P
acl2-8.5>  OPEN-OUTPUT-CHANNEL-P
acl2-8.5>  OPEN-OUTPUT-CHANNEL-ANY-P1
acl2-8.5>  OPEN-OUTPUT-CHANNEL-ANY-P
acl2-8.5>  OPEN-INPUT-CHANNEL-ANY-P1
acl2-8.5>  OPEN-INPUT-CHANNEL-ANY-P
acl2-8.5>  NON-FREE-VAR-RUNES
acl2-8.5>  FREE-VAR-RUNES
acl2-8.5>  NIL
acl2-8.5>  *DIRECTORY-SEPARATOR*
acl2-8.5>  *DIRECTORY-SEPARATOR-STRING*
acl2-8.5>  OS-ER
acl2-8.5>  OS
acl2-8.5>  ABSOLUTE-PATHNAME-STRING-P
acl2-8.5>  ILLEGAL-RULER-EXTENDERS-VALUES
acl2-8.5>  TABLE-ALIST
acl2-8.5>  RULER-EXTENDERS-MSG-AUX
acl2-8.5>  RULER-EXTENDERS-MSG
acl2-8.5>  STRICT-SYMBOL<-SORTEDP
acl2-8.5>  CHK-RULER-EXTENDERS
acl2-8.5>  FIXNUM-BOUND
acl2-8.5>  *DEFAULT-STEP-LIMIT*
acl2-8.5>  INCLUDE-BOOK-DIR-ALIST-ENTRY-P
acl2-8.5>  INCLUDE-BOOK-DIR-ALISTP
acl2-8.5>  *CHECK-INVARIANT-RISK-VALUES*
acl2-8.5>  TTAG
acl2-8.5>  GET-REGISTER-INVARIANT-RISK-WORLD
acl2-8.5>  ACL2-DEFAULTS-TABLE
acl2-8.5>  ACL2-DEFAULTS-TABLE
acl2-8.5>  PRINT-CASE
acl2-8.5>  ACL2-PRINT-CASE
acl2-8.5>  CHECK-PRINT-CASE
acl2-8.5>  SET-PRINT-CASE
acl2-8.5>  PRINT-BASE
acl2-8.5>  ACL2-PRINT-BASE
acl2-8.5>  PRINT-RADIX
acl2-8.5>  ACL2-PRINT-RADIX
acl2-8.5>  CHECK-PRINT-BASE
acl2-8.5>  SET-PRINT-BASE
acl2-8.5>  SET-PRINT-CIRCLE
acl2-8.5>  SET-PRINT-ESCAPE
acl2-8.5>  SET-PRINT-PRETTY
acl2-8.5>  SET-PRINT-RADIX
acl2-8.5>  SET-PRINT-READABLY
acl2-8.5>  CHECK-NULL-OR-NATP
acl2-8.5>  SET-PRINT-LENGTH
acl2-8.5>  SET-PRINT-LEVEL
acl2-8.5>  SET-PRINT-LINES
acl2-8.5>  SET-PRINT-RIGHT-MARGIN
acl2-8.5>  RAW-PRINT-VARS-ALIST
acl2-8.5>  *RAW-PRINT-VARS-ALIST*
acl2-8.5>  PRINC$
acl2-8.5>  WRITE-BYTE$
acl2-8.5>  W
acl2-8.5>  GET-SERIALIZE-CHARACTER
acl2-8.5>  SET-SERIALIZE-CHARACTER-FN
acl2-8.5>  SET-SERIALIZE-CHARACTER
acl2-8.5>  SET-SERIALIZE-CHARACTER-SYSTEM
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  PRINT-OBJECT$+-ALIST
acl2-8.5>  MAKE-INPUT-CHANNEL
acl2-8.5>  MAKE-OUTPUT-CHANNEL
acl2-8.5>  OPEN-INPUT-CHANNEL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  CLOSE-INPUT-CHANNEL
acl2-8.5>  OPEN-OUTPUT-CHANNEL
acl2-8.5>  OPEN-OUTPUT-CHANNEL!
acl2-8.5>  ASSERT$
acl2-8.5>  ASSERT*
acl2-8.5>  COMMENT-WINDOW-CO
acl2-8.5>  FMT-TO-COMMENT-WINDOW
acl2-8.5>  FMT-TO-COMMENT-WINDOW!
acl2-8.5>  FMT-TO-COMMENT-WINDOW+
acl2-8.5>  FMT-TO-COMMENT-WINDOW!+
acl2-8.5>  PAIRLIS2
acl2-8.5>  CW
acl2-8.5>  CW!
acl2-8.5>  CW+
acl2-8.5>  CW!+
acl2-8.5>  CW-PRINT-BASE-RADIX
acl2-8.5>  CW-PRINT-BASE-RADIX!
acl2-8.5>  SUBSEQ-LIST
acl2-8.5>  SUBSEQ
acl2-8.5>  LOCK-SYMBOL-NAME-P
acl2-8.5>  ASSIGN-LOCK
acl2-8.5>  LOCK-TABLE
acl2-8.5>  WITH-LOCK
acl2-8.5>  DEFLOCK
acl2-8.5>  WITH-OUTPUT-LOCK
acl2-8.5>  WITH-LOCAL-STATE-LOCK
acl2-8.5>  GET-OUTPUT-STREAM-STRING$-FN
acl2-8.5>  GET-OUTPUT-STREAM-STRING$
acl2-8.5>  CLOSE-OUTPUT-CHANNEL
acl2-8.5>  MAYBE-FINISH-OUTPUT$
acl2-8.5>  READ-CHAR$
acl2-8.5>  PEEK-CHAR$
acl2-8.5>  READ-BYTE$
acl2-8.5>  RAW-MODE-P
acl2-8.5>  READ-OBJECT
acl2-8.5>  READ-OBJECT-WITH-CASE
acl2-8.5>  READ-OBJECT-SUPPRESS
acl2-8.5>  *SUSPICIOUSLY-FIRST-NUMERIC-CHARS*
acl2-8.5>  *SUSPICIOUSLY-FIRST-HEX-CHARS*
acl2-8.5>  *HEX-CHARS*
acl2-8.5>  *LETTER-CHARS*
acl2-8.5>  *SLASHABLE-CHARS*
acl2-8.5>  SOME-SLASHABLE
acl2-8.5>  PRIN1-WITH-SLASHES1
acl2-8.5>  PRIN1-WITH-SLASHES
acl2-8.5>  SUSPICIOUSLY-FIRST-NUMERIC-CHARS
acl2-8.5>  NUMERIC-CHARS
acl2-8.5>  MAY-NEED-SLASHES1
acl2-8.5>  NIL
acl2-8.5>  ALL-DOTS
acl2-8.5>  MAY-NEED-SLASHES-FN
acl2-8.5>  MAY-NEED-SLASHES
acl2-8.5>  NEEDS-SLASHES
acl2-8.5>  T-STACK-LENGTH1
acl2-8.5>  T-STACK-LENGTH
acl2-8.5>  MAKE-LIST-AC
acl2-8.5>  MAKE-LIST
acl2-8.5>  EXTEND-T-STACK
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MSWINDOWS-DRIVE1
acl2-8.5>  MSWINDOWS-DRIVE
acl2-8.5>  SHRINK-T-STACK
acl2-8.5>  AREF-T-STACK
acl2-8.5>  ASET-T-STACK
acl2-8.5>  32-BIT-INTEGER-STACK-LENGTH1
acl2-8.5>  32-BIT-INTEGER-STACK-LENGTH
acl2-8.5>  EXTEND-32-BIT-INTEGER-STACK
acl2-8.5>  SHRINK-32-BIT-INTEGER-STACK
acl2-8.5>  AREF-32-BIT-INTEGER-STACK
acl2-8.5>  ASET-32-BIT-INTEGER-STACK
acl2-8.5>  F-BIG-CLOCK-NEGATIVE-P
acl2-8.5>  F-DECREMENT-BIG-CLOCK
acl2-8.5>  BIG-CLOCK-NEGATIVE-P
acl2-8.5>  DECREMENT-BIG-CLOCK
acl2-8.5>  LIST-ALL-PACKAGE-NAMES
acl2-8.5>  USER-STOBJ-ALIST
acl2-8.5>  UPDATE-USER-STOBJ-ALIST
acl2-8.5>  POWER-EVAL
acl2-8.5>  READ-IDATE
acl2-8.5>  READ-RUN-TIME
acl2-8.5>  READ-ACL2-ORACLE
acl2-8.5>  READ-ACL2-ORACLE@PAR
acl2-8.5>  GETENV$
acl2-8.5>  SETENV$
acl2-8.5>  RANDOM$
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SYS-CALL
acl2-8.5>  NIL
acl2-8.5>  SYS-CALL-STATUS
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SYS-CALL+
acl2-8.5>  SYS-CALL*
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MAIN-TIMER
acl2-8.5>  PUT-ASSOC-EQ-EXEC
acl2-8.5>  PUT-ASSOC-EQL-EXEC
acl2-8.5>  PUT-ASSOC-EQUAL
acl2-8.5>  PUT-ASSOC-EQ
acl2-8.5>  PUT-ASSOC-EQL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  PUT-ASSOC
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SET-TIMER
acl2-8.5>  GET-TIMER
acl2-8.5>  NIL
acl2-8.5>  PUSH-TIMER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  POP-TIMER
acl2-8.5>  ADD-TIMERS
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  INCREMENT-TIMER
acl2-8.5>  PRINT-RATIONAL-AS-DECIMAL
acl2-8.5>  PRINT-TIMER
acl2-8.5>  NIL
acl2-8.5>  SET-PRINT-BASE-RADIX
acl2-8.5>  KNOWN-PACKAGE-ALIST
acl2-8.5>  SYMBOL-IN-CURRENT-PACKAGE-P
acl2-8.5>  PRIN1$
acl2-8.5>  NIL
acl2-8.5>  CURRENT-PACKAGE
acl2-8.5>  NIL
acl2-8.5>  *INITIAL-UNTOUCHABLE-FNS*
acl2-8.5>  *INITIAL-UNTOUCHABLE-VARS*
acl2-8.5>  LD-SKIP-PROOFSP
acl2-8.5>  ASSIGN
acl2-8.5>  @
acl2-8.5>  SUBST-FOR-NTH-ARG
acl2-8.5>  THE-MV
acl2-8.5>  THE2S
acl2-8.5>  INTERSECTION-EQ-EXEC
acl2-8.5>  INTERSECTION-EQL-EXEC
acl2-8.5>  INTERSECTION-EQUAL
acl2-8.5>  INTERSECTION-EQ
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  INTERSECTION-EQUAL-WITH-INTERSECTION-EQ-EXEC-GUARD
acl2-8.5>  INTERSECTION-EQUAL-WITH-INTERSECTION-EQL-EXEC-GUARD
acl2-8.5>  INTERSECTION$
acl2-8.5>  SET-ENFORCE-REDUNDANCY
acl2-8.5>  GET-ENFORCE-REDUNDANCY
acl2-8.5>  DEFAULT-VERIFY-GUARDS-EAGERNESS-FROM-TABLE
acl2-8.5>  DEFAULT-VERIFY-GUARDS-EAGERNESS
acl2-8.5>  SET-VERIFY-GUARDS-EAGERNESS
acl2-8.5>  DEFAULT-COMPILE-FNS
acl2-8.5>  SET-COMPILE-FNS
acl2-8.5>  SET-COMPILER-ENABLED
acl2-8.5>  SET-PORT-FILE-ENABLED
acl2-8.5>  DEFAULT-MEASURE-FUNCTION
acl2-8.5>  SET-MEASURE-FUNCTION
acl2-8.5>  DEFAULT-WELL-FOUNDED-RELATION
acl2-8.5>  SET-WELL-FOUNDED-RELATION
acl2-8.5>  DEFAULT-DEFUN-MODE-FROM-TABLE
acl2-8.5>  DEFAULT-DEFUN-MODE
acl2-8.5>  DEFAULT-DEFUN-MODE-FROM-STATE
acl2-8.5>  LOGIC
acl2-8.5>  PROGRAM
acl2-8.5>  INVISIBLE-FNS-TABLE
acl2-8.5>  SET-INVISIBLE-FNS-TABLE
acl2-8.5>  UNARY-FUNCTION-SYMBOL-LISTP
acl2-8.5>  INVISIBLE-FNS-ENTRYP
acl2-8.5>  INVISIBLE-FNS-TABLE
acl2-8.5>  INVISIBLE-FNS-TABLE
acl2-8.5>  ADD-INVISIBLE-FNS
acl2-8.5>  REMOVE-INVISIBLE-FNS
acl2-8.5>  SET-INVISIBLE-FNS-ALIST
acl2-8.5>  INVISIBLE-FNS-ALIST
acl2-8.5>  SET-BOGUS-DEFUN-HINTS-OK
acl2-8.5>  SET-BOGUS-MEASURE-OK
acl2-8.5>  SET-BOGUS-MUTUAL-RECURSION-OK
acl2-8.5>  SET-IRRELEVANT-FORMALS-OK
acl2-8.5>  SET-IGNORE-OK
acl2-8.5>  INHIBIT-WARNINGS-TABLE
acl2-8.5>  SET-INHIBIT-WARNINGS!
acl2-8.5>  SET-INHIBIT-WARNINGS
acl2-8.5>  REMOVE1-ASSOC-STRING-EQUAL
acl2-8.5>  TOGGLE-INHIBIT-WARNING!
acl2-8.5>  TOGGLE-INHIBIT-WARNING
acl2-8.5>  INHIBIT-ER-SOFT-TABLE
acl2-8.5>  SET-INHIBIT-ER-SOFT!
acl2-8.5>  SET-INHIBIT-ER-SOFT
acl2-8.5>  TOGGLE-INHIBIT-ER-SOFT!
acl2-8.5>  TOGGLE-INHIBIT-ER-SOFT
acl2-8.5>  SET-INHIBIT-OUTPUT-LST
acl2-8.5>  SET-INHIBITED-SUMMARY-TYPES
acl2-8.5>  SET-STATE-OK
acl2-8.5>  SET-LET*-ABSTRACTIONP
acl2-8.5>  SET-LET*-ABSTRACTION
acl2-8.5>  LET*-ABSTRACTIONP
acl2-8.5>  *INITIAL-BACKCHAIN-LIMIT*
acl2-8.5>  *INITIAL-DEFAULT-BACKCHAIN-LIMIT*
acl2-8.5>  SET-BACKCHAIN-LIMIT
acl2-8.5>  BACKCHAIN-LIMIT
acl2-8.5>  SET-DEFAULT-BACKCHAIN-LIMIT
acl2-8.5>  DEFAULT-BACKCHAIN-LIMIT
acl2-8.5>  STEP-LIMIT-FROM-TABLE
acl2-8.5>  SET-PROVER-STEP-LIMIT
acl2-8.5>  *DEFAULT-REWRITE-STACK-LIMIT*
acl2-8.5>  SET-REWRITE-STACK-LIMIT
acl2-8.5>  REWRITE-STACK-LIMIT
acl2-8.5>  CASE-SPLIT-LIMITATIONS
acl2-8.5>  SR-LIMIT
acl2-8.5>  CASE-LIMIT
acl2-8.5>  SET-CASE-SPLIT-LIMITATIONS
acl2-8.5>  *INITIAL-ACL2-DEFAULTS-TABLE*
acl2-8.5>  UNTRANS-TABLE
acl2-8.5>  UNTRANS-TABLE
acl2-8.5>  ADD-MACRO-FN
acl2-8.5>  ADD-BINOP
acl2-8.5>  REMOVE-MACRO-FN
acl2-8.5>  REMOVE-BINOP
acl2-8.5>  MATCH-FREE-DEFAULT
acl2-8.5>  SET-MATCH-FREE-DEFAULT
acl2-8.5>  SET-MATCH-FREE-ERROR
acl2-8.5>  MATCH-FREE-OVERRIDE
acl2-8.5>  ADD-MATCH-FREE-OVERRIDE
acl2-8.5>  ADD-INCLUDE-BOOK-DIR
acl2-8.5>  DELETE-INCLUDE-BOOK-DIR
acl2-8.5>  INCLUDE-BOOK-DIR!-TABLE
acl2-8.5>  RAW-INCLUDE-BOOK-DIR-P
acl2-8.5>  ADD-INCLUDE-BOOK-DIR!
acl2-8.5>  DELETE-INCLUDE-BOOK-DIR!
acl2-8.5>  *NON-LINEAR-ROUNDS-VALUE*
acl2-8.5>  NON-LINEARP
acl2-8.5>  SET-NON-LINEARP
acl2-8.5>  SET-NON-LINEAR
acl2-8.5>  TAU-AUTO-MODEP
acl2-8.5>  SET-TAU-AUTO-MODE
acl2-8.5>  GET-IN-THEORY-REDUNDANT-OKP
acl2-8.5>  DEFTTAG
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES
acl2-8.5>  ADD-MACRO-ALIAS
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  DELETE-ASSOC-EQ-EXEC
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  DELETE-ASSOC-EQL-EXEC
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  DELETE-ASSOC-EQUAL
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  DELETE-ASSOC-EQ
acl2-8.5>  DELETE-ASSOC
acl2-8.5>  REMOVE-MACRO-ALIAS
acl2-8.5>  NTH-ALIASES-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  NTH-ALIASES
acl2-8.5>  ADD-NTH-ALIAS
acl2-8.5>  REMOVE-NTH-ALIAS
acl2-8.5>  DEFAULT-HINTS
acl2-8.5>  SET-DEFAULT-HINTS
acl2-8.5>  SET-DEFAULT-HINTS!
acl2-8.5>  ADD-DEFAULT-HINTS
acl2-8.5>  ADD-DEFAULT-HINTS!
acl2-8.5>  REMOVE-DEFAULT-HINTS
acl2-8.5>  REMOVE-DEFAULT-HINTS!
acl2-8.5>  SET-OVERRIDE-HINTS-MACRO
acl2-8.5>  ADD-OVERRIDE-HINTS!
acl2-8.5>  ADD-OVERRIDE-HINTS
acl2-8.5>  SET-OVERRIDE-HINTS!
acl2-8.5>  SET-OVERRIDE-HINTS
acl2-8.5>  REMOVE-OVERRIDE-HINTS!
acl2-8.5>  REMOVE-OVERRIDE-HINTS
acl2-8.5>  SET-RW-CACHE-STATE
acl2-8.5>  SET-RW-CACHE-STATE!
acl2-8.5>  *LEGAL-RW-CACHE-STATES*
acl2-8.5>  RW-CACHE-STATE-TABLE
acl2-8.5>  INDUCTION-DEPTH-LIMIT-TABLE
acl2-8.5>  *INDUCTION-DEPTH-LIMIT-DEFAULT*
acl2-8.5>  INDUCTION-DEPTH-LIMIT-TABLE
acl2-8.5>  SET-INDUCTION-DEPTH-LIMIT!
acl2-8.5>  SET-INDUCTION-DEPTH-LIMIT
acl2-8.5>  TRUE-LIST-FIX-EXEC
acl2-8.5>  TRUE-LIST-FIX
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  NIL
acl2-8.5>  FIX-TRUE-LIST
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  NIL
acl2-8.5>  BOOLEAN-LISTP
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-+
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-*
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-UNARY-MINUS
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-UNARY-/
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-<
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-CAR
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-CDR
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-CHAR-CODE
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-CODE-CHAR
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-COMPLEX
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  T
acl2-8.5>  COMPLETION-OF-COERCE
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-DENOMINATOR
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-IMAGPART
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-NUMERATOR
acl2-8.5>  NIL
acl2-8.5>  COMPLETION-OF-REALPART
acl2-8.5>  NIL
acl2-8.5>  DOUBLE-REWRITE
acl2-8.5>  CHK-WITH-PROVER-TIME-LIMIT-ARG
acl2-8.5>  WITH-PROVER-TIME-LIMIT1
acl2-8.5>  WITH-PROVER-TIME-LIMIT
acl2-8.5>  CATCH-TIME-LIMIT5
acl2-8.5>  *INTERRUPT-STRING*
acl2-8.5>  TIME-LIMIT5-REACHED-P
acl2-8.5>  CATCH-STEP-LIMIT
acl2-8.5>  *GUARD-CHECKING-VALUES*
acl2-8.5>  CHK-WITH-GUARD-CHECKING-ARG
acl2-8.5>  WITH-GUARD-CHECKING1
acl2-8.5>  WITH-GUARD-CHECKING-GATE
acl2-8.5>  WITH-GUARD-CHECKING
acl2-8.5>  WITH-GUARD-CHECKING-ERROR-TRIPLE
acl2-8.5>  WITH-GUARD-CHECKING-EVENT
acl2-8.5>  ABORT!
acl2-8.5>  A!
acl2-8.5>  P!
acl2-8.5>  NIL
acl2-8.5>  BIND-ACL2-TIME-LIMIT
acl2-8.5>  OUR-WITH-TERMINAL-INPUT
acl2-8.5>  WORMHOLE1
acl2-8.5>  WORMHOLE-P
acl2-8.5>  DUPLICATES
acl2-8.5>  SET-EQUALP-EQUAL
acl2-8.5>  |Access METAFUNCTION-CONTEXT record field UNIFY-SUBST|
acl2-8.5>  |Access REWRITE-CONSTANT record field CURRENT-CLAUSE|
acl2-8.5>  RECORD-ERROR
acl2-8.5>  RECORD-ACCESSOR-FUNCTION-NAME
acl2-8.5>  ACCESS
acl2-8.5>  MFC-CLAUSE
acl2-8.5>  MFC-RDEPTH
acl2-8.5>  TYPE-ALIST-ENTRYP
acl2-8.5>  TYPE-ALISTP
acl2-8.5>  MFC-TYPE-ALIST
acl2-8.5>  MFC-ANCESTORS
acl2-8.5>  MFC-UNIFY-SUBST
acl2-8.5>  MFC-WORLD
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  BAD-ATOM
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  BOOLEANP-BAD-ATOM<=
acl2-8.5>  BAD-ATOM<=-ANTISYMMETRIC
acl2-8.5>  BAD-ATOM<=-TRANSITIVE
acl2-8.5>  BAD-ATOM<=-TOTAL
acl2-8.5>  ALPHORDER
acl2-8.5>  LEXORDER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MERGE-LEXORDER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  MERGE-SORT-LEXORDER
acl2-8.5>  IF*
acl2-8.5>  RESIZE-LIST-EXEC
acl2-8.5>  RESIZE-LIST
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  E/D-FN
acl2-8.5>  E/D
acl2-8.5> <state>
acl2-8.5> 
acl2-8.5> To verify that the 30 encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOGIC)
acl2-8.5> :INVISIBLE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP)
acl2-8.5> 
acl2-8.5> The admission of ALISTP is trivial, using the relation O< (which is
acl2-8.5> known to be well-founded on the domain recognized by O-P) and the measure
acl2-8.5> (ACL2-COUNT L).  We observe that the type of ALISTP is described by
acl2-8.5> the theorem (OR (EQUAL (ALISTP L) T) (EQUAL (ALISTP L) NIL)).  We used
acl2-8.5> primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ALISTP....
acl2-8.5> 
acl2-8.5> The guard conjecture for ALISTP is trivial to prove.  ALISTP is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALISTP ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ALISTP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP)
acl2-8.5> 
acl2-8.5> The admission of SYMBOL-ALISTP is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of SYMBOL-ALISTP
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (SYMBOL-ALISTP X) T) (EQUAL (SYMBOL-ALISTP X) NIL)).  We
acl2-8.5> used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SYMBOL-ALISTP....
acl2-8.5> 
acl2-8.5> The guard conjecture for SYMBOL-ALISTP is trivial to prove.  SYMBOL-ALISTP
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-ALISTP ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SYMBOL-ALISTP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN TRUE-LISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TRUE-LISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN)
acl2-8.5> 
acl2-8.5> The event ( DEFUN LEN ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LEN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH)
acl2-8.5> 
acl2-8.5> The event ( DEFUN LENGTH ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LENGTH ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH)
acl2-8.5> 
acl2-8.5> The admission of NTH is trivial, using the relation O< (which is known
acl2-8.5> to be well-founded on the domain recognized by O-P) and the measure
acl2-8.5> (ACL2-COUNT N).  We could deduce no constraints on the type of NTH.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for NTH....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for NTH, given primitive
acl2-8.5> type reasoning, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (TRUE-LISTP L)
acl2-8.5>               (<= 0 N)
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (NOT (ENDP L))
acl2-8.5>               (NOT (ZP N)))
acl2-8.5>          (<= 0 (+ -1 N))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions ENDP
acl2-8.5> and ZP and the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for NTH.  NTH is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NTH ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION ZP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  62
acl2-8.5> NTH
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR)
acl2-8.5> 
acl2-8.5> Since CHAR is non-recursive, its admission is trivial.  We could deduce
acl2-8.5> no constraints on the type of CHAR.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CHAR....
acl2-8.5> 
acl2-8.5> The guard conjecture for CHAR is trivial to prove, given primitive
acl2-8.5> type reasoning and the :type-prescription rule LENGTH.  CHAR is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CHAR ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP)
acl2-8.5> 
acl2-8.5> The admission of EQLABLE-ALISTP is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of EQLABLE-ALISTP
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (EQLABLE-ALISTP X) T) (EQUAL (EQLABLE-ALISTP X) NIL)). 
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for EQLABLE-ALISTP....
acl2-8.5> 
acl2-8.5> The guard conjecture for EQLABLE-ALISTP is trivial to prove.  EQLABLE-ALISTP
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EQLABLE-ALISTP ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> EQLABLE-ALISTP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The admission of ASSOC-EQL-EXEC is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT ALIST).  We could deduce no constraints on the
acl2-8.5> type of ASSOC-EQL-EXEC.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ASSOC-EQL-EXEC....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for ASSOC-EQL-EXEC is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (EQLABLEP X)
acl2-8.5>                    (NOT (CONSP ALIST)))
acl2-8.5>               (EQ ALIST NIL))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (EQLABLEP X)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQL X (CAR (CAR ALIST)))))
acl2-8.5>               (ALISTP (CDR ALIST)))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (EQLABLEP X)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (EQUAL (CAR ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>                    (NOT (EQLABLEP X))
acl2-8.5>                    (NOT (ENDP ALIST)))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST))))
acl2-8.5>      (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>                    (NOT (EQLABLEP X))
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (EQUAL (CAR ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>                    (NOT (EQLABLEP X))
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQL X (CAR (CAR ALIST)))))
acl2-8.5>               (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>      (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>                    (NOT (EQLABLEP X))
acl2-8.5>                    (NOT (CONSP ALIST)))
acl2-8.5>               (EQ ALIST NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the
acl2-8.5> conjecture to the following seven conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 7
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (EQLABLEP X)
acl2-8.5>               (NOT (CONSP ALIST)))
acl2-8.5>          (EQUAL ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 6
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (EQLABLEP X)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>          (ALISTP (CDR ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (EQLABLEP X)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST))))
acl2-8.5>          (EQUAL (CAR ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (ACL2-NUMBERP X))
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (NOT (CHARACTERP X))
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (SYMBOLP (CAR (CAR ALIST)))))
acl2-8.5>          (CHARACTERP (CAR (CAR ALIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (ACL2-NUMBERP X))
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (NOT (CHARACTERP X))
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST))))
acl2-8.5>          (EQUAL (CAR ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (ACL2-NUMBERP X))
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (NOT (CHARACTERP X))
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>          (EQLABLE-ALISTP (CDR ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (ACL2-NUMBERP X))
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (NOT (CHARACTERP X))
acl2-8.5>               (NOT (CONSP ALIST)))
acl2-8.5>          (EQUAL ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for ASSOC-EQL-EXEC. 
acl2-8.5> ASSOC-EQL-EXEC is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQL-EXEC ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION EQL)
acl2-8.5>         (:DEFINITION EQLABLE-ALISTP)
acl2-8.5>         (:DEFINITION EQLABLEP)
acl2-8.5>         (:DEFINITION NOT))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  665
acl2-8.5> ASSOC-EQL-EXEC
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> Since ASSOC-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is
acl2-8.5> trivial.  We observe that the type of ASSOC-EQL-EXEC$GUARD-CHECK is
acl2-8.5> described by the theorem (EQUAL (ASSOC-EQL-EXEC$GUARD-CHECK X ALIST) T).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK....
acl2-8.5> 
acl2-8.5> The guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK is trivial to prove.
acl2-8.5> ASSOC-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ASSOC-EQL-EXEC$GUARD-CHECK
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL)
acl2-8.5> 
acl2-8.5> The admission of ASSOC-EQUAL is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT ALIST).  We could deduce no constraints on the
acl2-8.5> type of ASSOC-EQUAL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ASSOC-EQUAL....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for ASSOC-EQUAL is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST)))
acl2-8.5>               (EQ ALIST NIL))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (EQUAL (CAR ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>               (ALISTP (CDR ALIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST)))
acl2-8.5>          (EQUAL ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST))))
acl2-8.5>          (EQUAL (CAR ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>          (ALISTP (CDR ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for ASSOC-EQUAL.  ASSOC-EQUAL
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQUAL ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  188
acl2-8.5> ASSOC-EQUAL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS)
acl2-8.5> 
acl2-8.5> The admission of SUBLIS is trivial, using the relation O< (which is
acl2-8.5> known to be well-founded on the domain recognized by O-P) and the measure
acl2-8.5> (ACL2-COUNT TREE).  We could deduce no constraints on the type of SUBLIS.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SUBLIS....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SUBLIS is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (EQLABLE-ALISTP ALIST) (ATOM TREE))
acl2-8.5>               (LET ((X TREE))
acl2-8.5>                    (AND (OR (NOT (EQLABLEP X)) (ALISTP ALIST))
acl2-8.5>                         (OR (EQLABLEP X) (EQLABLE-ALISTP ALIST))
acl2-8.5>                         (EQUAL (ASSOC-EQUAL X ALIST)
acl2-8.5>                                (ASSOC-EQL-EXEC X ALIST)))))
acl2-8.5>      (IMPLIES (AND (EQLABLE-ALISTP ALIST) (ATOM TREE))
acl2-8.5>               (LET ((PAIR (ASSOC-EQUAL TREE ALIST)))
acl2-8.5>                    (OR (NOT PAIR)
acl2-8.5>                        (CONSP PAIR)
acl2-8.5>                        (EQUAL PAIR NIL))))).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (LET ((X TREE))
acl2-8.5>               (AND (OR (NOT (EQLABLEP X)) (ALISTP ALIST))
acl2-8.5>                    (OR (EQLABLEP X) (EQLABLE-ALISTP ALIST))
acl2-8.5>                    (EQUAL (ASSOC-EQUAL X ALIST)
acl2-8.5>                           (ASSOC-EQL-EXEC X ALIST))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
acl2-8.5> (if-intro) and the :type-prescription rule EQLABLE-ALISTP, to the following
acl2-8.5> four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.4
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Subgoal 2.3
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Name the formula above *2.
acl2-8.5> 
acl2-8.5> Subgoal 2.2
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Name the formula above *3.
acl2-8.5> 
acl2-8.5> Subgoal 2.1
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Name the formula above *4.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST)
acl2-8.5>               (NOT (CONSP (ASSOC-EQUAL TREE ALIST))))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST) NIL)).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal 1'
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> Name the formula above *5.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *5 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to two.
acl2-8.5> These merge into one derived induction scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (ASSOC-EQUAL TREE ALIST).
acl2-8.5> This suggestion was produced using the :induction rules ASSOC-EQUAL
acl2-8.5> and EQLABLE-ALISTP.  If we let (:P ALIST TREE) denote *5 above then
acl2-8.5> the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>                    (:P (CDR ALIST) TREE))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>                    (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (ENDP ALIST) (:P ALIST TREE))).
acl2-8.5> This induction is justified by the same argument used to admit ASSOC-EQUAL.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *5/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (CONSP (ASSOC-EQUAL TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/5'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (CONSP (ASSOC-EQUAL TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (ASSOC-EQUAL TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/4'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (ASSOC-EQUAL TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/3'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *5/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (EQUAL TREE (CAR (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/2'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (EQUAL TREE (CAR (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/1
acl2-8.5> (IMPLIES (AND (ENDP ALIST)
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ASSOC-EQUAL TREE ALIST))
acl2-8.5>          (CONSP (ASSOC-EQUAL TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQUAL
acl2-8.5> and EQLABLE-ALISTP, the :executable-counterpart of CONSP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *5.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *4, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *4 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to one.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
acl2-8.5> This suggestion was produced using the :induction rules ALISTP and
acl2-8.5> EQLABLE-ALISTP.  If we let (:P ALIST TREE) denote *4 above then the
acl2-8.5> induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (NOT (EQLABLEP (CAR (CAR ALIST)))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>                    (:P (CDR ALIST) TREE))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (ATOM ALIST) (:P ALIST TREE))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> EQLABLE-ALISTP.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *4/5
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *4/5'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *4/4
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (EQLABLEP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *4/4'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (SYMBOLP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (CHARACTERP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *4/3
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *4/3'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ALISTP,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *4/2
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *4/2'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *4/1
acl2-8.5> (IMPLIES (AND (ATOM ALIST)
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *4/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (SYMBOLP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
acl2-8.5> the :executable-counterparts of ALISTP and CONSP and primitive type
acl2-8.5> reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *4.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *3, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *3 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to one.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
acl2-8.5> This suggestion was produced using the :induction rules ALISTP and
acl2-8.5> EQLABLE-ALISTP.  If we let (:P ALIST TREE) denote *3 above then the
acl2-8.5> induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (NOT (EQLABLEP (CAR (CAR ALIST)))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>                    (:P (CDR ALIST) TREE))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (ATOM ALIST) (:P ALIST TREE))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> EQLABLE-ALISTP.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *3/5
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *3/5'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *3/4
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (EQLABLEP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *3/4'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (SYMBOLP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (CHARACTERP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *3/3
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *3/3'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ALISTP,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *3/2
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *3/2'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *3/1
acl2-8.5> (IMPLIES (AND (ATOM ALIST)
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *3/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (CHARACTERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
acl2-8.5> the :executable-counterparts of ALISTP and CONSP and primitive type
acl2-8.5> reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *3.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *2, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *2 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to one.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
acl2-8.5> This suggestion was produced using the :induction rules ALISTP and
acl2-8.5> EQLABLE-ALISTP.  If we let (:P ALIST TREE) denote *2 above then the
acl2-8.5> induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (NOT (EQLABLEP (CAR (CAR ALIST)))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>                    (CONSP (CAR ALIST))
acl2-8.5>                    (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>                    (:P (CDR ALIST) TREE))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (ATOM ALIST) (:P ALIST TREE))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> EQLABLE-ALISTP.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *2/5
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *2/5'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *2/4
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (EQLABLEP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *2/4'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (SYMBOLP (CAR (CAR ALIST))))
acl2-8.5>               (NOT (CHARACTERP (CAR (CAR ALIST))))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *2/3
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *2/3'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (ALISTP (CDR ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ALISTP,
acl2-8.5> EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal *2/2
acl2-8.5> (IMPLIES (AND (NOT (ATOM ALIST))
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *2/2'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (CONSP (CAR ALIST))
acl2-8.5>               (EQLABLEP (CAR (CAR ALIST)))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *2/1
acl2-8.5> (IMPLIES (AND (ATOM ALIST)
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *2/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE))
acl2-8.5>               (ACL2-NUMBERP TREE))
acl2-8.5>          (ALISTP ALIST)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
acl2-8.5> the :executable-counterparts of ALISTP and CONSP and primitive type
acl2-8.5> reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *2.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  These merge into one derived induction
acl2-8.5> scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by 
acl2-8.5> (ASSOC-EQL-EXEC TREE ALIST).  This suggestion was produced using the
acl2-8.5> :induction rules ASSOC-EQL-EXEC, ASSOC-EQUAL and EQLABLE-ALISTP.  If
acl2-8.5> we let (:P ALIST TREE) denote *1 above then the induction scheme we'll
acl2-8.5> use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQL TREE (CAR (CAR ALIST))))
acl2-8.5>                    (:P (CDR ALIST) TREE))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>                    (EQL TREE (CAR (CAR ALIST))))
acl2-8.5>               (:P ALIST TREE))
acl2-8.5>      (IMPLIES (ENDP ALIST) (:P ALIST TREE))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> ASSOC-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (NOT (EQL TREE (CAR (CAR ALIST))))
acl2-8.5>               (EQUAL (ASSOC-EQUAL TREE (CDR ALIST))
acl2-8.5>                      (ASSOC-EQL-EXEC TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/4'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (EQUAL (ASSOC-EQUAL TREE (CDR ALIST))
acl2-8.5>                      (ASSOC-EQL-EXEC TREE (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
acl2-8.5> ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (NOT (EQL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL TREE (CAR (CAR ALIST))))
acl2-8.5>               (NOT (EQLABLE-ALISTP (CDR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP ALIST))
acl2-8.5>               (EQL TREE (CAR (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP ALIST)
acl2-8.5>               (EQUAL TREE (CAR (CAR ALIST)))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
acl2-8.5> ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ENDP ALIST)
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP ALIST))
acl2-8.5>               (EQLABLE-ALISTP ALIST)
acl2-8.5>               (NOT (CONSP TREE)))
acl2-8.5>          (EQUAL (ASSOC-EQUAL TREE ALIST)
acl2-8.5>                 (ASSOC-EQL-EXEC TREE ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
acl2-8.5> ASSOC-EQUAL and EQLABLE-ALISTP, the :executable-counterparts of CONSP
acl2-8.5> and EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SUBLIS.  SUBLIS is
acl2-8.5> compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBLIS ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ASSOC-EQL-EXEC)
acl2-8.5>         (:DEFINITION ASSOC-EQUAL)
acl2-8.5>         (:DEFINITION ATOM)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQL)
acl2-8.5>         (:DEFINITION EQLABLE-ALISTP)
acl2-8.5>         (:DEFINITION EQLABLEP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ALISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION ALISTP)
acl2-8.5>         (:INDUCTION ASSOC-EQL-EXEC)
acl2-8.5>         (:INDUCTION ASSOC-EQUAL)
acl2-8.5>         (:INDUCTION EQLABLE-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-ALISTP))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION EQLABLEP)
acl2-8.5>              (:DEFINITION NOT))
acl2-8.5> Time:  0.02 seconds (prove: 0.01, print: 0.01, other: 0.00)
acl2-8.5> Prover steps counted:  5516
acl2-8.5> SUBLIS
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX)
acl2-8.5> 
acl2-8.5> Since NFIX is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of NFIX is described by the theorem 
acl2-8.5> (AND (INTEGERP (NFIX X)) (<= 0 (NFIX X))).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for NFIX....
acl2-8.5> 
acl2-8.5> The guard conjecture for NFIX is trivial to prove.  NFIX is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NFIX ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> NFIX
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX)
acl2-8.5> 
acl2-8.5> Since IFIX is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of IFIX is described by the theorem (INTEGERP (IFIX X)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for IFIX....
acl2-8.5> 
acl2-8.5> The guard conjecture for IFIX is trivial to prove.  IFIX is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN IFIX ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> IFIX
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS)
acl2-8.5> 
acl2-8.5> The event ( DEFUN INTEGER-ABS ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN INTEGER-ABS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ACL2-COUNT ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ACL2-COUNT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT)
acl2-8.5> 
acl2-8.5> For the admission of NONNEGATIVE-INTEGER-QUOTIENT we will use the relation
acl2-8.5> O< (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT I).  The non-trivial part of the measure
acl2-8.5> conjecture is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (NOT (OR (= (NFIX J) 0) (< (IFIX I) J)))
acl2-8.5>          (O< (ACL2-COUNT (+ I (- J)))
acl2-8.5>              (ACL2-COUNT I))).
acl2-8.5> 
acl2-8.5> By the simple :definition = we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J)))
acl2-8.5>          (O< (ACL2-COUNT (+ I (- J)))
acl2-8.5>              (ACL2-COUNT I))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT (if-intro), IFIX
acl2-8.5> (if-intro), INTEGER-ABS (if-intro), NFIX (if-intro), O-FINP and O<
acl2-8.5> (if-intro), primitive type reasoning and the :rewrite rule 
acl2-8.5> DISTRIBUTIVITY-OF-MINUS-OVER-+, to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (INTEGERP J)
acl2-8.5>               (<= 0 J)
acl2-8.5>               (NOT (EQUAL J 0))
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (<= J I)
acl2-8.5>               (< (+ I (- J)) 0))
acl2-8.5>          (< (+ (- I) (- (- J))) I)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (INTEGERP J)
acl2-8.5>               (<= 0 J)
acl2-8.5>               (NOT (EQUAL J 0))
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (<= J I)
acl2-8.5>               (<= 0 (+ I (- J))))
acl2-8.5>          (< (+ I (- J)) I)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for 
acl2-8.5> NONNEGATIVE-INTEGER-QUOTIENT.  Thus, we admit this function under the
acl2-8.5> principle of definition.  We observe that the type of 
acl2-8.5> NONNEGATIVE-INTEGER-QUOTIENT is described by the theorem 
acl2-8.5> (AND (INTEGERP (NONNEGATIVE-INTEGER-QUOTIENT I J))
acl2-8.5>      (<= 0 (NONNEGATIVE-INTEGER-QUOTIENT I J))).
acl2-8.5> We used primitive type reasoning and the :type-prescription rule NFIX.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT,
acl2-8.5> given primitive type reasoning and the :type-prescription rules IFIX,
acl2-8.5> NFIX and NONNEGATIVE-INTEGER-QUOTIENT, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (< 0 J)
acl2-8.5>               (INTEGERP J)
acl2-8.5>               (<= 0 I)
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (NOT (OR (= (NFIX J) 0) (< (IFIX I) J))))
acl2-8.5>          (<= 0 (+ I (- J)))).
acl2-8.5> 
acl2-8.5> By the simple :definition = we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (< 0 J)
acl2-8.5>               (INTEGERP J)
acl2-8.5>               (<= 0 I)
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J))))
acl2-8.5>          (<= 0 (+ I (- J)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions IFIX and NFIX and primitive
acl2-8.5> type reasoning, to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (< 0 J)
acl2-8.5>               (INTEGERP J)
acl2-8.5>               (<= 0 I)
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (<= J I))
acl2-8.5>          (<= 0 (+ I (- J)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for 
acl2-8.5> NONNEGATIVE-INTEGER-QUOTIENT.  NONNEGATIVE-INTEGER-QUOTIENT is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...)
acl2-8.5> Rules: ((:DEFINITION =)
acl2-8.5>         (:DEFINITION ACL2-COUNT)
acl2-8.5>         (:DEFINITION IFIX)
acl2-8.5>         (:DEFINITION INTEGER-ABS)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+)
acl2-8.5>         (:TYPE-PRESCRIPTION IFIX)
acl2-8.5>         (:TYPE-PRESCRIPTION NFIX)
acl2-8.5>         (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION ACL2-COUNT)
acl2-8.5>              (:DEFINITION IFIX)
acl2-8.5>              (:DEFINITION INTEGER-ABS)
acl2-8.5>              (:DEFINITION NFIX)
acl2-8.5>              (:DEFINITION O<))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  507
acl2-8.5> NONNEGATIVE-INTEGER-QUOTIENT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR)
acl2-8.5> 
acl2-8.5> Since FLOOR is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of FLOOR is described by the theorem (INTEGERP (FLOOR I J)).
acl2-8.5> We used primitive type reasoning and the :type-prescription rule 
acl2-8.5> NONNEGATIVE-INTEGER-QUOTIENT.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FLOOR....
acl2-8.5> 
acl2-8.5> The guard conjecture for FLOOR is trivial to prove, given the :executable-
acl2-8.5> counterpart of EQLABLEP, primitive type reasoning and the :type-prescription
acl2-8.5> rule NONNEGATIVE-INTEGER-QUOTIENT.  FLOOR is compliant with Common
acl2-8.5> Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FLOOR ...)
acl2-8.5> Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> FLOOR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SYMBOL-LISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-LISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND)
acl2-8.5> 
acl2-8.5> The admission of BINARY-APPEND is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of BINARY-APPEND
acl2-8.5> is described by the theorem (OR (CONSP (APPEND X Y)) (EQUAL (APPEND X Y) Y)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for BINARY-APPEND....
acl2-8.5> 
acl2-8.5> The guard conjecture for BINARY-APPEND is trivial to prove, given primitive
acl2-8.5> type reasoning.  BINARY-APPEND is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BINARY-APPEND ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> BINARY-APPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND)
acl2-8.5> 
acl2-8.5> Since STRING-APPEND is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of STRING-APPEND is described by the theorem
acl2-8.5> (STRINGP (STRING-APPEND STR1 STR2)).  We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for STRING-APPEND....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for STRING-APPEND is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (STRINGP STR2) (STRINGP STR1))
acl2-8.5>          (EQUAL (COERCE (APPEND (COERCE STR1 'LIST)
acl2-8.5>                                 (COERCE STR2 'LIST))
acl2-8.5>                         'STRING)
acl2-8.5>                 (STRING-APPEND STR1 STR2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition STRING-APPEND.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for STRING-APPEND.  
acl2-8.5> STRING-APPEND is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STRING-APPEND ...)
acl2-8.5> Rules: ((:DEFINITION STRING-APPEND)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  32
acl2-8.5> STRING-APPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP)
acl2-8.5> 
acl2-8.5> The admission of PLIST-WORLDP is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT ALIST).  We observe that the type of PLIST-WORLDP
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (PLIST-WORLDP ALIST) T) (EQUAL (PLIST-WORLDP ALIST) NIL)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for PLIST-WORLDP....
acl2-8.5> 
acl2-8.5> The guard conjecture for PLIST-WORLDP is trivial to prove.  PLIST-WORLDP
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PLIST-WORLDP ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PLIST-WORLDP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP)
acl2-8.5> 
acl2-8.5> The admission of FGETPROP is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT WORLD-ALIST).  We could deduce no constraints on
acl2-8.5> the type of FGETPROP.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FGETPROP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for FGETPROP is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (CONSP WORLD-ALIST)))
acl2-8.5>               (EQ WORLD-ALIST NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (NOT (CONSP (CAR WORLD-ALIST))))
acl2-8.5>               (EQUAL (CAR WORLD-ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                              (EQ KEY (CADR (CAR WORLD-ALIST))))))
acl2-8.5>               (PLIST-WORLDP (CDR WORLD-ALIST)))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                         (EQ KEY (CADR (CAR WORLD-ALIST))))
acl2-8.5>                    (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>               (EQUAL (CDR (CAR WORLD-ALIST)) NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                    (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>               (EQUAL (CDR (CAR WORLD-ALIST)) NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following five conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (NOT (CONSP WORLD-ALIST)))
acl2-8.5>          (EQUAL WORLD-ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (NOT (CONSP (CAR WORLD-ALIST))))
acl2-8.5>          (EQUAL (CAR WORLD-ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                         (EQUAL KEY (CADR (CAR WORLD-ALIST))))))
acl2-8.5>          (PLIST-WORLDP (CDR WORLD-ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>               (EQUAL KEY (CADR (CAR WORLD-ALIST)))
acl2-8.5>               (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>          (EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>               (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>          (EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for FGETPROP.  FGETPROP
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FGETPROP ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION PLIST-WORLDP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  704
acl2-8.5> FGETPROP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP)
acl2-8.5> 
acl2-8.5> The admission of SGETPROP is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT WORLD-ALIST).  We could deduce no constraints on
acl2-8.5> the type of SGETPROP.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SGETPROP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SGETPROP is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP WORLD-NAME)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (CONSP WORLD-ALIST)))
acl2-8.5>               (EQ WORLD-ALIST NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP WORLD-NAME)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (NOT (CONSP (CAR WORLD-ALIST))))
acl2-8.5>               (EQUAL (CAR WORLD-ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP WORLD-NAME)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                              (EQ KEY (CADR (CAR WORLD-ALIST))))))
acl2-8.5>               (PLIST-WORLDP (CDR WORLD-ALIST)))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP WORLD-NAME)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                         (EQ KEY (CADR (CAR WORLD-ALIST))))
acl2-8.5>                    (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>               (EQUAL (CDR (CAR WORLD-ALIST)) NIL))
acl2-8.5>      (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>                    (SYMBOLP WORLD-NAME)
acl2-8.5>                    (SYMBOLP KEY)
acl2-8.5>                    (SYMBOLP SYMB)
acl2-8.5>                    (NOT (ENDP WORLD-ALIST))
acl2-8.5>                    (EQ SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                    (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>               (EQUAL (CDR (CAR WORLD-ALIST)) NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following five conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP WORLD-NAME)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (NOT (CONSP WORLD-ALIST)))
acl2-8.5>          (EQUAL WORLD-ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP WORLD-NAME)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (NOT (CONSP (CAR WORLD-ALIST))))
acl2-8.5>          (EQUAL (CAR WORLD-ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP WORLD-NAME)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>                         (EQUAL KEY (CADR (CAR WORLD-ALIST))))))
acl2-8.5>          (PLIST-WORLDP (CDR WORLD-ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP WORLD-NAME)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>               (EQUAL KEY (CADR (CAR WORLD-ALIST)))
acl2-8.5>               (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>          (EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
acl2-8.5>               (SYMBOLP WORLD-NAME)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (SYMBOLP SYMB)
acl2-8.5>               (CONSP WORLD-ALIST)
acl2-8.5>               (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
acl2-8.5>               (NOT (CONSP (CDR (CAR WORLD-ALIST)))))
acl2-8.5>          (EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SGETPROP.  SGETPROP
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SGETPROP ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION PLIST-WORLDP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  804
acl2-8.5> SGETPROP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP)
acl2-8.5> 
acl2-8.5> Since FUNCTION-SYMBOLP is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of FUNCTION-SYMBOLP is described by the theorem
acl2-8.5> (OR (EQUAL (FUNCTION-SYMBOLP SYM WRLD) T)
acl2-8.5>     (EQUAL (FUNCTION-SYMBOLP SYM WRLD)
acl2-8.5>            NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FUNCTION-SYMBOLP....
acl2-8.5> 
acl2-8.5> The guard conjecture for FUNCTION-SYMBOLP is trivial to prove.  
acl2-8.5> FUNCTION-SYMBOLP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FUNCTION-SYMBOLP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> FUNCTION-SYMBOLP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS)
acl2-8.5> 
acl2-8.5> The admission of STRIP-CARS is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of STRIP-CARS is
acl2-8.5> described by the theorem (TRUE-LISTP (STRIP-CARS X)).  We used primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for STRIP-CARS....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for STRIP-CARS is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP X) (NOT (CONSP X)))
acl2-8.5>               (EQ X NIL))
acl2-8.5>      (IMPLIES (AND (ALISTP X) (NOT (ENDP X)))
acl2-8.5>               (ALISTP (CDR X)))
acl2-8.5>      (IMPLIES (AND (ALISTP X)
acl2-8.5>                    (NOT (ENDP X))
acl2-8.5>                    (NOT (CONSP (CAR X))))
acl2-8.5>               (EQUAL (CAR X) NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (ALISTP X) (NOT (CONSP X)))
acl2-8.5>          (EQUAL X NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (ALISTP X) (CONSP X))
acl2-8.5>          (ALISTP (CDR X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (ALISTP X)
acl2-8.5>               (CONSP X)
acl2-8.5>               (NOT (CONSP (CAR X))))
acl2-8.5>          (EQUAL (CAR X) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for STRIP-CARS.  STRIP-CARS
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STRIP-CARS ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  174
acl2-8.5> STRIP-CARS
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> Since ASSOC-EQ-EXEC$GUARD-CHECK is non-recursive, its admission is
acl2-8.5> trivial.  We observe that the type of ASSOC-EQ-EXEC$GUARD-CHECK is
acl2-8.5> described by the theorem (EQUAL (ASSOC-EQ-EXEC$GUARD-CHECK X ALIST) T).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK....
acl2-8.5> 
acl2-8.5> The guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK is trivial to prove.
acl2-8.5> ASSOC-EQ-EXEC$GUARD-CHECK is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ASSOC-EQ-EXEC$GUARD-CHECK
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC)
acl2-8.5> 
acl2-8.5> The admission of ASSOC-EQ-EXEC is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT ALIST).  We could deduce no constraints on the
acl2-8.5> type of ASSOC-EQ-EXEC.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ASSOC-EQ-EXEC....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for ASSOC-EQ-EXEC is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (SYMBOLP X)
acl2-8.5>                    (NOT (CONSP ALIST)))
acl2-8.5>               (EQ ALIST NIL))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (SYMBOLP X)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQ X (CAR (CAR ALIST)))))
acl2-8.5>               (ALISTP (CDR ALIST)))
acl2-8.5>      (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>                    (SYMBOLP X)
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (EQUAL (CAR ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>                    (NOT (SYMBOLP X))
acl2-8.5>                    (NOT (ENDP ALIST)))
acl2-8.5>               (SYMBOLP (CAR (CAR ALIST))))
acl2-8.5>      (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>                    (NOT (SYMBOLP X))
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (CONSP (CAR ALIST))))
acl2-8.5>               (EQUAL (CAR ALIST) NIL))
acl2-8.5>      (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>                    (NOT (SYMBOLP X))
acl2-8.5>                    (NOT (ENDP ALIST))
acl2-8.5>                    (NOT (EQ X (CAR (CAR ALIST)))))
acl2-8.5>               (SYMBOL-ALISTP (CDR ALIST)))
acl2-8.5>      (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>                    (NOT (SYMBOLP X))
acl2-8.5>                    (NOT (CONSP ALIST)))
acl2-8.5>               (EQ ALIST NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following seven conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 7
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (SYMBOLP X)
acl2-8.5>               (NOT (CONSP ALIST)))
acl2-8.5>          (EQUAL ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 6
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (SYMBOLP X)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>          (ALISTP (CDR ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (ALISTP ALIST)
acl2-8.5>               (SYMBOLP X)
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST))))
acl2-8.5>          (EQUAL (CAR ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (CONSP ALIST))
acl2-8.5>          (SYMBOLP (CAR (CAR ALIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (CONSP (CAR ALIST))))
acl2-8.5>          (EQUAL (CAR ALIST) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (CONSP ALIST)
acl2-8.5>               (NOT (EQUAL X (CAR (CAR ALIST)))))
acl2-8.5>          (SYMBOL-ALISTP (CDR ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (SYMBOL-ALISTP ALIST)
acl2-8.5>               (NOT (SYMBOLP X))
acl2-8.5>               (NOT (CONSP ALIST)))
acl2-8.5>          (EQUAL ALIST NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for ASSOC-EQ-EXEC.  
acl2-8.5> ASSOC-EQ-EXEC is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQ-EXEC ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION SYMBOL-ALISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  547
acl2-8.5> ASSOC-EQ-EXEC
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST)
acl2-8.5> 
acl2-8.5> Since TABLE-ALIST is non-recursive, its admission is trivial.  We could
acl2-8.5> deduce no constraints on the type of TABLE-ALIST.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TABLE-ALIST....
acl2-8.5> 
acl2-8.5> The guard conjecture for TABLE-ALIST is trivial to prove.  TABLE-ALIST
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TABLE-ALIST ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TABLE-ALIST
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export TABLE-ALIST, ASSOC-EQ-EXEC, ASSOC-EQ-EXEC$GUARD-CHECK, STRIP-CARS,
acl2-8.5> FUNCTION-SYMBOLP, SGETPROP, FGETPROP, PLIST-WORLDP, STRING-APPEND,
acl2-8.5> BINARY-APPEND, FLOOR, NONNEGATIVE-INTEGER-QUOTIENT, IFIX, NFIX, SUBLIS,
acl2-8.5> ASSOC-EQUAL, ASSOC-EQL-EXEC$GUARD-CHECK, ASSOC-EQL-EXEC, EQLABLE-ALISTP,
acl2-8.5> CHAR, NTH, SYMBOL-ALISTP and ALISTP.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOGIC) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.11 seconds (prove: 0.02, print: 0.01, other: 0.07)
acl2-8.5> Prover steps counted:  9199
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MOD-EXPT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MOD-EXPT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONJOIN-CLAUSES ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CONJOIN-CLAUSES
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TRUE-CLAUSE* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *TRUE-CLAUSE*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *FALSE-CLAUSE* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *FALSE-CLAUSE*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CLAUSES-RESULT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CLAUSES-RESULT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( TABLE EVISC-TABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  EVISC-TABLE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TOP-HINT-KEYWORDS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *TOP-HINT-KEYWORDS*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *HINT-KEYWORDS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *HINT-KEYWORDS*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( TABLE CUSTOM-KEYWORDS-TABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CUSTOM-KEYWORDS-TABLE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  ADD-CUSTOM-KEYWORD-HINT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  REMOVE-CUSTOM-KEYWORD-HINT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SPLICE-KEYWORD-ALIST ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SPLICE-KEYWORD-ALIST
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SHOW-CUSTOM-KEYWORD-HINT-EXPANSION
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FN-GUARD ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SEARCH-FN-GUARD
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FROM-START ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SEARCH-FROM-START
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FROM-END ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SEARCH-FROM-END
acl2-8.5> 
acl2-8.5> To verify that the 18 encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1
acl2-8.5>                         (EQUAL (LEN (STRING-DOWNCASE1 X))
acl2-8.5>                                (LEN X))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM STRINGP-SUBSEQ
acl2-8.5>                         (IMPLIES (STRINGP STR)
acl2-8.5>                                  (STRINGP (SUBSEQ STR START END)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-NTHCDR
acl2-8.5>                   (IMPLIES (STANDARD-CHAR-LISTP X)
acl2-8.5>                            (STANDARD-CHAR-LISTP (NTHCDR N X)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND
acl2-8.5>                   (IMPLIES (AND (STANDARD-CHAR-LISTP X)
acl2-8.5>                                 (STANDARD-CHAR-LISTP AC))
acl2-8.5>                            (STANDARD-CHAR-LISTP (REVAPPEND X AC)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE
acl2-8.5>                   (IMPLIES (AND (STANDARD-CHAR-LISTP X)
acl2-8.5>                                 (<= N (LEN X)))
acl2-8.5>                            (STANDARD-CHAR-LISTP (TAKE N X)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE
acl2-8.5>                         (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X)))
acl2-8.5>                                  (CHARACTER-LISTP (TAKE N X)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR
acl2-8.5>                         (IMPLIES (CHARACTER-LISTP X)
acl2-8.5>                                  (CHARACTER-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL)))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM LEN-NTHCDR
acl2-8.5>                         (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                                (NFIX (- (LEN X) (NFIX N))))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL
acl2-8.5>             (DEFTHM
acl2-8.5>                  SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
acl2-8.5>                  (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>                                (NATP START)
acl2-8.5>                                (NATP END)
acl2-8.5>                                (<= START END)
acl2-8.5>                                (<= END (LENGTH SEQ))
acl2-8.5>                                (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
acl2-8.5>                           (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END)
acl2-8.5>                                                        'LIST)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
acl2-8.5>                         (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                                (TRUE-LISTP Y))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
acl2-8.5>                         (IMPLIES (TRUE-LISTP X)
acl2-8.5>                                  (TRUE-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ
acl2-8.5>                         (IMPLIES (TRUE-LISTP SEQ)
acl2-8.5>                                  (TRUE-LISTP (SUBSEQ SEQ START END)))
acl2-8.5>                         :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION)))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM LEN-REVAPPEND
acl2-8.5>                         (EQUAL (LEN (REVAPPEND X Y))
acl2-8.5>                                (+ (LEN X) (LEN Y)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM LEN-OF-TAKE
acl2-8.5>                         (EQUAL (LEN (TAKE N LST)) (NFIX N))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ
acl2-8.5>                         (IMPLIES (AND (TRUE-LISTP SEQ)
acl2-8.5>                                       (NATP START)
acl2-8.5>                                       (NATP END)
acl2-8.5>                                       (<= START END))
acl2-8.5>                                  (EQUAL (LEN (SUBSEQ SEQ START END))
acl2-8.5>                                         (- END START)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL
acl2-8.5>           (DEFTHM LEN-SUBSEQ-STRING
acl2-8.5>                   (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>                                 (NATP START)
acl2-8.5>                                 (NATP END)
acl2-8.5>                                 (<= START END)
acl2-8.5>                                 (<= END (LEN (COERCE SEQ 'LIST))))
acl2-8.5>                            (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
acl2-8.5>                                   (- END START)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFUN
acl2-8.5>           SEARCH-FN
acl2-8.5>           (SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                 START1 START2 END1 END2 END1P END2P)
acl2-8.5>           (DECLARE
acl2-8.5>             (XARGS
acl2-8.5>                  :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                                          START1 START2 END1 END2 END1P END2P)
acl2-8.5>                  :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ)))))
acl2-8.5>           (LET*
acl2-8.5>            ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>             (END2 (IF END2P END2 (LENGTH SEQ2)))
acl2-8.5>             (SEQ1 (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>            (MV-LET
acl2-8.5>             (SEQ1 SEQ2)
acl2-8.5>             (COND ((EQ TEST 'CHAR-EQUAL)
acl2-8.5>                    (MV (STRING-DOWNCASE SEQ1)
acl2-8.5>                        (STRING-DOWNCASE SEQ2)))
acl2-8.5>                   (T (MV SEQ1 SEQ2)))
acl2-8.5>             (AND (<= (- END1 START1) (- END2 START2))
acl2-8.5>                  (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL))
acl2-8.5>                        (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)))))))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SEARCH-FN
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export SEARCH-FN.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.01)
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SEARCH ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SEARCH
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  DEFTHM events are skipped when the
acl2-8.5> default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-STRINGP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  COUNT-STRINGP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-LISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  COUNT-LISTP
acl2-8.5> 
acl2-8.5> To verify that the two encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
acl2-8.5>                         (IMPLIES (TRUE-LISTP X)
acl2-8.5>                                  (TRUE-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFUN
acl2-8.5>              COUNT-FN (ITEM SEQUENCE START END)
acl2-8.5>              (DECLARE
acl2-8.5>                   (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE)
acl2-8.5>                                          T (STRINGP SEQUENCE))
acl2-8.5>                                      (NATP START)
acl2-8.5>                                      (OR (NULL END)
acl2-8.5>                                          (AND (NATP END)
acl2-8.5>                                               (<= END (LENGTH SEQUENCE)))))))
acl2-8.5>              (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>                   (COND ((<= END START) 0)
acl2-8.5>                         ((STRINGP SEQUENCE)
acl2-8.5>                          (COUNT-STRINGP ITEM SEQUENCE START END))
acl2-8.5>                         (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE)
acl2-8.5>                                         (- END START))))))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> COUNT-FN
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export COUNT-FN.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO COUNT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  COUNT
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-TERMINATION events are skipped
acl2-8.5> when the default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-TERMINATION events are skipped
acl2-8.5> when the default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-TERMINATION events are skipped
acl2-8.5> when the default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-TERMINATION events are skipped
acl2-8.5> when the default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-SHARP-ATSIGN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MAKE-SHARP-ATSIGN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SHARP-ATSIGN-ALIST ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SHARP-ATSIGN-ALIST
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME$1 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TIME$1
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TIME$
acl2-8.5> 
acl2-8.5> To verify that the six encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
acl2-8.5>                         (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                                (TRUE-LISTP Y))))
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  LOCAL events are skipped when the default-
acl2-8.5> defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(VERIFY-GUARDS THROW-NONEXEC-ERROR)
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-GUARDS events are skipped when
acl2-8.5> the default-defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(VERIFY-GUARDS DEFUN-NX-FORM)
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-GUARDS events are skipped when
acl2-8.5> the default-defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(VERIFY-GUARDS DEFUN-NX-FN)
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-GUARDS events are skipped when
acl2-8.5> the default-defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-GUARDS events are skipped when
acl2-8.5> the default-defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  VERIFY-GUARDS events are skipped when
acl2-8.5> the default-defun-mode is :PROGRAM.
acl2-8.5> NIL
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> ACL2 Observation in ( ENCAPSULATE NIL (LOCAL ...) ...):  The submitted
acl2-8.5> encapsulate event has created no new ACL2 events, and thus is leaving
acl2-8.5> the ACL2 logical world unchanged.  See :DOC encapsulate.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC$-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC$-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GC$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC$
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC-VERBOSE-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC-VERBOSE-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GC-VERBOSE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC-VERBOSE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GET-WORMHOLE-STATUS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GET-WORMHOLE-STATUS
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FILE-WRITE-DATE$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  FILE-WRITE-DATE$
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DELETE-FILE$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DELETE-FILE$
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DEBUGGER-ENABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DEBUGGER-ENABLE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BREAK$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  BREAK$
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PRINT-CALL-HISTORY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PRINT-CALL-HISTORY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DEBUGGER-ENABLEDP-VAL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DEBUGGER-ENABLEDP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DEBUGGER-ENABLEDP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAYBE-PRINT-CALL-HISTORY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MAYBE-PRINT-CALL-HISTORY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WITH-RECKLESS-READTABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  WITH-RECKLESS-READTABLE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-DEBUGGER-ENABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-DEBUGGER-ENABLE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-DEBUGGER-ENABLE-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-DEBUGGER-ENABLE-FN
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  IN-THEORY events are skipped when the
acl2-8.5> default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  IN-THEORY events are skipped when the
acl2-8.5> default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> ACL2 Observation in TOP-LEVEL:  IN-THEORY events are skipped when the
acl2-8.5> default-defun-mode is :PROGRAM.
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ADD-@PAR-SUFFIX ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  ADD-@PAR-SUFFIX
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GENERATE-@PAR-MAPPINGS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GENERATE-@PAR-MAPPINGS
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *@PAR-MAPPINGS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *@PAR-MAPPINGS*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MAKE-IDENTITY-FOR-@PAR-MAPPINGS
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEFINE-@PAR-MACROS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DEFINE-@PAR-MACROS
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CATCH-TIME-LIMIT5@PAR (&REST RST)
acl2-8.5>                    (CONS 'CATCH-TIME-LIMIT5 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CATCH-TIME-LIMIT5@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'CMP-AND-VALUE-TO-ERROR-QUADRUPLE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CMP-TO-ERROR-TRIPLE@PAR (&REST RST)
acl2-8.5>                    (CONS 'CMP-TO-ERROR-TRIPLE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CMP-TO-ERROR-TRIPLE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ER@PAR (&REST RST)
acl2-8.5>                    (CONS 'ER RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ER@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ER-LET*@PAR (&REST RST)
acl2-8.5>                    (CONS 'ER-LET* RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER-LET*@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ER-LET*@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ER-PROGN@PAR (&REST RST)
acl2-8.5>                    (CONS 'ER-PROGN RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER-PROGN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ER-PROGN@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ERROR-FMS@PAR (&REST RST)
acl2-8.5>                    (CONS 'ERROR-FMS RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-FMS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ERROR-FMS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'ERROR-IN-PARALLELISM-MODE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ERROR-IN-PARALLELISM-MODE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ERROR1@PAR (&REST RST)
acl2-8.5>                    (CONS 'ERROR1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ERROR1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST)
acl2-8.5>                    (CONS 'F-PUT-GLOBAL RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO F-PUT-GLOBAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> F-PUT-GLOBAL@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO IO?@PAR (&REST RST)
acl2-8.5>                    (CONS 'IO? RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO IO?@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> IO?@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO IO?-PROVE@PAR (&REST RST)
acl2-8.5>                    (CONS 'IO?-PROVE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO IO?-PROVE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> IO?-PROVE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MV@PAR (&REST RST)
acl2-8.5>                    (CONS 'MV RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MV@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MV@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MV-LET@PAR (&REST RST)
acl2-8.5>                    (CONS 'MV-LET RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MV-LET@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MV-LET@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST)
acl2-8.5>                    (CONS 'PARALLEL-ONLY RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PARALLEL-ONLY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PARALLEL-ONLY@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO PPROGN@PAR (&REST RST)
acl2-8.5>                    (CONS 'PPROGN RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PPROGN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PPROGN@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST)
acl2-8.5>                    (CONS 'SERIAL-ONLY RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-ONLY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SERIAL-ONLY@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO SL-LET@PAR (&REST RST)
acl2-8.5>                    (CONS 'SL-LET RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SL-LET@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SL-LET@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO STATE-MAC@PAR (&REST RST)
acl2-8.5>                    (CONS 'STATE-MAC RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO STATE-MAC@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> STATE-MAC@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO VALUE@PAR (&REST RST)
acl2-8.5>                    (CONS 'VALUE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> VALUE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WARNING$@PAR (&REST RST)
acl2-8.5>                    (CONS 'WARNING$ RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WARNING$@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WARNING$@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'ADD-CUSTOM-KEYWORD-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ADD-CUSTOM-KEYWORD-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST)
acl2-8.5>                    (CONS 'EVAL-CLAUSE-PROCESSOR RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> EVAL-CLAUSE-PROCESSOR@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO EVAL-THEORY-EXPR@PAR (&REST RST)
acl2-8.5>                    (CONS 'EVAL-THEORY-EXPR RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-THEORY-EXPR@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> EVAL-THEORY-EXPR@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO FORMAL-VALUE-TRIPLE@PAR (&REST RST)
acl2-8.5>                    (CONS 'FORMAL-VALUE-TRIPLE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> FORMAL-VALUE-TRIPLE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO INCREMENT-TIMER@PAR (&REST RST)
acl2-8.5>                    (CONS 'INCREMENT-TIMER RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO INCREMENT-TIMER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> INCREMENT-TIMER@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'SIMPLE-TRANSLATE-AND-EVAL RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SIMPLE-TRANSLATE-AND-EVAL@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-IN-THEORY-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-IN-THEORY-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-PRINT-CLAUSE-ID RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-PRINT-CLAUSE-ID@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-UPDATE-GAG-STATE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-UPDATE-GAG-STATE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL1-LST@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL1-LST RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL1-LST@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL1-WRAPPER@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL1-WRAPPER RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1-WRAPPER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL1-WRAPPER@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO XTRANS-EVAL@PAR (&REST RST)
acl2-8.5>                    (CONS 'XTRANS-EVAL RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO XTRANS-EVAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> XTRANS-EVAL@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'ADD-CUSTOM-KEYWORD-HINT-FN RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ADD-CUSTOM-KEYWORD-HINT-FN@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'APPLY-OVERRIDE-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> APPLY-OVERRIDE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINT1@PAR (&REST RST)
acl2-8.5>                    (CONS 'APPLY-OVERRIDE-HINT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> APPLY-OVERRIDE-HINT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST)
acl2-8.5>                    (CONS 'APPLY-OVERRIDE-HINTS RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> APPLY-OVERRIDE-HINTS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'APPLY-REORDER-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-REORDER-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> APPLY-REORDER-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST)
acl2-8.5>                    (CONS 'APPLY-TOP-HINTS-CLAUSE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> APPLY-TOP-HINTS-CLAUSE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'CHECK-TRANSLATED-OVERRIDE-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHECK-TRANSLATED-OVERRIDE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-ARGLIST RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-ARGLIST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-ARGLIST@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-DO-NOT-EXPR-VALUE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-DO-NOT-EXPR-VALUE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-EQUAL-ARITIES RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-EQUAL-ARITIES@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-EQUIV-CLASSICALP RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-EQUIV-CLASSICALP@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-THEORY-EXPR-VALUE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-THEORY-EXPR-VALUE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-THEORY-EXPR-VALUE1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-THEORY-EXPR-VALUE1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-THEORY-INVARIANT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-THEORY-INVARIANT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST)
acl2-8.5>                    (CONS 'CHK-THEORY-INVARIANT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CHK-THEORY-INVARIANT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'FIND-APPLICABLE-HINT-SETTINGS
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> FIND-APPLICABLE-HINT-SETTINGS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'FIND-APPLICABLE-HINT-SETTINGS1
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> FIND-APPLICABLE-HINT-SETTINGS1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST)
acl2-8.5>                    (CONS 'GAG-STATE-EXITING-CL-ID RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> GAG-STATE-EXITING-CL-ID@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'LOAD-HINT-SETTINGS-INTO-PSPV
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> LOAD-HINT-SETTINGS-INTO-PSPV@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'LOAD-HINT-SETTINGS-INTO-RCNST
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> LOAD-HINT-SETTINGS-INTO-RCNST@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST)
acl2-8.5>                    (CONS 'MAYBE-WARN-ABOUT-THEORY RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MAYBE-WARN-ABOUT-THEORY@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'MAYBE-WARN-FOR-USE-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> MAYBE-WARN-FOR-USE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'PAIR-CL-ID-WITH-HINT-SETTING
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PAIR-CL-ID-WITH-HINT-SETTING@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'PROCESS-BACKTRACK-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PROCESS-BACKTRACK-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST)
acl2-8.5>                    (CONS 'PUSH-CLAUSE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PUSH-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PUSH-CLAUSE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO
acl2-8.5>               PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
acl2-8.5>               (&REST RST)
acl2-8.5>               (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
acl2-8.5>                     RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
acl2-8.5> ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST)
acl2-8.5>                    (CONS 'RECORD-GAG-STATE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO RECORD-GAG-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> RECORD-GAG-STATE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'THANKS-FOR-THE-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> THANKS-FOR-THE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-BACKTRACK-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-BACKTRACK-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-BDD-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-BDD-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-BDD-HINT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-BDD-HINT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-BY-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BY-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-BY-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-CASES-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-CASES-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-DO-NOT-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-DO-NOT-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-DO-NOT-INDUCT-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-ERROR-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-ERROR-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-EXPAND-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-EXPAND-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-EXPAND-HINT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-EXPAND-HINT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-EXPAND-TERM RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-EXPAND-TERM@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-EXPAND-TERM1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-EXPAND-TERM1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HANDS-OFF-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HANDS-OFF-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HANDS-OFF-HINT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINTS RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINTS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINTS1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINTS1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINTS2 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS2@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINTS2@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINTS+1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS+1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINTS+1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINT-EXPRESSION RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINT-EXPRESSIONS RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINT-EXPRESSIONS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-HINT-SETTINGS RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-HINT-SETTINGS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-INDUCT-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-INDUCT-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-LMI RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-LMI@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-LMI/INSTANCE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-LMI/INSTANCE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-NO-OP-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-NO-OP-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-NO-THANKS-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-NO-THANKS-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-NONLINEARP-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-NONLINEARP-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-OR-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-OR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-OR-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-REORDER-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-REORDER-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-RESTRICT-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-RESTRICT-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-RW-CACHE-STATE-HINT
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-RW-CACHE-STATE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-SUBSTITUTION RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-SUBSTITUTION@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-SUBSTITUTION-LST RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-SUBSTITUTION-LST@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-TERM-LST RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-TERM-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-TERM-LST@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-USE-HINT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-USE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-USE-HINT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-USE-HINT1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-USE-HINT1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST)
acl2-8.5>                    (CONS 'TRANSLATE-X-HINT-VALUE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRANSLATE-X-HINT-VALUE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-MSG RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-MSG@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-MSG@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-PRINT-CLAUSE RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-PRINT-CLAUSE@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-STEP RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-STEP@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-STEP1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-STEP1@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL-STEP-CLEANUP RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL-STEP-CLEANUP@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL0@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL0 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL0@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL0-OR-HIT RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0-OR-HIT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL0-OR-HIT@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR
acl2-8.5>                    (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL0-WITH-HINT-SETTINGS
acl2-8.5>                          RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL0-WITH-HINT-SETTINGS@PAR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(DEFMACRO WATERFALL1@PAR (&REST RST)
acl2-8.5>                    (CONS 'WATERFALL1 RST))
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> WATERFALL1@PAR
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.01)
acl2-8.5>  WATERFALL1@PAR
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  REPLACE-DEFUN@PAR-WITH-DEFUN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MUTUAL-RECURSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MUTUAL-RECURSION@PAR
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEFUN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DEFUN@PAR
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-ONLY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SERIAL-ONLY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PARALLEL-ONLY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PARALLEL-ONLY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO STATE-MAC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  STATE-MAC
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  ERROR-IN-PARALLELISM-MODE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *WATERFALL-PRINTING-VALUES* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *WATERFALL-PRINTING-VALUES*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *WATERFALL-PARALLELISM-VALUES*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-CONSTANT-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SYMBOL-CONSTANT-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STOBJS-IN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  STOBJS-IN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALL-NILS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  ALL-NILS
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TTAG-FNS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *TTAG-FNS*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LOGICP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  LOGICP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOGICALP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  LOGICALP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PROGRAMP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PROGRAMP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *STOBJS-OUT-INVALID* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *STOBJS-OUT-INVALID*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STOBJS-OUT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  STOBJS-OUT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EV-FNCALL-W-GUARD1 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  EV-FNCALL-W-GUARD1
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EV-FNCALL-W-GUARD ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  EV-FNCALL-W-GUARD
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TIME-TRACKER-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TIME-TRACKER-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME-TRACKER ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TIME-TRACKER
acl2-8.5> 
acl2-8.5> Since SET-ABSSTOBJ-DEBUG-FN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of SET-ABSSTOBJ-DEBUG-FN is described by the
acl2-8.5> theorem (EQUAL (SET-ABSSTOBJ-DEBUG-FN VAL) VAL).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SET-ABSSTOBJ-DEBUG-FN....
acl2-8.5> 
acl2-8.5> The guard conjecture for SET-ABSSTOBJ-DEBUG-FN is trivial to prove.
acl2-8.5> SET-ABSSTOBJ-DEBUG-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-ABSSTOBJ-DEBUG-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-ABSSTOBJ-DEBUG ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-ABSSTOBJ-DEBUG
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN <? ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  <?
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-DOMAINP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-DOMAINP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-DOM ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-DOM
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-LO-REL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-LO-REL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-LO ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-LO
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-HI-REL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-HI-REL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-HI ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-HI
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-TAU-INTERVAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MAKE-TAU-INTERVAL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVALP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVALP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN IN-TAU-INTERVALP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  IN-TAU-INTERVALP
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DECIMAL-STRING-TO-NUMBER ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DECIMAL-STRING-TO-NUMBER
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CHECK-DCL-GUARDIAN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CHECK-DCL-GUARDIAN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *GC-STRATEGY-ALIST* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *GC-STRATEGY-ALIST*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-GC-STRATEGY-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-GC-STRATEGY-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-GC-STRATEGY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  SET-GC-STRATEGY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC-STRATEGY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC-STRATEGY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *EXPANDABLE-BOOT-STRAP-NON-REC-FNS*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *DEFINITION-MINIMAL-THEORY*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *BBODY-ALIST* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *BBODY-ALIST*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BBODY-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  BBODY-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO BBODY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  BBODY
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FILE-LENGTH$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  FILE-LENGTH$
acl2-8.5> 
acl2-8.5> Since CONSTANT-T-FUNCTION-ARITY-0 is non-recursive, its admission is
acl2-8.5> trivial.  We observe that the type of CONSTANT-T-FUNCTION-ARITY-0 is
acl2-8.5> described by the theorem (EQUAL (CONSTANT-T-FUNCTION-ARITY-0) T). 
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CONSTANT-T-FUNCTION-ARITY-0....
acl2-8.5> 
acl2-8.5> The guard conjecture for CONSTANT-T-FUNCTION-ARITY-0 is trivial to
acl2-8.5> prove.  CONSTANT-T-FUNCTION-ARITY-0 is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CONSTANT-T-FUNCTION-ARITY-0
acl2-8.5> 
acl2-8.5> Since CONSTANT-NIL-FUNCTION-ARITY-0 is non-recursive, its admission
acl2-8.5> is trivial.  We observe that the type of CONSTANT-NIL-FUNCTION-ARITY-0
acl2-8.5> is described by the theorem (EQUAL (CONSTANT-NIL-FUNCTION-ARITY-0) NIL).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CONSTANT-NIL-FUNCTION-ARITY-0....
acl2-8.5> 
acl2-8.5> The guard conjecture for CONSTANT-NIL-FUNCTION-ARITY-0 is trivial to
acl2-8.5> prove.  CONSTANT-NIL-FUNCTION-ARITY-0 is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CONSTANT-NIL-FUNCTION-ARITY-0
acl2-8.5> 
acl2-8.5> To verify that the twelve encapsulated events correctly extend the
acl2-8.5> current theory we will evaluate them.  The theory thus constructed
acl2-8.5> is only ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 p!>>(LOGIC)
acl2-8.5> :INVISIBLE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BOOLEANP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN BOOLEANP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BOOLEANP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS)
acl2-8.5> 
acl2-8.5> The admission of ALL-NILS is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT LST).  We observe that the type of ALL-NILS is
acl2-8.5> described by the theorem 
acl2-8.5> (OR (EQUAL (ALL-NILS LST) T) (EQUAL (ALL-NILS LST) NIL)).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ALL-NILS....
acl2-8.5> 
acl2-8.5> The guard conjecture for ALL-NILS is trivial to prove, given primitive
acl2-8.5> type reasoning.  ALL-NILS is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALL-NILS ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> ALL-NILS
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQL-EXEC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQL-EXEC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQUAL ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQUAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The admission of SUBSETP-EQL-EXEC is trivial, using the relation O<
acl2-8.5> (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT X).  We observe that the type of SUBSETP-EQL-EXEC
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (SUBSETP-EQL-EXEC X Y) T) (EQUAL (SUBSETP-EQL-EXEC X Y) NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SUBSETP-EQL-EXEC....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SUBSETP-EQL-EXEC,
acl2-8.5> given primitive type reasoning, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>                    (EQLABLE-LISTP Y)
acl2-8.5>                    (NOT (ENDP X)))
acl2-8.5>               (LET ((X (CAR X)) (L Y))
acl2-8.5>                    (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                         (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                         (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                (MEMBER-EQL-EXEC X L)))))
acl2-8.5>      (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>                    (EQLABLE-LISTP X)
acl2-8.5>                    (NOT (EQLABLE-LISTP Y))
acl2-8.5>                    (NOT (CONSP X)))
acl2-8.5>               (EQ X NIL))
acl2-8.5>      (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>                    (EQLABLE-LISTP X)
acl2-8.5>                    (NOT (EQLABLE-LISTP Y))
acl2-8.5>                    (NOT (ENDP X)))
acl2-8.5>               (LET ((X (CAR X)) (L Y))
acl2-8.5>                    (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                         (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                         (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                (MEMBER-EQL-EXEC X L)))))
acl2-8.5>      (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>                    (EQLABLE-LISTP X)
acl2-8.5>                    (NOT (EQLABLE-LISTP Y))
acl2-8.5>                    (NOT (ENDP X))
acl2-8.5>                    (MEMBER-EQUAL (CAR X) Y))
acl2-8.5>               (EQLABLE-LISTP (CDR X)))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> the following four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CONSP X))
acl2-8.5>          (LET ((X (CAR X)) (L Y))
acl2-8.5>               (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                    (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                    (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                           (MEMBER-EQL-EXEC X L))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
acl2-8.5> (if-intro) and the :type-prescription rule EQLABLE-LISTP, to the following
acl2-8.5> four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4.4
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CONSP X))
acl2-8.5>          (EQUAL (MEMBER-EQUAL (CAR X) Y)
acl2-8.5>                 (MEMBER-EQL-EXEC (CAR X) Y))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2 and restrict the type of the new variable X2 to be that of the
acl2-8.5> term it replaces, as established by primitive type reasoning.  This
acl2-8.5> produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal 4.4'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (CONSP (CONS X1 X2))
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal 4.4''
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Subgoal 4.3
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CONSP X)
acl2-8.5>               (ACL2-NUMBERP (CAR X)))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2 and restrict the type of the new variable X2 to be that of the
acl2-8.5> term it replaces, as established by primitive type reasoning.  This
acl2-8.5> produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal 4.3'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (CONSP (CONS X1 X2))
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal 4.3''
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Name the formula above *2.
acl2-8.5> 
acl2-8.5> Subgoal 4.2
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CONSP X)
acl2-8.5>               (CHARACTERP (CAR X)))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2 and restrict the type of the new variable X2 to be that of the
acl2-8.5> term it replaces, as established by primitive type reasoning.  This
acl2-8.5> produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal 4.2'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (CONSP (CONS X1 X2))
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal 4.2''
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Name the formula above *3.
acl2-8.5> 
acl2-8.5> Subgoal 4.1
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X)
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CONSP X)
acl2-8.5>               (SYMBOLP (CAR X)))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2 and restrict the type of the new variable X2 to be that of the
acl2-8.5> term it replaces, as established by primitive type reasoning.  This
acl2-8.5> produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal 4.1'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (CONSP (CONS X1 X2))
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal 4.1''
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Name the formula above *4.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP X)
acl2-8.5>               (NOT (EQLABLE-LISTP Y))
acl2-8.5>               (NOT (CONSP X)))
acl2-8.5>          (EQUAL X NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP X)
acl2-8.5>               (NOT (EQLABLE-LISTP Y))
acl2-8.5>               (CONSP X))
acl2-8.5>          (LET ((X (CAR X)) (L Y))
acl2-8.5>               (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                    (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                    (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                           (MEMBER-EQL-EXEC X L))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
acl2-8.5> (if-intro), to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.2
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP X)
acl2-8.5>               (NOT (EQLABLE-LISTP Y))
acl2-8.5>               (CONSP X))
acl2-8.5>          (EQUAL (MEMBER-EQUAL (CAR X) Y)
acl2-8.5>                 (MEMBER-EQL-EXEC (CAR X) Y))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2.  This produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal 2.2'
acl2-8.5> (IMPLIES (AND (CONSP (CONS X1 X2))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP (CONS X1 X2))
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLE-LISTP (if-intro) and
acl2-8.5> EQLABLEP (if-intro), primitive type reasoning and the :rewrite rules
acl2-8.5> CAR-CONS and CDR-CONS, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.2.3
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Name the formula above *5.
acl2-8.5> 
acl2-8.5> Subgoal 2.2.2
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Name the formula above *6.
acl2-8.5> 
acl2-8.5> Subgoal 2.2.1
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Name the formula above *7.
acl2-8.5> 
acl2-8.5> Subgoal 2.1
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP X)
acl2-8.5>               (NOT (EQLABLE-LISTP Y))
acl2-8.5>               (CONSP X)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR X)))
acl2-8.5>               (NOT (SYMBOLP (CAR X))))
acl2-8.5>          (CHARACTERP (CAR X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (EQLABLE-LISTP X)
acl2-8.5>               (NOT (EQLABLE-LISTP Y))
acl2-8.5>               (CONSP X)
acl2-8.5>               (MEMBER-EQUAL (CAR X) Y))
acl2-8.5>          (EQLABLE-LISTP (CDR X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> So we now return to *7, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *7 by induction.  Five induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to four.  These
acl2-8.5> merge into two derived induction schemes.  One of these has a score
acl2-8.5> higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 X2 Y)
acl2-8.5> denote *7 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>                    (NOT (EQL X1 (CAR Y)))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (ENDP Y) (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *7/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7/5'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7/4'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLE-LISTP, EQLABLEP, 
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning
acl2-8.5> and the :type-prescription rule EQLABLE-LISTP, to
acl2-8.5> 
acl2-8.5> Subgoal *7/4''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *7/4'''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR Y) and (CDR Y) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y)
acl2-8.5> by Y2 and restrict the type of the new variable Y1 to be that of the
acl2-8.5> term it replaces.  This produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal *7/4'4'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (CHARACTERP Y1)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7/4'5'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *7/4'6'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)),
acl2-8.5> (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the
acl2-8.5> truth of this conjecture and throw them out.  We will thus try to prove
acl2-8.5> 
acl2-8.5> Subgoal *7/4'7'
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Name the formula above *7.1.
acl2-8.5> 
acl2-8.5> Subgoal *7/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (EQL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7/2'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQUAL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7/1
acl2-8.5> (IMPLIES (AND (ENDP Y)
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (SYMBOLP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition TRUE-LISTP,
acl2-8.5> the :executable-counterparts of CONSP and EQLABLE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> So we now return to *7.1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *7.1 by induction.  Four induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to three.
acl2-8.5> These merge into one derived induction scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y2).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 Y2)
acl2-8.5> denote *7.1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>                    (NOT (EQL X1 (CAR Y2)))
acl2-8.5>                    (:P X1 (CDR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (ENDP Y2) (:P X1 Y2))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *7.1/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7.1/5'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7.1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7.1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7.1/3'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *7.1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (EQL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7.1/2'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (EQUAL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *7.1/1
acl2-8.5> (IMPLIES (AND (ENDP Y2)
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *7.1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions MEMBER-EQL-EXEC,
acl2-8.5> MEMBER-EQUAL and TRUE-LISTP, the :executable-counterparts of CONSP,
acl2-8.5> EQLABLE-LISTP and EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proofs of *7.1 and *7.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *6, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *6 by induction.  Five induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to four.  These
acl2-8.5> merge into two derived induction schemes.  One of these has a score
acl2-8.5> higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 X2 Y)
acl2-8.5> denote *6 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>                    (NOT (EQL X1 (CAR Y)))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (ENDP Y) (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *6/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6/5'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6/4'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLE-LISTP, EQLABLEP, 
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning
acl2-8.5> and the :type-prescription rule EQLABLE-LISTP, to
acl2-8.5> 
acl2-8.5> Subgoal *6/4''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *6/4'''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR Y) and (CDR Y) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y)
acl2-8.5> by Y2 and restrict the type of the new variable Y1 to be that of the
acl2-8.5> term it replaces.  This produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal *6/4'4'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (CHARACTERP Y1)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6/4'5'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *6/4'6'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)),
acl2-8.5> (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the
acl2-8.5> truth of this conjecture and throw them out.  We will thus try to prove
acl2-8.5> 
acl2-8.5> Subgoal *6/4'7'
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Name the formula above *6.1.
acl2-8.5> 
acl2-8.5> Subgoal *6/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (EQL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6/2'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQUAL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6/1
acl2-8.5> (IMPLIES (AND (ENDP Y)
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (CHARACTERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition TRUE-LISTP,
acl2-8.5> the :executable-counterparts of CONSP and EQLABLE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> So we now return to *6.1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *6.1 by induction.  Four induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to three.
acl2-8.5> These merge into one derived induction scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y2).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 Y2)
acl2-8.5> denote *6.1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>                    (NOT (EQL X1 (CAR Y2)))
acl2-8.5>                    (:P X1 (CDR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (ENDP Y2) (:P X1 Y2))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *6.1/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6.1/5'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6.1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6.1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6.1/3'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *6.1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (EQL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6.1/2'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (EQUAL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *6.1/1
acl2-8.5> (IMPLIES (AND (ENDP Y2)
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *6.1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions MEMBER-EQL-EXEC,
acl2-8.5> MEMBER-EQUAL and TRUE-LISTP, the :executable-counterparts of CONSP,
acl2-8.5> EQLABLE-LISTP and EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proofs of *6.1 and *6.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *5, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *5 by induction.  Five induction schemes are suggested
acl2-8.5> by this conjecture.  Subsumption reduces that number to four.  These
acl2-8.5> merge into two derived induction schemes.  One of these has a score
acl2-8.5> higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 X2 Y)
acl2-8.5> denote *5 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>                    (NOT (EQL X1 (CAR Y)))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (ENDP Y) (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *5/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/5'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/4'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions EQLABLE-LISTP, EQLABLEP, 
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning
acl2-8.5> and the :type-prescription rule EQLABLE-LISTP, to
acl2-8.5> 
acl2-8.5> Subgoal *5/4''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *5/4'''
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y))))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                 (MEMBER-EQL-EXEC X1 (CDR Y)))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR Y) and (CDR Y) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y)
acl2-8.5> by Y2 and restrict the type of the new variable Y1 to be that of the
acl2-8.5> term it replaces.  This produces the following goal.
acl2-8.5> 
acl2-8.5> Subgoal *5/4'4'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (CHARACTERP Y1)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/4'5'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (CONSP (CONS Y1 Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> This simplifies, using primitive type reasoning, to
acl2-8.5> 
acl2-8.5> Subgoal *5/4'6'
acl2-8.5> (IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
acl2-8.5>               (NOT (SYMBOLP Y1))
acl2-8.5>               (NOT (CHARACTERP Y1))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)),
acl2-8.5> (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the
acl2-8.5> truth of this conjecture and throw them out.  We will thus try to prove
acl2-8.5> 
acl2-8.5> Subgoal *5/4'7'
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Name the formula above *5.1.
acl2-8.5> 
acl2-8.5> Subgoal *5/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (EQL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/2'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQUAL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5/1
acl2-8.5> (IMPLIES (AND (ENDP Y)
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1)
acl2-8.5>               (EQLABLE-LISTP X2)
acl2-8.5>               (NOT (EQLABLE-LISTP Y)))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition TRUE-LISTP,
acl2-8.5> the :executable-counterparts of CONSP and EQLABLE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> So we now return to *5.1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *5.1 by induction.  Four induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to three.
acl2-8.5> These merge into one derived induction scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y2).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.  If we let (:P X1 Y2)
acl2-8.5> denote *5.1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>                    (NOT (EQL X1 (CAR Y2)))
acl2-8.5>                    (:P X1 (CDR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)))
acl2-8.5>               (:P X1 Y2))
acl2-8.5>      (IMPLIES (ENDP Y2) (:P X1 Y2))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces five nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *5.1/5
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5.1/5'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y2))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5.1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (TRUE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5.1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (NOT (EQL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5.1/3'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y2)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y2)))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *5.1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y2))
acl2-8.5>               (EQL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5.1/2'
acl2-8.5> (IMPLIES (AND (CONSP Y2)
acl2-8.5>               (EQUAL X1 (CAR Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *5.1/1
acl2-8.5> (IMPLIES (AND (ENDP Y2)
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *5.1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y2))
acl2-8.5>               (EQLABLE-LISTP Y2)
acl2-8.5>               (TRUE-LISTP Y2)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y2)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions MEMBER-EQL-EXEC,
acl2-8.5> MEMBER-EQUAL and TRUE-LISTP, the :executable-counterparts of CONSP,
acl2-8.5> EQLABLE-LISTP and EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proofs of *5.1 and *5.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *4, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *4 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to two.
acl2-8.5> One of these has a score higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP
acl2-8.5> and TRUE-LISTP.  If we let (:P X1 X2 Y) denote *4 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y)
acl2-8.5>                    (EQLABLEP (CAR Y))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit EQLABLE-LISTP.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *4/4
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-LISTP
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *4/3
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQLABLEP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> By the simple :definition EQLABLEP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *4/3'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *4/2
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *4/1
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (SYMBOLP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> That completes the proof of *4.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *3, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *3 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to two.
acl2-8.5> One of these has a score higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP
acl2-8.5> and TRUE-LISTP.  If we let (:P X1 X2 Y) denote *3 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y)
acl2-8.5>                    (EQLABLEP (CAR Y))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit EQLABLE-LISTP.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *3/4
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-LISTP
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *3/3
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQLABLEP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> By the simple :definition EQLABLEP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *3/3'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *3/2
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *3/1
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (CHARACTERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> That completes the proof of *3.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *2, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *2 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to two.
acl2-8.5> One of these has a score higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP
acl2-8.5> and TRUE-LISTP.  If we let (:P X1 X2 Y) denote *2 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (CONSP Y)
acl2-8.5>                    (EQLABLEP (CAR Y))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit EQLABLE-LISTP.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *2/4
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-LISTP
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *2/3
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQLABLEP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> By the simple :definition EQLABLEP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *2/3'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (ACL2-NUMBERP (CAR Y)))
acl2-8.5>               (NOT (SYMBOLP (CAR Y)))
acl2-8.5>               (NOT (CHARACTERP (CAR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *2/2
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (TRUE-LISTP (CDR Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *2/1
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQLABLEP (CAR Y))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y)
acl2-8.5>               (ACL2-NUMBERP X1))
acl2-8.5>          (TRUE-LISTP Y)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> That completes the proof of *2.
acl2-8.5> 
acl2-8.5> We therefore turn our attention to *1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Four induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into two derived induction schemes.
acl2-8.5> One of these has a score higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y).
acl2-8.5> This suggestion was produced using the :induction rules EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC and MEMBER-EQUAL.  If we let (:P X1 X2 Y) denote *1
acl2-8.5> above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>                    (NOT (EQL X1 (CAR Y)))
acl2-8.5>                    (:P X1 X2 (CDR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)))
acl2-8.5>               (:P X1 X2 Y))
acl2-8.5>      (IMPLIES (ENDP Y) (:P X1 X2 Y))).
acl2-8.5> This induction is justified by the same argument used to admit 
acl2-8.5> MEMBER-EQL-EXEC.  When applied to the goal at hand the above induction
acl2-8.5> scheme produces four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/4'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (EQUAL (MEMBER-EQUAL X1 (CDR Y))
acl2-8.5>                      (MEMBER-EQL-EXEC X1 (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (NOT (EQL X1 (CAR Y)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (NOT (EQUAL X1 (CAR Y)))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR Y)))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and EQLABLEP.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP Y))
acl2-8.5>               (EQL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP Y)
acl2-8.5>               (EQUAL X1 (CAR Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ENDP Y)
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP Y))
acl2-8.5>               (TRUE-LISTP X2)
acl2-8.5>               (TRUE-LISTP (CONS X1 X2))
acl2-8.5>               (EQLABLE-LISTP Y))
acl2-8.5>          (EQUAL (MEMBER-EQUAL X1 Y)
acl2-8.5>                 (MEMBER-EQL-EXEC X1 Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
acl2-8.5> MEMBER-EQL-EXEC and MEMBER-EQUAL, the :executable-counterparts of CONSP
acl2-8.5> and EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SUBSETP-EQL-EXEC.
acl2-8.5> SUBSETP-EQL-EXEC is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQL-EXEC ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION EQL)
acl2-8.5>         (:DEFINITION EQLABLE-LISTP)
acl2-8.5>         (:DEFINITION EQLABLEP)
acl2-8.5>         (:DEFINITION MEMBER-EQL-EXEC)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION TRUE-LISTP)
acl2-8.5>         (:ELIM CAR-CDR-ELIM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQLABLE-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION EQLABLE-LISTP)
acl2-8.5>         (:INDUCTION MEMBER-EQL-EXEC)
acl2-8.5>         (:INDUCTION MEMBER-EQUAL)
acl2-8.5>         (:INDUCTION TRUE-LISTP)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION EQLABLE-LISTP)
acl2-8.5>              (:DEFINITION EQLABLEP)
acl2-8.5>              (:DEFINITION NOT))
acl2-8.5> Time:  0.07 seconds (prove: 0.04, print: 0.02, other: 0.00)
acl2-8.5> Prover steps counted:  13737
acl2-8.5> SUBSETP-EQL-EXEC
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> Since SUBSETP-EQL-EXEC$GUARD-CHECK is non-recursive, its admission
acl2-8.5> is trivial.  We observe that the type of SUBSETP-EQL-EXEC$GUARD-CHECK
acl2-8.5> is described by the theorem (EQUAL (SUBSETP-EQL-EXEC$GUARD-CHECK X Y) T).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK....
acl2-8.5> 
acl2-8.5> The guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK is trivial to
acl2-8.5> prove.  SUBSETP-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SUBSETP-EQL-EXEC$GUARD-CHECK
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL)
acl2-8.5> 
acl2-8.5> The admission of SUBSETP-EQUAL is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of SUBSETP-EQUAL
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (SUBSETP-EQUAL X Y) T) (EQUAL (SUBSETP-EQUAL X Y) NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SUBSETP-EQUAL....
acl2-8.5> 
acl2-8.5> The guard conjecture for SUBSETP-EQUAL is trivial to prove, given primitive
acl2-8.5> type reasoning.  SUBSETP-EQUAL is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQUAL ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> SUBSETP-EQUAL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND)
acl2-8.5> 
acl2-8.5> The admission of REVAPPEND is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  We observe that the type of REVAPPEND is described
acl2-8.5> by the theorem (OR (CONSP (REVAPPEND X Y)) (EQUAL (REVAPPEND X Y) Y)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for REVAPPEND....
acl2-8.5> 
acl2-8.5> The guard conjecture for REVAPPEND is trivial to prove, given primitive
acl2-8.5> type reasoning.  REVAPPEND is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN REVAPPEND ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> REVAPPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC)
acl2-8.5> 
acl2-8.5> The admission of FIRST-N-AC is trivial, using the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT I).  We observe that the type of FIRST-N-AC is
acl2-8.5> described by the theorem 
acl2-8.5> (OR (CONSP (FIRST-N-AC I L AC)) (EQUAL (FIRST-N-AC I L AC) NIL)). 
acl2-8.5> We used the :type-prescription rule REVAPPEND.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FIRST-N-AC....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for FIRST-N-AC, given
acl2-8.5> primitive type reasoning, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (TRUE-LISTP AC)
acl2-8.5>               (TRUE-LISTP L)
acl2-8.5>               (<= 0 I)
acl2-8.5>               (INTEGERP I)
acl2-8.5>               (NOT (ZP I)))
acl2-8.5>          (<= 0 (+ -1 I))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition ZP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for FIRST-N-AC.  FIRST-N-AC
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FIRST-N-AC ...)
acl2-8.5> Rules: ((:DEFINITION NOT)
acl2-8.5>         (:DEFINITION ZP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:TYPE-PRESCRIPTION REVAPPEND))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  63
acl2-8.5> FIRST-N-AC
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE)
acl2-8.5> 
acl2-8.5> The admission of TAKE is trivial, using the relation O< (which is known
acl2-8.5> to be well-founded on the domain recognized by O-P) and the measure
acl2-8.5> (ACL2-COUNT N).  We observe that the type of TAKE is described by the
acl2-8.5> theorem (TRUE-LISTP (TAKE N L)).  We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAKE ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TAKE
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export TAKE, FIRST-N-AC, REVAPPEND, SUBSETP-EQUAL, 
acl2-8.5> SUBSETP-EQL-EXEC$GUARD-CHECK, SUBSETP-EQL-EXEC and ALL-NILS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOGIC) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.10 seconds (prove: 0.04, print: 0.02, other: 0.04)
acl2-8.5> Prover steps counted:  13800
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  *READ-FILE-INTO-STRING-BOUND*
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING1 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING1
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING2-LOGICAL
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING2 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING2
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO READ-FILE-INTO-STRING ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WHEN-PASS-2 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  WHEN-PASS-2
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PRINT-CL-CACHE-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PRINT-CL-CACHE-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PRINT-CL-CACHE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PRINT-CL-CACHE
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN HONS-REMOVE-ASSOC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  HONS-REMOVE-ASSOC
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-KEYS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  COUNT-KEYS
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN HONS-ENABLEDP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  HONS-ENABLEDP
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
acl2-8.5>             '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
acl2-8.5>                                 &AUX *PRINT-PPRINT-DISPATCH*
acl2-8.5>                                 &BODY *PRINT-PRETTY* &ENVIRONMENT ...))
acl2-8.5>   (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
acl2-8.5>             '(* ** *** *BREAK-ON-SIGNALS*
acl2-8.5>                 *COMPILE-FILE-PATHNAME*
acl2-8.5>                 *COMPILE-FILE-TRUENAME*
acl2-8.5>                 *COMPILE-PRINT* ...))
acl2-8.5>   (DEFCONST NIL 'NIL)
acl2-8.5>   (DEFCONST T 'T)
acl2-8.5>   (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
acl2-8.5>   (DEFMACRO MAKE-PACKAGE-ENTRY
acl2-8.5>             (&KEY NAME IMPORTS HIDDEN-P
acl2-8.5>                   BOOK-PATH DEFPKG-EVENT-FORM TTERM)
acl2-8.5>             (CONS 'LIST* (CONS NAME #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO DEFN (F A &REST R)
acl2-8.5>             (CONS 'DEFUN (CONS F #)))
acl2-8.5>   (DEFMACRO DEFND (F A &REST R)
acl2-8.5>             (CONS 'DEFUND (CONS F #)))
acl2-8.5>   (DEFN HONS-EQUAL (X Y)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (EQUAL X Y))
acl2-8.5>   (DEFN HONS-ASSOC-EQUAL (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (COND (# NIL) (# #) (T #)))
acl2-8.5>   (DEFN HONS-GET (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (HONS-ASSOC-EQUAL KEY ALIST))
acl2-8.5>   (DEFN HONS-ACONS (KEY VAL ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (CONS (CONS KEY VAL) ALIST))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  DEFN
acl2-8.5>  DEFND
acl2-8.5>  HONS-EQUAL
acl2-8.5>  HONS-ASSOC-EQUAL
acl2-8.5>  HONS-GET
acl2-8.5>  HONS-ACONS
acl2-8.5>  FAST-ALIST-FREE-ON-EXIT-RAW
acl2-8.5>  FAST-ALIST-FREE
acl2-8.5>  FAST-ALIST-FREE-ON-EXIT
acl2-8.5>  HONS-COPY
acl2-8.5>  HONS-COPY-PERSISTENT
acl2-8.5>  HONS
acl2-8.5>  HONS-EQUAL-LITE
acl2-8.5>  HONS-CLEAR
acl2-8.5>  HONS-CLEAR!
acl2-8.5>  HONS-WASH
acl2-8.5>  HONS-WASH!
acl2-8.5>  HONS-SUMMARY
acl2-8.5>  HONS-RESIZE
acl2-8.5>  HONS-RESIZE-FN
acl2-8.5>  HONS
acl2-8.5>  SET-SLOW-ALIST-ACTION
acl2-8.5>  HONS-ACONS!
acl2-8.5>  MAKE-FAST-ALIST
acl2-8.5>  FAST-ALIST-FORK
acl2-8.5>  FAST-ALIST-FORK!
acl2-8.5>  HONS-SHRINK-ALIST
acl2-8.5>  HONS-SHRINK-ALIST!
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  FAST-ALIST-CLEAN
acl2-8.5>  FAST-ALIST-CLEAN!
acl2-8.5>  FAST-ALIST-LEN
acl2-8.5>  FAST-ALIST-SUMMARY
acl2-8.5>  WITH-FAST-ALIST-RAW
acl2-8.5>  WITH-FAST-ALIST
acl2-8.5>  WITH-STOLEN-ALIST-RAW
acl2-8.5>  WITH-STOLEN-ALIST
acl2-8.5>  CONS-SUBTREES
acl2-8.5>  NUMBER-SUBTREES
acl2-8.5>  FLUSH-HONS-GET-HASH-TABLE-LINK
acl2-8.5>  NIL
acl2-8.5>  REMOVE-KEYWORD
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO DEFN (F A &REST R)
acl2-8.5>             (CONS 'DEFUN (CONS F #)))
acl2-8.5>   (DEFMACRO DEFND (F A &REST R)
acl2-8.5>             (CONS 'DEFUND (CONS F #)))
acl2-8.5>   (DEFN HONS-EQUAL (X Y)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (EQUAL X Y))
acl2-8.5>   (DEFN HONS-ASSOC-EQUAL (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (COND (# NIL) (# #) (T #)))
acl2-8.5>   (DEFN HONS-GET (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (HONS-ASSOC-EQUAL KEY ALIST))
acl2-8.5>   (DEFN HONS-ACONS (KEY VAL ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (CONS (CONS KEY VAL) ALIST))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading "basis-a.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  EQUAL-X-CONSTANT
acl2-8.5>  MATCH-TESTS-AND-BINDINGS
acl2-8.5>  MATCH-CLAUSE
acl2-8.5>  MATCH-CLAUSE-LIST
acl2-8.5>  CASE-MATCH
acl2-8.5>  WORMHOLE-STATUSP
acl2-8.5>  WORMHOLE-ENTRY-CODE
acl2-8.5>  WORMHOLE-DATA
acl2-8.5>  SET-WORMHOLE-ENTRY-CODE
acl2-8.5>  SET-WORMHOLE-DATA
acl2-8.5>  MAKE-WORMHOLE-STATUS
acl2-8.5>  TREE-OCCUR-EQ
acl2-8.5>  WORMHOLE-EVAL
acl2-8.5>  WITH-WORMHOLE-LOCK
acl2-8.5>  WORMHOLE-EVAL-EARLY-NULL-EXIT-P
acl2-8.5>  WORMHOLE
acl2-8.5>  LAMBDA-KEYWORDP
acl2-8.5>  LEGAL-VARIABLE-OR-CONSTANT-NAMEP
acl2-8.5>  LEGAL-VARIABLEP
acl2-8.5>  ARGLISTP1
acl2-8.5>  ARGLISTP
acl2-8.5>  FIND-FIRST-BAD-ARG
acl2-8.5>  PROCESS-DEFABBREV-DECLARES
acl2-8.5>  DEFABBREV1
acl2-8.5>  DEFABBREV
acl2-8.5>  *EVISCERATION-MARK*
acl2-8.5>  *EVISCERATION-HASH-MARK*
acl2-8.5>  *EVISCERATION-ELLIPSIS-MARK*
acl2-8.5>  *EVISCERATION-WORLD-MARK*
acl2-8.5>  *EVISCERATION-STATE-MARK*
acl2-8.5>  *EVISCERATION-ERROR-TRIPLE-MARKS*
acl2-8.5>  *EVISCERATION-HIDING-MARK*
acl2-8.5>  *ANTI-EVISCERATION-MARK*
acl2-8.5>  EVISCERATEDP
acl2-8.5>  *SHARP-ATSIGN-AR*
acl2-8.5>  GET-SHARP-ATSIGN
acl2-8.5>  UPDATE-IPRINT-ALIST-FAL
acl2-8.5>  (EVISCERATE1 EVISCERATE1-LST)
acl2-8.5>  (EVISCERATE1P EVISCERATE1P-LST)
acl2-8.5>  EVISCERATE
acl2-8.5>  EVISCERATE-SIMPLE
acl2-8.5>  ASET1-LST
acl2-8.5>  IPRINT-HARD-BOUND
acl2-8.5>  IPRINT-SOFT-BOUND
acl2-8.5>  IPRINT-LAST-INDEX*
acl2-8.5>  IPRINT-LAST-INDEX
acl2-8.5>  IPRINT-AR-ILLEGAL-INDEX
acl2-8.5>  IPRINT-ENABLEDP
acl2-8.5>  IPRINT-AR-AREF1
acl2-8.5>  COLLECT-POSP-INDICES-TO-HEADER
acl2-8.5>  IPRINT-FAL-NAME
acl2-8.5>  IPRINT-EAGER-P
acl2-8.5>  INIT-IPRINT-FAL
acl2-8.5>  ROLLOVER-IPRINT-AR
acl2-8.5>  UPDATE-IPRINT-FAL-REC
acl2-8.5>  UPDATE-IPRINT-FAL
acl2-8.5>  UPDATE-IPRINT-AR-FAL
acl2-8.5>  EVISCERATE-TOP
acl2-8.5>  MV-LETC
acl2-8.5>  ER-HARD-VAL
acl2-8.5>  ER-HARD?-VAL?
acl2-8.5>  THE-FIXNUM!
acl2-8.5>  THE-HALF-FIXNUM!
acl2-8.5>  THE-UNSIGNED-BYTE!
acl2-8.5>  THE-STRING!
acl2-8.5>  XXXJOIN-FIXNUM
acl2-8.5>  +F
acl2-8.5>  -F
acl2-8.5>  |1-F|
acl2-8.5>  |1+F|
acl2-8.5>  CHARF
acl2-8.5>  *F
acl2-8.5>  PPR-FLAT-RIGHT-MARGIN
acl2-8.5>  SET-PPR-FLAT-RIGHT-MARGIN
acl2-8.5>  KEYWORD-PARAM-VALUEP
acl2-8.5>  CONS-PPR1
acl2-8.5>  FLSZ-INTEGER
acl2-8.5>  FLSZ-ATOM
acl2-8.5>  *NEWLINE-STRING*
acl2-8.5>  FLSZ1
acl2-8.5>  FLSZ
acl2-8.5>  MAX-WIDTH
acl2-8.5>  (PPR1 PPR1-LST)
acl2-8.5>  NEWLINE
acl2-8.5>  FMT-HARD-RIGHT-MARGIN
acl2-8.5>  FMT-SOFT-RIGHT-MARGIN
acl2-8.5>  SET-FMT-HARD-RIGHT-MARGIN
acl2-8.5>  SET-FMT-SOFT-RIGHT-MARGIN
acl2-8.5>  WRITE-FOR-READ
acl2-8.5>  SPACES1
acl2-8.5>  MAKE-SPACES-ARRAY-REC
acl2-8.5>  MAKE-SPACES-ARRAY
acl2-8.5>  *ACL2-BUILT-IN-SPACES-ARRAY*
acl2-8.5>  SPACES
acl2-8.5>  (FLPR1 FLPR11)
acl2-8.5>  FLPR
acl2-8.5>  PPR2-FLAT
acl2-8.5>  (PPR2-COLUMN PPR2)
acl2-8.5>  *FMT-PPR-INDENTATION*
acl2-8.5>  PPR
acl2-8.5>  *ILLEGAL-FMT-KEYS*
acl2-8.5>  ILLEGAL-FMT-STRING
acl2-8.5>  ILLEGAL-FMT-MSG
acl2-8.5>  SCAN-PAST-WHITESPACE
acl2-8.5>  ZERO-ONE-OR-MORE
acl2-8.5>  FIND-ALTERNATIVE-SKIP
acl2-8.5>  FIND-ALTERNATIVE-START1
acl2-8.5>  FMT-CHAR
acl2-8.5>  FIND-ALTERNATIVE-START
acl2-8.5>  FIND-ALTERNATIVE-STOP
acl2-8.5>  PUNCTP
acl2-8.5>  FMT-TILDE-S1
acl2-8.5>  FMT-TILDE-CAP-S1
acl2-8.5>  FMT-VAR
acl2-8.5>  SPLAT-ATOM
acl2-8.5>  SPLAT-ATOM!
acl2-8.5>  SPLAT-STRING
acl2-8.5>  (SPLAT SPLAT1)
acl2-8.5>  NUMBER-OF-DIGITS
acl2-8.5>  LEFT-PAD-WITH-BLANKS
acl2-8.5>  MAYBE-NEWLINE
acl2-8.5>  EVISC-TUPLE
acl2-8.5>  STANDARD-EVISC-TUPLEP
acl2-8.5>  WORLD-EVISCERATION-ALIST
acl2-8.5>  ABBREV-EVISC-TUPLE
acl2-8.5>  GAG-MODE
acl2-8.5>  TERM-EVISC-TUPLE
acl2-8.5>  GAG-MODE-EVISC-TUPLE
acl2-8.5>  LD-EVISC-TUPLE
acl2-8.5>  FMT-PPR
acl2-8.5>  SCAN-PAST-EMPTY-FMT-DIRECTIVES
acl2-8.5>  (FMT0* FMT0&V SPELL-NUMBER
acl2-8.5>         FMT-TILDE-S FMT-TILDE-CAP-S FMT0)
acl2-8.5>  TILDE-*-&V-STRINGS
acl2-8.5>  FMT1
acl2-8.5>  FMT
acl2-8.5>  FMS
acl2-8.5>  FMT1!
acl2-8.5>  FMT!
acl2-8.5>  FMS!
acl2-8.5>  FMX
acl2-8.5>  FMX-CW-MSG-1-BODY
acl2-8.5>  FMX-CW-MSG-1
acl2-8.5>  FMX-CW-MSG
acl2-8.5>  FMX-CW-FN-GUARD
acl2-8.5>  FMX-CW-FN
acl2-8.5>  FMX!-CW-FN
acl2-8.5>  FMX-CW
acl2-8.5>  FMX!-CW
acl2-8.5>  FMT-DOC-EXAMPLE1
acl2-8.5>  FMT-DOC-EXAMPLE
acl2-8.5>  *SEE-DOC-SET-IPRINT*
acl2-8.5>  FMT-ABBREV1
acl2-8.5>  FMT-ABBREV
acl2-8.5>  *FMT-CTX-SPACERS*
acl2-8.5>  FMT-CTX
acl2-8.5>  FMT-IN-CTX
acl2-8.5>  ER-SOFT-OFF-P1
acl2-8.5>  ER-SOFT-OFF-P
acl2-8.5>  ERROR-FMS-CHANNEL
acl2-8.5>  ERROR-FMS
acl2-8.5>  PUSH-WARNING-FRAME
acl2-8.5>  ABSORB-FRAME
acl2-8.5>  POP-WARNING-FRAME
acl2-8.5>  PUSH-WARNING
acl2-8.5>  RECORD-MAKER-FUNCTION-NAME
acl2-8.5>  RECORD-CHANGER-FUNCTION-NAME
acl2-8.5>  MAKE
acl2-8.5>  CHANGE
acl2-8.5>  MAKE-RECORD-CAR-CDRS1
acl2-8.5>  MAKE-RECORD-CAR-CDRS
acl2-8.5>  MAKE-RECORD-ACCESSORS
acl2-8.5>  SYMBOL-NAME-TREE-OCCUR
acl2-8.5>  SOME-SYMBOL-NAME-TREE-OCCUR
acl2-8.5>  MAKE-RECORD-CHANGER-CONS
acl2-8.5>  MAKE-RECORD-CHANGER-LET-BINDINGS
acl2-8.5>  MAKE-RECORD-CHANGER-LET
acl2-8.5>  MAKE-RECORD-CHANGER
acl2-8.5>  MAKE-RECORD-MAKER-CONS
acl2-8.5>  MAKE-RECORD-MAKER-LET
acl2-8.5>  MAKE-RECORD-MAKER
acl2-8.5>  MAKE-RECORD-FIELD-LST
acl2-8.5>  RECORD-MAKER-RECOGNIZER-NAME
acl2-8.5>  MAKE-RECORD-RECOGNIZER-BODY
acl2-8.5>  MAKE-RECORD-RECOGNIZER
acl2-8.5>  RECORD-MACROS
acl2-8.5>  DEFREC
acl2-8.5>  RECORD-TYPE
acl2-8.5>  IO?-NIL-OUTPUT
acl2-8.5>  CHECK-EXACT-FREE-VARS
acl2-8.5>  FORMAL-BINDINGS
acl2-8.5>  WEAK-IO-RECORD-P
acl2-8.5>  PUSH-IO-RECORD
acl2-8.5>  SAVED-OUTPUT-TOKEN-P
acl2-8.5>  IO?-WORMHOLE-BINDINGS
acl2-8.5>  *TRACKED-WARNING-SUMMARIES*
acl2-8.5>  IO?
acl2-8.5>  IO?-PROVE
acl2-8.5>  OUTPUT-IGNORED-P
acl2-8.5>  ERROR1
acl2-8.5>  ERROR1-SAFE
acl2-8.5>  *UNINHIBITED-WARNING-SUMMARIES*
acl2-8.5>  WARNING-OFF-P1
acl2-8.5>  WARNING-OFF-P
acl2-8.5>  WEAK-DO-EXPRESSIONP-P
acl2-8.5>  WEAK-STATE-VARS-P
acl2-8.5>  DEFAULT-STATE-VARS
acl2-8.5>  WARNING1-BODY
acl2-8.5>  WARNING1-FORM
acl2-8.5>  WARNING1
acl2-8.5>  WARNING-DISABLED-P
acl2-8.5>  ER-SOFT
acl2-8.5>  ER-SOFT@PAR
acl2-8.5>  OBSERVATION1-BODY
acl2-8.5>  OBSERVATION1
acl2-8.5>  OBSERVATION1-CW
acl2-8.5>  OBSERVATION
acl2-8.5>  OBSERVATION-CW
acl2-8.5>  WEAK-DEFSTOBJ-FIELD-TEMPLATE-P
acl2-8.5>  WEAK-DEFSTOBJ-TEMPLATE-P
acl2-8.5>  PACKN1
acl2-8.5>  PACKN-POS
acl2-8.5>  FIND-FIRST-NON-CL-SYMBOL
acl2-8.5>  PACKN
acl2-8.5>  PACK2
acl2-8.5>  DEFSTOBJ-FNNAME-KEY2
acl2-8.5>  DOUBLET-LISTP
acl2-8.5>  DEFSTOBJ-FNNAME
acl2-8.5>  DEFINED-CONSTANT
acl2-8.5>  FIX-STOBJ-ARRAY-TYPE
acl2-8.5>  DEFSTOBJ-FIELD-TEMPLATES
acl2-8.5>  *DEFSTOBJ-KEYWORDS*
acl2-8.5>  PARTITION-REST-AND-KEYWORD-ARGS1
acl2-8.5>  PARTITION-REST-AND-KEYWORD-ARGS2
acl2-8.5>  PARTITION-REST-AND-KEYWORD-ARGS
acl2-8.5>  DEFSTOBJ-TEMPLATE
acl2-8.5>  SIMPLE-ARRAY-TYPE
acl2-8.5>  LIVE-STOBJP
acl2-8.5>  ABSSTOBJ-NAME
acl2-8.5>  WEAK-DEFSTOBJ-REDUNDANT-RAW-LISP-DISCRIMINATOR-VALUE-P
acl2-8.5>  WEAK-STOBJ-PROPERTY-P
acl2-8.5>  GET-STOBJ-CREATOR
acl2-8.5>  THE$
acl2-8.5>  GET-STOBJ-SCALAR-FIELD
acl2-8.5>  MAKE-STOBJ-SCALAR-FIELD
acl2-8.5>  (MAYBE-CONTAINED-IN-CHARACTER SOME-MAYBE-CONTAINED-IN-CHARACTER
acl2-8.5>                                ALL-MAYBE-CONTAINED-IN-CHARACTER)
acl2-8.5>  SINGLE-FIELD-TYPE-P
acl2-8.5>  STOBJ-HASH-TABLE-TEST
acl2-8.5>  STOBJ-HASH-TABLE-INIT-SIZE
acl2-8.5>  STOBJ-HASH-TABLE-ELEMENT-TYPE
acl2-8.5>  DEFSTOBJ-FIELD-FNS-RAW-DEFS
acl2-8.5>  DEFSTOBJ-RAW-INIT-FIELDS
acl2-8.5>  DEFSTOBJ-RAW-INIT-SETF-FORMS
acl2-8.5>  DEFSTOBJ-RAW-INIT
acl2-8.5>  DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS
acl2-8.5>  STOBJP
acl2-8.5>  TRANSLATE-STOBJ-TYPE-TO-GUARD
acl2-8.5>  DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS
acl2-8.5>  CONGRUENT-STOBJ-REP
acl2-8.5>  ALL-BUT-LAST
acl2-8.5>  DEFSTOBJ-RAW-DEFS
acl2-8.5>  DEFCONST-NAME
acl2-8.5>  DEFSTOBJ-DEFCONSTS
acl2-8.5>  STRIP-ACCESSOR-NAMES
acl2-8.5>  THE-LIVE-VAR
acl2-8.5>  STANDARD-CO
acl2-8.5>  WEAK-LD-HISTORY-ENTRY-P
acl2-8.5>  PARSE-WITH-LOCAL-STOBJ
acl2-8.5>  PARSE-VERSION
acl2-8.5>  PCD2
acl2-8.5>  POWER-REP
acl2-8.5>  DECODE-IDATE
acl2-8.5>  PRINT-IDATE
acl2-8.5>  GOOD-BYE-FN
acl2-8.5>  GOOD-BYE
acl2-8.5>  EXIT
acl2-8.5>  QUIT
acl2-8.5>  EXPAND-TILDE-TO-USER-HOME-DIR
acl2-8.5>  SAVE-EXEC-FN
acl2-8.5>  SAVE-EXEC
acl2-8.5>  *SLASH-DOT-DOT*
acl2-8.5>  *LENGTH-SLASH-DOT-DOT*
acl2-8.5>  FIND-DOT-DOT
acl2-8.5>  (CANCEL-DOT-DOTS GET-PARENT-DIRECTORY
acl2-8.5>                   MERGE-USING-DOT-DOT)
acl2-8.5>  COMMENT-STRING-P1
acl2-8.5>  COMMENT-STRING-P
acl2-8.5>  WEAK-PRINT-CONTROL-P
acl2-8.5>  :REDUNDANT
acl2-8.5>  PRINT-CONTROL-ALISTP
acl2-8.5>  *RAW-PRINT-VARS-KEYS*
acl2-8.5>  ALIST-KEYS-SUBSETP
acl2-8.5>  PRINT-CONTROL-P
acl2-8.5>  PRINT-OBJECT$-FN
acl2-8.5>  PRINT-OBJECT$
acl2-8.5>  PRINT-OBJECT$-PRESERVING-CASE
acl2-8.5>  PRINT-OBJECT$+
acl2-8.5> 
acl2-8.5> Finished loading "basis-a.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
acl2-8.5>   (DEFN MEMOIZE-SUMMARY NIL NIL)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
acl2-8.5>   (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
acl2-8.5>   (DEFCONST *HONS-PRIMITIVE-FNS*
acl2-8.5>             '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
acl2-8.5>                         HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  CLEAR-MEMOIZE-TABLE
acl2-8.5>  CLEAR-MEMOIZE-TABLES
acl2-8.5>  MEMOIZE-SUMMARY
acl2-8.5>  CLEAR-MEMOIZE-STATISTICS
acl2-8.5>  MEMSUM
acl2-8.5>  *HONS-PRIMITIVE-FNS*
acl2-8.5>  *HONS-PRIMITIVES*
acl2-8.5>  *MHT-DEFAULT-SIZE*
acl2-8.5>  MEMOIZE-FORM
acl2-8.5>  MEMOIZE
acl2-8.5>  UNMEMOIZE
acl2-8.5>  PROFILE
acl2-8.5>  MEMOIZEDP-WORLD
acl2-8.5>  MEMOIZEDP
acl2-8.5>  NEVER-MEMOIZE-FN
acl2-8.5>  NEVER-MEMOIZE
acl2-8.5>  *BAD-LISP-CONSP-MEMOIZATION*
acl2-8.5>  *THREAD-UNSAFE-BUILTIN-MEMOIZATIONS*
acl2-8.5>  SET-BAD-LISP-CONSP-MEMOIZE
acl2-8.5>  *SPECIAL-CLTL-CMD-ATTACHMENT-MARK-NAME*
acl2-8.5>  *SPECIAL-CLTL-CMD-ATTACHMENT-MARK*
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
acl2-8.5>   (DEFN MEMOIZE-SUMMARY NIL NIL)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
acl2-8.5>   (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
acl2-8.5>   (DEFCONST *HONS-PRIMITIVE-FNS*
acl2-8.5>             '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
acl2-8.5>                         HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO SERIALIZE-WRITE
acl2-8.5>             (FILENAME OBJ &KEY VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-WRITE-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-WRITE-FN
acl2-8.5>          (FILENAME OBJ VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME OBJ VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  STATE))
acl2-8.5>   (DEFMACRO SERIALIZE-READ
acl2-8.5>             (FILENAME &KEY (HONS-MODE #) VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-READ-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-READ-FN
acl2-8.5>          (FILENAME HONS-MODE VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME HONS-MODE VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  (MV VAL STATE)))
acl2-8.5>   (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
acl2-8.5>             (DECLARE (XARGS :GUARD #))
acl2-8.5>             (CONS 'STATE-GLOBAL-LET* (CONS # #)))).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  SERIALIZE-WRITE
acl2-8.5>  SERIALIZE-WRITE-FN
acl2-8.5>  SERIALIZE-READ
acl2-8.5>  SERIALIZE-READ-FN
acl2-8.5>  WITH-SERIALIZE-CHARACTER
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO SERIALIZE-WRITE
acl2-8.5>             (FILENAME OBJ &KEY VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-WRITE-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-WRITE-FN
acl2-8.5>          (FILENAME OBJ VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME OBJ VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  STATE))
acl2-8.5>   (DEFMACRO SERIALIZE-READ
acl2-8.5>             (FILENAME &KEY (HONS-MODE #) VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-READ-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-READ-FN
acl2-8.5>          (FILENAME HONS-MODE VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME HONS-MODE VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  (MV VAL STATE)))
acl2-8.5>   (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
acl2-8.5>             (DECLARE (XARGS :GUARD #))
acl2-8.5>             (CONS 'STATE-GLOBAL-LET* (CONS # #)))).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading "basis-b.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  ENFORCE-REDUNDANCY-ER-ARGS
acl2-8.5>  ENFORCE-REDUNDANCY
acl2-8.5>  GLOBAL-SET
acl2-8.5>  TILDE-@-ILLEGAL-VARIABLE-OR-CONSTANT-NAME-PHRASE
acl2-8.5>  LEGAL-CONSTANTP
acl2-8.5>  GENVAR1
acl2-8.5>  GENVAR
acl2-8.5>  GEN-FORMALS-FROM-PRETTY-FLAGS1
acl2-8.5>  GEN-FORMALS-FROM-PRETTY-FLAGS
acl2-8.5>  COLLECT-NON-X
acl2-8.5>  COLLECT-NON-*
acl2-8.5>  DEFSTUB-BODY-NEW
acl2-8.5>  DEFPROXY
acl2-8.5>  DEFSTUB-IGNORES
acl2-8.5>  DEFSTUB-BODY-OLD-AUX
acl2-8.5>  DEFSTUB-BODY-OLD
acl2-8.5>  DEFSTUB-FN1
acl2-8.5>  DEFSTUB-FN
acl2-8.5>  DEFSTUB
acl2-8.5>  *PRIMITIVE-FORMALS-AND-GUARDS*
acl2-8.5>  *PRIMITIVE-MONADIC-BOOLEANS*
acl2-8.5>  CONS-TERM1-CASES
acl2-8.5>  *CONS-TERM1-ALIST*
acl2-8.5>  CONS-TERM1-BODY
acl2-8.5>  QUOTE-LISTP
acl2-8.5>  CONS-TERM1
acl2-8.5>  CONS-TERM
acl2-8.5>  CONS-TERM*
acl2-8.5>  MCONS-TERM
acl2-8.5>  MCONS-TERM*
acl2-8.5>  FCONS-TERM
acl2-8.5>  CDR-NEST
acl2-8.5>  STOBJ-PRINT-NAME
acl2-8.5>  EVISCERATION-STOBJ-MARK
acl2-8.5>  EVISCERATION-STOBJ-MARKS1
acl2-8.5>  *ERROR-TRIPLE-SIG*
acl2-8.5>  *CMP-SIG*
acl2-8.5>  EVISCERATION-STOBJ-MARKS
acl2-8.5>  EVISCERATE-STOBJS1
acl2-8.5>  EVISCERATE-STOBJS
acl2-8.5>  EVISCERATE-STOBJS-TOP
acl2-8.5>  FLAMBDA-APPLICATIONP
acl2-8.5>  LAMBDA-APPLICATIONP
acl2-8.5>  FLAMBDAP
acl2-8.5>  LAMBDA-FORMALS
acl2-8.5>  LAMBDA-BODY
acl2-8.5>  MAKE-LAMBDA
acl2-8.5>  MAKE-LET
acl2-8.5>  ER-LET*
acl2-8.5>  MATCH
acl2-8.5>  MATCH!
acl2-8.5>  DEF-BASIC-TYPE-SETS1
acl2-8.5>  DEF-BASIC-TYPE-SETS
acl2-8.5>  LIST-OF-THE-TYPE-SET
acl2-8.5>  TS=
acl2-8.5>  TS-COMPLEMENT0
acl2-8.5>  TS-COMPLEMENTP
acl2-8.5>  TS-UNION0-FN
acl2-8.5>  TS-UNION0
acl2-8.5>  TS-INTERSECTION0
acl2-8.5>  TS-DISJOINTP
acl2-8.5>  TS-INTERSECTP
acl2-8.5>  TS-BUILDER-CASE-LISTP
acl2-8.5>  TS-BUILDER-MACRO1
acl2-8.5>  TS-BUILDER-MACRO
acl2-8.5>  TS-BUILDER
acl2-8.5>  FFN-SYMB-P
acl2-8.5>  STRIP-NOT
acl2-8.5>  EQUALITYP
acl2-8.5>  INEQUALITYP
acl2-8.5>  CONSITYP
acl2-8.5>  PRINT-CURRENT-IDATE
acl2-8.5>  SKIP-WHEN-LOGIC
acl2-8.5>  CHK-INHIBIT-OUTPUT-LST
acl2-8.5>  *LD-SPECIAL-ERROR*
acl2-8.5>  CHK-LD-SKIP-PROOFSP
acl2-8.5>  SET-LD-SKIP-PROOFSP
acl2-8.5>  SET-LD-SKIP-PROOFS
acl2-8.5>  SET-WRITE-ACL2X
acl2-8.5>  *CHECK-SUM-EXCLUSIVE-MAXIMUM*
acl2-8.5>  *CHECK-LENGTH-EXCLUSIVE-MAXIMUM*
acl2-8.5>  *-CHECK-SUM-EXCLUSIVE-MAXIMUM*
acl2-8.5>  *1-CHECK-LENGTH-EXCLUSIVE-MAXIMUM*
acl2-8.5>  ASCII-CODE!
acl2-8.5>  CHECK-SUM1
acl2-8.5>  CHECK-SUM
acl2-8.5>  CHECK-SUM-INC
acl2-8.5>  CHECK-SUM-NATURAL
acl2-8.5>  CHECK-SUM-STRING1
acl2-8.5>  CHECK-SUM-STRING2
acl2-8.5>  CHECK-SUM-STRING
acl2-8.5>  CHECK-SUM-OBJ1
acl2-8.5>  OLD-CHECK-SUM-OBJ
acl2-8.5>  PLUS-MOD-M31
acl2-8.5>  DOUBLE-MOD-M31
acl2-8.5>  TIMES-EXPT-2-16-MOD-M31
acl2-8.5>  TIMES-MOD-M31
acl2-8.5>  FCHECKSUM-NATURAL-AUX
acl2-8.5>  FCHECKSUM-NATURAL
acl2-8.5>  FCHECKSUM-STRING1
acl2-8.5>  FCHECKSUM-STRING2
acl2-8.5>  FCHECKSUM-STRING
acl2-8.5>  FCHECKSUM-ATOM
acl2-8.5>  *FCHECKSUM-OBJ-STACK-BOUND-INIT*
acl2-8.5>  (FCHECKSUM-OBJ2 FCHECKSUM-OBJ)
acl2-8.5>  CHECK-SUM-OBJ
acl2-8.5>  READ-FILE-ITERATE
acl2-8.5>  READ-FILE
acl2-8.5>  FORMALS
acl2-8.5>  PLIST-WORLDP-WITH-FORMALS
acl2-8.5>  ARITY
acl2-8.5>  SYMBOL-CLASS
acl2-8.5>  FDEFUN-MODE
acl2-8.5>  DEFUN-MODE
acl2-8.5>  ARITIES-OKP
acl2-8.5>  USER-DEFINED-FUNCTIONS-TABLE
acl2-8.5>  WEAK-DEF-BODY-P
acl2-8.5>  LATEST-BODY
acl2-8.5>  DEF-BODY
acl2-8.5>  BODY
acl2-8.5>  GET-STOBJ-RECOGNIZER
acl2-8.5>  STOBJ-RECOGNIZER-TERMS
acl2-8.5>  MCONS-TERM-SMART
acl2-8.5>  (OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST)
acl2-8.5>  OPTIMIZE-STOBJ-RECOGNIZERS
acl2-8.5>  GUARD
acl2-8.5>  GUARD-LST
acl2-8.5>  EQUIVALENCE-RELATIONP
acl2-8.5>  >=-LEN
acl2-8.5>  ALL->=-LEN
acl2-8.5>  STRIP-CADRS
acl2-8.5>  STRIP-CDDRS
acl2-8.5>  GLOBAL-SET-LST
acl2-8.5>  CONS-TERM1-BODY-MV2
acl2-8.5>  CONS-TERM1-MV2
acl2-8.5>  (SUBLIS-VAR1 SUBLIS-VAR1-LST)
acl2-8.5>  SUBLIS-VAR
acl2-8.5>  SUBLIS-VAR-LST
acl2-8.5>  SUBCOR-VAR1
acl2-8.5>  (SUBCOR-VAR SUBCOR-VAR-LST)
acl2-8.5>  MAKE-REVERSED-AD-LIST
acl2-8.5>  CAR-CDR-ABBREV-NAME
acl2-8.5>  PRETTY-PARSE-AD-LIST
acl2-8.5>  UNTRANSLATE-CAR-CDR-NEST
acl2-8.5>  COLLECT-NON-TRIVIAL-BINDINGS
acl2-8.5>  UNTRANSLATE-AND
acl2-8.5>  UNTRANSLATE-OR
acl2-8.5>  CASE-LENGTH
acl2-8.5>  COND-LENGTH
acl2-8.5>  *UNTRANSLATE-BOOLEAN-PRIMITIVES*
acl2-8.5>  RIGHT-ASSOCIATED-ARGS
acl2-8.5>  DUMB-NEGATE-LIT
acl2-8.5>  DUMB-NEGATE-LIT-LST
acl2-8.5>  (TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT)
acl2-8.5>  ACCESSOR-ROOT
acl2-8.5>  PROGN!
acl2-8.5>  LD-REDEFINITION-ACTION
acl2-8.5>  CHK-LD-REDEFINITION-ACTION
acl2-8.5>  SET-LD-REDEFINITION-ACTION
acl2-8.5>  REDEF
acl2-8.5>  REDEF!
acl2-8.5>  REDEF+
acl2-8.5>  REDEF-
acl2-8.5>  CHK-CURRENT-PACKAGE
acl2-8.5>  SET-CURRENT-PACKAGE
acl2-8.5>  DEFUN-FOR-STATE-NAME
acl2-8.5>  ERROR-FREE-TRIPLE-TO-STATE
acl2-8.5>  DEFUN-FOR-STATE
acl2-8.5>  SET-CURRENT-PACKAGE-STATE
acl2-8.5>  STANDARD-OI
acl2-8.5>  READ-STANDARD-OI
acl2-8.5>  CHK-STANDARD-OI
acl2-8.5>  SET-STANDARD-OI
acl2-8.5>  CHK-STANDARD-CO
acl2-8.5>  SET-STANDARD-CO
acl2-8.5>  PROOFS-CO
acl2-8.5>  CHK-PROOFS-CO
acl2-8.5>  SET-PROOFS-CO
acl2-8.5>  ILLEGAL-STATE-LD-PROMPT
acl2-8.5>  LD-PRE-EVAL-FILTER
acl2-8.5>  ILLEGAL-STATE-P
acl2-8.5>  LD-PROMPT
acl2-8.5>  CHK-LD-PROMPT
acl2-8.5>  SET-LD-PROMPT
acl2-8.5>  LD-KEYWORD-ALIASES
acl2-8.5>  LD-KEYWORD-ALIASESP
acl2-8.5>  LD-KEYWORD-ALIASES
acl2-8.5>  ADD-LD-KEYWORD-ALIAS!
acl2-8.5>  ADD-LD-KEYWORD-ALIAS
acl2-8.5>  SET-LD-KEYWORD-ALIASES!
acl2-8.5>  SET-LD-KEYWORD-ALIASES
acl2-8.5>  LD-MISSING-INPUT-OK
acl2-8.5>  CHK-LD-MISSING-INPUT-OK
acl2-8.5>  SET-LD-MISSING-INPUT-OK
acl2-8.5>  NEW-NAMEP
acl2-8.5>  CHK-LD-PRE-EVAL-FILTER
acl2-8.5>  SET-LD-PRE-EVAL-FILTER
acl2-8.5>  LD-PRE-EVAL-PRINT
acl2-8.5>  CHK-LD-PRE-EVAL-PRINT
acl2-8.5>  SET-LD-PRE-EVAL-PRINT
acl2-8.5>  LD-POST-EVAL-PRINT
acl2-8.5>  CHK-LD-POST-EVAL-PRINT
acl2-8.5>  SET-LD-POST-EVAL-PRINT
acl2-8.5>  LD-ERROR-TRIPLES
acl2-8.5>  CHK-LD-ERROR-TRIPLES
acl2-8.5>  SET-LD-ERROR-TRIPLES
acl2-8.5>  LD-ERROR-ACTION
acl2-8.5>  CHK-LD-ERROR-ACTION
acl2-8.5>  SET-LD-ERROR-ACTION
acl2-8.5>  LD-QUERY-CONTROL-ALIST
acl2-8.5>  LD-QUERY-CONTROL-ALISTP
acl2-8.5>  CDR-ASSOC-QUERY-ID
acl2-8.5>  CHK-LD-QUERY-CONTROL-ALIST
acl2-8.5>  SET-LD-QUERY-CONTROL-ALIST
acl2-8.5>  LD-VERBOSE
acl2-8.5>  CHK-LD-VERBOSE
acl2-8.5>  SET-LD-VERBOSE
acl2-8.5>  CHK-LD-USER-STOBJS-MODIFIED-WARNING
acl2-8.5>  SET-LD-USER-STOBJS-MODIFIED-WARNING
acl2-8.5>  *NQTHM-TO-ACL2-PRIMITIVES*
acl2-8.5>  *NQTHM-TO-ACL2-COMMANDS*
acl2-8.5>  NQTHM-TO-ACL2-FN
acl2-8.5>  NQTHM-TO-ACL2
acl2-8.5>  ALLOCATE-FIXNUM-RANGE
acl2-8.5>  ALLEGRO-ALLOCATE-SLOWLY-FN
acl2-8.5>  CLEAR-PSTK
acl2-8.5>  *PSTK-VARS*
acl2-8.5>  PSTK-BINDINGS-AND-ARGS
acl2-8.5>  PSTK
acl2-8.5>  PSTACK-FN
acl2-8.5>  PSTACK
acl2-8.5>  VERBOSE-PSTACK
acl2-8.5>  SET-PRINT-CLAUSE-IDS
acl2-8.5>  SET-SAVED-OUTPUT-TOKEN-LST
acl2-8.5>  SET-GAG-MODE-FN
acl2-8.5>  SET-GAG-MODE
acl2-8.5>  POP-INHIBIT-OUTPUT-LST-STACK
acl2-8.5>  PUSH-INHIBIT-OUTPUT-LST-STACK
acl2-8.5>  SET-GC-THRESHOLD$-FN
acl2-8.5>  SET-GC-THRESHOLD$
acl2-8.5> 
acl2-8.5> Finished loading "basis-b.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "parallel.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  SET-PARALLEL-EXECUTION-FN
acl2-8.5>  SET-PARALLEL-EXECUTION
acl2-8.5>  WATERFALL-PRINTING-VALUE-FOR-PARALLELISM-VALUE
acl2-8.5>  PRINT-SET-WATERFALL-PARALLELISM-NOTICE
acl2-8.5>  CHECK-FOR-NO-OVERRIDE-HINTS
acl2-8.5>  SET-WATERFALL-PARALLELISM-FN
acl2-8.5>  SET-WATERFALL-PARALLELISM1
acl2-8.5>  SAVED-MEMOIZE-TABLE
acl2-8.5>  SAVE-MEMO-TABLE
acl2-8.5>  CLEAR-MEMO-TABLE-EVENTS
acl2-8.5>  CLEAR-MEMO-TABLE
acl2-8.5>  SAVE-AND-CLEAR-MEMOIZATION-SETTINGS
acl2-8.5>  SET-MEMO-TABLE-EVENTS
acl2-8.5>  RESTORE-MEMOIZATION-SETTINGS
acl2-8.5>  SET-WATERFALL-PARALLELISM
acl2-8.5>  SET-WATERFALL-PRINTING-FN
acl2-8.5>  SET-WATERFALL-PRINTING
acl2-8.5>  SET-WATERFALL-PARALLELISM-HACKS-ENABLED-GUARD
acl2-8.5>  WATERFALL-PARALLELISM-TABLE
acl2-8.5>  SET-WATERFALL-PARALLELISM-HACKS-ENABLED
acl2-8.5>  SET-WATERFALL-PARALLELISM-HACKS-ENABLED!
acl2-8.5>  CAAR-IS-DECLAREP
acl2-8.5>  DECLARE-GRANULARITY-P
acl2-8.5>  CHECK-AND-PARSE-FOR-GRANULARITY-FORM
acl2-8.5>  PARGS
acl2-8.5>  PLET
acl2-8.5>  BINARY-PAND
acl2-8.5>  PAND
acl2-8.5>  BINARY-POR
acl2-8.5>  POR
acl2-8.5>  OR-LIST
acl2-8.5>  AND-LIST
acl2-8.5>  CPU-CORE-COUNT
acl2-8.5>  SPEC-MV-LET
acl2-8.5>  SET-TOTAL-PARALLELISM-WORK-LIMIT-FN
acl2-8.5>  SET-TOTAL-PARALLELISM-WORK-LIMIT
acl2-8.5>  SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR-FN
acl2-8.5>  SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR
acl2-8.5> 
acl2-8.5> Finished loading "parallel.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "translate.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  (TERMP TERM-LISTP)
acl2-8.5>  TERM-LIST-LISTP
acl2-8.5>  COMPUTED-HINT-TUPLE-LISTP
acl2-8.5>  DEFAULT-HINTS-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ARGS
acl2-8.5>  *MACRO-EXPANSION-CTX*
acl2-8.5>  ERROR-TRACE-SUGGESTION
acl2-8.5>  IGNORED-ATTACHMENT-MSG
acl2-8.5>  EV-FNCALL-NULL-BODY-ER-MSG
acl2-8.5>  EV-FNCALL-NULL-BODY-ERP
acl2-8.5>  EV-FNCALL-NULL-BODY-ER
acl2-8.5>  EV-FNCALL-CREATOR-ER-MSG
acl2-8.5>  UNKNOWN-PKG-ERROR-MSG
acl2-8.5>  ILLEGAL-MSG
acl2-8.5>  PROGRAM-ONLY-ER-MSG
acl2-8.5>  *SAFE-MODE-GUARD-ER-ADDENDUM*
acl2-8.5>  FIND-FIRST-NON-NIL
acl2-8.5>  LATCH-STOBJS1
acl2-8.5>  LATCH-STOBJS
acl2-8.5>  ACTUAL-STOBJS-OUT1
acl2-8.5>  APPLY-SYMBOL-ALIST
acl2-8.5>  APPLY-INVERSE-SYMBOL-ALIST
acl2-8.5>  *FOR-LOOP$-KEYWORD-INFO*
acl2-8.5>  *LOOP$-SPECIAL-FUNCTION-SYMBOLS*
acl2-8.5>  FOR-LOOP$-OPERATOR-SCIONP
acl2-8.5>  LOOP$-SCION-STYLE1
acl2-8.5>  LOOP$-SCION-STYLE
acl2-8.5>  LOOP$-SCION-RESTRICTION1
acl2-8.5>  LOOP$-SCION-RESTRICTION
acl2-8.5>  MAKE-CARTON
acl2-8.5>  EXCART
acl2-8.5>  SYMBOL-NAME-EQUAL
acl2-8.5>  ASSOC-SYMBOL-NAME-EQUAL
acl2-8.5>  PARSE-LOOP$-ACCUM
acl2-8.5>  POSSIBLE-TYPOP
acl2-8.5>  MAYBE-MEANT-BUT-DIDNT-WRITE
acl2-8.5>  PARSE-LOOP$-WHEN
acl2-8.5>  PARSE-LOOP$-UNTIL
acl2-8.5>  PARSE-LOOP$-VSTS-DIAGNOSE-FAILURE
acl2-8.5>  PARSE-LOOP$-VSTS
acl2-8.5>  PARSE-LOOP$-FINALLY
acl2-8.5>  PARSE-DO$-KEYWORDS-AND-BODY
acl2-8.5>  PARSE-DO$
acl2-8.5>  FIRST-UNUSUAL-WITH-CLAUSE
acl2-8.5>  PARSE-LOOP$-WITH
acl2-8.5>  PARSE-LOOP$
acl2-8.5>  UNKNOWN-STOBJ-NAMES
acl2-8.5>  DO$-STOBJS-OUT
acl2-8.5>  ACTUAL-STOBJS-OUT
acl2-8.5>  TRANSLATED-ACL2-UNWIND-PROTECTP4
acl2-8.5>  TRANSLATED-ACL2-UNWIND-PROTECTP
acl2-8.5>  ACL2-SYSTEM-NAMEP
acl2-8.5>  ACL2-SYSTEM-NAMEP-STATE
acl2-8.5>  (BIG-N DECREMENT-BIG-N ZP-BIG-N)
acl2-8.5>  W-OF-ANY-STATE
acl2-8.5>  UNTRANSLATE-PREPROCESS-FN
acl2-8.5>  UNTRANSLATE*
acl2-8.5>  SAVE-EV-FNCALL-GUARD-ER
acl2-8.5>  WEAK-ATTACHMENT-P
acl2-8.5>  WEAK-ATTACHMENT-COMPONENT-P
acl2-8.5>  ATTACHMENT-RECORD-PAIRS
acl2-8.5>  ALL-ATTACHMENTS
acl2-8.5>  GC-OFF1
acl2-8.5>  GC-OFF
acl2-8.5>  RETURN-LAST-LOOKUP
acl2-8.5>  ADD-IGNORE-TO-REST
acl2-8.5>  ADD-TYPE-DCLS-TO-REST
acl2-8.5>  COLLECT-IGNORED-LET-VARS
acl2-8.5>  MAKE-LET-OR-LET*
acl2-8.5>  UNTRANSLATE*-LST
acl2-8.5>  LIVE-STATE-SYMBOLP
acl2-8.5>  APPLY-USER-STOBJ-ALIST-OR-KWOTE
acl2-8.5>  SIGNATURE-FNS
acl2-8.5>  MAKE-EVENT-TUPLE
acl2-8.5>  ACCESS-EVENT-TUPLE-NUMBER
acl2-8.5>  ACCESS-EVENT-TUPLE-DEPTH
acl2-8.5>  ACCESS-EVENT-TUPLE-TYPE
acl2-8.5>  ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P
acl2-8.5>  ACCESS-EVENT-TUPLE-NAMEX
acl2-8.5>  ACCESS-EVENT-TUPLE-FORM
acl2-8.5>  ACCESS-EVENT-TUPLE-SYMBOL-CLASS
acl2-8.5>  WEAK-COMMAND-TUPLE-P
acl2-8.5>  MAKE-COMMAND-TUPLE
acl2-8.5>  ACCESS-COMMAND-TUPLE-NUMBER
acl2-8.5>  ACCESS-COMMAND-TUPLE-DEFUN-MODE
acl2-8.5>  ACCESS-COMMAND-TUPLE-FORM
acl2-8.5>  SAFE-ACCESS-COMMAND-TUPLE-FORM
acl2-8.5>  ACCESS-COMMAND-TUPLE-LAST-MAKE-EVENT-EXPANSION
acl2-8.5>  ACCESS-COMMAND-TUPLE-CBD
acl2-8.5>  MAX-ABSOLUTE-EVENT-NUMBER
acl2-8.5>  NEXT-ABSOLUTE-EVENT-NUMBER
acl2-8.5>  MAX-ABSOLUTE-COMMAND-NUMBER
acl2-8.5>  NEXT-ABSOLUTE-COMMAND-NUMBER
acl2-8.5>  SCAN-TO-LANDMARK-NUMBER
acl2-8.5>  ADD-TO-ZAP-TABLE
acl2-8.5>  FETCH-FROM-ZAP-TABLE
acl2-8.5>  *EVENT-INDEX-INTERVAL*
acl2-8.5>  *COMMAND-INDEX-INTERVAL*
acl2-8.5>  LOOKUP-WORLD-INDEX1
acl2-8.5>  LOOKUP-WORLD-INDEX
acl2-8.5>  *UNSPECIFIED-XARG-VALUE*
acl2-8.5>  GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS1
acl2-8.5>  GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS
acl2-8.5>  GET-UNAMBIGUOUS-XARGS-FLG1
acl2-8.5>  GET-UNAMBIGUOUS-XARGS-FLG
acl2-8.5>  GET-UNAMBIGUOUS-XARGS-FLG-LST
acl2-8.5>  REMOVE-STRINGS
acl2-8.5>  REV-UNION-EQUAL
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST
acl2-8.5>  TRANSLATE-DECLARATION-TO-GUARD-VAR-LST
acl2-8.5>  GET-GUARDS2
acl2-8.5>  GET-GUARDS1
acl2-8.5>  GET-GUARDS
acl2-8.5>  DCLS-GUARD-RAW-FROM-DEF
acl2-8.5>  GET-EVENT
acl2-8.5>  GET-SKIPPED-PROOFS-P
acl2-8.5>  NEGATE-UNTRANSLATED-FORM
acl2-8.5>  EVENT-TUPLE-FN-NAMES
acl2-8.5>  CLTL-DEF-FROM-NAME2
acl2-8.5>  CLTL-DEF-FROM-NAME1
acl2-8.5>  CLTL-DEF-FROM-NAME
acl2-8.5>  UNMAKE-TRUE-LIST-CONS-NEST
acl2-8.5>  UNMAKE-FORMAL-PAIRLIS2
acl2-8.5>  COLLECT-IGNORED-MV-VARS
acl2-8.5>  ALL-QUOTEPS
acl2-8.5>  (SUBST-VAR SUBST-VAR-LST)
acl2-8.5>  SUBST-EACH-FOR-VAR
acl2-8.5>  TYPE-EXPRESSIONS-FROM-TYPE-SPEC
acl2-8.5>  SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1
acl2-8.5>  FLATTEN-ANDS-IN-LIT
acl2-8.5>  FLATTEN-ANDS-IN-LIT-LST
acl2-8.5>  WEAK-SPLO-EXTRACTS-TUPLE-P
acl2-8.5>  (SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP
acl2-8.5>       SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN
acl2-8.5>       SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN-LST)
acl2-8.5>  COLLECT-PROGRAMS
acl2-8.5>  ALL-FNNAMES1
acl2-8.5>  ALL-FNNAMES
acl2-8.5>  ALL-FNNAMES-LST
acl2-8.5>  MAKE-BADGE-USERFN-STRUCTURE-TUPLE
acl2-8.5>  PUT-BADGE-USERFN-STRUCTURE-TUPLE-IN-ALIST
acl2-8.5>  WEAK-BADGE-USERFN-STRUCTURE-TUPLEP
acl2-8.5>  ACCESS-BADGE-USERFN-STRUCTURE-TUPLE-WARRANTP
acl2-8.5>  ACCESS-BADGE-USERFN-STRUCTURE-TUPLE-BADGE
acl2-8.5>  GET-WARRANTP
acl2-8.5>  GET-BADGE
acl2-8.5>  GET-BADGE-AND-WARRANTP
acl2-8.5>  WARRANT-NAME
acl2-8.5>  STRING-PREFIXP-1
acl2-8.5>  STRING-PREFIXP
acl2-8.5>  WARRANT-NAME-INVERSE
acl2-8.5>  WARRANT-FUNCTION-NAMEP
acl2-8.5>  T
acl2-8.5>  APPLY$-BADGE-ARITY
acl2-8.5>  *GENERIC-TAME-BADGE-1*
acl2-8.5>  *GENERIC-TAME-BADGE-2*
acl2-8.5>  *GENERIC-TAME-BADGE-3*
acl2-8.5>  *APPLY$-BADGE*
acl2-8.5>  *EV$-BADGE*
acl2-8.5>  EXECUTABLE-BADGE
acl2-8.5>  FIND-WARRANT-FUNCTION-NAME
acl2-8.5>  EXECUTABLE-TAMEP-LAMBDAP
acl2-8.5>  (EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP
acl2-8.5>                    EXECUTABLE-SUITABLY-TAMEP-LISTP)
acl2-8.5>  WELL-FORMED-LAMBDA-OBJECTP1
acl2-8.5>  WELL-FORMED-LAMBDA-OBJECTP
acl2-8.5>  ALL-FNNAMES!
acl2-8.5>  REMOVE-GUARD-HOLDERS-BLOCKED-BY-HIDE-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  (POSSIBLY-DIRTY-LAMBDA-OBJECTP1 POSSIBLY-DIRTY-LAMBDA-OBJECTP1-LST)
acl2-8.5>  POSSIBLY-DIRTY-LAMBDA-OBJECTP
acl2-8.5>  (MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP-LST)
acl2-8.5>  (EXPAND-ALL-LAMBDAS EXPAND-ALL-LAMBDAS-LST)
acl2-8.5>  (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST)
acl2-8.5>  TRIVIAL-LAMBDA-P
acl2-8.5>  (REMOVE-GUARD-HOLDERS1 REMOVE-GUARD-HOLDERS1-LST)
acl2-8.5>  REMOVE-GUARD-HOLDERS-WEAK
acl2-8.5>  REMOVE-GUARD-HOLDERS-WEAK-LST
acl2-8.5>  REMOVE-GUARD-HOLDERS1-LST-LST
acl2-8.5>  REMOVE-GUARD-HOLDERS-WEAK-LST-LST
acl2-8.5>  WARRANTS-FOR-TAMEP-LAMBDAP
acl2-8.5>  (WARRANTS-FOR-TAMEP WARRANTS-FOR-TAMEP-FUNCTIONP
acl2-8.5>                      WARRANTS-FOR-SUITABLY-TAMEP-LISTP)
acl2-8.5>  WARRANTS-FOR-TAMEP-LAMBDAP-LST
acl2-8.5>  (CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST)
acl2-8.5>  POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS
acl2-8.5>  POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST
acl2-8.5>  POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-IN-PAIRS
acl2-8.5>  REMOVE-GUARD-HOLDERS-LAMP
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  REMOVE-GUARD-HOLDERS
acl2-8.5>  REMOVE-GUARD-HOLDERS-LST
acl2-8.5>  REMOVE-GUARD-HOLDERS-LST-LST
acl2-8.5>  LAMBDA-OBJECT-GUARD
acl2-8.5>  TAG-TRANSLATED-LAMBDA$-BODY
acl2-8.5>  LAMBDA$-BODYP
acl2-8.5>  MEMBER-LAMBDA-OBJECTP
acl2-8.5>  ATTACHMENT-ALIST
acl2-8.5>  ATTACHMENT-PAIR
acl2-8.5>  APPLY$-LAMBDA-GUARD
acl2-8.5>  APPLY$-GUARD
acl2-8.5>  NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES
acl2-8.5>  ALL-FUNCTION-SYMBOLPS
acl2-8.5>  *UNKNOWN-CONSTRAINTS*
acl2-8.5>  UNKNOWN-CONSTRAINTS-TABLE-GUARD
acl2-8.5>  UNKNOWN-CONSTRAINTS-TABLE
acl2-8.5>  SET-UNKNOWN-CONSTRAINTS-SUPPORTERS
acl2-8.5>  EV-FNCALL-REC-LOGICAL-UNKNOWN-CONSTRAINTS
acl2-8.5>  NON-EXECUTABLE-STOBJS-MSG
acl2-8.5>  SCAN-TO-EVENT
acl2-8.5>  GET-DEFUN-EVENT
acl2-8.5>  *ONE-WAY-UNIFY1-IMPLICIT-FNS*
acl2-8.5>  ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS
acl2-8.5>  (ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1
acl2-8.5>                  ONE-WAY-UNIFY1-EQUAL)
acl2-8.5>  ONE-WAY-UNIFY
acl2-8.5>  *INITIAL-RETURN-LAST-TABLE*
acl2-8.5>  MAYBE-CONVERT-TO-MV
acl2-8.5>  *TYPE-EXPR-TO-TYPE-SPEC-ALIST*
acl2-8.5>  TYPE-SPEC-FIX-UNIFY-SUBST
acl2-8.5>  TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION-1
acl2-8.5>  TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION
acl2-8.5>  TYPE-SPEC-TO-VARLIST-ALIST
acl2-8.5>  RECOVER-TYPE-SPEC-EXPRS!1
acl2-8.5>  RECOVER-TYPE-SPEC-EXPRS!
acl2-8.5>  SPLIT-TYPE-SPECS-FROM-TERM
acl2-8.5>  UNTRANSLATE-LAMBDA-OBJECT-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  UNTRANSLATE-LAMBDA-OBJECT-CHEAT
acl2-8.5>  (GUARD-RAW EV-FNCALL-GUARD-ER EV-FNCALL-REC-LOGICAL
acl2-8.5>             EV-FNCALL-REC EV-REC-RETURN-LAST
acl2-8.5>             EV-REC EV-REC-LST ...)
acl2-8.5>  EV-FNCALL
acl2-8.5>  EV
acl2-8.5>  EV-LST
acl2-8.5>  ERSATZ-PROG2
acl2-8.5>  ERSATZ-SETQ
acl2-8.5>  ERSATZ-RETURN
acl2-8.5>  ERSATZ-LOOP-FINISH
acl2-8.5>  ERSATZ-MV-SETQ
acl2-8.5>  MAKE-ERSATZ-MV-SETQ
acl2-8.5>  ERSATZ-MV-SETQ-VARS
acl2-8.5>  ERSATZ-MV-SETQ-BODY
acl2-8.5>  *CLTL-TO-ERSATZ-FNS*
acl2-8.5>  ERSATZ-FUNCTIONP
acl2-8.5>  (ERSATZ-SYMBOLS ERSATZ-SYMBOLS-LIST)
acl2-8.5>  UNTRANSLATE
acl2-8.5>  UNTRANSLATE-LST
acl2-8.5>  (REPLACE-ERSATZ-FUNCTIONS REPLACE-ERSATZ-FUNCTIONS-LIST)
acl2-8.5>  UNTRANSLATE-DO-BODY
acl2-8.5>  PROGN$-OF-CHECK-DCL-GUARDIANSP
acl2-8.5>  LAMBDA-DO-BODY-DECONSTRUCTOR
acl2-8.5>  (WELL-FORMED-DO-BODY WELL-FORMED-DO-BODY-LIST)
acl2-8.5>  (DUMB-OCCUR DUMB-OCCUR-LST)
acl2-8.5>  VAR-ON-IF-LEAF
acl2-8.5>  GUESS-DO-BODY-MEASURE-VARS
acl2-8.5>  GUESS-DO-BODY-MEASURE
acl2-8.5>  CMP-DO-BODY-ALIST
acl2-8.5>  MAKE-TRUE-LIST-CONS-NEST
acl2-8.5>  CMP-DO-BODY-EXIT
acl2-8.5>  CMP-DO-BODY-GUARDIAN
acl2-8.5>  PROG2$-CALL
acl2-8.5>  CMP-DO-BODY-MV-GUARDIAN-1
acl2-8.5>  CMP-DO-BODY-MV-GUARDIAN
acl2-8.5>  TRANSLATED-MV-NTH-CALLS
acl2-8.5>  COLLECT-BY-POSITION
acl2-8.5>  MAKE-LAMBDA-APPLICATION
acl2-8.5>  MAKE-LAMBDA-TERM
acl2-8.5>  CMP-TO-ERROR-TRIPLE
acl2-8.5>  CMP-TO-ERROR-DOUBLE
acl2-8.5>  CMP-AND-VALUE-TO-ERROR-QUADRUPLE
acl2-8.5>  ER-CMP-FN
acl2-8.5>  ER-CMP
acl2-8.5>  VALUE-CMP
acl2-8.5>  ER-PROGN-FN-CMP
acl2-8.5>  ER-PROGN-CMP
acl2-8.5>  ER-LET*-CMP
acl2-8.5>  CMP-DO-BODY-SETQ
acl2-8.5>  CMP-DO-BODY-MV-SETQ
acl2-8.5>  CHK-NO-ERSATZ-SYMBOLS-P
acl2-8.5>  COLLECT-NONTRIVIAL-FORMALS-IN-SET
acl2-8.5>  CMP-DO-BODY-1
acl2-8.5>  CMP-DO-BODY
acl2-8.5>  COLLECT-TWVTS-TYPE-PREDS
acl2-8.5>  VAR-TO-CDR-ASSOC-VAR-SUBSTITUTION
acl2-8.5>  MAKE-DO-BODY-LAMBDA$
acl2-8.5>  MAKE-DO-MEASURE-LAMBDA$
acl2-8.5>  MAKE-INITIAL-DO-BODY-ALIST
acl2-8.5>  EV-W-LST
acl2-8.5>  SILENT-ERROR
acl2-8.5>  WARNING1-CW
acl2-8.5>  WARNING$-CW1
acl2-8.5>  WARNING$-CW
acl2-8.5>  CHK-LENGTH-AND-KEYS
acl2-8.5>  DUPLICATE-KEYS-ACTION-TABLE
acl2-8.5>  SET-DUPLICATE-KEYS-ACTION!
acl2-8.5>  SET-DUPLICATE-KEYS-ACTION
acl2-8.5>  DUPLICATE-KEYS-ACTION
acl2-8.5>  LEGAL-INITP
acl2-8.5>  MACRO-ARGLIST-KEYSP
acl2-8.5>  MACRO-ARGLIST-AFTER-RESTP
acl2-8.5>  MACRO-ARGLIST-OPTIONALP
acl2-8.5>  MACRO-ARGLIST1P
acl2-8.5>  SUBSEQUENCEP
acl2-8.5>  COLLECT-LAMBDA-KEYWORDPS
acl2-8.5>  MACRO-ARGS-STRUCTUREP
acl2-8.5>  BIND-MACRO-ARGS-KEYS1
acl2-8.5>  BIND-MACRO-ARGS-KEYS
acl2-8.5>  BIND-MACRO-ARGS-AFTER-REST
acl2-8.5>  BIND-MACRO-ARGS-OPTIONAL
acl2-8.5>  BIND-MACRO-ARGS1
acl2-8.5>  BIND-MACRO-ARGS
acl2-8.5>  MACRO-GUARD-ER-MSG
acl2-8.5>  MACROEXPAND1-CMP
acl2-8.5>  MACROEXPAND1
acl2-8.5>  CHK-DECLARE
acl2-8.5>  COLLECT-DCLS
acl2-8.5>  TAG-LOOP$
acl2-8.5>  *ACCEPTABLE-DCLS-ALIST*
acl2-8.5>  *DOCUMENTATION-STRINGS-PERMITTED*
acl2-8.5>  *DCL-EXPLANATION-ALIST*
acl2-8.5>  TILDE-*-CONJUNCTION-PHRASE1
acl2-8.5>  TILDE-*-CONJUNCTION-PHRASE
acl2-8.5>  COLLECT-NON-LEGAL-VARIABLEPS
acl2-8.5>  OPTIMIZE-ALISTP
acl2-8.5>  CHK-DCL-LST
acl2-8.5>  NUMBER-OF-STRINGS
acl2-8.5>  GET-STRING
acl2-8.5>  COLLECT-DECLARATIONS-CMP
acl2-8.5>  COLLECT-DECLARATIONS
acl2-8.5>  LISTIFY
acl2-8.5>  TRANSLATE-DCL-LST
acl2-8.5>  *ONEIFY-PRIMITIVES*
acl2-8.5>  *EC-CALL-BAD-OPS*
acl2-8.5>  RETURN-LAST-CALL
acl2-8.5>  DCL-GUARDIAN
acl2-8.5>  IGNORE-VARS
acl2-8.5>  IGNORABLE-VARS
acl2-8.5>  MV-NTH-LIST
acl2-8.5>  TRANSLATE-BIND
acl2-8.5>  TRANSLATE-DEREF
acl2-8.5>  TRANSLATE-UNBOUND
acl2-8.5>  LISTLIS
acl2-8.5>  (FIND-FIRST-VAR FIND-FIRST-VAR-LST)
acl2-8.5>  (FIND-FIRST-FNSYMB FIND-FIRST-FNSYMB-LST)
acl2-8.5>  FIND-PKG-WITNESS
acl2-8.5>  TRANS-ER
acl2-8.5>  TRANS-ER+
acl2-8.5>  TRANS-ER+?
acl2-8.5>  TRANS-VALUE
acl2-8.5>  TRANS-ER-LET*
acl2-8.5>  HIDE-IGNORED-ACTUALS
acl2-8.5>  AUGMENT-IGNORE-VARS
acl2-8.5>  COMPUTE-STOBJ-FLAGS
acl2-8.5>  PRETTYIFY-STOBJ-FLAGS
acl2-8.5>  PRETTYIFY-STOBJS-OUT
acl2-8.5>  DEFSTOBJ-SUPPORTERP
acl2-8.5>  STOBJ-CREATORP
acl2-8.5>  (FFNNAMEP FFNNAMEP-LST)
acl2-8.5>  UNKNOWN-BINDING-MSG
acl2-8.5>  *MACROS-FOR-NONEXPANSION-IN-RAW-LISP*
acl2-8.5>  CHK-NO-DUPLICATE-DEFUNS-CMP
acl2-8.5>  CHK-NO-DUPLICATE-DEFUNS
acl2-8.5>  CHK-STATE-OK-MSG
acl2-8.5>  CHK-STATE-OK
acl2-8.5>  CHK-ARGLIST-MSG
acl2-8.5>  MSG-TO-CMP
acl2-8.5>  CHK-ARGLIST-CMP
acl2-8.5>  CHK-ARGLIST
acl2-8.5>  LOGICAL-NAME-TYPE
acl2-8.5>  CHK-ALL-BUT-NEW-NAME-CMP
acl2-8.5>  CHK-ALL-BUT-NEW-NAME
acl2-8.5>  CHK-DEFUNS-TUPLES-CMP
acl2-8.5>  CHK-DEFUNS-TUPLES
acl2-8.5>  NAME-DROPPER
acl2-8.5>  FIRST-ASSOC-EQ
acl2-8.5>  CONTEXT-FOR-ENCAPSULATE-PASS-2
acl2-8.5>  *BRR-GLOBALS*
acl2-8.5>  UNKNOWN-BINDING-MSG-ER
acl2-8.5>  CONGRUENT-STOBJSP
acl2-8.5>  STOBJS-IN-OUT1
acl2-8.5>  STOBJS-IN-MATCHP
acl2-8.5>  STOBJS-IN-OUT
acl2-8.5>  NON-TRIVIAL-STOBJ-BINDING
acl2-8.5>  FORMALIZED-VARLISTP
acl2-8.5>  THROW-NONEXEC-ERROR-P1
acl2-8.5>  THROW-NONEXEC-ERROR-P
acl2-8.5>  CHK-FLET-DECLARATIONS
acl2-8.5>  CHK-FLET-DECLARE-FORM
acl2-8.5>  CHK-FLET-DECLARE-FORM-LIST
acl2-8.5>  STOBJ-UPDATER-GUESS-FROM-ACCESSOR
acl2-8.5>  PARSE-STOBJ-LET-ACTUAL
acl2-8.5>  UNQUOTED-SYMBOL
acl2-8.5>  PARSE-STOBJ-LET1
acl2-8.5>  ILLEGAL-STOBJ-LET-MSG
acl2-8.5>  PARSE-STOBJ-LET
acl2-8.5>  SPLIT-VALUES-BY-KEYS
acl2-8.5>  NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST
acl2-8.5>  CONCRETE-ACCESSOR
acl2-8.5>  NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS-1
acl2-8.5>  WEAK-ABSSTOBJ-INFO-P
acl2-8.5>  ABSSTOBJ-TUPLES-LST
acl2-8.5>  NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS
acl2-8.5>  STOBJ-LET-FN
acl2-8.5>  STOBJ-LET-FN-RAW-LET-BINDINGS
acl2-8.5>  STOBJ-FIELD-ACCESSOR-P
acl2-8.5>  *STOBJ-TABLE-STOBJ*
acl2-8.5>  CHK-STOBJ-LET/BINDINGS
acl2-8.5>  CHK-STOBJ-LET/UPDATERS-1
acl2-8.5>  CHK-STOBJ-LET/UPDATERS
acl2-8.5>  ALIST-TO-DOUBLETS
acl2-8.5>  CHK-STOBJ-LET/ACCESSORS2
acl2-8.5>  CHK-STOBJ-LET/ACCESSORS1
acl2-8.5>  COLLECT-SOME-TRIPLES-WITH-NON-NIL-CDDDRS
acl2-8.5>  CHK-STOBJ-LET/ACCESSORS
acl2-8.5>  CHK-STOBJ-LET
acl2-8.5>  ALL-NILS-OR-X
acl2-8.5>  ABSSTOBJ-FIELD-FN-OF-STOBJ-TYPE-P
acl2-8.5>  STOBJ-FIELD-FN-OF-STOBJ-TYPE-P
acl2-8.5>  STOBJ-RECOGNIZER-P
acl2-8.5>  TRANS-OR
acl2-8.5>  INSIDE-DEFABSSTOBJ
acl2-8.5>  MISSING-KNOWN-STOBJS
acl2-8.5>  DEREF-MACRO-NAME
acl2-8.5>  CORRESPONDING-INLINE-FN
acl2-8.5>  UNTOUCHABLE-FN-P
acl2-8.5>  MACROEXPAND1*-CMP
acl2-8.5>  FIND-STOBJ-OUT-AND-CALL
acl2-8.5>  DEFINED-SYMBOLS
acl2-8.5>  MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES
acl2-8.5>  MATCH-STOBJS
acl2-8.5>  (ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST)
acl2-8.5>  *GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG*
acl2-8.5>  EDCLS-FROM-LAMBDA-OBJECT-DCLS
acl2-8.5>  EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT
acl2-8.5>  MAKE-PLAIN-LOOP$-LAMBDA-OBJECT
acl2-8.5>  TRANSLATE-VSTS
acl2-8.5>  MAKE-BINDINGS
acl2-8.5>  COLLECT-TVSTS-LIFTED-GUARDS
acl2-8.5>  MAKE-FANCY-LOOP$-TYPE-SPECS
acl2-8.5>  LIFT-FANCY-LOOP$-CARTON-GUARD
acl2-8.5>  MAKE-FANCY-LOOP$-LAMBDA-OBJECT
acl2-8.5>  MAKE-PLAIN-LOOP$
acl2-8.5>  MAKE-FANCY-LOOP$-TARGET
acl2-8.5>  MAKE-FANCY-LOOP$
acl2-8.5>  REMOVE-FOR-LOOP$-GUARDS
acl2-8.5>  REMOVE-DO-LOOP$-GUARDS
acl2-8.5>  REMOVE-LOOP$-GUARDS
acl2-8.5>  TRANSLATE11-VAR-OR-QUOTE-EXIT
acl2-8.5>  WEAK-BADGE-USERFN-STRUCTURE-ALISTP
acl2-8.5>  ILKS-PLIST-WORLDP
acl2-8.5>  ILKS-PER-ARGUMENT-SLOT
acl2-8.5>  (QUOTE-NORMAL-FORM1 QUOTE-NORMAL-FORM1-LST)
acl2-8.5>  QUOTE-NORMAL-FORM
acl2-8.5>  PRIMITIVE-EVENT-MACROS
acl2-8.5>  *SYMS-NOT-CALLABLE-IN-CODE-FAL*
acl2-8.5>  LOOP$-DEFAULT
acl2-8.5>  PARSE-WITH-GLOBAL-STOBJ
acl2-8.5>  *WITH-GLOBAL-STOBJ-PREFIX*
acl2-8.5>  *WITH-GLOBAL-STOBJ-PREFIX-CHARS*
acl2-8.5>  WITH-GLOBAL-STOBJ-VAR-LST
acl2-8.5>  WITH-GLOBAL-STOBJ-ADJUST-SIGNATURE-OR-VARS
acl2-8.5>  WITH-GLOBAL-STOBJ-FN1
acl2-8.5>  *SEE-DOC-WITH-GLOBAL-STOBJ*
acl2-8.5>  WITH-GLOBAL-STOBJ-FN
acl2-8.5>  WITH-GLOBAL-STOBJ
acl2-8.5>  (COLLECT-GLOBAL-STOBJS COLLECT-GLOBAL-STOBJS-LST)
acl2-8.5>  PATH-TO-WITH-GLOBAL-STOBJ
acl2-8.5>  WITH-GLOBAL-STOBJ-ILLEGAL-PATH-MSG
acl2-8.5>  CHK-GLOBAL-STOBJ-BODY
acl2-8.5>  (TRANSLATE11-FLET-ALIST TRANSLATE11-FLET-ALIST1 TRANSLATE11-FLET
acl2-8.5>                          TRANSLATE-STOBJ-CALLS TRANSLATE11-LET
acl2-8.5>                          TRANSLATE11-LET* TRANSLATE11-MV-LET ...)
acl2-8.5>  TRANSLATE1-CMP
acl2-8.5>  TRANSLATE1
acl2-8.5>  (LOGIC-FNSP LOGIC-FNS-LISTP)
acl2-8.5>  LOGIC-TERMP
acl2-8.5>  LOGIC-TERM-LISTP
acl2-8.5>  LOGIC-FNS-LIST-LISTP
acl2-8.5>  LOGIC-TERM-LIST-LISTP
acl2-8.5>  TRANSLATE-CMP
acl2-8.5>  TRANSLATE
acl2-8.5>  TRANSLATABLE-P
acl2-8.5>  CHK-TRANSLATABLE
acl2-8.5>  LOOP$-STOBJS-OUT
acl2-8.5>  REPLACED-STOBJ
acl2-8.5>  REPLACE-STOBJS1
acl2-8.5>  REPLACE-STOBJS
acl2-8.5>  USER-STOBJSP
acl2-8.5>  PUT-ASSOC-EQ-ALIST
acl2-8.5>  COLLECT-USER-STOBJS
acl2-8.5>  FILTER-KNOWN-STOBJS
acl2-8.5>  CHK-GLOBAL-STOBJS
acl2-8.5>  EV-FOR-TRANS-EVAL
acl2-8.5>  MACROEXPAND1*
acl2-8.5>  TRANS-EVAL1
acl2-8.5>  TRANS-EVAL0
acl2-8.5>  TRANS-EVAL
acl2-8.5>  TRANS-EVAL-NO-WARNING
acl2-8.5>  TRANS-EVAL-DEFAULT-WARNING
acl2-8.5>  LAMBDA-OBJECT-GUARD-LST
acl2-8.5>  LAMBDA-OBJECT-BODY-LST
acl2-8.5>  FILTER-LAMBDA$-OBJECTS
acl2-8.5>  (COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST)
acl2-8.5>  TAGGED-LOOP$P
acl2-8.5>  (COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST)
acl2-8.5>  (ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST)
acl2-8.5>  COLLECT-NON-EMPTY-PAIRS
acl2-8.5>  ANCESTRAL-LAMBDA$S-BY-CALLER
acl2-8.5>  (ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST)
acl2-8.5>  TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1
acl2-8.5>  TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2
acl2-8.5>  TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3
acl2-8.5>  TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4
acl2-8.5>  TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5
acl2-8.5>  STRINGS-AND-OTHERS
acl2-8.5>  PROHIBITION-OF-LOOP$-AND-LAMBDA$-MSG
acl2-8.5>  SIMPLE-TRANSLATE-AND-EVAL
acl2-8.5>  ERROR-FMS-CW
acl2-8.5>  SIMPLE-TRANSLATE-AND-EVAL-CMP
acl2-8.5>  SIMPLE-TRANSLATE-AND-EVAL-ERROR-DOUBLE
acl2-8.5>  TILDE-*-ALIST-PHRASE1
acl2-8.5>  TILDE-*-ALIST-PHRASE
acl2-8.5>  SET-TEMP-TOUCHABLE-FNS
acl2-8.5>  SET-TEMP-TOUCHABLE-VARS
acl2-8.5>  CLEAR-TEMP-TOUCHABLE-FNS
acl2-8.5>  CLEAR-TEMP-TOUCHABLE-VARS
acl2-8.5>  MAPCAR$
acl2-8.5>  MAPDO
acl2-8.5>  ALWAYS
acl2-8.5>  THEREIS
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  SET-GUARD-MSG
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  SUBLIS-EQUAL
acl2-8.5>  *TYPE-SPEC-TEMPLATES*
acl2-8.5>  PAIR-TYPE-EXPRESSIONS-WITH-TYPE-SPECS
acl2-8.5> 
acl2-8.5> Finished loading "translate.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "type-set-a.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  *TS-CHARACTER*
acl2-8.5>  *TS-POSITIVE-INTEGER*
acl2-8.5>  *TS-NON-NEGATIVE-INTEGER*
acl2-8.5>  *TS-NON-POSITIVE-INTEGER*
acl2-8.5>  *TS-INTEGER*
acl2-8.5>  *TS-RATIONAL*
acl2-8.5>  *TS-ACL2-NUMBER*
acl2-8.5>  *TS-RATIONAL-ACL2-NUMBER*
acl2-8.5>  *TS-NEGATIVE-RATIONAL*
acl2-8.5>  *TS-POSITIVE-RATIONAL*
acl2-8.5>  *TS-NON-POSITIVE-RATIONAL*
acl2-8.5>  *TS-NON-NEGATIVE-RATIONAL*
acl2-8.5>  *TS-RATIO*
acl2-8.5>  *TS-BIT*
acl2-8.5>  *TS-CONS*
acl2-8.5>  *TS-BOOLEAN*
acl2-8.5>  *TS-TRUE-LIST*
acl2-8.5>  *TS-NON-NIL*
acl2-8.5>  *TS-SYMBOL*
acl2-8.5>  *TS-TRUE-LIST-OR-STRING*
acl2-8.5>  *TS-EMPTY*
acl2-8.5>  *TS-UNKNOWN*
acl2-8.5>  ONE-BIT-TYPE-SETP
acl2-8.5>  *CODE-TYPE-SET-ALIST*
acl2-8.5>  LOGIOR-LST
acl2-8.5>  LOGAND-LST
acl2-8.5>  (TS-COMPLEMENT-FN TS-UNION-FN TS-INTERSECTION-FN
acl2-8.5>                    EVAL-TYPE-SET EVAL-TYPE-SET-LST)
acl2-8.5>  TS-COMPLEMENT
acl2-8.5>  TS-INTERSECTION
acl2-8.5>  TS-UNION
acl2-8.5>  TS-SUBSETP
acl2-8.5>  TYPE-SET-BINARY-+-ALIST-ENTRY
acl2-8.5>  TYPE-SET-BINARY-+-ALIST1
acl2-8.5>  TYPE-SET-BINARY-+-ALIST
acl2-8.5>  TYPE-SET-BINARY-*-ALIST-ENTRY
acl2-8.5>  TYPE-SET-BINARY-*-ALIST1
acl2-8.5>  TYPE-SET-BINARY-*-ALIST
acl2-8.5>  TYPE-SET-<-ALIST-ENTRY
acl2-8.5>  TYPE-SET-<-ALIST1
acl2-8.5>  TYPE-SET-<-ALIST
acl2-8.5> 
acl2-8.5> Finished loading "type-set-a.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "linear-a.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  TS-ACL2-NUMBERP
acl2-8.5>  TS-RATIONALP
acl2-8.5>  TS-REAL/RATIONALP
acl2-8.5>  TS-INTEGERP
acl2-8.5>  WEAK-HISTORY-ENTRY-P
acl2-8.5>  PT-OCCUR
acl2-8.5>  PT-INTERSECTP
acl2-8.5>  TAG-TREE-OCCUR
acl2-8.5>  REMOVE-TAG-FROM-TAG-TREE
acl2-8.5>  REMOVE-TAG-FROM-TAG-TREE!
acl2-8.5>  EXTEND-TAG-TREE
acl2-8.5>  ADD-TO-TAG-TREE
acl2-8.5>  ADD-TO-TAG-TREE!
acl2-8.5>  *FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE*
acl2-8.5>  FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE-P
acl2-8.5>  PUSH-LEMMA
acl2-8.5>  REMOVE1-ASSOC-EQ-ASSOC-EQ-1
acl2-8.5>  REMOVE1-ASSOC-EQ-ASSOC-EQ
acl2-8.5>  CONS-TAG-TREES1
acl2-8.5>  CONS-TAG-TREES
acl2-8.5>  TAGGED-OBJECTS
acl2-8.5>  TAGGED-OBJECTSP
acl2-8.5>  TAGGED-OBJECT
acl2-8.5>  WITH-TTREE-LOCK
acl2-8.5>  ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
acl2-8.5>  PTS-TO-TTREE-LST
acl2-8.5>  MARRY-PARENTS
acl2-8.5>  COLLECT-PARENTS1
acl2-8.5>  COLLECT-PARENTS0
acl2-8.5>  COLLECT-PARENTS
acl2-8.5>  IGNORE-POLYP
acl2-8.5>  TO-BE-IGNOREDP1
acl2-8.5>  TO-BE-IGNOREDP
acl2-8.5>  WEAK-ASSUMNOTE-P
acl2-8.5>  WEAK-ASSUMPTION-P
acl2-8.5>  WEAK-FC-DERIVATION-P
acl2-8.5>  (CONTAINS-ASSUMPTIONP CONTAINS-ASSUMPTIONP-FC-DERIVATIONS)
acl2-8.5>  REMOVE-ASSUMPTION-ENTRIES-FROM-TYPE-ALIST
acl2-8.5>  FORCE-ASSUMPTION1
acl2-8.5>  DUMB-OCCUR-IN-TYPE-ALIST
acl2-8.5>  ALL-DUMB-OCCUR-IN-TYPE-ALIST
acl2-8.5>  *FORCE-XRUNE*
acl2-8.5>  FORCE-ASSUMPTION
acl2-8.5>  TAG-TREE-OCCUR-ASSUMPTION-NIL-1
acl2-8.5>  TAG-TREE-OCCUR-ASSUMPTION-NIL
acl2-8.5>  ASSUMPTION-FREE-TTREEP
acl2-8.5>  *IMPOSSIBLE-ASSUMPTION*
acl2-8.5>  FN-COUNT-EVG-MAX-VAL
acl2-8.5>  FN-COUNT-EVG-MAX-VAL-NEG
acl2-8.5>  FN-COUNT-EVG-MAX-CALLS
acl2-8.5>  MIN-FIXNUM
acl2-8.5>  FN-COUNT-EVG-REC
acl2-8.5>  FN-COUNT-EVG
acl2-8.5>  VAR-FN-COUNT-1
acl2-8.5>  VAR-FN-COUNT
acl2-8.5>  VAR-OR-FN-COUNT-<
acl2-8.5>  TERM-ORDER1
acl2-8.5>  ARITH-TERM-ORDER
acl2-8.5>  WEAK-POLY-P
acl2-8.5>  FIRST-VAR
acl2-8.5>  FIRST-COEFFICIENT
acl2-8.5>  GOOD-COEFFICIENT
acl2-8.5>  GOOD-POT-VARP
acl2-8.5>  GOOD-POLYP
acl2-8.5>  LOGICAL-<
acl2-8.5>  LOGICAL-<=
acl2-8.5>  EVALUATE-GROUND-POLY
acl2-8.5>  IMPOSSIBLE-POLYP
acl2-8.5>  TRUE-POLYP
acl2-8.5>  SILLY-POLYP
acl2-8.5>  IMPOSSIBLE-POLY
acl2-8.5>  BASE-POLY0
acl2-8.5>  BASE-POLY
acl2-8.5>  POLY-ALIST-EQUAL
acl2-8.5>  POLY-EQUAL
acl2-8.5>  POLY-WEAKERP
acl2-8.5>  POLY-MEMBER
acl2-8.5>  NEW-AND-UGLY-LINEAR-VARSP
acl2-8.5>  FILTER-POLYS
acl2-8.5>  ADD-LINEAR-VARIABLE1
acl2-8.5>  ZERO-FACTOR-P
acl2-8.5>  GET-COEFFICIENT
acl2-8.5>  ADD-LINEAR-VARIABLE
acl2-8.5>  DUMB-EVAL-YIELDS-QUOTEP
acl2-8.5>  DUMB-EVAL
acl2-8.5>  ADD-LINEAR-TERM
acl2-8.5>  ADD-LINEAR-TERMS-FN
acl2-8.5>  ADD-LINEAR-TERMS
acl2-8.5>  NORMALIZE-POLY1
acl2-8.5>  NORMALIZE-POLY
acl2-8.5>  NORMALIZE-POLY-LST
acl2-8.5>  WEAK-LINEAR-POT-P
acl2-8.5>  MODIFY-LINEAR-POT
acl2-8.5>  *MAX-LINEAR-POT-LOOP-STOPPER-VALUE*
acl2-8.5>  LOOP-STOPPER-VALUE-OF-VAR
acl2-8.5>  SET-LOOP-STOPPER-VALUES
acl2-8.5>  VAR-IN-POT-LST-P
acl2-8.5>  BOUNDS-POLY-WITH-VAR
acl2-8.5>  BOUNDS-POLYS-WITH-VAR
acl2-8.5>  POLYS-WITH-VAR1
acl2-8.5>  POLYS-WITH-VAR
acl2-8.5>  POLYS-WITH-POTS
acl2-8.5>  NEW-VARS-IN-POT-LST
acl2-8.5>  CHANGED-POT-VARS
acl2-8.5>  INFECT-POLYS
acl2-8.5>  INFECT-FIRST-N-POLYS
acl2-8.5>  INFECT-NEW-POLYS
acl2-8.5>  FCOMPLEMENTARY-MULTIPLEP1
acl2-8.5>  FCOMPLEMENTARY-MULTIPLEP
acl2-8.5>  ALREADY-USED-BY-FIND-EQUATIONAL-POLYP-LST
acl2-8.5>  ALREADY-USED-BY-FIND-EQUATIONAL-POLYP
acl2-8.5>  CONS-TERM-BINARY-+-CONSTANT
acl2-8.5>  CONS-TERM-UNARY--
acl2-8.5>  CONS-TERM-BINARY-*-CONSTANT
acl2-8.5>  FIND-EQUATIONAL-POLY-RHS1
acl2-8.5>  FIND-EQUATIONAL-POLY-RHS
acl2-8.5>  FIND-EQUATIONAL-POLY3
acl2-8.5>  FIND-EQUATIONAL-POLY2
acl2-8.5>  FIND-EQUATIONAL-POLY1
acl2-8.5>  FIND-EQUATIONAL-POLY
acl2-8.5>  GET-COEFF-FOR-CANCEL1
acl2-8.5>  CANCEL2
acl2-8.5>  CANCEL1
acl2-8.5>  CANCEL
acl2-8.5>  CANCEL-POLY-AGAINST-ALL-POLYS
acl2-8.5>  ADD-POLY
acl2-8.5>  PRUNE-POLY-LST
acl2-8.5>  ADD-POLYS1
acl2-8.5>  ADD-POLYS0
acl2-8.5>  SHOW-POLY2
acl2-8.5>  SHOW-POLY1
acl2-8.5>  SHOW-POLY
acl2-8.5>  SHOW-POLY-LST
acl2-8.5> 
acl2-8.5> Finished loading "linear-a.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "type-set-b.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  *NUMBER-OF-NUMERIC-TYPE-SET-BITS*
acl2-8.5>  *TYPE-SET-BINARY-+-TABLE-LIST*
acl2-8.5>  *TYPE-SET-BINARY-+-TABLE*
acl2-8.5>  *TYPE-SET-BINARY-*-TABLE-LIST*
acl2-8.5>  *TYPE-SET-BINARY-*-TABLE*
acl2-8.5>  *TYPE-SET-<-TABLE-LIST*
acl2-8.5>  *TYPE-SET-<-TABLE*
acl2-8.5>  ASSOC-EQUAL-CDR
acl2-8.5>  RUNEP
acl2-8.5>  BASE-SYMBOL
acl2-8.5>  STRIP-BASE-SYMBOLS
acl2-8.5>  FNUME
acl2-8.5>  FRUNIC-MAPPING-PAIR
acl2-8.5>  FN-RUNE-NUME
acl2-8.5>  DEFINITION-RUNES
acl2-8.5>  GET-NEXT-NUME
acl2-8.5>  DEREF-MACRO-NAME-LST
acl2-8.5>  *ABBREV-RUNE-ALIST*
acl2-8.5>  TRANSLATE-ABBREV-RUNE
acl2-8.5>  RULE-NAME-DESIGNATORP
acl2-8.5>  THEORYP1
acl2-8.5>  THEORYP
acl2-8.5>  RUNIC-THEORYP1
acl2-8.5>  RUNIC-THEORYP
acl2-8.5>  FIND-MAPPING-PAIRS-TAIL1
acl2-8.5>  FIND-MAPPING-PAIRS-TAIL
acl2-8.5>  AUGMENT-RUNIC-THEORY1
acl2-8.5>  AUGMENT-RUNIC-THEORY
acl2-8.5>  *BAD-RUNIC-DESIGNATOR-STRING*
acl2-8.5>  CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1
acl2-8.5>  CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS
acl2-8.5>  DUPLICITOUS-CONS-CAR
acl2-8.5>  DUPLICITOUS-REVAPPEND-CAR
acl2-8.5>  DUPLICITOUS-MERGE-CAR
acl2-8.5>  DUPLICITOUS-SORT-CAR
acl2-8.5>  AUGMENT-THEORY
acl2-8.5>  ASSERT$-RUNIC-THEORYP
acl2-8.5>  RUNIC-THEORY
acl2-8.5>  WEAK-ENABLED-STRUCTURE-P
acl2-8.5>  ENABLED-STRUCTURE-P
acl2-8.5>  ENABLED-NUMEP
acl2-8.5>  ENABLED-ARITH-NUMEP
acl2-8.5>  ENABLED-RUNEP
acl2-8.5>  ACTIVE-RUNEP
acl2-8.5>  ACTIVE-OR-NON-RUNEP
acl2-8.5>  ENABLED-XFNP
acl2-8.5>  (SUBLIS-VAR! SUBLIS-VAR!-LST)
acl2-8.5>  THEORY-WARNING-FNS-AUX
acl2-8.5>  THEORY-WARNING-FNS
acl2-8.5>  MAYBE-WARN-ABOUT-THEORY
acl2-8.5>  WEAK-THEORY-INVARIANT-RECORD-P
acl2-8.5>  ENABLED-DISABLED-RUNEPS
acl2-8.5>  THEORY-INVARIANT-MSG-IMPLICATION
acl2-8.5>  COMBINE-ANDS
acl2-8.5>  THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST
acl2-8.5>  THEORY-INVARIANT-MSG
acl2-8.5>  WEAK-CERTIFY-BOOK-INFO-P
acl2-8.5>  WEAK-USELESS-RUNES-P
acl2-8.5>  ACTIVE-USELESS-RUNES
acl2-8.5>  USELESS-RUNES-FILENAME
acl2-8.5>  ACTIVE-USELESS-RUNES-FILENAME
acl2-8.5>  CHK-THEORY-INVARIANT1
acl2-8.5>  CHK-THEORY-INVARIANT
acl2-8.5>  WEAK-CLAUSE-ID-P
acl2-8.5>  POS-LISTP
acl2-8.5>  ALL-DIGITS-P
acl2-8.5>  D-POS-LISTP
acl2-8.5>  CLAUSE-ID-P
acl2-8.5>  *INITIAL-CLAUSE-ID*
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE
acl2-8.5>  STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE
acl2-8.5>  UPDATE-ENABLED-STRUCTURE-ARRAY
acl2-8.5>  INCREMENT-ARRAY-NAME
acl2-8.5>  UPDATE-ENABLED-STRUCTURE
acl2-8.5>  LOAD-THEORY-INTO-ENABLED-STRUCTURE-1
acl2-8.5>  LOAD-THEORY-INTO-ENABLED-STRUCTURE
acl2-8.5>  INITIAL-GLOBAL-ENABLED-STRUCTURE
acl2-8.5>  RECOMPRESS-GLOBAL-ENABLED-STRUCTURE
acl2-8.5>  RECOMPRESS-STOBJ-ACCESSOR-ARRAYS
acl2-8.5>  *FAKE-RUNE-FOR-TYPE-SET*
acl2-8.5>  PUFFERT
acl2-8.5>  IMMEDIATE-FORCEP
acl2-8.5>  NUMERIC-TYPE-SET
acl2-8.5>  RATIONAL-TYPE-SET
acl2-8.5>  TYPE-SET-BINARY-+
acl2-8.5>  TYPE-SET-BINARY-*
acl2-8.5>  TYPE-SET-NOT
acl2-8.5>  TYPE-SET-<-1
acl2-8.5>  TYPE-SET-<
acl2-8.5>  TYPE-SET-UNARY--
acl2-8.5>  TYPE-SET-UNARY-/
acl2-8.5>  TYPE-SET-NUMERATOR
acl2-8.5>  TYPE-SET-DENOMINATOR
acl2-8.5>  TYPE-SET-REALPART
acl2-8.5>  TYPE-SET-IMAGPART
acl2-8.5>  TYPE-SET-COMPLEX
acl2-8.5>  WEAK-RECOGNIZER-TUPLE-P
acl2-8.5>  *INITIAL-RECOGNIZER-ALIST*
acl2-8.5>  MOST-RECENT-ENABLED-RECOG-TUPLE1
acl2-8.5>  MOST-RECENT-ENABLED-RECOG-TUPLE
acl2-8.5>  TYPE-SET-RECOGNIZER
acl2-8.5>  TYPE-SET-CAR
acl2-8.5>  TYPE-SET-CDR
acl2-8.5>  TYPE-SET-COERCE
acl2-8.5>  TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  TYPE-SET-LENGTH
acl2-8.5>  TYPE-SET-CONS
acl2-8.5>  *SINGLETON-TYPE-SETS*
acl2-8.5>  TYPE-SET-EQUAL
acl2-8.5>  TYPE-SET-QUOTE
acl2-8.5>  TYPE-SET-CHAR-CODE
acl2-8.5>  FN-COUNT-1
acl2-8.5>  FN-COUNT
acl2-8.5>  TERM-ORDER
acl2-8.5>  WEAK-TYPE-PRESCRIPTION-P
acl2-8.5>  FIND-RUNED-TYPE-PRESCRIPTION
acl2-8.5>  MV-ATF
acl2-8.5>  ASSUME-TRUE-FALSE-ERROR
acl2-8.5>  NON-CONS-CDR
acl2-8.5>  CANONICAL-REPRESENTATIVE
acl2-8.5>  SUBST-TYPE-ALIST1-CHECK
acl2-8.5>  NIL-FN
acl2-8.5>  *NIL-FN-TS-ENTRY*
acl2-8.5>  SUBST-TYPE-ALIST1
acl2-8.5>  SUBST-TYPE-ALIST
acl2-8.5>  INFECT-TYPE-ALIST-ENTRY
acl2-8.5>  INFECT-NEW-TYPE-ALIST-ENTRIES2
acl2-8.5>  INFECT-NEW-TYPE-ALIST-ENTRIES1
acl2-8.5>  INFECT-NEW-TYPE-ALIST-ENTRIES
acl2-8.5>  EXTEND-TYPE-ALIST-SIMPLE
acl2-8.5>  EXTEND-TYPE-ALIST1
acl2-8.5>  EXTEND-TYPE-ALIST
acl2-8.5>  ZIP-VARIABLE-TYPE-ALIST
acl2-8.5>  ASSOC-EQUIV
acl2-8.5>  ASSOC-EQUIV+
acl2-8.5>  ASSOC-TYPE-ALIST
acl2-8.5>  LOOK-IN-TYPE-ALIST
acl2-8.5>  MEMBER-CHAR-STRINGP
acl2-8.5>  TERMINAL-SUBSTRINGP1
acl2-8.5>  TERMINAL-SUBSTRINGP
acl2-8.5>  EVG-OCCUR
acl2-8.5>  (OCCUR OCCUR-LST)
acl2-8.5>  (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST)
acl2-8.5>  DECREMENT-WORSE-THAN-CLK
acl2-8.5>  WITH-DECREMENT-WORSE-THAN-CLK
acl2-8.5>  WORSE-THAN-BUILTIN-CLOCKED-BODY
acl2-8.5>  (WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED
acl2-8.5>                              BASIC-WORSE-THAN-LST1
acl2-8.5>                              BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN
acl2-8.5>                              SOME-SUBTERM-WORSE-THAN-OR-EQUAL
acl2-8.5>                              SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST
acl2-8.5>                              ...)
acl2-8.5>  WORSE-THAN
acl2-8.5>  WORSE-THAN-OR-EQUAL
acl2-8.5>  WORSE-THAN-CLK
acl2-8.5>  WORSE-THAN-BUILTIN
acl2-8.5>  WORSE-THAN-OR-EQUAL-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  WEAK-ANCESTOR-P
acl2-8.5>  MAKE-ANCESTOR-BINDING-HYP
acl2-8.5>  ANCESTOR-BINDING-HYP-P
acl2-8.5>  ANCESTOR-BINDING-HYP/HYP
acl2-8.5>  ANCESTOR-BINDING-HYP/UNIFY-SUBST
acl2-8.5>  PUSH-ANCESTOR
acl2-8.5>  ANCESTOR-LISTP
acl2-8.5>  EARLIER-ANCESTOR-BIGGERP
acl2-8.5>  EQUAL-MOD-COMMUTING
acl2-8.5>  ANCESTORS-CHECK1
acl2-8.5>  ANCESTORS-CHECK-BUILTIN
acl2-8.5>  ANCESTORS-CHECK
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  MAP-MULTIPLY-CAR
acl2-8.5>  NORMALIZE-ADDEND
acl2-8.5>  INSERT-CDR-TERM-ORDER
acl2-8.5>  NORMALIZE-LINEAR-SUM-2
acl2-8.5>  NORMALIZE-LINEAR-SUM-1
acl2-8.5>  NORMALIZE-LINEAR-SUM
acl2-8.5>  NORMALIZE-LINEAR-SUM-P1
acl2-8.5>  NORMALIZE-LINEAR-SUM-P
acl2-8.5>  TYPE-SET-FINISH-1
acl2-8.5>  TYPE-SET-FINISH
acl2-8.5>  SEARCH-TYPE-ALIST-REC
acl2-8.5>  (FREE-VARSP FREE-VARSP-LST)
acl2-8.5>  SEARCH-TYPE-ALIST-WITH-REST
acl2-8.5>  SEARCH-TYPE-ALIST
acl2-8.5>  TERM-AND-TYP-TO-LOOKUP
acl2-8.5>  LOOKUP-HYP
acl2-8.5>  BIND-FREE-VARS-TO-UNBOUND-FREE-VARS
acl2-8.5>  X-XRUNEP
acl2-8.5>  HYP-XRUNE
acl2-8.5>  HYP-XRUNE-RUNE
acl2-8.5>  CONC-XRUNE
acl2-8.5>  CONC-XRUNE-RUNE
acl2-8.5>  XRUNE-RUNE
acl2-8.5>  RUNE=
acl2-8.5>  XRUNE=
acl2-8.5>  PRETTYIFY-XRUNE
acl2-8.5>  WEAK-ACCP-INFO-P
acl2-8.5>  WEAK-ACCP-ENTRY-P
acl2-8.5>  MERGE-ACCUMULATED-PERSISTENCE-AUX
acl2-8.5>  MERGE-ACCUMULATED-PERSISTENCE-REC
acl2-8.5>  MERGE-ACCUMULATED-PERSISTENCE
acl2-8.5>  ADD-ACCUMULATED-PERSISTENCE-S
acl2-8.5>  ADD-ACCUMULATED-PERSISTENCE-F
acl2-8.5>  ACCUMULATED-PERSISTENCE-MAKE-FAILURES
acl2-8.5>  ADD-ACCUMULATED-PERSISTENCE
acl2-8.5>  ACCUMULATED-PERSISTENCE
acl2-8.5>  ACCUMULATED-PERSISTENCE-OOPS
acl2-8.5>  SET-ACCUMULATED-PERSISTENCE
acl2-8.5>  MERGE-CAR->
acl2-8.5>  MERGE-SORT-CAR->
acl2-8.5>  *ACCP-MAJOR-SEPARATOR*
acl2-8.5>  *ACCP-MINOR-SEPARATOR*
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE0
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE1
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE2
acl2-8.5>  SPLIT-XRUNE-ALIST
acl2-8.5>  SORT-XRUNE-ALIST-BY-RUNE1
acl2-8.5>  SORT-XRUNE-ALIST-BY-RUNE
acl2-8.5>  POP-ACCP-FN
acl2-8.5>  POP-ACCP-FN-ITERATE
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-LIST
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE-PHRASE
acl2-8.5>  SHOW-ACCUMULATED-PERSISTENCE
acl2-8.5>  PUSH-ACCP-FN
acl2-8.5>  PUSH-ACCP
acl2-8.5>  POP-ACCP
acl2-8.5>  WITH-ACCUMULATED-PERSISTENCE
acl2-8.5>  ASSUME-TRUE-FALSE-<
acl2-8.5>  MV-ATF-2
acl2-8.5>  BINDING-HYP-P
acl2-8.5>  ADJUST-IGNORE-FOR-ATF
acl2-8.5>  BACKCHAIN-LIMIT-REACHEDP1
acl2-8.5>  BACKCHAIN-LIMIT-REACHEDP
acl2-8.5>  NEW-BACKCHAIN-LIMIT
acl2-8.5>  ONCEP-TP
acl2-8.5>  ONCEP-TP-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  STRENGTHEN-RECOG-CALL
acl2-8.5>  PUSH-LEMMA?
acl2-8.5>  STRONG-RECOGNIZER-EXPR-P
acl2-8.5>  RECOGNIZER-EXPR-P
acl2-8.5>  PUSH-LEMMA[S]
acl2-8.5>  (TYPE-SET-REC TYPE-SET-LST TYPE-SET-RELIEVE-HYPS-FREE
acl2-8.5>                TYPE-SET-RELIEVE-HYPS1
acl2-8.5>                TYPE-SET-RELIEVE-HYPS
acl2-8.5>                EXTEND-TYPE-ALIST-WITH-BINDINGS
acl2-8.5>                TYPE-SET-WITH-RULE ...)
acl2-8.5>  TYPE-SET
acl2-8.5>  TYPE-SET-BC
acl2-8.5>  ASSUME-TRUE-FALSE-AGGRESSIVE-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  TOP-LEVEL-IF-REDUCE-REC
acl2-8.5>  TOP-LEVEL-IF-REDUCE
acl2-8.5>  TOP-LEVEL-IF-P
acl2-8.5>  TYPE-ALIST-REDUCIBLE-ENTRIES
acl2-8.5>  ASSUME-TRUE-FALSE-AGGRESSIVE-1
acl2-8.5>  ASSUME-TRUE-FALSE-AGGRESSIVE
acl2-8.5>  ASSUME-TRUE-FALSE
acl2-8.5>  ASSUME-TRUE-FALSE-BC
acl2-8.5>  OK-TO-FORCE-ENS
acl2-8.5>  ADD-LINEAR-ASSUMPTION
acl2-8.5>  RETURN-TYPE-ALIST
acl2-8.5>  TYPE-ALIST-EQUALITY-LOOP1
acl2-8.5>  CLEAN-UP-ALIST
acl2-8.5>  DUPLICATE-KEYSP
acl2-8.5>  CLEAN-TYPE-ALIST
acl2-8.5>  TYPE-ALIST-EQUALITY-LOOP-EXIT
acl2-8.5>  *TYPE-ALIST-EQUALITY-LOOP-MAX-DEPTH*
acl2-8.5>  TYPE-ALIST-EQUALITY-LOOP
acl2-8.5>  PUT-ASSOC-EQUAL-TS
acl2-8.5>  RECONSIDER-TYPE-ALIST
acl2-8.5>  TYPE-ALIST-CLAUSE-FINISH1
acl2-8.5>  TYPE-ALIST-CLAUSE-FINISH
acl2-8.5>  TYPE-ALIST-CLAUSE
acl2-8.5>  KNOWN-WHETHER-NIL
acl2-8.5>  TS-BOOLEANP
acl2-8.5>  WEAK-CONS-OCCUR
acl2-8.5>  EQUAL-X-CONS-X-YP
acl2-8.5>  NOT-IDENT
acl2-8.5>  FIRST-IF
acl2-8.5>  ALL-VARIABLEP
acl2-8.5>  NORMALIZE-WITH-TYPE-SET
acl2-8.5>  (NORMALIZE NORMALIZE-LST
acl2-8.5>             NORMALIZE-OR-DISTRIBUTE-FIRST-IF
acl2-8.5>             DISTRIBUTE-FIRST-IF)
acl2-8.5>  DECODE-TYPE-SET1
acl2-8.5>  DECODE-TYPE-SET
acl2-8.5>  DTS
acl2-8.5>  ENS
acl2-8.5> 
acl2-8.5> Finished loading "type-set-b.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "linear-b.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  POLYS-FROM-TYPE-SET
acl2-8.5>  ADD-TYPE-SET-POLYS
acl2-8.5>  ADD-POLYNOMIAL-INEQUALITIES
acl2-8.5>  ADD-POLYS
acl2-8.5>  (EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST)
acl2-8.5>  EVAL-GROUND-SUBEXPRESSIONS
acl2-8.5>  EVAL-GROUND-SUBEXPRESSIONS-LST
acl2-8.5>  POLY-SET
acl2-8.5>  LINEARIZE1
acl2-8.5>  LINEARIZE
acl2-8.5>  LINEARIZE-LST1
acl2-8.5>  LINEARIZE-LST
acl2-8.5> 
acl2-8.5> Finished loading "linear-b.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "non-linear.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  CLEANSE-TYPE-ALIST
acl2-8.5>  VAR-WITH-DIVISIONP
acl2-8.5>  VARIFY
acl2-8.5>  VARIFY!
acl2-8.5>  VARIFY!-LST1
acl2-8.5>  VARIFY!-LST
acl2-8.5>  INVERT-VAR
acl2-8.5>  PART-OF1
acl2-8.5>  PART-OF
acl2-8.5>  PRODUCT-ALREADY-TRIEDP
acl2-8.5>  TOO-MANY-POLYSP
acl2-8.5>  EXPANDED-NEW-VARS-IN-POT-LST2
acl2-8.5>  EXPANDED-NEW-VARS-IN-POT-LST1
acl2-8.5>  EXPANDED-NEW-VARS-IN-POT-LST
acl2-8.5>  EXTRACT-BOUNDS
acl2-8.5>  GOOD-BOUNDS-IN-POT
acl2-8.5>  INVERSE-POLYS
acl2-8.5>  ADD-INVERSE-POLYS
acl2-8.5>  ADD-POLYS-FROM-TYPE-SET
acl2-8.5>  LENGTH-OF-SHORTEST-POLYS-WITH-VAR
acl2-8.5>  SHORTEST-POLYS-WITH-VAR1
acl2-8.5>  SHORTEST-POLYS-WITH-VAR
acl2-8.5>  BINARY-*-LEAVES
acl2-8.5>  BINARY-*-TREE
acl2-8.5>  MERGE-ARITH-TERM-ORDER
acl2-8.5>  INSERT-ARITH-TERM-ORDER
acl2-8.5>  SORT-ARITH-TERM-ORDER
acl2-8.5>  MULTIPLY-ALIST-AND-CONST
acl2-8.5>  COLLECT-RATIONAL-POLY-P-LST
acl2-8.5> 
acl2-8.5> Finished loading "non-linear.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "tau.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  ALMOST-LEXORDER-SINGLETONS
acl2-8.5>  MEMBER-NIL-NEG-EVGS
acl2-8.5>  MEMBER-NEG-EVGS1
acl2-8.5>  MEMBER-NEG-EVGS
acl2-8.5>  INSERT-NEG-EVGS1
acl2-8.5>  INSERT-NEG-EVGS
acl2-8.5>  MERGE-CAR-<
acl2-8.5>  MERGE-SORT-CAR-<
acl2-8.5>  MERGE-CADR-<
acl2-8.5>  MERGE-SORT-CADR-<
acl2-8.5>  STRIP-CADDRS
acl2-8.5>  UNPRETTYIFY/ADD-HYPS-TO-PAIRS
acl2-8.5>  UNPRETTYIFY
acl2-8.5>  REPRETTYIFY
acl2-8.5>  CONVERT-RETURNED-VARS-TO-TERM-LST
acl2-8.5>  IMPLICATE
acl2-8.5>  WEAK-TYPE-SET-INVERTER-RULE-P
acl2-8.5>  *INITIAL-TYPE-SET-INVERTER-RULES*
acl2-8.5>  CONVERT-TYPE-SET-TO-TERM-LST
acl2-8.5>  CONVERT-TYPE-SET-TO-TERM1
acl2-8.5>  CONVERT-TYPE-SET-TO-TERM
acl2-8.5>  CONVERT-TYPE-PRESCRIPTION-TO-TERM
acl2-8.5>  ALL-RUNES-IN-VAR-TO-RUNES-ALIST
acl2-8.5>  ALL-RUNES-IN-VAR-TO-RUNES-ALIST-LST
acl2-8.5>  UNION-EQUAL-REMOVING-DUPLICATES
acl2-8.5>  WEAK-SUMMARY-DATA-P
acl2-8.5>  MAKE-SUMMARY-DATA
acl2-8.5>  (ALL-RUNES-IN-ELIM-SEQUENCE-LST ALL-RUNES-IN-ELIM-SEQUENCE
acl2-8.5>                                  ALL-RUNES-IN-TTREE-FC-DERIVATION-LST
acl2-8.5>                                  ALL-RUNES-IN-TTREE-FIND-EQUATIONAL-POLY-LST
acl2-8.5>                                  ALL-RUNES-SUMMARY-DATA-LST
acl2-8.5>                                  ALL-RUNES-IN-TTREE
acl2-8.5>                                  ALL-RUNES-IN-TTREE-LST)
acl2-8.5>  WEAK-TAU-INTERVAL-P
acl2-8.5>  *TAU-EMPTY-INTERVAL*
acl2-8.5>  TAU-EMPTY-INTERVALP
acl2-8.5>  <?-NUMBER-V-RATIONAL
acl2-8.5>  <?-RATIONAL-V-NUMBER
acl2-8.5>  EVAL-TAU-INTERVAL1
acl2-8.5>  EVAL-TAU-INTERVAL
acl2-8.5>  DECODE-TAU-INTERVAL
acl2-8.5>  WEAK-TAU-P
acl2-8.5>  *TAU-EMPTY*
acl2-8.5>  *NIL-SINGLETON-EVG-LIST*
acl2-8.5>  *TAU-T*
acl2-8.5>  *TAU-NIL*
acl2-8.5>  *TAU-NON-NIL*
acl2-8.5>  *TAU-CONTRADICTION*
acl2-8.5>  *CONTRADICTORY-TAU*
acl2-8.5>  WEAK-SIGNATURE-RULE-P
acl2-8.5>  WEAK-BIG-SWITCH-RULE-P
acl2-8.5>  TAU-SIMPLE-IMPLICANTS
acl2-8.5>  TAU-PAIR-MEMBER1
acl2-8.5>  TAU-PAIR-MEMBER
acl2-8.5>  EV-FNCALL-W-TAU-RECOG
acl2-8.5>  BAD-VAL-OR-UNKNOWNS
acl2-8.5>  EXISTS-BAD-VALP
acl2-8.5>  ALL-EVAL-VALP
acl2-8.5>  DELETE-BAD-VALS
acl2-8.5>  DELETE-BAD-VALS1
acl2-8.5>  TAU-PAIRS-SUBSETP
acl2-8.5>  TAU-PAIRS-NEAR-SUBSETP
acl2-8.5>  TAU-PAIRS-INTERSECTIONP
acl2-8.5>  INSERT-TAU-PAIR
acl2-8.5>  INTERVAL-DECIDER
acl2-8.5>  SIGNATE
acl2-8.5>  REDUCE-SIGN/RECOG
acl2-8.5>  EVERY-NEG-EVG-IN-TAU-P1
acl2-8.5>  EVERY-NEG-EVG-IN-TAU-P
acl2-8.5>  LOWER-BOUND-<=
acl2-8.5>  UPPER-BOUND->=
acl2-8.5>  LOWER-BOUND->
acl2-8.5>  UPPER-BOUND-<
acl2-8.5>  TAU-SUBINTERVALP
acl2-8.5>  TAU-IMPLIES
acl2-8.5>  EMPTY-TAU-INTERVALP
acl2-8.5>  SINGLETON-TAU-INTERVALP
acl2-8.5>  MAKE-IDENTITY-INTERVAL
acl2-8.5>  IDENTITY-INTERVALP
acl2-8.5>  DELETE-CONSECUTIVE-INTEGERS-UPWARD
acl2-8.5>  DELETE-CONSECUTIVE-INTEGERS-DOWNWARD
acl2-8.5>  COLLECT-<?-X-K
acl2-8.5>  COLLECT-<?-K-X
acl2-8.5>  ADJUST-UPPER-BOUND-WITH-NEG-EVGS
acl2-8.5>  ADJUST-LOWER-BOUND-WITH-NEG-EVGS
acl2-8.5>  SQUEEZE-K
acl2-8.5>  SET-TAU-POS-EVG
acl2-8.5>  POSITIVE-LOWER-BOUNDP
acl2-8.5>  NONNEGATIVE-LOWER-BOUNDP
acl2-8.5>  NEGATIVE-UPPER-BOUNDP
acl2-8.5>  TIGHTEN-BOUND
acl2-8.5>  ADD-TO-TAU1
acl2-8.5>  ADD-RECOGS-TO-TAU1
acl2-8.5>  TAU-INTERVAL-ENDPOINT-TO-SIGN-K-TOKEN
acl2-8.5>  TAU-UNION
acl2-8.5>  ALL-INTEGERS-IN-RANGE-EXCLUDEDP1
acl2-8.5>  ALL-INTEGERS-IN-RANGE-EXCLUDEDP
acl2-8.5>  ADD-TO-TAU
acl2-8.5>  POS-EVG-NEAR-SUBSETP
acl2-8.5>  NEG-EVGS-NEAR-SUBSETP
acl2-8.5>  TAU-INTERVAL-ENDPOINT-IMPLICATION
acl2-8.5>  TAU-INTERVAL-NEAR-SUBSETP
acl2-8.5>  TAU-NEAR-SUBSETP
acl2-8.5>  TAU-PUT
acl2-8.5>  (TAU-PUT* TAU-PUT*-TAU TAU-PUT*-INTERVAL-ENDPOINTS
acl2-8.5>            TAU-PUT*-RECOGS)
acl2-8.5>  *NON-TAU-MONADIC-BOOLEAN-FUNCTIONS*
acl2-8.5>  MONADIC-BOOLEAN-FNP
acl2-8.5>  PUTPROP-IF-DIFFERENT
acl2-8.5>  TAU-VISIT-FUNCTION-INTRODUCTION
acl2-8.5>  TAU-VISIT-FUNCTION-INTRODUCTIONS
acl2-8.5>  PUTPROP-TAU-PAIR
acl2-8.5>  INITIALIZE-TAU-PRED
acl2-8.5>  INITIALIZE-TAU-PREDS
acl2-8.5>  TAU-BOOLEAN-FORMP
acl2-8.5>  TAU-EVAL-FORMP
acl2-8.5>  RUNE-<
acl2-8.5>  MERGE-RUNES-STRICT
acl2-8.5>  MERGE-SORT-RUNES-STRICT
acl2-8.5>  GET-TAU-RUNES
acl2-8.5>  SET-TAU-RUNES
acl2-8.5>  ADD-TAU-BOOLEAN-RULE
acl2-8.5>  ADD-TAU-EVAL-RULE
acl2-8.5>  TAU-LIKE-SUBJECT-CRITERION
acl2-8.5>  TAU-LIKE-TERM
acl2-8.5>  TAU-LIKE-TERM-LISTP
acl2-8.5>  TAU-CONJUNCTIVE-FORMP
acl2-8.5>  TAU-SIMPLE-FORMP
acl2-8.5>  ADD-TAU-SIMPLE-RULE
acl2-8.5>  CONVERT-TAU-LIKE-TERMS-TO-TAU
acl2-8.5>  ADD-TAU-CONJUNCTIVE-RULE
acl2-8.5>  PARTITION-SIGNATURE-HYPS-INTO-TAU-ALIST-AND-OTHERS
acl2-8.5>  TAU-BOOLEAN-SIGNATURE-FORMP
acl2-8.5>  TAU-SIGNATURE-FORMP
acl2-8.5>  REPLACE-VARS-BY-BINDINGS
acl2-8.5>  ADD-TAU-SIGNATURE-RULE
acl2-8.5>  SWITCH-VARP
acl2-8.5>  TAU-BIG-SWITCH-EQUATIONP
acl2-8.5>  TAU-BIG-SWITCH-VAR
acl2-8.5>  TAU-BIG-SWITCH-FORMP
acl2-8.5>  ADD-TAU-BIG-SWITCH-RULE
acl2-8.5>  TAU-MV-NTH-SYNONYM-FORMP
acl2-8.5>  ADD-TAU-MV-NTH-SYNONYM-RULE
acl2-8.5>  WEAK-BOUNDER-CORRECTNESS-P
acl2-8.5>  ALL-CARS-NIL
acl2-8.5>  FIND-SUBJECT-BOUNDER-LINK-TERM
acl2-8.5>  TAU-BOUNDER-DOMS-EXTRACTION
acl2-8.5>  TAU-BOUNDER-HYP-EXTRACTION
acl2-8.5>  *ALL-INTERVAL-DOMAINS*
acl2-8.5>  ACCEPTABLE-DOMAINS-FOR-BOUNDER
acl2-8.5>  BOUNDER-ARGS
acl2-8.5>  TAU-BOUNDER-FORMP
acl2-8.5>  PAIRWISE-SUBSETP-EQ
acl2-8.5>  BOUNDER-SUBSUMEDP
acl2-8.5>  BOUNDER-SUBSUMEDP-BY-SOME
acl2-8.5>  DELETE-SOME-SUBSUMED-BOUNDERS
acl2-8.5>  ADD-BOUNDER-TO-BOUNDERS
acl2-8.5>  ADD-TAU-BOUNDER-RULE
acl2-8.5>  STRIP-FORCE-AND-CASE-SPLIT
acl2-8.5>  STRIP-FORCE-AND-CASE-SPLIT-IN-HYPS-OF-PAIRS
acl2-8.5>  ACCEPTABLE-TAU-RULEP
acl2-8.5>  ACCEPTABLE-TAU-RULESP
acl2-8.5>  ACCEPTABLE-TAU-RULES
acl2-8.5>  CROSS-PROD1
acl2-8.5>  CROSS-PROD2
acl2-8.5>  CROSS-PROD
acl2-8.5>  CNF-DNF
acl2-8.5>  SPLIT-ON-CONJOINED-DISJUNCTIONS
acl2-8.5>  SPLIT-ON-CONJOINED-DISJUNCTIONS-IN-HYPS-OF-PAIRS
acl2-8.5>  CHK-ACCEPTABLE-TAU-RULE
acl2-8.5>  ADD-TAU-RULE1
acl2-8.5>  ADD-TAU-RULE
acl2-8.5>  DISCOVER-TAU-PRED
acl2-8.5>  DISCOVER-TAU-PREDS
acl2-8.5>  TAU-RULES-FROM-TYPE-PRESCRIPTIONS
acl2-8.5>  ORIGINAL-DEF-BODY1
acl2-8.5>  ORIGINAL-DEF-BODY
acl2-8.5>  TAU-LIKE-PROPOSITIONP
acl2-8.5>  EXPAND-TAU-LIKE-PROPOSITION
acl2-8.5>  ADD-ONLY-SIMPLE-AND-CONJUNCTIVE-TAU-RULES
acl2-8.5>  CONVERT-NORMALIZED-TERM-TO-PAIRS
acl2-8.5>  COMPLEMENTARYP
acl2-8.5>  SUBSUMES-BUT-FOR-ONE-NEGATION
acl2-8.5>  REMOVE-ANCESTOR-LITERALS-FROM-PAIRS1
acl2-8.5>  REMOVE-ANCESTOR-LITERALS-FROM-PAIRS
acl2-8.5>  CONVERT-TERM-TO-PAIRS
acl2-8.5>  TAU-SUBRS
acl2-8.5>  TAU-VISIT-DEFUNS1
acl2-8.5>  TAU-VISIT-DEFUNS
acl2-8.5>  TAU-VISIT-DEFUN
acl2-8.5>  COROLLARIES-AND-RUNES-OF-ENABLED-RULES
acl2-8.5>  TAU-VISIT-DEFTHM1
acl2-8.5>  TAU-VISIT-DEFTHM
acl2-8.5>  TAU-VISIT-EVENT
acl2-8.5>  APPLY-CONJUNCTIVE-TAU-RULE
acl2-8.5>  APPLY-CONJUNCTIVE-TAU-RULES2
acl2-8.5>  APPLY-CONJUNCTIVE-TAU-RULES1
acl2-8.5>  APPLY-CONJUNCTIVE-TAU-RULES
acl2-8.5>  ADD-TO-TAU!
acl2-8.5>  ALL-TAU-EMPTYP
acl2-8.5>  ALL-UNRESTRICTED-SIGNATURE-RULESP
acl2-8.5>  DISJOIN-INTERVALS
acl2-8.5>  CONJOIN-INTERVALS
acl2-8.5>  COMBINE-POS/NEG-PAIRS-FROM-TAU1
acl2-8.5>  AUGMENT-POS/NEG-PAIRS-WITH-IMPLICIT-NUMERIC-RECOGS
acl2-8.5>  COMBINE-POS/NEG-PAIRS-FROM-TAU
acl2-8.5>  COMBINE-TAU
acl2-8.5>  PUSH-MV-NTH-DOWN
acl2-8.5>  TAU-EXPAND-BIG-SWITCH
acl2-8.5>  DECONSTRUCT-CONJUNCTION
acl2-8.5>  OK-TO-FIRE-SIGNATURE-RULEP1
acl2-8.5>  SMART-MEMBER-EQUAL-+-
acl2-8.5>  RECURSIVEP
acl2-8.5>  FIND-FIRST-ACCEPTABLE-DOMAIN
acl2-8.5>  TAU-LST-WITH-ACCEPTABLE-DOMAINSP
acl2-8.5>  COLLECT-BOUNDER-ARGS
acl2-8.5>  BOUNDING-INTERVAL
acl2-8.5>  CONJOIN-BOUNDING-INTERVALS
acl2-8.5>  APPLY-TAU-BOUNDERS
acl2-8.5>  TAU-INTERVAL-EQUAL-DECIDER
acl2-8.5>  TAU-INTERVAL-<-DECIDER
acl2-8.5>  (TAU-TERM TAU-TERM-LST
acl2-8.5>            TAU-REWRITE RELIEVE-DEPENDENT-HYPS
acl2-8.5>            OK-TO-FIRE-SIGNATURE-RULEP
acl2-8.5>            APPLY-SIGNATURE-TAU-RULE
acl2-8.5>            APPLY-SIGNATURE-TAU-RULES1 ...)
acl2-8.5>  ANNOTATE-CLAUSE-WITH-KEY-NUMBERS
acl2-8.5>  TAU-CLAUSE1P
acl2-8.5>  TAU-GET-ALL-PREDS
acl2-8.5>  TAU-GET-STATS-NEW-MAX-BLOCK
acl2-8.5>  TAU-SIZE
acl2-8.5>  TAU-GET-STATS-ON-IMPLICANT-SIZES
acl2-8.5>  DECODE-RECOG
acl2-8.5>  DECODE-RECOG-LST
acl2-8.5>  DECODE-TAU1
acl2-8.5>  DECODE-TAU
acl2-8.5>  DECODE-TAU-CONJUNCTIVE-RULE
acl2-8.5>  DECODE-TAU-CONJUNCTIVE-RULES
acl2-8.5>  DECODE-TAU-LST
acl2-8.5>  DECODE-TAU-ALIST
acl2-8.5>  DECODE-TAU-SIGNATURE-RULE
acl2-8.5>  DECODE-TAU-SIGNATURE-RULES1
acl2-8.5>  DECODE-TAU-SIGNATURE-RULES2
acl2-8.5>  DECODE-TAU-SIGNATURE-RULES
acl2-8.5>  TAU-GET-ALL-SIG-FNS
acl2-8.5>  SOME-SLOT-HAS-MULTIPLE-TAU-SIGS
acl2-8.5>  COUNT-TAU-SIGS-BY-SLOT
acl2-8.5>  COLLECT-RULES-WITH-DEPENDENT-HYPS
acl2-8.5>  COLLECT-RULES-WITH-DEPENDENT-HYPS-ACROSS-MV
acl2-8.5>  TAU-GET-STATS-ON-SIGNATURES1
acl2-8.5>  TAU-GET-STATS-ON-SIGNATURES
acl2-8.5>  COLLECT-TAU-BIG-SWITCHES
acl2-8.5>  TAU-SUM-LST
acl2-8.5>  TAU-GET-STATS
acl2-8.5>  TAU-STATUS
acl2-8.5>  TAU-DATA-FN
acl2-8.5>  TAU-DATA
acl2-8.5>  ALL-FNNAMES-WORLD1
acl2-8.5>  ALL-FNNAMES-WORLD
acl2-8.5>  TAU-DATA-FNS
acl2-8.5>  TAU-DATABASE
acl2-8.5>  INITIALIZE-TAU-GLOBALS
acl2-8.5>  COLLECT-TAU-RELEVANT-TRIPLES
acl2-8.5> 
acl2-8.5> Finished loading "tau.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "rewrite.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  WARRANTED-FNS-OF-WORLD1
acl2-8.5>  WARRANTED-FNS-OF-WORLD
acl2-8.5>  EV-FNCALL+-FNS
acl2-8.5>  EV-FNCALL+-W
acl2-8.5>  EV-FNCALL+
acl2-8.5>  WEAK-CONGRUENCE-RULE-P
acl2-8.5>  *GENEQV-IFF*
acl2-8.5>  REFINEMENTP
acl2-8.5>  GENEQV-REFINEMENTP1
acl2-8.5>  GENEQV-REFINEMENTP
acl2-8.5>  SOME-CONGRUENCE-RULE-DISABLEDP
acl2-8.5>  FILTER-GENEQV1
acl2-8.5>  FILTER-GENEQV
acl2-8.5>  SOME-GENEQV-DISABLEDP
acl2-8.5>  FILTER-GENEQV-LST1
acl2-8.5>  FILTER-GENEQV-LST
acl2-8.5>  REFINEMENTP1
acl2-8.5>  PAIR-CONGRUENCE-RULES-WITH-COARSENINGS
acl2-8.5>  ADD-TO-CR-AND-COARSENINGS
acl2-8.5>  UNION-GENEQV1
acl2-8.5>  UNION-GENEQV
acl2-8.5>  PAIRWISE-UNION-GENEQV
acl2-8.5>  GENEQV-LST1
acl2-8.5>  GENEQV-LST
acl2-8.5>  (SUBST-EXPR1 SUBST-EXPR1-LST)
acl2-8.5>  SUBST-EXPR-ERROR
acl2-8.5>  SUBST-EXPR
acl2-8.5>  COMMENT-FN
acl2-8.5>  COMMENT
acl2-8.5>  HIDE-WITH-COMMENT-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  HIDE-WITH-COMMENT
acl2-8.5>  SCONS-TERM
acl2-8.5>  (SUBST-EQUIV-EXPR1 SUBST-EQUIV-EXPR1-LST)
acl2-8.5>  SUBST-EQUIV-EXPR
acl2-8.5>  *ANONYMOUS-VAR*
acl2-8.5>  (EQUAL-MOD-ALIST EQUAL-MOD-ALIST-LST)
acl2-8.5>  (EQUAL-MOD-ALIST2 EQUAL-MOD-ALIST2-LST)
acl2-8.5>  (ONE-WAY-UNIFY1-TERM-ALIST ONE-WAY-UNIFY1-TERM-ALIST-LST)
acl2-8.5>  WEAK-PEQUIV-P
acl2-8.5>  WEAK-PEQUIV-PATTERN-P
acl2-8.5>  WEAK-PEQUIV-INFO-P
acl2-8.5>  WEAK-PEQUIVS-PROPERTY-P
acl2-8.5>  *EMPTY-PEQUIVS-PROPERTY*
acl2-8.5>  PEQUIVS-PROPERTY-FIELD
acl2-8.5>  NEXT-PEQUIV
acl2-8.5>  NEXT-PEQUIVS
acl2-8.5>  NEXT-PEQUIVS-ALIST
acl2-8.5>  EXTEND-PEQUIV-LST
acl2-8.5>  ACCUMULATE-SHALLOW-PEQUIV-ALIST
acl2-8.5>  PEQUIVS-FOR-REWRITE-ARGS
acl2-8.5>  PEQUIV-INFO-FOR-REWRITE
acl2-8.5>  REDUCE-GENEQV-FOR-EQUIV
acl2-8.5>  GENEQV-FOR-REWRITE
acl2-8.5>  GENEQV-AND-PEQUIV-INFO-FOR-REWRITE
acl2-8.5>  (FFNNAMESP FFNNAMESP-LST)
acl2-8.5>  (COLLECT-FFNNAMES COLLECT-FFNNAMES-LST)
acl2-8.5>  COMM-EQUAL
acl2-8.5>  MEMBER-TERM2
acl2-8.5>  MEMBER-COMPLEMENT-TERM2
acl2-8.5>  MEMBER-COMPLEMENT-TERM1
acl2-8.5>  (MEMBER-TERM MEMBER-COMPLEMENT-TERM)
acl2-8.5>  INSTR-LISTP
acl2-8.5>  SPLICED-INSTR-LISTP
acl2-8.5>  NEXT-TAG
acl2-8.5>  IF-COMPILE-FORMAL
acl2-8.5>  (FFNNAMEP-HIDE FFNNAMEP-HIDE-LST)
acl2-8.5>  (IF-COMPILE IF-COMPILE-LST)
acl2-8.5>  IF-INTERP-ASSUME-TRUE
acl2-8.5>  IF-INTERP-SWITCH
acl2-8.5>  IF-INTERP-ASSUMED-VALUE0
acl2-8.5>  IF-INTERP-ASSUMED-VALUE1
acl2-8.5>  IF-INTERP-ASSUMED-VALUE2-EQUAL-CONSTANT
acl2-8.5>  IF-INTERP-ASSUMED-VALUE2
acl2-8.5>  IF-INTERP-ASSUMED-VALUE3
acl2-8.5>  IF-INTERP-ASSUMED-VALUE4
acl2-8.5>  IF-INTERP-ASSUMED-VALUE-X
acl2-8.5>  IF-INTERP-ASSUMED-VALUE
acl2-8.5>  CONVERT-ASSUMPTIONS-TO-CLAUSE-SEGMENT
acl2-8.5>  CONVERT-CLAUSE-TO-ASSUMPTIONS
acl2-8.5>  SIMPLIFIABLE-MV-NTH1
acl2-8.5>  SIMPLIFIABLE-MV-NTH-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  SIMPLIFIABLE-MV-NTH
acl2-8.5>  CALL-STACK
acl2-8.5>  RET-STACK
acl2-8.5>  EXTRA-INFO-LIT-P
acl2-8.5>  SUBSETP-EQUAL-MOD-EXTRA-INFO-LITS
acl2-8.5>  QUICK-AND-DIRTY-SUBSUMPTION-REPLACEMENT-STEP1
acl2-8.5>  QUICK-AND-DIRTY-SUBSUMPTION-REPLACEMENT-STEP
acl2-8.5>  QUICK-AND-DIRTY-SRS
acl2-8.5>  QUICK-AND-DIRTY-SRS-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  IF-INTERP-ADD-CLAUSE
acl2-8.5>  IF-INTERP
acl2-8.5>  SPLICE-INSTRS1
acl2-8.5>  SPLICE-INSTRS
acl2-8.5>  STRIP-BRANCHES
acl2-8.5>  MERGE-LENGTH
acl2-8.5>  MERGE-SORT-LENGTH
acl2-8.5>  MEMBER-EQUAL-+-
acl2-8.5>  ARG1-ALMOST-SUBSUMES-ARG2
acl2-8.5>  FIND-SUBSUMER-REPLACEMENT-REC
acl2-8.5>  FIND-SUBSUMER-REPLACEMENT
acl2-8.5>  REMOVE-ONE-COMPLEMENT
acl2-8.5>  WEAK-DISC-TREE
acl2-8.5>  SWEEP-CLAUSES1
acl2-8.5>  SWEEP-CLAUSES
acl2-8.5>  FILTER-WITH-AND-WITHOUT
acl2-8.5>  DISC-TREE
acl2-8.5>  FIND-CLAUSES1
acl2-8.5>  FIND-CLAUSES
acl2-8.5>  REMOVE-ONE-+-
acl2-8.5>  STORE-CLAUSE1
acl2-8.5>  STORE-CLAUSE
acl2-8.5>  SUBSTITUTE1-AC
acl2-8.5>  SUBSTITUTE1
acl2-8.5>  REPLACE-CLAUSE1
acl2-8.5>  REPLACE-CLAUSE
acl2-8.5>  EXTRA-INFO-LITS
acl2-8.5>  MERGE-EXTRA-INFO-LITS
acl2-8.5>  SUBSUMPTION-REPLACEMENT-LOOP
acl2-8.5>  CLAUSIFY
acl2-8.5>  FIND-REWRITING-EQUIVALENCE
acl2-8.5>  OBJ-TABLE
acl2-8.5>  REWRITE-SOLIDIFY-REC
acl2-8.5>  *REWRITE-EQUIV-SOLIDIFY-ITERATION-BOUND*
acl2-8.5>  REWRITE-SOLIDIFY
acl2-8.5>  REWRITE-IF11
acl2-8.5>  REWRITE-IF-AVOID-SWAP
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  REWRITE-IF1
acl2-8.5>  MEMBER-EQUAL-MOD-ALIST
acl2-8.5>  NOT-TO-BE-REWRITTENP1
acl2-8.5>  NOT-TO-BE-REWRITTENP
acl2-8.5>  REWRITE-RECOGNIZER
acl2-8.5>  REMOVE-INVISIBLE-FNCALLS
acl2-8.5>  TERM-ORDER+
acl2-8.5>  INVISIBLE-FNS
acl2-8.5>  LOOP-STOPPERP-REC
acl2-8.5>  LOOP-STOPPERP
acl2-8.5>  WEAK-REWRITE-RULE-P
acl2-8.5>  RELEVANT-GROUND-LEMMAS
acl2-8.5>  SEARCH-GROUND-UNITS1
acl2-8.5>  SEARCH-GROUND-UNITS
acl2-8.5>  IF-TAUTOLOGYP
acl2-8.5>  (EXPAND-SOME-NON-REC-FNS EXPAND-SOME-NON-REC-FNS-LST)
acl2-8.5>  TAUTOLOGYP
acl2-8.5>  BEING-OPENEDP-REC
acl2-8.5>  BEING-OPENEDP-LIMITED-FOR-NONREC
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  BEING-OPENEDP
acl2-8.5>  RECURSIVE-FN-ON-FNSTACKP
acl2-8.5>  FNSTACK-TERM-MEMBER
acl2-8.5>  (VAR-COUNTS1 VAR-COUNTS1-LST)
acl2-8.5>  VAR-COUNTS
acl2-8.5>  (COUNT-IFS COUNT-IFS-LST)
acl2-8.5>  TOO-MANY-IFS0
acl2-8.5>  TOO-MANY-IFS-PRE-REWRITE
acl2-8.5>  TOO-MANY-IFS-PRE-REWRITE-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  (OCCUR-CNT-BOUNDED OCCUR-CNT-BOUNDED-LST)
acl2-8.5>  TOO-MANY-IFS1
acl2-8.5>  TOO-MANY-IFS-POST-REWRITE
acl2-8.5>  TOO-MANY-IFS-POST-REWRITE-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  ALL-ARGS-OCCUR-IN-TOP-CLAUSEP
acl2-8.5>  CONS-COUNT-BOUNDED-AC
acl2-8.5>  CONS-COUNT-BOUNDED
acl2-8.5>  (MAX-FORM-COUNT MAX-FORM-COUNT-LST)
acl2-8.5>  CONTROLLER-COMPLEXITY1
acl2-8.5>  CONTROLLER-COMPLEXITY
acl2-8.5>  CONTROLLER-POCKET-SIMPLERP
acl2-8.5>  CONSTANT-CONTROLLER-POCKETP1
acl2-8.5>  CONSTANT-CONTROLLER-POCKETP
acl2-8.5>  SOME-CONTROLLER-POCKET-CONSTANT-AND-NON-CONTROLLER-SIMPLERP
acl2-8.5>  (REWRITE-FNCALLP REWRITE-FNCALLP-LISTP)
acl2-8.5>  (CONTAINS-REWRITABLE-CALLP CONTAINS-REWRITABLE-CALLP-LST)
acl2-8.5>  WEAK-LINEAR-LEMMA-P
acl2-8.5>  WEAK-CURRENT-LITERAL-P
acl2-8.5>  WEAK-REWRITE-CONSTANT-P
acl2-8.5>  *DEFAULT-RW-CACHE-STATE*
acl2-8.5>  *EMPTY-REWRITE-CONSTANT*
acl2-8.5>  WEAK-METAFUNCTION-CONTEXT-P
acl2-8.5>  OK-TO-FORCE
acl2-8.5>  PLIST-TO-ALIST
acl2-8.5>  ADJUST-RDEPTH
acl2-8.5>  ADD-REWRITE-ARGS
acl2-8.5>  WEAK-STEP-LIMIT-RECORD-P
acl2-8.5>  STEP-LIMIT-START
acl2-8.5>  STEP-LIMIT-STRICTP
acl2-8.5>  INITIAL-STEP-LIMIT
acl2-8.5>  STEP-LIMIT-ERROR1
acl2-8.5>  STEP-LIMIT-ERROR
acl2-8.5>  DECREMENT-STEP-LIMIT
acl2-8.5>  REWRITE-ENTRY
acl2-8.5>  *FAKE-RUNE-FOR-LINEAR*
acl2-8.5>  WEAK-GFRAME-P
acl2-8.5>  PUSH-GFRAME
acl2-8.5>  INITIAL-GSTACK
acl2-8.5>  TILDE-@-BKPTR-PHRASE
acl2-8.5>  GET-RULE-FIELD
acl2-8.5>  CW-GFRAME
acl2-8.5>  CW-GSTACK1
acl2-8.5>  CW-GSTACK-FN
acl2-8.5>  CW-GSTACK
acl2-8.5>  RESTORE-BRR-GLOBALS1
acl2-8.5>  RESTORE-BRR-GLOBALS
acl2-8.5>  SAVE-BRR-GLOBALS
acl2-8.5>  GET-BRR-GLOBAL
acl2-8.5>  EXIT-BRR-WORMHOLE
acl2-8.5>  BRR-WORMHOLE
acl2-8.5>  INITIALIZE-BRR-STACK
acl2-8.5>  LOOKUP-BRR-STACK
acl2-8.5>  CLEAN-BRR-STACK1
acl2-8.5>  *CRYPTIC-BRR-MESSAGE*
acl2-8.5>  CLEAN-BRR-STACK
acl2-8.5>  GET-BRR-LOCAL
acl2-8.5>  PUT-BRR-LOCAL1
acl2-8.5>  PUT-BRR-LOCAL
acl2-8.5>  PUT-BRR-LOCAL-LST
acl2-8.5>  SOME-CDR-EQUALP
acl2-8.5>  PUSH-BRR-STACK-FRAME
acl2-8.5>  POP-BRR-STACK-FRAME
acl2-8.5>  DECODE-TYPE-ALIST
acl2-8.5>  TRANSLATE-BREAK-CONDITION
acl2-8.5>  EVAL-BREAK-CONDITION
acl2-8.5>  *DEFAULT-FREE-VARS-DISPLAY-LIMIT*
acl2-8.5>  SET-FREE-VARS-DISPLAY-LIMIT
acl2-8.5>  FREE-VARS-DISPLAY-LIMIT
acl2-8.5>  (LIMIT-FAILURE-REASON LIMIT-FAILURE-REASON-ALIST)
acl2-8.5>  (FIX-FREE-FAILURE-REASON FIX-FREE-FAILURE-REASON-ALIST)
acl2-8.5>  ANCESTOR-BACKCHAIN-RUNE
acl2-8.5>  WEAK-FORWARD-CHAINING-RULE-P
acl2-8.5>  WEAK-ELIM-RULE-P
acl2-8.5>  WEAK-GENERALIZE-RULE-P
acl2-8.5>  WEAK-INDUCTION-RULE-P
acl2-8.5>  WEAK-BUILT-IN-CLAUSE-P
acl2-8.5>  SCAN-TO-DEFPKG
acl2-8.5>  SCAN-TO-INCLUDE-BOOK
acl2-8.5>  MULTIPLE-ASSOC-TERMINAL-SUBSTRINGP1
acl2-8.5>  MULTIPLE-ASSOC-TERMINAL-SUBSTRINGP
acl2-8.5>  POSSIBLY-ADD-LISP-EXTENSION
acl2-8.5>  STUFF-STANDARD-OI
acl2-8.5>  DEFUN-MODE-PROMPT-STRING
acl2-8.5>  BRR-PROMPT
acl2-8.5>  TS<
acl2-8.5>  ADD-TO-TYPE-ALIST-SEGMENTS
acl2-8.5>  MERGE-TERM-ORDER
acl2-8.5>  MERGE-SORT-TERM-ORDER
acl2-8.5>  SORT-TYPE-ALIST-SEGMENTS
acl2-8.5>  TYPE-ALIST-SEGMENTS
acl2-8.5>  PRINT-TERMS
acl2-8.5>  PRINT-TYPE-ALIST-SEGMENTS
acl2-8.5>  PRINT-TYPE-ALIST
acl2-8.5>  DECODE-LOGICAL-NAME
acl2-8.5>  ACCESS-X-RULE-RUNE
acl2-8.5>  COLLECT-X-RULES-OF-RUNE
acl2-8.5>  COLLECT-CONGRUENCE-RULES-OF-RUNE-IN-GENEQV-LST
acl2-8.5>  COLLECT-CONGRUENCE-RULES-OF-RUNE
acl2-8.5>  COLLECT-PEQUIVS-OF-RUNE
acl2-8.5>  FIND-RULES-OF-RUNE2
acl2-8.5>  FIND-RULES-OF-RUNE1
acl2-8.5>  WORLD-TO-NEXT-EVENT
acl2-8.5>  ACTUAL-PROPS
acl2-8.5>  FIND-RULES-OF-RUNE
acl2-8.5>  BACKCHAIN-LIMIT-ENFORCERS
acl2-8.5>  TILDE-*-ANCESTORS-STACK-MSG1
acl2-8.5>  TILDE-*-ANCESTORS-STACK-MSG
acl2-8.5>  BRR-EVISC-TUPLE
acl2-8.5>  SET-BRR-EVISC-TUPLE
acl2-8.5>  MAYBE-INITIALIZE-BRR-EVISC-TUPLE
acl2-8.5>  SHOW-BRR-EVISC-TUPLE-FN
acl2-8.5>  SHOW-BRR-EVISC-TUPLE
acl2-8.5>  SHOW-ANCESTORS-STACK-MSG
acl2-8.5>  TILDE-@-FAILURE-REASON-PHRASE1-BACKCHAIN-LIMIT
acl2-8.5>  GET-EVG
acl2-8.5>  (TILDE-@-FAILURE-REASON-FREE-PHRASE TILDE-@-FAILURE-REASON-PHRASE1)
acl2-8.5>  TILDE-@-FAILURE-REASON-PHRASE
acl2-8.5>  BRR-RESULT
acl2-8.5>  *BRKPT1-ALIASES*
acl2-8.5>  *BRKPT2-ALIASES*
acl2-8.5>  BRKPT1
acl2-8.5>  BRKPT2
acl2-8.5>  WEAK-EXPAND-HINT-P
acl2-8.5>  BINDS-TO-CONSTANTS-P
acl2-8.5>  EXPAND-PERMISSION-RESULT1
acl2-8.5>  REMOVE1-BY-POSITION
acl2-8.5>  EXPAND-PERMISSION-RESULT
acl2-8.5>  EXPAND-PERMISSION-P
acl2-8.5>  ONE-WAY-UNIFY-RESTRICTIONS1
acl2-8.5>  ONE-WAY-UNIFY-RESTRICTIONS
acl2-8.5>  EV-FNCALL!
acl2-8.5>  EV-FNCALL-META
acl2-8.5>  EV-SYNP
acl2-8.5>  BAD-SYNP-ALIST1
acl2-8.5>  BAD-SYNP-ALIST1-LST
acl2-8.5>  BIND-FREE-INFO
acl2-8.5>  EVGS-OR-T
acl2-8.5>  SEARCH-TYPE-ALIST+
acl2-8.5>  ONCEP
acl2-8.5>  ZERO-DEPTHP
acl2-8.5>  RDEPTH-ERROR
acl2-8.5>  BAD-SYNP-HYP-MSG1
acl2-8.5>  BAD-SYNP-HYP-MSG
acl2-8.5>  SL-LET
acl2-8.5>  REWRITE-ENTRY-EXTENDING-FAILURE
acl2-8.5>  SET-DIFFERENCE-ASSOC-EQ
acl2-8.5>  EXTEND-UNIFY-SUBST
acl2-8.5>  RELIEVE-HYP-SYNP
acl2-8.5>  PUSH-LEMMA+
acl2-8.5>  PUSH-SPLITTER?
acl2-8.5>  PREPEND-STEP-LIMIT
acl2-8.5>  WEAK-RW-CACHE-ENTRY-P
acl2-8.5>  FREE-FAILURE-P
acl2-8.5>  COMBINE-FREE-FAILURE-REASONS
acl2-8.5>  COMBINE-FREE-FAILURE-ALISTS
acl2-8.5>  COMBINE-SORTED-RW-CACHE-LISTS1
acl2-8.5>  SPLIT-PSORTED-LIST1
acl2-8.5>  SPLIT-PSORTED-LIST
acl2-8.5>  MERGE-LEXORDER-FAST
acl2-8.5>  MERGE-SORT-LEXORDER-FAST
acl2-8.5>  SORT-RW-CACHE-LIST
acl2-8.5>  COMBINE-RW-CACHE-LISTS
acl2-8.5>  MERGE-RW-CACHES
acl2-8.5>  SORTED-RW-CACHE-P
acl2-8.5>  MERGE-SYMBOL-ALISTP
acl2-8.5>  MERGE-SORT-SYMBOL-ALISTP
acl2-8.5>  CDR-SORT-RW-CACHE
acl2-8.5>  COMBINE-RW-CACHES
acl2-8.5>  UNIFY-SUBST-SUBSETP
acl2-8.5>  RW-CACHE-LIST-LOOKUP
acl2-8.5>  RELIEVE-HYP-FAILURE-ENTRY-SKIP-P
acl2-8.5>  RELIEVE-HYP-FAILURE-ENTRY-SKIP-P-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  RW-CACHE-ACTIVE-P
acl2-8.5>  ASSOC-RW-CACHE
acl2-8.5>  PUT-ASSOC-RW-CACHE1
acl2-8.5>  PUT-ASSOC-RW-CACHE
acl2-8.5>  RELIEVE-HYP-FAILURE-ENTRY
acl2-8.5>  MAYBE-EXTEND-TAG-TREE
acl2-8.5>  ACCUMULATE-RW-CACHE1
acl2-8.5>  ACCUMULATE-RW-CACHE
acl2-8.5>  ACCUMULATE-RW-CACHE?
acl2-8.5>  RESTRICT-ALIST-TO-ALL-VARS1
acl2-8.5>  (ALL-VARS-BOUNDP ALL-VARS-LST-BOUNDP)
acl2-8.5>  RESTRICT-ALIST-TO-ALL-VARS
acl2-8.5>  PUSH-RW-CACHE-ENTRY
acl2-8.5>  RW-CACHE-DEBUG
acl2-8.5>  RW-CACHE-DEBUG-ACTION
acl2-8.5>  RW-CACHE-DEBUG-BUILTIN
acl2-8.5>  RW-CACHE-DEBUG-ACTION-BUILTIN
acl2-8.5>  RW-CACHEABLE-FAILURE-REASON
acl2-8.5>  RW-CACHEABLE-FAILURE-REASON-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  RW-CACHEABLE-NIL-TAG
acl2-8.5>  NOTE-RELIEVE-HYP-FAILURE
acl2-8.5>  REPLACE-FREE-RW-CACHE-ENTRY1
acl2-8.5>  REPLACE-FREE-RW-CACHE-ENTRY
acl2-8.5>  RW-CACHE-ALIST-NIL-TAG-P
acl2-8.5>  MERGE-FREE-FAILURE-REASONS-NIL-TAG
acl2-8.5>  MERGE-FREE-FAILURE-ALISTS-NIL-TAG
acl2-8.5>  NOTE-RW-CACHE-FREE-NIL-TAG
acl2-8.5>  NOTE-RELIEVE-HYPS-FAILURE-FREE
acl2-8.5>  RW-CACHE-ENTER-CONTEXT
acl2-8.5>  ERASE-RW-CACHE
acl2-8.5>  RW-CACHE-EXIT-CONTEXT
acl2-8.5>  RESTORE-RW-CACHE-ANY-TAG
acl2-8.5>  CONS-TAG-TREES-RW-CACHE
acl2-8.5>  NORMALIZE-RW-ANY-CACHE
acl2-8.5>  CONS-TAG-TREES-RW-CACHE-FIRST
acl2-8.5>  TAG-TREE-TAGS-SUBSETP
acl2-8.5>  RW-CACHE
acl2-8.5>  RW-CACHED-FAILURE-PAIR
acl2-8.5>  EXTEND-RW-CACHE-ALIST-FREE
acl2-8.5>  RW-CACHE-ADD-FAILURE-REASON
acl2-8.5>  ADD-LINEAR-LEMMA-FINISH
acl2-8.5>  MAKE-STACK-FROM-ALIST
acl2-8.5>  LAMBDA-NEST-HIDEP
acl2-8.5>  LAMBDA-NEST-UNHIDE
acl2-8.5>  MEMO-ACTIVEP
acl2-8.5>  ACTIVATE-MEMO
acl2-8.5>  INTERSECTION1-EQ
acl2-8.5>  FORBIDDEN-FNS-IN-TERM
acl2-8.5>  FORBIDDEN-FNS-IN-TERM-LIST
acl2-8.5>  ALL-FNNAMES-LST-LST1
acl2-8.5>  FORBIDDEN-FNS-IN-TERM-LIST-LIST
acl2-8.5>  FORBIDDEN-FNS
acl2-8.5>  SKIP-META-TERMP-CHECKS-TABLE
acl2-8.5>  SET-SKIP-META-TERMP-CHECKS!
acl2-8.5>  SET-SKIP-META-TERMP-CHECKS
acl2-8.5>  SKIP-META-TERMP-CHECKS
acl2-8.5>  COLLECT-BAD-FN-ARITY-INFO
acl2-8.5>  BAD-ARITIES-MSG
acl2-8.5>  ALL-FFN-SYMBS
acl2-8.5>  ALL-FFN-SYMBS-LST
acl2-8.5>  APPLY$-RULE-NAME
acl2-8.5>  PUSH-WARRANTS
acl2-8.5>  *FAKE-RUNE-FOR-CERT-DATA*
acl2-8.5>  *FAKE-RUNE-ALIST*
acl2-8.5>  MERGE-RUNES
acl2-8.5>  MERGE-SORT-RUNES
acl2-8.5>  FN-SLOT-FROM-GENEQVP
acl2-8.5>  PARTITION-USERFNS-BY-WARRANTP
acl2-8.5>  REWRITE-LAMBDA-OBJECT-PRE-WARNING
acl2-8.5>  REWRITE-LAMBDA-OBJECT-POST-WARNING
acl2-8.5>  COLLECT-0-ARY-HYPS
acl2-8.5>  *REWRITE-LAMBDA-MODEP-XRUNE*
acl2-8.5>  (REWRITE REWRITE-SOLIDIFY-PLUS REWRITE-IF
acl2-8.5>           REWRITE-ARGS REWRITE-PRIMITIVE
acl2-8.5>           REWRITE-EQUAL RELIEVE-HYP ...)
acl2-8.5> 
acl2-8.5> Finished loading "rewrite.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "simplify.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  NEGATE-LIT
acl2-8.5>  PEGATE-LIT
acl2-8.5>  ADD-LITERAL
acl2-8.5>  ADD-EACH-LITERAL
acl2-8.5>  (SUBSUMES-REC SUBSUMES1-EQUALITY-WITH-CONST SUBSUMES1)
acl2-8.5>  (SUBSUMES!-REC SUBSUMES!1-EQUALITY-WITH-CONST
acl2-8.5>                 SUBSUMES!1)
acl2-8.5>  *INIT-SUBSUMES-COUNT*
acl2-8.5>  SUBSUMES
acl2-8.5>  SOME-MEMBER-SUBSUMES
acl2-8.5>  EQUAL-MOD-COMMUTING-LST
acl2-8.5>  MEMBER-EQUAL-MOD-COMMUTING-LST
acl2-8.5>  CONJOIN-CLAUSE-TO-CLAUSE-SET
acl2-8.5>  ADD-EACH-LITERAL-LST
acl2-8.5>  CONJOIN-CLAUSE-SETS
acl2-8.5>  SOME-ELEMENT-MEMBER-COMPLEMENT-TERM
acl2-8.5>  DISJOIN-CLAUSES1
acl2-8.5>  DISJOIN-CLAUSES
acl2-8.5>  DISJOIN-CLAUSE-SEGMENT-TO-CLAUSE-SET
acl2-8.5>  SPLIT-ON-ASSUMPTIONS
acl2-8.5>  REWRITE-CLAUSE-ACTION
acl2-8.5>  WEAK-FC-ACTIVATION-P
acl2-8.5>  SUSPEND-FC-ACTIVATION
acl2-8.5>  PRETTYIFY-FC-ACTIVATION
acl2-8.5>  PRETTYIFY-FC-ACTIVATIONS
acl2-8.5>  MAKE-FC-ACTIVATION
acl2-8.5>  MAKE-FC-ACTIVATIONS
acl2-8.5>  (COLLECT-TERMS-AND-ACTIVATIONS COLLECT-TERMS-AND-ACTIVATIONS-LST)
acl2-8.5>  COLLECT-TERMS-AND-ACTIVATIONS-FROM-FCD-LST
acl2-8.5>  (SUBLIS-VARP SUBLIS-VAR-LSTP)
acl2-8.5>  MULT-SEARCH-TYPE-ALIST
acl2-8.5>  MULT-LOOKUP-HYP
acl2-8.5>  (EV-RESPECTING-ENS EV-LST-RESPECTING-ENS)
acl2-8.5>  ADD-FC-DERIVATIONS
acl2-8.5>  (PRETTYIFY-FC-DERIVATION PRETTYIFY-FC-DERIVATIONS)
acl2-8.5>  (EXPUNGE-FC-DERIVATIONS EXPUNGE-FC-DERIVATIONS-LST
acl2-8.5>                          EXPUNGE-FC-DERIVATIONS-TYPE-ALIST
acl2-8.5>                          EXPUNGE-FC-DERIVATIONS-ASSUMPTIONS-LST
acl2-8.5>                          EXPUNGE-FC-DERIVATIONS-ASSUMPTIONS)
acl2-8.5>  CURRENT-FC-CALL-NUMBER
acl2-8.5>  CURRENT-FC-CALL-ALIST
acl2-8.5>  PUT-CURRENT-FC-CALL-ALIST
acl2-8.5>  INITIALIZE-FC-WORMHOLE-SITES
acl2-8.5>  SHOW-FC-CRITERIA
acl2-8.5>  RESET-FC-REPORTING
acl2-8.5>  TRANSLATE-FC-CRITERION
acl2-8.5>  TRANSLATE-FC-CRITERIA
acl2-8.5>  SET-FC-CRITERIA-FN
acl2-8.5>  SET-FC-CRITERIA
acl2-8.5>  SET-FC-REPORT-ON-THE-FLY
acl2-8.5>  NEW-FC-CALL
acl2-8.5>  MEMBER-ONE-WAY-UNIFY1
acl2-8.5>  SATISFYING-FC-ACTIVATION1P
acl2-8.5>  SATISFYING-FC-ACTIVATIONP
acl2-8.5>  COLLECT-SATISFYING-FC-ACTIVATIONS
acl2-8.5>  SATISFYING-VIRTUAL-FC-ACTIVATION1P
acl2-8.5>  SATISFYING-VIRTUAL-FC-ACTIVATIONP
acl2-8.5>  SATISFYING-FC-DERIVATION1P
acl2-8.5>  SATISFYING-FC-DERIVATIONP
acl2-8.5>  COLLECT-SATISFYING-FC-DERIVATIONS
acl2-8.5>  FILTER-SATISFYING-VIRTUAL-FC-ACTIVATION
acl2-8.5>  FILTER-ALL-SATISFYING-FC-DERIVATIONS
acl2-8.5>  FILTER-SATISFYING-FC-ACTIVATIONS
acl2-8.5>  FILTER-REDUNDANT-APPROVED-FC-DERIVATION
acl2-8.5>  COLLECT-RUNE-TRIGGER-PAIRS-FROM-FC-ACTIVATIONS
acl2-8.5>  COLLECT-RUNE-TRIGGER-PAIRS-FROM-FC-DERIVATIONS
acl2-8.5>  PRETTYIFY-SUBST
acl2-8.5>  COLLECT-FC-STATUS-SITE-1
acl2-8.5>  COLLECT-FC-STATUS-SITES-2-3-5
acl2-8.5>  PRETTYIFY-BLOCKED-FC-INST-HYP
acl2-8.5>  COLLECT-FC-STATUS-SITE-4
acl2-8.5>  COLLECT-FC-STATUS
acl2-8.5>  MAKE-FC-ACTIVITY-REPORT1
acl2-8.5>  MAKE-FC-ACTIVITY-REPORT
acl2-8.5>  FC-REPORT1
acl2-8.5>  FC-REPORT
acl2-8.5>  FC-EXIT
acl2-8.5>  (ADVANCE-FC-ACTIVATION1 ADVANCE-FC-ACTIVATION2
acl2-8.5>                          ADVANCE-FC-ACTIVATION3)
acl2-8.5>  ADVANCE-FC-ACTIVATION
acl2-8.5>  ADVANCE-FC-ACTIVATIONS
acl2-8.5>  FC-PAIR-LST
acl2-8.5>  FC-PAIR-LST-TYPE-ALIST
acl2-8.5>  FCD-RUNEP
acl2-8.5>  FCD-RUNEP-LST
acl2-8.5>  FCD-WORSE-THAN-OR-EQUAL
acl2-8.5>  FCD-WORSE-THAN-OR-EQUAL-LST
acl2-8.5>  EXISTS-FCD-WORSE-THAN-OR-EQUAL
acl2-8.5>  ALL-DUMB-OCCUR-LST
acl2-8.5>  ALL-ARGS-OCCUR-AFTER-STRIP-NOT
acl2-8.5>  APPROVED-FC-DERIVATIONP
acl2-8.5>  APPROVE-FC-DERIVATIONS
acl2-8.5>  (MAX-LEVEL-NO MAX-LEVEL-NO-LST GET-LEVEL-NO)
acl2-8.5>  (SORT-FCDS1-RATING1 SORT-FCDS1-RATING1-LST)
acl2-8.5>  SORT-FCDS1-RATING
acl2-8.5>  SORT-FCDS1
acl2-8.5>  SORT-FCDS
acl2-8.5>  STRIP-FCD-CONCLS
acl2-8.5>  TYPE-ALIST-FCD-LST
acl2-8.5>  EVERY-CONCL-MEMBER-EQUALP
acl2-8.5>  COLLECT-DISJUNCTS
acl2-8.5>  COLLECT-DISJUNCTION-TRIPLES
acl2-8.5>  EXPLOIT-DISJUNCTION-TRIPLE
acl2-8.5>  EXPLOIT-DISJUNCTION-TRIPLES1
acl2-8.5>  EXPLOIT-DISJUNCTION-TRIPLES
acl2-8.5>  PROCESS-DISJUNCTION-TRIPLES
acl2-8.5>  CONCLS-FROM-FCDS
acl2-8.5>  MAKE-TYPE-ALIST
acl2-8.5>  STRIP-TTREES-FROM-TYPE-ALIST
acl2-8.5>  CW-ROUND-BY-ROUND-FN
acl2-8.5>  CW-ROUND-BY-ROUND
acl2-8.5>  FORWARD-CHAIN1
acl2-8.5>  FORWARD-CHAIN-TOP
acl2-8.5>  FORWARD-CHAIN
acl2-8.5>  SELECT-FORWARD-CHAINED-CONCLS-AND-TTREES
acl2-8.5>  REWRITE-CLAUSE-TYPE-ALIST
acl2-8.5>  (FOCCURRENCES FOCCURRENCES-LST)
acl2-8.5>  (MAXIMAL-MULTIPLE MAXIMAL-MULTIPLE-LST)
acl2-8.5>  MAXIMAL-MULTIPLES1
acl2-8.5>  MAXIMAL-MULTIPLES
acl2-8.5>  MUTUALLY-EXCLUSIVE-TESTS
acl2-8.5>  MUTUALLY-EXCLUSIVE-SUBSUMPTIONP
acl2-8.5>  (CLEANUP-IF-EXPR CLEANUP-IF-EXPR-LST)
acl2-8.5>  ALL-TYPE-REASONING-TAGS-P1
acl2-8.5>  ALL-TYPE-REASONING-TAGS-P
acl2-8.5>  TRY-CLAUSE
acl2-8.5>  *TRIVIAL-NON-NIL-TTREE*
acl2-8.5>  MAKE-NON-NIL-TTREE
acl2-8.5>  TRY-TYPE-SET-AND-CLAUSE
acl2-8.5>  (LAMBDA-SUBTERMP LAMBDA-SUBTERMP-LST)
acl2-8.5>  REWRITE-ATM
acl2-8.5>  (EVERY-OCCURRENCE-EQUIV-HITTABLEP1 EVERY-OCCURRENCE-EQUIV-HITTABLEP1-LISTP)
acl2-8.5>  EVERY-OCCURRENCE-EQUIV-HITTABLEP
acl2-8.5>  EVERY-OCCURRENCE-EQUIV-HITTABLEP-IN-CLAUSEP
acl2-8.5>  (SOME-OCCURRENCE-EQUIV-HITTABLEP1 SOME-OCCURRENCE-EQUIV-HITTABLEP1-LISTP)
acl2-8.5>  SOME-OCCURRENCE-EQUIV-HITTABLEP
acl2-8.5>  EQUIV-HITTABLE-IN-SOME-OTHER-LIT
acl2-8.5>  FIND-TRIVIAL-EQUIVALENCE1
acl2-8.5>  FIND-TRIVIAL-EQUIVALENCE
acl2-8.5>  ADD-LITERAL-AND-PT1
acl2-8.5>  ADD-LITERAL-AND-PT
acl2-8.5>  ADD-BINDING-TO-TAG-TREE
acl2-8.5>  SUBST-EQUIV-AND-MAYBE-DELETE-LIT
acl2-8.5>  REMOVE-TRIVIAL-EQUIVALENCES-ENABLED-P
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  REMOVE-TRIVIAL-EQUIVALENCES-REC
acl2-8.5>  REMOVE-TRIVIAL-EQUIVALENCES
acl2-8.5>  *INITIAL-BUILT-IN-CLAUSES*
acl2-8.5>  BUILT-IN-CLAUSEP2
acl2-8.5>  BUILT-IN-CLAUSEP1
acl2-8.5>  POSSIBLE-TRIVIAL-CLAUSE-P
acl2-8.5>  TRIVIAL-CLAUSE-P
acl2-8.5>  BUILT-IN-CLAUSEP
acl2-8.5>  CRUNCH-CLAUSE-SEGMENTS1
acl2-8.5>  CRUNCH-CLAUSE-SEGMENTS2
acl2-8.5>  CRUNCH-CLAUSE-SEGMENTS
acl2-8.5>  STRIP-NON-REWRITTENP-ASSUMPTIONS1
acl2-8.5>  STRIP-NON-REWRITTENP-ASSUMPTIONS
acl2-8.5>  ASSUMNOTE-LIST-TO-TOKEN-LIST
acl2-8.5>  RESUME-SUSPENDED-ASSUMPTION-REWRITING1
acl2-8.5>  RESUME-SUSPENDED-ASSUMPTION-REWRITING
acl2-8.5>  HELPFUL-LITTLE-ECNT-MSG
acl2-8.5>  (REWRITE-CLAUSE REWRITE-CLAUSE-LST)
acl2-8.5>  SETUP-SIMPLIFY-CLAUSE-POT-LST1
acl2-8.5>  SETUP-SIMPLIFY-CLAUSE-POT-LST
acl2-8.5>  SEQUENTIAL-SUBST-VAR-TERM
acl2-8.5>  PROCESS-EQUATIONAL-POLYS
acl2-8.5>  ENUMERATE-ELEMENTS
acl2-8.5>  ALREADY-USED-BY-FERTILIZE-CLAUSEP
acl2-8.5>  UNHIDDEN-LIT-INFO
acl2-8.5>  TILDE-@-HYP-PHRASE
acl2-8.5>  SIMPLIFY-CLAUSE1
acl2-8.5>  SOME-ELEMENT-DUMB-OCCUR-LST
acl2-8.5>  WEAK-PROVE-SPEC-VAR-P
acl2-8.5>  WEAK-GAG-INFO-P
acl2-8.5>  WEAK-GAG-STATE-P
acl2-8.5>  *INITIAL-GAG-STATE*
acl2-8.5>  *EMPTY-PROVE-SPEC-VAR*
acl2-8.5>  CONTROLLER-UNIFY-SUBST2
acl2-8.5>  CONTROLLER-UNIFY-SUBST1
acl2-8.5>  CONTROLLER-UNIFY-SUBST
acl2-8.5>  FILTER-DISABLED-EXPAND-TERMS
acl2-8.5>  FOUND-HIT-REWRITE-HIST-ENTRY
acl2-8.5>  SIMPLIFY-CLAUSE
acl2-8.5>  SETTLED-DOWN-CLAUSE
acl2-8.5>  MEMBER-CLASS-NAME-RUNES
acl2-8.5>  EXTRACT-AND-CLASSIFY-LEMMAS2
acl2-8.5>  EXTRACT-AND-CLASSIFY-LEMMAS1
acl2-8.5>  RUNES-TO-CLASS-ALIST1
acl2-8.5>  STRICT-MERGE-SYMBOL<
acl2-8.5>  STRICT-MERGE-SORT-SYMBOL<
acl2-8.5>  SORT-SYMBOL-LISTP
acl2-8.5>  SET-RULER-EXTENDERS
acl2-8.5>  STRICT-MERGE-SORT-SYMBOL<-CDRS
acl2-8.5>  RUNES-TO-CLASS-ALIST
acl2-8.5>  EXTRACT-AND-CLASSIFY-LEMMAS
acl2-8.5>  TILDE-*-CONJUNCTION-OF-POSSIBLY-FORCED-NAMES-PHRASE1
acl2-8.5>  TILDE-*-CONJUNCTION-OF-POSSIBLY-FORCED-NAMES-PHRASE
acl2-8.5>  TILDE-*-SIMP-PHRASE1
acl2-8.5>  TILDE-*-RAW-SIMP-PHRASE1
acl2-8.5>  RECOVER-FORCED-RUNES1
acl2-8.5>  RECOVER-FORCED-RUNES
acl2-8.5>  TILDE-*-RAW-SIMP-PHRASE
acl2-8.5>  TILDE-*-SIMP-PHRASE
acl2-8.5>  TILDE-@-POOL-NAME-PHRASE
acl2-8.5>  TILDE-@-POOL-NAME-PHRASE-LST
acl2-8.5>  TILDE-@-CLAUSE-ID-PHRASE
acl2-8.5>  WEAK-BDDNOTE-P
acl2-8.5>  TILDE-@-BDDNOTE-PHRASE
acl2-8.5>  PARSE-NATURAL1
acl2-8.5>  PARSE-NATURAL
acl2-8.5>  PARSE-DOTTED-NATURALS
acl2-8.5>  PARSE-MATCH
acl2-8.5>  PARSE-PRIMES
acl2-8.5>  PARSE-CLAUSE-ID2
acl2-8.5>  PARSE-CLAUSE-ID1
acl2-8.5>  PARSE-CLAUSE-ID
acl2-8.5>  TILDE-@-CASE-SPLIT-LIMITATIONS-PHRASE
acl2-8.5>  SIMPLIFY-CLAUSE-MSG1
acl2-8.5>  SETTLED-DOWN-CLAUSE-MSG1
acl2-8.5> 
acl2-8.5> Finished loading "simplify.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "bdd.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  MVF
acl2-8.5>  LOGANDF
acl2-8.5>  LOGXORF
acl2-8.5>  LOGIORF
acl2-8.5>  ASHF
acl2-8.5>  MX-ID-BOUND
acl2-8.5>  1+MX-ID
acl2-8.5>  BDD-ERROR
acl2-8.5>  UNIQUE-ID
acl2-8.5>  TST
acl2-8.5>  CST-BOOLP
acl2-8.5>  TBR
acl2-8.5>  FBR
acl2-8.5>  LEAFP
acl2-8.5>  TRM
acl2-8.5>  BDD-CONSTRUCTORS
acl2-8.5>  MAKE-LEAF-CST
acl2-8.5>  EVG-FN-SYMB
acl2-8.5>  BDD-CONSTRUCTOR-TRM-P
acl2-8.5>  EVG-TYPE
acl2-8.5>  MAKE-IF-CST
acl2-8.5>  *CST-T*
acl2-8.5>  *CST-NIL*
acl2-8.5>  CST=
acl2-8.5>  CST-TP
acl2-8.5>  CST-NILP
acl2-8.5>  CST-VARP
acl2-8.5>  CST-NONNILP
acl2-8.5>  BOOL-MASK1
acl2-8.5>  BOOLEAN-TERM-VAR
acl2-8.5>  BOOLEAN-HYPS-VARS
acl2-8.5>  FIRST-BOOLEAN-TYPE-PRESCRIPTION
acl2-8.5>  RECOGNIZER-RUNE
acl2-8.5>  BOOL-MASK
acl2-8.5>  COMMUTATIVE-P1
acl2-8.5>  FIND-EQUIVALENCE-RUNE
acl2-8.5>  EQUIVALENCE-RUNE1
acl2-8.5>  EQUIVALENCE-RUNE
acl2-8.5>  COMMUTATIVE-P
acl2-8.5>  OP-ALIST
acl2-8.5>  OP-ALIST-INFO
acl2-8.5>  IF-OP-CODE
acl2-8.5>  HASH-SIZE
acl2-8.5>  IF-HASH-INDEX
acl2-8.5>  OP-HASH-INDEX1
acl2-8.5>  OP-HASH-INDEX
acl2-8.5>  OP-HASH-INDEX-2
acl2-8.5>  OP-HASH-INDEX-IF
acl2-8.5>  IF-SEARCH-BUCKET
acl2-8.5>  CST=-LST
acl2-8.5>  EQ-OP
acl2-8.5>  OP-SEARCH-BUCKET
acl2-8.5>  OP-SEARCH-BUCKET-2
acl2-8.5>  OP-SEARCH-BUCKET-IF
acl2-8.5>  CHK-MEMO
acl2-8.5>  CHK-MEMO-2
acl2-8.5>  CHK-MEMO-IF
acl2-8.5>  HALF-HASH-SIZE
acl2-8.5>  FOURTH-HASH-SIZE
acl2-8.5>  OP-HASH-INDEX-STRING
acl2-8.5>  OP-HASH-INDEX-EVG
acl2-8.5>  OP-SEARCH-BUCKET-QUOTE
acl2-8.5>  CHK-MEMO-QUOTEP
acl2-8.5>  BDD-QUOTEP
acl2-8.5>  BDD-QUOTEP+
acl2-8.5>  WEAK-BDD-RULE-P
acl2-8.5>  REWRITE-RULE-TO-BDD-RULE
acl2-8.5>  BDD-RULES-ALIST1
acl2-8.5>  EXTRA-RULES-FOR-BDDS
acl2-8.5>  BDD-RULES-ALIST
acl2-8.5>  ONE-WAY-UNIFY1-CST-2
acl2-8.5>  ONE-WAY-UNIFY1-CST-3
acl2-8.5>  (ONE-WAY-UNIFY1-CST ONE-WAY-UNIFY1-CST-LST
acl2-8.5>                      ONE-WAY-UNIFY1-CST-EQUAL)
acl2-8.5>  SOME-ONE-WAY-UNIFY-CST-LST
acl2-8.5>  LEAF-CST-LIST
acl2-8.5>  (DECODE-CST DECODE-CST-LST)
acl2-8.5>  DECODE-CST-ALIST1
acl2-8.5>  DECODE-CST-ALIST
acl2-8.5>  LEAF-CST-LIST-ARRAY
acl2-8.5>  *SOME-NON-NIL-VALUE*
acl2-8.5>  FALSIFYING-ASSIGNMENT1
acl2-8.5>  FALSIFYING-ASSIGNMENT
acl2-8.5>  MAKE-IF
acl2-8.5>  MAKE-IF-NO-MEMO
acl2-8.5>  SPLIT-VAR
acl2-8.5>  MIN-VAR
acl2-8.5>  COMBINE-OP-CSTS1
acl2-8.5>  BOOL-FLG
acl2-8.5>  SOME-BDD-CONSTRUCTORP
acl2-8.5>  COMBINE-OP-CSTS-SIMPLE
acl2-8.5>  BDD-MV-LET
acl2-8.5>  COMBINE-IF-CSTS+
acl2-8.5>  COMBINE-IF-CSTS1
acl2-8.5>  COMBINE-IF-CSTS
acl2-8.5>  CST-LIST-TO-EVG-LIST
acl2-8.5>  CST-QUOTE-LISTP
acl2-8.5>  WEAK-BDDSPV-P
acl2-8.5>  BDD-EV-FNCALL
acl2-8.5>  COMBINE-OP-CSTS+
acl2-8.5>  MAKE-IF-FOR-OP
acl2-8.5>  (COMBINE-OP-CSTS COMBINE-OP-CSTS-COMM
acl2-8.5>                   COMBINE-OP-CSTS-GUTS
acl2-8.5>                   BDD BDD-ALIST BDD-LIST)
acl2-8.5>  IF-HT-MAX-LENGTH
acl2-8.5>  OP-HT-MAX-LENGTH
acl2-8.5>  LEAF-CST-LIST-TO-ALIST
acl2-8.5>  BDD-TOP
acl2-8.5>  GET-BOOL-VARS
acl2-8.5>  BDD-CLAUSE1
acl2-8.5>  EXPAND-AND-OR-SIMPLE+
acl2-8.5>  EXPAND-AND-OR-SIMPLE
acl2-8.5>  EXPAND-CLAUSE
acl2-8.5>  BDD-CLAUSE
acl2-8.5> 
acl2-8.5> Finished loading "bdd.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "other-processes.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  STRIP-FINAL-DIGITS1
acl2-8.5>  STRIP-FINAL-DIGITS
acl2-8.5>  *VAR-FAMILIES-BY-TYPE*
acl2-8.5>  ASSOC-TS-SUBSETP
acl2-8.5>  FIRST-NON-MEMBER-EQ
acl2-8.5>  ABBREVIATE-HYPHENATED-STRING1
acl2-8.5>  ABBREVIATE-HYPHENATED-STRING
acl2-8.5>  GENERATE-VARIABLE-ROOT1
acl2-8.5>  GENERATE-VARIABLE-ROOT
acl2-8.5>  GENERATE-VARIABLE
acl2-8.5>  GENERATE-VARIABLE-LST
acl2-8.5>  OCCURS-NOWHERE-ELSE
acl2-8.5>  FIRST-NOMINATION
acl2-8.5>  SECOND-NOMINATION
acl2-8.5>  SOME-HYP-PROBABLY-NILP
acl2-8.5>  (SUBLIS-EXPR SUBLIS-EXPR-LST)
acl2-8.5>  NOMINATE-DESTRUCTOR-CANDIDATE
acl2-8.5>  (NOMINATE-DESTRUCTOR-CANDIDATES NOMINATE-DESTRUCTOR-CANDIDATES-LST)
acl2-8.5>  SUM-LEVEL-NOS
acl2-8.5>  PICK-HIGHEST-SUM-LEVEL-NOS
acl2-8.5>  SELECT-INSTANTIATED-ELIM-RULE
acl2-8.5>  TYPE-RESTRICTION-SEGMENT
acl2-8.5>  (SUBTERM-ONE-WAY-UNIFY SUBTERM-ONE-WAY-UNIFY-LST)
acl2-8.5>  APPLY-GENERALIZE-RULE
acl2-8.5>  GENERALIZE-RULE-SEGMENT1
acl2-8.5>  GENERALIZE-RULE-SEGMENT
acl2-8.5>  GENERALIZE1
acl2-8.5>  APPLY-INSTANTIATED-ELIM-RULE
acl2-8.5>  ELIMINATE-DESTRUCTORS-CLAUSE1
acl2-8.5>  OWNED-VARS
acl2-8.5>  ENS-FROM-PSPV
acl2-8.5>  ELIMINATE-DESTRUCTORS-CLAUSE
acl2-8.5>  PRETTYIFY-CLAUSE1
acl2-8.5>  PRETTYIFY-CLAUSE2
acl2-8.5>  PRETTYIFY-CLAUSE
acl2-8.5>  PRETTYIFY-CLAUSE-LST
acl2-8.5>  PRETTYIFY-CLAUSE-SET
acl2-8.5>  TILDE-*-ELIM-PHRASE/ALIST1
acl2-8.5>  TILDE-*-ELIM-PHRASE/ALIST
acl2-8.5>  TILDE-*-ELIM-PHRASE3
acl2-8.5>  TILDE-*-ELIM-PHRASE2
acl2-8.5>  TILDE-*-ELIM-PHRASE1
acl2-8.5>  TILDE-*-ELIM-PHRASE
acl2-8.5>  TILDE-*-UNTRANSLATE-LST-PHRASE
acl2-8.5>  ELIMINATE-DESTRUCTORS-CLAUSE-MSG1
acl2-8.5>  (ALMOST-QUOTEP1 ALMOST-QUOTEP1-LISTP)
acl2-8.5>  ALMOST-QUOTEP
acl2-8.5>  DESTRUCTOR-APPLIED-TO-VARSP
acl2-8.5>  DUMB-OCCUR-LST-EXCEPT
acl2-8.5>  FERTILIZE-FEASIBLE
acl2-8.5>  (FERTILIZE-COMPLEXITY MAXIMIZE-FERTILIZE-COMPLEXITY)
acl2-8.5>  FIRST-FERTILIZE-LIT
acl2-8.5>  CROSS-FERTILIZEP/C
acl2-8.5>  CROSS-FERTILIZEP/D
acl2-8.5>  CROSS-FERTILIZEP
acl2-8.5>  DELETE-FROM-TTREE
acl2-8.5>  FERTILIZE-CLAUSE1
acl2-8.5>  FERTILIZE-CLAUSE
acl2-8.5>  FERTILIZE-CLAUSE-MSG1
acl2-8.5>  COLLECTABLE-FNP
acl2-8.5>  (SMALLEST-COMMON-SUBTERMS1 SMALLEST-COMMON-SUBTERMS1-LST)
acl2-8.5>  DUMB-FN-COUNT-1
acl2-8.5>  DUMB-FN-COUNT
acl2-8.5>  SMALLEST-COMMON-SUBTERMS
acl2-8.5>  GENERALIZING-RELATIONP
acl2-8.5>  GENERALIZABLE-TERMS-ACROSS-RELATIONS
acl2-8.5>  GENERALIZABLE-TERMS-ACROSS-LITERALS1
acl2-8.5>  GENERALIZABLE-TERMS-ACROSS-LITERALS
acl2-8.5>  GENERALIZABLE-TERMS
acl2-8.5>  GENERALIZE-CLAUSE
acl2-8.5>  TILDE-*-GEN-PHRASE/ALIST1
acl2-8.5>  TILDE-*-GEN-PHRASE/ALIST
acl2-8.5>  TILDE-*-GEN-PHRASE
acl2-8.5>  GENERALIZE-CLAUSE-MSG1
acl2-8.5> 
acl2-8.5> Finished loading "other-processes.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "induct.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  SELECT-X-CL-SET
acl2-8.5>  UNCHANGEABLES
acl2-8.5>  CHANGEABLES
acl2-8.5>  SOUND-INDUCTION-PRINCIPLE-MASK1
acl2-8.5>  SOUND-INDUCTION-PRINCIPLE-MASK
acl2-8.5>  WEAK-CANDIDATE-P
acl2-8.5>  COUNT-NON-NILS
acl2-8.5>  CONTROLLERS
acl2-8.5>  CHANGED/UNCHANGED-VARS
acl2-8.5>  WEAK-TESTS-AND-ALISTS-P
acl2-8.5>  TESTS-AND-ALISTS/ALIST
acl2-8.5>  TESTS-AND-ALISTS/ALISTS
acl2-8.5>  WEAK-TESTS-AND-CALLS-P
acl2-8.5>  WEAK-JUSTIFICATION-P
acl2-8.5>  TESTS-AND-ALISTS
acl2-8.5>  TESTS-AND-ALISTS-LST
acl2-8.5>  FLESH-OUT-INDUCTION-PRINCIPLE
acl2-8.5>  INTRINSIC-SUGGESTED-INDUCTION-CAND
acl2-8.5>  (APPLY-INDUCTION-RULE SUGGESTED-INDUCTION-CANDS1
acl2-8.5>                        SUGGESTED-INDUCTION-CANDS)
acl2-8.5>  (GET-INDUCTION-CANDS GET-INDUCTION-CANDS-LST)
acl2-8.5>  GET-INDUCTION-CANDS-FROM-CL-SET1
acl2-8.5>  GET-INDUCTION-CANDS-FROM-CL-SET
acl2-8.5>  (PIGEON-HOLEP-APPLY PIGEON-HOLEP PIGEON-HOLEP1)
acl2-8.5>  FLUSH-CAND1-DOWN-CAND2
acl2-8.5>  FLUSH-CANDIDATES
acl2-8.5>  ALISTS-AGREEP
acl2-8.5>  IRRECONCILABLE-ALISTSP
acl2-8.5>  AFFINITY
acl2-8.5>  MEMBER-AFFINITY
acl2-8.5>  OCCUR-AFFINITY
acl2-8.5>  SOME-OCCUR-AFFINITY
acl2-8.5>  ALL-OCCUR-AFFINITY
acl2-8.5>  CONTAINS-AFFINITY
acl2-8.5>  ANTAGONISTIC-TESTS-AND-ALISTS-LSTP
acl2-8.5>  ANTAGONISTIC-TESTS-AND-ALISTS-LSTSP
acl2-8.5>  EVERY-ALIST1-MATEDP
acl2-8.5>  MERGE-ALIST1-INTO-ALIST2
acl2-8.5>  MERGE-ALIST1-LST-INTO-ALIST2
acl2-8.5>  MERGE-LST1-INTO-ALIST2
acl2-8.5>  MERGE-LST1-INTO-ALIST2-LST
acl2-8.5>  MERGE-LST1-INTO-LST2
acl2-8.5>  MERGE-TESTS-AND-ALISTS-LSTS
acl2-8.5>  MERGE-CAND1-INTO-CAND2
acl2-8.5>  MERGE-CANDIDATES
acl2-8.5>  CONTROLLER-VARIABLES1
acl2-8.5>  CONTROLLER-VARIABLES
acl2-8.5>  INDUCT-VARS1
acl2-8.5>  INDUCT-VARS
acl2-8.5>  VETOEDP
acl2-8.5>  COMPUTE-VETOES1
acl2-8.5>  COMPUTE-VETOES2
acl2-8.5>  COMPUTE-VETOES
acl2-8.5>  INDUCTION-COMPLEXITY1
acl2-8.5>  MAXIMAL-ELEMENTS-APPLY
acl2-8.5>  MAXIMAL-ELEMENTS1
acl2-8.5>  MAXIMAL-ELEMENTS
acl2-8.5>  INTERSECTP-EQ/UNION-EQUAL
acl2-8.5>  EQUAL/UNION-EQUAL
acl2-8.5>  SUBSETP-EQUAL/SMALLER
acl2-8.5>  M&M-APPLY
acl2-8.5>  COUNT-OFF
acl2-8.5>  M&M-SEARCH
acl2-8.5>  M&M1
acl2-8.5>  M&M
acl2-8.5>  CONS-SUBSET-TREE
acl2-8.5>  CAR-SUBSET-TREE
acl2-8.5>  CDR-SUBSET-TREE
acl2-8.5>  OR-SUBSET-TREES
acl2-8.5>  M&M-OVER-POWERSET1
acl2-8.5>  M&M-OVER-POWERSET
acl2-8.5>  ALL-PICKS2
acl2-8.5>  ALL-PICKS2R
acl2-8.5>  ALL-PICKS1
acl2-8.5>  ALL-PICKS
acl2-8.5>  DUMB-NEGATE-LIT-LST-LST
acl2-8.5>  INDUCTION-HYP-CLAUSE-SEGMENTS2
acl2-8.5>  INDUCTION-HYP-CLAUSE-SEGMENTS1
acl2-8.5>  INDUCTION-HYP-CLAUSE-SEGMENTS
acl2-8.5>  INDUCTION-FORMULA3
acl2-8.5>  INDUCTION-FORMULA2
acl2-8.5>  INDUCTION-FORMULA1
acl2-8.5>  INDUCTION-FORMULA
acl2-8.5>  ALL-PICKS-SIZE
acl2-8.5>  INDUCTION-FORMULA-SIZE1
acl2-8.5>  INDUCTION-FORMULA-SIZE
acl2-8.5>  *MAXIMUM-INDUCT-SIZE*
acl2-8.5>  TERMIFY-CLAUSE-SET
acl2-8.5>  INFORM-SIMPLIFY3
acl2-8.5>  INFORM-SIMPLIFY2
acl2-8.5>  INFORM-SIMPLIFY1
acl2-8.5>  INFORM-SIMPLIFY
acl2-8.5>  ALL-VARS1-LST-LST
acl2-8.5>  GEN-NEW-NAME1
acl2-8.5>  GEN-NEW-NAME
acl2-8.5>  UNMEASURED-VARIABLES3
acl2-8.5>  UNMEASURED-VARIABLES2
acl2-8.5>  UNMEASURED-VARIABLES1
acl2-8.5>  UNMEASURED-VARIABLES
acl2-8.5>  TILDE-@-WELL-FOUNDED-RELATION-PHRASE
acl2-8.5>  MEASURED-VARIABLES
acl2-8.5>  INDUCT-MSG/CONTINUE
acl2-8.5>  (REC-FNNAMES REC-FNNAMES-LST)
acl2-8.5>  INDUCT-MSG/LOSE
acl2-8.5>  SET-DIFFERENCE-AUGMENTED-THEORIES
acl2-8.5>  LOAD-HINT-SETTINGS-INTO-RCNST
acl2-8.5>  UPDATE-HINT-SETTINGS
acl2-8.5>  LOAD-HINT-SETTINGS-INTO-PSPV
acl2-8.5>  RESTORE-HINT-SETTINGS-IN-PSPV
acl2-8.5>  REMOVE-TRIVIAL-CLAUSES
acl2-8.5>  REMOVE-ADJACENT-DUPLICATES-EQ
acl2-8.5>  INDUCT
acl2-8.5>  PAIR-VARS-WITH-LITS
acl2-8.5>  (FFNNAMES-SUBSETP FFNNAMES-SUBSETP-LISTP)
acl2-8.5>  PROBABLY-NOT-VALIDP
acl2-8.5>  IRRELEVANT-LITS
acl2-8.5>  ELIMINATE-IRRELEVANCE-CLAUSE
acl2-8.5>  ELIMINATE-IRRELEVANCE-CLAUSE-MSG1
acl2-8.5> 
acl2-8.5> Finished loading "induct.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "proof-builder-pkg.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  "ACL2-PC"
acl2-8.5> 
acl2-8.5> Finished loading "proof-builder-pkg.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "doc.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  *ACL2-SYSTEM-DOCUMENTATION*
acl2-8.5> 
acl2-8.5> Finished loading "doc.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "history-management.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  WEAK-GOAL-TREE-P
acl2-8.5>  START-PROOF-TREE-FN
acl2-8.5>  START-PROOF-TREE
acl2-8.5>  CHECKPOINT-FORCED-GOALS
acl2-8.5>  STOP-PROOF-TREE-FN
acl2-8.5>  STOP-PROOF-TREE
acl2-8.5>  (INSERT-INTO-GOAL-TREE-REC INSERT-INTO-GOAL-TREE-LST)
acl2-8.5>  INSERT-INTO-GOAL-TREE
acl2-8.5>  SET-DIFFERENCE-EQUAL-CHANGEDP
acl2-8.5>  (PRUNE-GOAL-TREE PRUNE-GOAL-TREE-LST)
acl2-8.5>  PRUNE-PROOF-TREE
acl2-8.5>  PRINT-STRING-REPEAT
acl2-8.5>  *FORMAT-PROC-ALIST*
acl2-8.5>  FORMAT-FORCED-SUBGOALS
acl2-8.5>  FORMAT-PROCESSOR
acl2-8.5>  (FORMAT-GOAL-TREE-LST FORMAT-GOAL-TREE)
acl2-8.5>  FORMAT-PROOF-TREE
acl2-8.5>  PRINT-PROOF-TREE1
acl2-8.5>  *PROOF-FAILURE-STRING*
acl2-8.5>  PRINT-PROOF-TREE-CTX
acl2-8.5>  *PROOF-TREE-START-DELIMITER*
acl2-8.5>  *PROOF-TREE-END-DELIMITER*
acl2-8.5>  PRINT-PROOF-TREE-FINISH
acl2-8.5>  PRINT-PROOF-TREE
acl2-8.5>  (DECORATE-FORCED-GOALS-1 DECORATE-FORCED-GOALS-1-LST)
acl2-8.5>  DECORATE-FORCED-GOALS
acl2-8.5>  DECORATE-FORCED-GOALS-IN-PROOF-TREE
acl2-8.5>  ASSUMNOTE-LIST-TO-CLAUSE-ID-LIST
acl2-8.5>  ASSUMNOTE-LIST-LIST-TO-CLAUSE-ID-LIST-LIST
acl2-8.5>  EXTEND-PROOF-TREE-FOR-FORCING-ROUND
acl2-8.5>  INITIALIZE-PROOF-TREE1
acl2-8.5>  INITIALIZE-PROOF-TREE
acl2-8.5>  *STAR-1-CLAUSE-ID*
acl2-8.5>  (REVERT-GOAL-TREE-REC REVERT-GOAL-TREE-LST)
acl2-8.5>  REVERT-GOAL-TREE
acl2-8.5>  WEAK-POOL-ELEMENT-P
acl2-8.5>  POOL-LST1
acl2-8.5>  POOL-LST
acl2-8.5>  INCREMENT-PROOF-TREE
acl2-8.5>  GOAL-TREE-WITH-CL-ID
acl2-8.5>  (GOAL-TREE-CHOOSE-DISJUNCT-REC GOAL-TREE-CHOOSE-DISJUNCT-LST)
acl2-8.5>  GOAL-TREE-CHOOSE-DISJUNCT
acl2-8.5>  INSTALL-DISJUNCT-INTO-PROOF-TREE
acl2-8.5>  LOGICAL-NAMEP
acl2-8.5>  LOGICAL-NAME-TYPE-STRING
acl2-8.5>  SCAN-TO-COMMAND
acl2-8.5>  UPDATE-WORLD-INDEX
acl2-8.5>  STORE-ABSOLUTE-EVENT-NUMBER
acl2-8.5>  THE-NAMEX-SYMBOL-CLASS1
acl2-8.5>  THE-NAMEX-SYMBOL-CLASS
acl2-8.5>  ADD-EVENT-LANDMARK
acl2-8.5>  ER-DECODE-LOGICAL-NAME
acl2-8.5>  RENEW-LEMMAS
acl2-8.5>  RENEW-NAME/ERASE
acl2-8.5>  RENEW-NAME/OVERWRITE
acl2-8.5>  RENEW-NAME
acl2-8.5>  RENEW-NAMES
acl2-8.5>  COLLECT-REDEFINED
acl2-8.5>  SCRUNCH-EQ
acl2-8.5>  PRINT-REDEFINITION-WARNING
acl2-8.5>  CLEAR-EVENT-DATA
acl2-8.5>  GET-EVENT-DATA
acl2-8.5>  PUT-EVENT-DATA
acl2-8.5>  LAST-PROVER-STEPS
acl2-8.5>  INITIALIZE-SUMMARY-ACCUMULATORS
acl2-8.5>  CLEAR-WARNING-SUMMARIES-ALIST
acl2-8.5>  CLEAR-WARNING-SUMMARIES
acl2-8.5>  PRINT-WARNINGS-SUMMARY
acl2-8.5>  SKIP-PROOF-TREE-TIME
acl2-8.5>  PRINT-TIME-SUMMARY
acl2-8.5>  PROVER-STEPS
acl2-8.5>  PRINT-STEPS-SUMMARY
acl2-8.5>  *GAG-PREFIX*
acl2-8.5>  *GAG-SUFFIX*
acl2-8.5>  GAG-START-MSG
acl2-8.5>  PRINT-GAG-INFO
acl2-8.5>  SET-CHECKPOINT-SUMMARY-LIMIT-FN
acl2-8.5>  SET-CHECKPOINT-SUMMARY-LIMIT
acl2-8.5>  CHECKPOINT-SUMMARY-LIMIT
acl2-8.5>  PRINT-GAG-STACK-REV
acl2-8.5>  REVERSE-GAG-STACK
acl2-8.5>  PRINT-GAG-STATE-ABORT-STACK-MSG
acl2-8.5>  PRINT-GAG-STATE1
acl2-8.5>  SAVE-AND-PRINT-GAG-STATE
acl2-8.5>  TILDE-@P
acl2-8.5>  PRINT-FAILURE1
acl2-8.5>  PRINT-FAILURE
acl2-8.5>  INITIALIZE-EVENT-USER
acl2-8.5>  FINALIZE-EVENT-USER
acl2-8.5>  LMI-SEED
acl2-8.5>  LMI-TECHS
acl2-8.5>  LMI-SEED-LST
acl2-8.5>  LMI-TECHS-LST
acl2-8.5>  LMI-SEEDS-INFO
acl2-8.5>  PRINT-RUNES-SUMMARY
acl2-8.5>  USE-NAMES-IN-TTREE
acl2-8.5>  BY-NAMES-IN-TTREE
acl2-8.5>  WEAK-CLAUSE-PROCESSOR-HINT-P
acl2-8.5>  COLLECT-NON-HINT-EVENTS
acl2-8.5>  HINT-EVENTS-SYMBOLS
acl2-8.5>  GET-SUMMARY-DATA
acl2-8.5>  CL-PROC-DATA-IN-TTREE-1
acl2-8.5>  CL-PROC-DATA-IN-TTREE
acl2-8.5>  HINT-EVENT-NAMES-IN-TTREE
acl2-8.5>  PRINT-HINT-EVENTS-SUMMARY
acl2-8.5>  PRINT-SPLITTER-RULES-SUMMARY-1
acl2-8.5>  PRINT-SPLITTER-RULES-SUMMARY
acl2-8.5>  PRINT-RULES-AND-HINT-EVENTS-SUMMARY
acl2-8.5>  MODIFIED-SYSTEM-ATTACHMENT
acl2-8.5>  MODIFIED-SYSTEM-ATTACHMENTS-1
acl2-8.5>  MODIFIED-SYSTEM-ATTACHMENTS
acl2-8.5>  PRINT-SYSTEM-ATTACHMENTS-SUMMARY
acl2-8.5>  PRINT-SUMMARY
acl2-8.5>  WITH-PROVER-STEP-LIMIT-FN
acl2-8.5>  WITH-PROVER-STEP-LIMIT
acl2-8.5>  WITH-PROVER-STEP-LIMIT!
acl2-8.5>  WEAK-PROVED-FUNCTIONAL-INSTANCES-ALIST-ENTRY-P
acl2-8.5>  SUPPLY-NAME-FOR-PROVED-FUNCTIONAL-INSTANCES-ALIST-ENTRY
acl2-8.5>  PROVED-FUNCTIONAL-INSTANCES-FROM-TAGGED-OBJECTS
acl2-8.5>  ADD-COMMAND-LANDMARK
acl2-8.5>  FIND-LONGEST-COMMON-RETRACTION1
acl2-8.5>  FIND-LONGEST-COMMON-RETRACTION1-EVENT
acl2-8.5>  FIND-LONGEST-COMMON-RETRACTION
acl2-8.5>  INSTALL-GLOBAL-ENABLED-STRUCTURE
acl2-8.5>  RETRACT-STOBJ-TABLES
acl2-8.5>  SET-W
acl2-8.5>  SET-W!
acl2-8.5>  SAVE-EVENT-STATE-GLOBALS
acl2-8.5>  *PROTECTED-SYSTEM-STATE-GLOBALS*
acl2-8.5>  STATE-GLOBAL-BINDINGS
acl2-8.5>  *PROTECTED-SYSTEM-STATE-GLOBAL-BINDINGS*
acl2-8.5>  PROTECT-SYSTEM-STATE-GLOBALS
acl2-8.5>  FORMAL-VALUE-TRIPLE
acl2-8.5>  TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
acl2-8.5>  XTRANS-EVAL
acl2-8.5>  XTRANS-EVAL-STATE-FN-ATTACHMENT
acl2-8.5>  WITH-CTX-SUMMARIZED
acl2-8.5>  REVERT-WORLD-ON-ERROR
acl2-8.5>  CHK-THEORY-EXPR-VALUE1
acl2-8.5>  CHK-THEORY-EXPR-VALUE
acl2-8.5>  THEORY-FN-TRANSLATED-CALLP
acl2-8.5>  EVAL-THEORY-EXPR
acl2-8.5>  APPEND-STRIP-CARS
acl2-8.5>  APPEND-STRIP-CDRS
acl2-8.5>  NO-RUNE-BASED-ON
acl2-8.5>  REVAPPEND-DELETE-RUNES-BASED-ON-SYMBOLS1
acl2-8.5>  REVAPPEND-DELETE-RUNES-BASED-ON-SYMBOLS
acl2-8.5>  CURRENT-THEORY1
acl2-8.5>  FIRST-N-AC-REV
acl2-8.5>  LONGEST-COMMON-TAIL-LENGTH-REC
acl2-8.5>  LONGEST-COMMON-TAIL-LENGTH
acl2-8.5>  EXTEND-CURRENT-THEORY
acl2-8.5>  UPDATE-CURRENT-THEORY
acl2-8.5>  PUT-CLTL-COMMAND
acl2-8.5>  STRIP-NON-NIL-BASE-SYMBOLS
acl2-8.5>  INSTALL-PROOF-SUPPORTERS
acl2-8.5>  UPDATE-W
acl2-8.5>  SKIP-PROOFS-DUE-TO-SYSTEM
acl2-8.5>  SET-CERT-REPLAY-P
acl2-8.5>  INSTALL-EVENT
acl2-8.5>  STOP-REDUNDANT-EVENT-FN1
acl2-8.5>  STOP-REDUNDANT-EVENT-FN
acl2-8.5>  STOP-REDUNDANT-EVENT
acl2-8.5>  WEAK-COMMAND-NUMBER-BASELINE-INFO-P
acl2-8.5>  ABSOLUTE-TO-RELATIVE-COMMAND-NUMBER
acl2-8.5>  RELATIVE-TO-ABSOLUTE-COMMAND-NUMBER
acl2-8.5>  NORMALIZE-ABSOLUTE-COMMAND-NUMBER
acl2-8.5>  TREE-OCCUR
acl2-8.5>  CD-FORM-MATCHP
acl2-8.5>  CD-SOME-EVENT-MATCHP
acl2-8.5>  CD-SEARCH
acl2-8.5>  SUPERIOR-COMMAND-WORLD
acl2-8.5>  ER-DECODE-CD
acl2-8.5>  WEAK-LDD-STATUS-P
acl2-8.5>  MAKE-LDD-FLAGS
acl2-8.5>  MAKE-LDD
acl2-8.5>  ACCESS-LDD-CLASS
acl2-8.5>  ACCESS-LDD-MARKP
acl2-8.5>  ACCESS-LDD-STATUS
acl2-8.5>  ACCESS-LDD-FULLP
acl2-8.5>  ACCESS-LDD-N
acl2-8.5>  ACCESS-LDD-FORM
acl2-8.5>  BIG-D-LITTLE-D-NAME1
acl2-8.5>  BIG-D-LITTLE-D-NAME
acl2-8.5>  BIG-D-LITTLE-D-CLIQUE1
acl2-8.5>  BIG-D-LITTLE-D-CLIQUE
acl2-8.5>  BIG-D-LITTLE-D-EVENT
acl2-8.5>  BIG-D-LITTLE-D-COMMAND-BLOCK
acl2-8.5>  BIG-M-LITTLE-M-NAME
acl2-8.5>  BIG-M-LITTLE-M-CLIQUE1
acl2-8.5>  BIG-M-LITTLE-M-CLIQUE
acl2-8.5>  BIG-M-LITTLE-M-EVENT
acl2-8.5>  BIG-M-LITTLE-M-COMMAND-BLOCK
acl2-8.5>  SYMBOL-CLASS-CHAR
acl2-8.5>  DEFUN-MODE-STRING
acl2-8.5>  BIG-C-LITTLE-C-EVENT
acl2-8.5>  BIG-C-LITTLE-C-COMMAND-BLOCK
acl2-8.5>  PRINT-LDD-FULL-OR-SKETCH/MUTUAL-RECURSION
acl2-8.5>  PRINT-LDD-FULL-OR-SKETCH/ENCAPSULATE
acl2-8.5>  NORMALIZE-CHAR
acl2-8.5>  NORMALIZE-STRING1
acl2-8.5>  NORMALIZE-STRING
acl2-8.5>  STRING-MATCHP
acl2-8.5>  PRINT-LDD-FULL-OR-SKETCH
acl2-8.5>  WITH-BASE-10
acl2-8.5>  PRINT-LDD-FORMULA-COLUMN
acl2-8.5>  PRINT-LDD
acl2-8.5>  PRINT-LDDS
acl2-8.5>  MAKE-COMMAND-LDD
acl2-8.5>  EXTEND-PE-TABLE
acl2-8.5>  PE-EVENT-FORM
acl2-8.5>  MAKE-EVENT-LDD
acl2-8.5>  MAKE-LDDS-COMMAND-SEQUENCE
acl2-8.5>  MAKE-LDDS-COMMAND-BLOCK1
acl2-8.5>  MAKE-LDDS-COMMAND-BLOCK
acl2-8.5>  ENS-MAYBE-BRR
acl2-8.5>  PCB-PCB!-FN
acl2-8.5>  PCB!-FN
acl2-8.5>  PCB-FN
acl2-8.5>  PCB!
acl2-8.5>  PC-FN
acl2-8.5>  PC
acl2-8.5>  PCS-FN
acl2-8.5>  PCS
acl2-8.5>  GET-COMMAND-SEQUENCE-FN1
acl2-8.5>  GET-COMMAND-SEQUENCE-FN
acl2-8.5>  GET-COMMAND-SEQUENCE
acl2-8.5>  GCS
acl2-8.5>  PBT
acl2-8.5>  PCB
acl2-8.5>  PRINT-INDENTED-LIST-MSG
acl2-8.5>  PRINT-INDENTED-LIST
acl2-8.5>  RELATIVIZE-BOOK-PATH
acl2-8.5>  RELATIVIZE-BOOK-PATH-LST
acl2-8.5>  PRINT-BOOK-PATH
acl2-8.5>  PE-FN1
acl2-8.5>  PE-FN2
acl2-8.5>  PE-FN-MAIN
acl2-8.5>  PE-FN
acl2-8.5>  PE
acl2-8.5>  PE!
acl2-8.5>  GTHM
acl2-8.5>  TTHM
acl2-8.5>  COMMAND-BLOCK-NAMES1
acl2-8.5>  COMMAND-BLOCK-NAMES
acl2-8.5>  SYMBOL-NAME-LST
acl2-8.5>  ACL2-QUERY-SIMULATE-INTERACTION
acl2-8.5>  ACL2-QUERY1
acl2-8.5>  ACL2-QUERY
acl2-8.5>  COLLECT-NAMES-IN-DEFUN-MODES
acl2-8.5>  UBT-UBU-QUERY
acl2-8.5>  UBT?
acl2-8.5>  UBT
acl2-8.5>  UBT!
acl2-8.5>  UBU?
acl2-8.5>  UBU
acl2-8.5>  UBU!
acl2-8.5>  U
acl2-8.5>  CHK-VIRGIN-MSG
acl2-8.5>  CHK-VIRGIN
acl2-8.5>  CHK-BOOT-STRAP-REDEFINEABLE-NAMEP
acl2-8.5>  MAYBE-COERCE-OVERWRITE-TO-ERASE
acl2-8.5>  REDEFINITION-RENEWAL-MODE
acl2-8.5>  REDEFINED-NAMES1
acl2-8.5>  REDEFINED-NAMES
acl2-8.5>  CHK-REDEFINEABLE-NAMEP
acl2-8.5>  CHK-JUST-NEW-NAME
acl2-8.5>  NO-NEW-NAMESP
acl2-8.5>  CHK-JUST-NEW-NAMES-REC
acl2-8.5>  CHK-JUST-NEW-NAMES
acl2-8.5>  ALPHA-<
acl2-8.5>  MERGE-ALPHA-<
acl2-8.5>  MERGE-SORT-ALPHA-<
acl2-8.5>  PUTPROP-UNLESS
acl2-8.5>  REDEFINED-WARNING
acl2-8.5>  REDUNDANT-LABELP
acl2-8.5>  MAKE-CTX-FOR-EVENT
acl2-8.5>  DEFLABEL-FN
acl2-8.5>  DEGREE-OF-MATCH2
acl2-8.5>  DEGREE-OF-MATCH1
acl2-8.5>  DEGREE-OF-MATCH
acl2-8.5>  FIND-LIKELY-NEAR-MISSES
acl2-8.5>  PRINT-DOC-DWIM
acl2-8.5>  DOC-FN
acl2-8.5>  DOC
acl2-8.5>  HELP
acl2-8.5>  TRANS-FN
acl2-8.5>  TRANS!-FN
acl2-8.5>  TRANS
acl2-8.5>  TRANS!
acl2-8.5>  TRANS1-FN
acl2-8.5>  TRANS1
acl2-8.5>  TRANSLAM
acl2-8.5>  TILDE-*-PROPS-FN-PHRASE1
acl2-8.5>  TILDE-*-PROPS-FN-PHRASE
acl2-8.5>  PROPS-FN
acl2-8.5>  PROPS
acl2-8.5>  WALKABOUT-NTH
acl2-8.5>  WALKABOUT-IP
acl2-8.5>  WALKABOUT-HUH
acl2-8.5>  WALKABOUT1
acl2-8.5>  WALKABOUT
acl2-8.5>  WALKABOUT=-FN
acl2-8.5>  WALKABOUT=
acl2-8.5>  LOOKUP-BDDNOTE
acl2-8.5>  UPDATE-BDDNOTE-WITH-TERM
acl2-8.5>  SHOW-BDD
acl2-8.5>  SHOW-BDD-GOAL
acl2-8.5>  MERGE-CAR-TERM-ORDER
acl2-8.5>  MERGE-SORT-CAR-TERM-ORDER
acl2-8.5>  FALSIFYING-PAIR-P
acl2-8.5>  BOGUS-FALSIFYING-ASSIGNMENT-VAR
acl2-8.5>  SHOW-FALSIFYING-ASSIGNMENT
acl2-8.5>  SHOW-BDD-TERM
acl2-8.5>  TILDE-*-SUBSTITUTION-PHRASE1
acl2-8.5>  TILDE-*-SUBSTITUTION-PHRASE
acl2-8.5>  SHOW-BDD-BACKTRACE
acl2-8.5>  SHOW-BDD-FN
acl2-8.5>  GET-DOCS
acl2-8.5>  GET-GUARDSP
acl2-8.5>  *NO-MEASURE*
acl2-8.5>  GET-MEASURES1
acl2-8.5>  GET-MEASURES2
acl2-8.5>  GET-MEASURES
acl2-8.5>  *NO-RULER-EXTENDERS*
acl2-8.5>  *BASIC-RULER-EXTENDERS*
acl2-8.5>  *BASIC-RULER-EXTENDERS-PLUS-LAMBDAS*
acl2-8.5>  GET-RULER-EXTENDERS1
acl2-8.5>  GET-RULER-EXTENDERS2
acl2-8.5>  DEFAULT-RULER-EXTENDERS-FROM-TABLE
acl2-8.5>  DEFAULT-RULER-EXTENDERS
acl2-8.5>  GET-RULER-EXTENDERS-LST
acl2-8.5>  GET-HINTS1
acl2-8.5>  GET-HINTS
acl2-8.5>  GET-GUARD-HINTS1
acl2-8.5>  GET-GUARD-HINTS
acl2-8.5>  GET-NORMALIZEP
acl2-8.5>  GET-NORMALIZEPS
acl2-8.5>  CHK-XARGS-KEYWORDS1
acl2-8.5>  CHK-XARGS-KEYWORDS
acl2-8.5>  GET-NAMES
acl2-8.5>  GET-BODIES
acl2-8.5>  (FIND-NONTRIVIAL-RULERS FIND-NONTRIVIAL-RULERS-LST)
acl2-8.5>  TILDE-@-FREE-VARS-PHRASE
acl2-8.5>  CHK-FREE-VARS
acl2-8.5>  CHK-DECLARED-IGNORES
acl2-8.5>  CHK-FREE-AND-IGNORED-VARS
acl2-8.5>  CHK-FREE-AND-IGNORED-VARS-LSTS
acl2-8.5>  PUTPROP-X-LST1
acl2-8.5>  PUTPROP-X-LST2
acl2-8.5>  PUTPROP-X-LST2-UNLESS
acl2-8.5>  TRANSLATE-TERM-LST
acl2-8.5>  FIND-NAMED-LEMMA
acl2-8.5>  FIND-RUNED-LEMMA
acl2-8.5>  (FREE-VARSP-MEMBER FREE-VARSP-MEMBER-LST)
acl2-8.5>  TRANSLATE-EXPAND-TERM1
acl2-8.5>  TRANSLATE-EXPAND-TERM
acl2-8.5>  TRANSLATE-EXPAND-HINT1
acl2-8.5>  TRANSLATE-EXPAND-HINT
acl2-8.5>  CONS-ALL-TO-LST
acl2-8.5>  TRANSLATE-SUBSTITUTION
acl2-8.5>  TRANSLATE-SUBSTITUTION-LST
acl2-8.5>  GET-REWRITE-AND-DEFN-RUNES-FROM-RUNIC-MAPPING-PAIRS
acl2-8.5>  TRANSLATE-RESTRICT-HINT
acl2-8.5>  *DO-NOT-PROCESSES*
acl2-8.5>  COERCE-TO-PROCESS-NAME-LST
acl2-8.5>  COERCE-TO-ACL2-PACKAGE-LST
acl2-8.5>  CHK-DO-NOT-EXPR-VALUE
acl2-8.5>  TRANSLATE-DO-NOT-HINT
acl2-8.5>  TRANSLATE-DO-NOT-INDUCT-HINT
acl2-8.5>  TRANSLATE-HANDS-OFF-HINT1
acl2-8.5>  TRANSLATE-HANDS-OFF-HINT
acl2-8.5>  TRUNCATED-CLASS
acl2-8.5>  TESTS-AND-ALISTS-LST-FROM-FN
acl2-8.5>  COROLLARY
acl2-8.5>  FORMULA
acl2-8.5>  PF-INDUCTION-SCHEME
acl2-8.5>  PF-FN
acl2-8.5>  PF
acl2-8.5>  MERGE-SYMBOL<
acl2-8.5>  MERGE-SORT-SYMBOL<
acl2-8.5>  *NON-INSTANTIABLE-PRIMITIVES*
acl2-8.5>  INSTANTIABLEP
acl2-8.5>  CONSTRAINT-INFO
acl2-8.5>  CHK-EQUAL-ARITIES
acl2-8.5>  EXTEND-SORTED-SYMBOL-ALIST
acl2-8.5>  TRANSLATE-FUNCTIONAL-SUBSTITUTION
acl2-8.5>  (SUBLIS-FN-REC SUBLIS-FN-REC-LST)
acl2-8.5>  SUBLIS-FN
acl2-8.5>  SUBLIS-FN-SIMPLE
acl2-8.5>  SUBLIS-FN-LST-SIMPLE
acl2-8.5>  (INSTANTIABLE-FFN-SYMBS INSTANTIABLE-FFN-SYMBS-LST)
acl2-8.5>  UNKNOWN-CONSTRAINTS-P
acl2-8.5>  UNKNOWN-CONSTRAINTS-SUPPORTERS
acl2-8.5>  COLLECT-INSTANTIABLEP1
acl2-8.5>  ALL-INSTANTIABLEP
acl2-8.5>  COLLECT-INSTANTIABLEP
acl2-8.5>  IMMEDIATE-INSTANTIABLE-ANCESTORS
acl2-8.5>  INSTANTIABLE-ANCESTORS
acl2-8.5>  (HITP HITP-LST)
acl2-8.5>  EVENT-RESPONSIBLE-FOR-PROVED-CONSTRAINT
acl2-8.5>  GETPROP-X-LST
acl2-8.5>  FILTER-HITPS
acl2-8.5>  RELEVANT-CONSTRAINTS1
acl2-8.5>  RELEVANT-CONSTRAINTS1-AXIOMS
acl2-8.5>  RELEVANT-CONSTRAINTS
acl2-8.5>  (BOUND-VARS BOUND-VARS-LST)
acl2-8.5>  TRANSLATE-LMI/INSTANCE-FIX-ALIST
acl2-8.5>  TRANSLATE-LMI/INSTANCE
acl2-8.5>  FN-SUBST-FREE-VARS
acl2-8.5>  FN-SUBST-RENAMING-ALIST
acl2-8.5>  REMOVE-CAPTURE-IN-CONSTRAINT-LST
acl2-8.5>  TRANSLATE-LMI/FUNCTIONAL-INSTANCE
acl2-8.5>  WEAK-TESTS-AND-CALL-P
acl2-8.5>  (ALL-CALLS ALL-CALLS-LST)
acl2-8.5>  ALL-CALLS-ALIST
acl2-8.5>  TERMINATION-MACHINE1
acl2-8.5>  (FFNNAMESP-EQ FFNNAMESP-EQ-LST)
acl2-8.5>  MEMBER-EQ-ALL
acl2-8.5>  *EQUALITY-ALIASES*
acl2-8.5>  TERM-EQUATED-TO-CONSTANT
acl2-8.5>  TERM-EQUATED-TO-CONSTANT-IN-TERMLIST
acl2-8.5>  SIMPLIFY-TESTS
acl2-8.5>  ADD-TEST-SMART
acl2-8.5>  (CHOKE-ON-LOOP$-RECURSION1 CHOKE-ON-LOOP$-RECURSION1-LST)
acl2-8.5>  CHOKE-ON-LOOP$-RECURSION
acl2-8.5>  (ALL-LOOP$-SCION-QUOTE-LAMBDAS ALL-LOOP$-SCION-QUOTE-LAMBDAS-LST)
acl2-8.5>  (TERMINATION-MACHINE-REC TERMINATION-MACHINE-REC-FOR-LIST)
acl2-8.5>  TERMINATION-MACHINE
acl2-8.5>  TERMINATION-MACHINES
acl2-8.5>  MAYBE-ADD-EXTRA-INFO-LIT
acl2-8.5>  MEASURE-CLAUSE-FOR-BRANCH
acl2-8.5>  SPLIT-INITIAL-EXTRA-INFO-LITS
acl2-8.5>  CONJOIN-CLAUSE-TO-CLAUSE-SET-EXTRA-INFO1
acl2-8.5>  CONJOIN-CLAUSE-TO-CLAUSE-SET-EXTRA-INFO
acl2-8.5>  MEASURE-CLAUSES-FOR-FN1
acl2-8.5>  MEASURE-CLAUSES-FOR-FN
acl2-8.5>  CONJOIN-CLAUSE-SETS-EXTRA-INFO
acl2-8.5>  CONJOIN-CLAUSE-SETS+
acl2-8.5>  MEASURE-CLAUSES-FOR-CLIQUE
acl2-8.5>  TERMINATION-THEOREM-CLAUSES
acl2-8.5>  MEASURE-ALIST?
acl2-8.5>  RULER-EXTENDERS-LST
acl2-8.5>  GET-UNNORMALIZED-BODIES
acl2-8.5>  TERMINATION-THEOREM
acl2-8.5>  EVAL-GROUND-SUBEXPRESSIONS1-LST-LST
acl2-8.5>  EVAL-GROUND-SUBEXPRESSIONS-LST-LST
acl2-8.5>  SUBLIS-VAR-LST-LST
acl2-8.5>  ADD-SEGMENTS-TO-CLAUSE
acl2-8.5>  SIMPLIFY-CLAUSE-FOR-TERM-EQUAL-CONST-1
acl2-8.5>  SIMPLIFY-CLAUSE-FOR-TERM-EQUAL-CONST
acl2-8.5>  ADD-LITERAL-SMART
acl2-8.5>  (ALL-VARS!1 ALL-VARS!1-LST)
acl2-8.5>  ALL-VARS!-OF-FN
acl2-8.5>  RECOVER-TYPE-SPEC-EXPRS1
acl2-8.5>  RECOVER-TYPE-SPEC-EXPRS
acl2-8.5>  TERMS-IN-VAR
acl2-8.5>  TYPE-SPECS-FOR-VAR
acl2-8.5>  RECOVER-FANCY-TARGETS
acl2-8.5>  RECOVER-DEEP-TARGETS
acl2-8.5>  VARS-SPECS-AND-TARGETS1
acl2-8.5>  VARS-SPECS-AND-TARGETS
acl2-8.5>  SPECIAL-CONJECTURES-C2
acl2-8.5>  SPECIAL-CONJECTURES-C1
acl2-8.5>  SPECIAL-CONJECTURES-C
acl2-8.5>  SPECIAL-LOOP$-SCION-CALLP
acl2-8.5>  (COLLECT-WARRANTED-FNS COLLECT-WARRANTED-FNS-LST)
acl2-8.5>  COLLECT-NEGATED-WARRANTS1
acl2-8.5>  COLLECT-NEGATED-WARRANTS
acl2-8.5>  ADD-LITERALS
acl2-8.5>  SPECIAL-CONJECTURES
acl2-8.5>  MAKE-LAMBDA-APPLICATION+
acl2-8.5>  MAKE-LAMBDA-APPLICATION+-LST
acl2-8.5>  SPLIT-ENV
acl2-8.5>  ADD-ENV-TO-CLAUSE-SET-1
acl2-8.5>  ADD-ENV-TO-CLAUSE-SET
acl2-8.5>  (GUARD-CLAUSES GUARD-CLAUSES-LST)
acl2-8.5>  GUARD-CLAUSES+
acl2-8.5>  GUARD-CLAUSES-FOR-BODY
acl2-8.5>  NORMALIZE-TS-BACKCHAIN-LIMIT-FOR-DEFS
acl2-8.5>  GUARD-CLAUSES-FOR-FN1
acl2-8.5>  GUARD-CLAUSES-FOR-FN1-LST
acl2-8.5>  COLLECT-WELL-FORMED-LAMBDA-OBJECTS
acl2-8.5>  COLLECT-WELL-FORMED-LAMBDA-OBJECTS-LST
acl2-8.5>  GUARD-CLAUSES-FOR-FN
acl2-8.5>  GUARD-CLAUSES-FOR-CLIQUE
acl2-8.5>  REMOVE-BUILT-IN-CLAUSES
acl2-8.5>  LENGTH-EXCEEDSP
acl2-8.5>  *HALF-LENGTH-INITIAL-BUILT-IN-CLAUSES*
acl2-8.5>  CLEAN-UP-CLAUSE-SET
acl2-8.5>  GUARD-THEOREM-SIMPLIFY-MSG
acl2-8.5>  GUARD-THEOREM
acl2-8.5>  GUARD-OR-TERMINATION-THEOREM-MSG
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  TERMINATION-THEOREM-FN-SUBST2
acl2-8.5>  TERMINATION-THEOREM-FN-SUBST1
acl2-8.5>  TERMINATION-THEOREM-FN-SUBST
acl2-8.5>  TRANSLATE-LMI
acl2-8.5>  TRANSLATE-USE-HINT1
acl2-8.5>  TRANSLATE-USE-HINT
acl2-8.5>  CONVERT-NAME-TREE-TO-NEW-NAME1
acl2-8.5>  CONVERT-NAME-TREE-TO-NEW-NAME
acl2-8.5>  TRANSLATE-BY-HINT
acl2-8.5>  TRANSLATE-CASES-HINT
acl2-8.5>  TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
acl2-8.5>  TRANSLATE-NO-OP-HINT
acl2-8.5>  TRANSLATE-ERROR-HINT
acl2-8.5>  TRANSLATE-INDUCT-HINT
acl2-8.5>  *BUILT-IN-EXECUTABLE-COUNTERPARTS*
acl2-8.5>  *S-PROP-THEORY*
acl2-8.5>  NEW-DISABLES
acl2-8.5>  SOME-NEW-DISABLES-1
acl2-8.5>  SOME-NEW-DISABLES
acl2-8.5>  SOME-NEW-ENABLES-1
acl2-8.5>  SOME-NEW-ENABLES
acl2-8.5>  TRANSLATE-IN-THEORY-HINT
acl2-8.5>  NON-FUNCTION-SYMBOLS
acl2-8.5>  COLLECT-NON-LOGIC-MODE
acl2-8.5>  TRANSLATE-BDD-HINT1
acl2-8.5>  TRANSLATE-BDD-HINT
acl2-8.5>  TRANSLATE-NONLINEARP-HINT
acl2-8.5>  TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
acl2-8.5>  TRANSLATE-NO-THANKS-HINT
acl2-8.5>  TRANSLATE-REORDER-HINT
acl2-8.5>  ARITY-MISMATCH-MSG
acl2-8.5>  MACRO-MINIMAL-ARITY1
acl2-8.5>  MACRO-MINIMAL-ARITY
acl2-8.5>  TRANSLATE-CLAUSE-PROCESSOR-HINT/SYMBOL-TO-CALL
acl2-8.5>  TRANSLATE-CLAUSE-PROCESSOR-HINT
acl2-8.5>  TRANSLATE-CUSTOM-KEYWORD-HINT
acl2-8.5>  CUSTOM-KEYWORD-HINT
acl2-8.5>  REMOVE-ALL-NO-OPS
acl2-8.5>  REMOVE-REDUNDANT-NO-OPS
acl2-8.5>  FIND-FIRST-CUSTOM-KEYWORD-HINT
acl2-8.5>  *CUSTOM-KEYWORD-MAX-ITERATIONS*
acl2-8.5>  CUSTOM-KEYWORD-HINT-INTERPRETER1
acl2-8.5>  CUSTOM-KEYWORD-HINT-INTERPRETER
acl2-8.5>  CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
acl2-8.5>  PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
acl2-8.5>  MAKE-DISJUNCTIVE-CLAUSE-ID
acl2-8.5>  MAKE-DISJUNCTIVE-GOAL-SPEC
acl2-8.5>  MINIMALLY-WELL-FORMED-OR-HINTP
acl2-8.5>  SPLIT-KEYWORD-ALIST
acl2-8.5>  DISTRIBUTE-OTHER-HINTS-INTO-OR1
acl2-8.5>  DISTRIBUTE-OTHER-HINTS-INTO-OR
acl2-8.5>  *HINT-EXPRESSION-BASIC-VARS*
acl2-8.5>  *HINT-EXPRESSION-OVERRIDE-VARS*
acl2-8.5>  *HINT-EXPRESSION-BACKTRACK-VARS*
acl2-8.5>  *HINT-EXPRESSION-ALL-VARS*
acl2-8.5>  TRANSLATE-HINT-EXPRESSION
acl2-8.5>  TRANSLATE-BACKTRACK-HINT
acl2-8.5>  TRANSLATE-RW-CACHE-STATE-HINT
acl2-8.5>  (TRANSLATE-OR-HINT TRANSLATE-HINT-SETTINGS
acl2-8.5>                     TRANSLATE-X-HINT-VALUE
acl2-8.5>                     REPLACE-GOAL-SPEC-IN-NAME-TREE1
acl2-8.5>                     REPLACE-GOAL-SPEC-IN-NAME-TREE
acl2-8.5>                     TRANSLATE-HINT)
acl2-8.5>  TRANSLATE-HINT-EXPRESSIONS
acl2-8.5>  CHECK-TRANSLATED-OVERRIDE-HINT
acl2-8.5>  TRANSLATE-HINTS1
acl2-8.5>  WARN-ON-DUPLICATE-HINT-GOAL-SPECS
acl2-8.5>  TRANSLATE-HINTS2
acl2-8.5>  OVERRIDE-HINTS
acl2-8.5>  TRANSLATE-HINTS
acl2-8.5>  TRANSLATE-HINTS+1
acl2-8.5>  TRANSLATE-HINTS+
acl2-8.5>  TRANSLATE-OVERRIDE-HINTS
acl2-8.5>  APPLY-OVERRIDE-HINT1
acl2-8.5>  APPLY-OVERRIDE-HINT
acl2-8.5>  APPLY-OVERRIDE-HINTS
acl2-8.5>  EVAL-AND-TRANSLATE-HINT-EXPRESSION
acl2-8.5>  TTAGS-SEEN
acl2-8.5>  ACTIVE-BOOK-NAME
acl2-8.5>  WEAK-DEFERRED-TTAG-NOTE-P
acl2-8.5>  FMS-TO-STANDARD-CO
acl2-8.5>  PRINT-TTAG-NOTE
acl2-8.5>  SHOW-TTAG-NOTES1
acl2-8.5>  SHOW-TTAG-NOTES-FN
acl2-8.5>  SHOW-TTAG-NOTES
acl2-8.5>  SET-DEFERRED-TTAG-NOTES
acl2-8.5>  TTAGS-FROM-DEFERRED-TTAG-NOTES1
acl2-8.5>  TTAGS-FROM-DEFERRED-TTAG-NOTES
acl2-8.5>  PRINT-DEFERRED-TTAG-NOTES-SUMMARY
acl2-8.5>  NOTIFY-ON-DEFTTAG
acl2-8.5>  TTAG-ALLOWED-P
acl2-8.5>  CHK-ACCEPTABLE-TTAG1
acl2-8.5>  CHK-ACCEPTABLE-TTAG
acl2-8.5>  CHK-ACCEPTABLE-TTAGS2
acl2-8.5>  CHK-ACCEPTABLE-TTAGS1
acl2-8.5>  CHK-TABLE-NIL-ARGS
acl2-8.5>  *BADGE-TABLE-GUARD-MSG*
acl2-8.5>  CHK-TABLE-GUARD
acl2-8.5>  CHK-TABLE-GUARDS-REC
acl2-8.5>  CHK-TABLE-GUARDS
acl2-8.5>  PUT-ASSOC-EQUAL-FAST
acl2-8.5>  GLOBAL-SET?
acl2-8.5>  CLTL-DEF-MEMOIZE-PARTIAL
acl2-8.5>  TABLE-CLTL-CMD
acl2-8.5>  TABLE-FN1
acl2-8.5>  TABLE-FN
acl2-8.5>  SET-OVERRIDE-HINTS-FN
acl2-8.5> 
acl2-8.5> Finished loading "history-management.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "prove.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  (ABBREVIATIONP1 ABBREVIATIONP1-LST)
acl2-8.5>  ABBREVIATIONP
acl2-8.5>  (ALL-VARS-BAG ALL-VARS-BAG-LST)
acl2-8.5>  FIND-ABBREVIATION-LEMMA
acl2-8.5>  (EXPAND-ABBREVIATIONS-WITH-LEMMA EXPAND-ABBREVIATIONS
acl2-8.5>                                   EXPAND-ABBREVIATIONS-LST)
acl2-8.5>  AND-ORP
acl2-8.5>  FIND-AND-OR-LEMMA
acl2-8.5>  EXPAND-AND-OR
acl2-8.5>  CLAUSIFY-INPUT1
acl2-8.5>  CLAUSIFY-INPUT1-LST
acl2-8.5>  CLAUSIFY-INPUT
acl2-8.5>  EXPAND-SOME-NON-REC-FNS-IN-CLAUSES
acl2-8.5>  NO-OP-HISTP
acl2-8.5>  (EXPAND-ANY-FINAL-IMPLIES1 EXPAND-ANY-FINAL-IMPLIES1-LST)
acl2-8.5>  EXPAND-ANY-FINAL-IMPLIES
acl2-8.5>  RW-CACHE-STATE
acl2-8.5>  MAKE-RCNST
acl2-8.5>  CHEAP-TYPE-ALIST-AND-POT-LST
acl2-8.5>  *TAU-TTREE*
acl2-8.5>  TAU-CLAUSEP
acl2-8.5>  TAU-CLAUSEP-LST-REC
acl2-8.5>  TAU-CLAUSEP-LST
acl2-8.5>  PRETTYIFY-CLAUSE-SIMPLE
acl2-8.5>  PREPROCESS-CLAUSE
acl2-8.5>  TILDE-*-PREPROCESS-PHRASE
acl2-8.5>  TILDE-*-RAW-PREPROCESS-PHRASE
acl2-8.5>  PREPROCESS-CLAUSE-MSG1
acl2-8.5>  MORE-THAN-SIMPLIFIEDP
acl2-8.5>  REMOVE1-ASSOC-EQ-LST
acl2-8.5>  DELETE-ASSUMPTIONS-1
acl2-8.5>  DELETE-ASSUMPTIONS
acl2-8.5>  INDUCTION-DEPTH-LIMIT
acl2-8.5>  PUSH-CLAUSE
acl2-8.5>  PUSH-CLAUSE-MSG1-ABORT
acl2-8.5>  PUSH-CLAUSE-MSG1
acl2-8.5>  CLAUSE-SET-SUBSUMES-1
acl2-8.5>  CLAUSE-SET-SUBSUMES
acl2-8.5>  PREPROCESS-CLAUSE?
acl2-8.5>  APPLY-USE-HINT-CLAUSES
acl2-8.5>  APPLY-CASES-HINT-CLAUSE
acl2-8.5>  NON-TERM-LISTP-MSG
acl2-8.5>  NON-TERM-LIST-LISTP-MSG
acl2-8.5>  ALL-FFN-SYMBS-LST-LST
acl2-8.5>  TILDE-@-UNKNOWN-NAMES-PHRASE
acl2-8.5>  TILDE-@-ILLEGAL-HINT-EVENTS-PHRASE
acl2-8.5>  COLLECT-NON-RUNES-FROM-SUMMARY-DATA
acl2-8.5>  TILDE-@-ILLEGAL-SUMMARY-DATA-PHRASE
acl2-8.5>  EVAL-CLAUSE-PROCESSOR
acl2-8.5>  APPLY-TOP-HINTS-CLAUSE1
acl2-8.5>  APPLY-TOP-HINTS-CLAUSE
acl2-8.5>  TILDE-@-LMI-PHRASE
acl2-8.5>  OR-HIT-MSG
acl2-8.5>  APPLY-TOP-HINTS-CLAUSE-MSG1
acl2-8.5>  PREVIOUS-PROCESS-WAS-SPECIOUSP
acl2-8.5>  *PREPROCESS-CLAUSE-LEDGE*
acl2-8.5>  WATERFALL-UPDATE-GAG-STATE
acl2-8.5>  RECORD-GAG-STATE
acl2-8.5>  GAG-STATE-EXITING-CL-ID
acl2-8.5>  REMOVE-POOL-LST-FROM-GAG-STATE
acl2-8.5>  POP-CLAUSE-UPDATE-GAG-STATE-POP
acl2-8.5>  GAG-MODE-JPPL-FLG
acl2-8.5>  SPLITTER-OUTPUT
acl2-8.5>  SET-SPLITTER-OUTPUT
acl2-8.5>  WATERFALL-MSG1
acl2-8.5>  IO?-PROVE-CW
acl2-8.5>  WATERFALL-PRINT-CLAUSE-BODY
acl2-8.5>  WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
acl2-8.5>  WATERFALL-PRINT-CLAUSE-ID
acl2-8.5>  PRINT-CLAUSE-ID-OKP
acl2-8.5>  PRINT-CLAUSE-ID-OKP-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  WATERFALL-PRINT-CLAUSE
acl2-8.5>  WATERFALL-MSG
acl2-8.5>  PUT-TTREE-INTO-PSPV
acl2-8.5>  SET-CL-IDS-OF-ASSUMPTIONS1
acl2-8.5>  SET-CL-IDS-OF-ASSUMPTIONS
acl2-8.5>  COLLECT-ASSUMPTIONS1
acl2-8.5>  COLLECT-ASSUMPTIONS
acl2-8.5>  LINKED-VARIABLES1
acl2-8.5>  LINKED-VARIABLES
acl2-8.5>  (CONTAINS-CONSTRAINED-CONSTANTP CONTAINS-CONSTRAINED-CONSTANTP-LST)
acl2-8.5>  DISVAR-TYPE-ALIST1
acl2-8.5>  COLLECT-ALL-VARS
acl2-8.5>  DISVAR-TYPE-ALIST
acl2-8.5>  UNENCUMBER-TYPE-ALIST
acl2-8.5>  UNENCUMBER-ASSUMPTION
acl2-8.5>  UNENCUMBER-ASSUMPTIONS
acl2-8.5>  DUMB-TYPE-ALIST-IMPLICATIONP1
acl2-8.5>  DUMB-TYPE-ALIST-IMPLICATIONP2
acl2-8.5>  DUMB-TYPE-ALIST-IMPLICATIONP
acl2-8.5>  PARTITION-ACCORDING-TO-ASSUMPTION-TERM
acl2-8.5>  EXISTS-ASSUMPTION-WITH-WEAKER-TYPE-ALIST
acl2-8.5>  ADD-ASSUMPTION-WITH-WEAK-TYPE-ALIST
acl2-8.5>  DUMB-KEEP-ASSUMPTIONS-WITH-WEAKEST-TYPE-ALISTS
acl2-8.5>  DUMB-ASSUMPTION-SUBSUMPTION1
acl2-8.5>  DUMB-ASSUMPTION-SUBSUMPTION
acl2-8.5>  CLAUSIFY-TYPE-ALIST
acl2-8.5>  CLAUSIFY-ASSUMPTION
acl2-8.5>  CLAUSIFY-ASSUMPTIONS
acl2-8.5>  STRIP-ASSUMPTION-TERMS
acl2-8.5>  ADD-SPLITTERS-TO-TTREE1
acl2-8.5>  ADD-SPLITTERS-TO-TTREE
acl2-8.5>  MAYBE-ADD-SPLITTERS-TO-TTREE
acl2-8.5>  EXTRACT-AND-CLAUSIFY-ASSUMPTIONS
acl2-8.5>  WATERFALL-STEP1
acl2-8.5>  PROCESS-BACKTRACK-HINT
acl2-8.5>  SET-RW-CACHE-STATE-IN-PSPV
acl2-8.5>  MAYBE-SET-RW-CACHE-STATE-DISABLED
acl2-8.5>  MAYBE-SET-RW-CACHE-STATE-ENABLED
acl2-8.5>  ACCUMULATE-RW-CACHE-INTO-PSPV
acl2-8.5>  ERASE-RW-CACHE-FROM-PSPV
acl2-8.5>  *SIMPLIFY-CLAUSE-LEDGE*
acl2-8.5>  *SIMPLIFY-CLAUSE-LEDGE-COMPLEMENT*
acl2-8.5>  WATERFALL-STEP-CLEANUP
acl2-8.5>  IPRINT-ORACLE-UPDATES
acl2-8.5>  IPRINT-ORACLE-UPDATES@PAR
acl2-8.5>  WATERFALL-STEP
acl2-8.5>  FIND-APPLICABLE-HINT-SETTINGS1
acl2-8.5>  FIND-APPLICABLE-HINT-SETTINGS
acl2-8.5>  THANKS-FOR-THE-HINT
acl2-8.5>  LMI-NAME-OR-RUNE
acl2-8.5>  ENABLED-LMI-NAMES1
acl2-8.5>  ENABLED-LMI-NAMES
acl2-8.5>  MAYBE-WARN-FOR-USE-HINT
acl2-8.5>  MAYBE-WARN-ABOUT-THEORY-SIMPLE
acl2-8.5>  MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
acl2-8.5>  WATERFALL-OR-HIT-MSG-A
acl2-8.5>  WATERFALL-OR-HIT-MSG-B
acl2-8.5>  TILDE-*-OR-HIT-SUMMARY-PHRASE1
acl2-8.5>  TILDE-*-OR-HIT-SUMMARY-PHRASE
acl2-8.5>  WATERFALL-OR-HIT-MSG-C
acl2-8.5>  (TERM-DIFFICULTY1 TERM-DIFFICULTY1-LST)
acl2-8.5>  TERM-DIFFICULTY
acl2-8.5>  CLAUSE-DIFFICULTY
acl2-8.5>  CLAUSE-SET-DIFFICULTY
acl2-8.5>  POOL-DIFFICULTY
acl2-8.5>  HOW-MANY-TO-BE-PROVED
acl2-8.5>  PICK-BEST-PSPV-FOR-WATERFALL0-OR-HIT1
acl2-8.5>  PICK-BEST-PSPV-FOR-WATERFALL0-OR-HIT
acl2-8.5>  CHANGE-OR-HIT-HISTORY-ENTRY
acl2-8.5>  PAIR-CL-ID-WITH-HINT-SETTING
acl2-8.5>  APPLY-REORDER-HINT-FRONT
acl2-8.5>  APPLY-REORDER-HINT-BACK
acl2-8.5>  FILTER->
acl2-8.5>  APPLY-REORDER-HINT
acl2-8.5>  ERASE-RW-CACHE-ANY-TAG-FROM-PSPV
acl2-8.5>  RESTORE-RW-CACHE-STATE-IN-PSPV
acl2-8.5>  WATERFALL1-WRAPPER
acl2-8.5>  (WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0
acl2-8.5>              WATERFALL0-OR-HIT WATERFALL1-LST)
acl2-8.5>  WATERFALL
acl2-8.5>  SOME-POOL-MEMBER-SUBSUMES
acl2-8.5>  ADD-TO-POP-HISTORY
acl2-8.5>  POP-CLAUSE1
acl2-8.5>  MAKE-DEFTHM-FORMS-FOR-BYES
acl2-8.5>  POP-CLAUSE-MSG1
acl2-8.5>  POP-CLAUSE-MSG
acl2-8.5>  SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY
acl2-8.5>  INCREMENT-PROOF-TREE-POP-CLAUSE
acl2-8.5>  POP-CLAUSE
acl2-8.5>  TILDE-@-ASSUMNOTES-PHRASE-LST
acl2-8.5>  TILDE-*-ASSUMNOTES-COLUMN-PHRASE
acl2-8.5>  TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE
acl2-8.5>  TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE
acl2-8.5>  PROCESS-ASSUMPTIONS-MSG1
acl2-8.5>  PROCESS-ASSUMPTIONS-MSG
acl2-8.5>  COUNT-ASSUMPTIONS
acl2-8.5>  ADD-TYPE-ALIST-RUNES-TO-TTREE1
acl2-8.5>  ADD-TYPE-ALIST-RUNES-TO-TTREE
acl2-8.5>  PROCESS-ASSUMPTIONS-TTREE
acl2-8.5>  PROCESS-ASSUMPTIONS
acl2-8.5>  DO-NOT-INDUCT-MSG
acl2-8.5>  PROVE-LOOP2
acl2-8.5>  PROVE-LOOP1
acl2-8.5>  PRINT-SUMMARY-ON-ERROR
acl2-8.5>  PROVE-LOOP0
acl2-8.5>  PROVE-LOOP
acl2-8.5>  MAKE-PSPV
acl2-8.5>  CHK-ASSUMPTION-FREE-TTREE
acl2-8.5>  PUSH-CURRENT-ACL2-WORLD
acl2-8.5>  POP-CURRENT-ACL2-WORLD
acl2-8.5>  REVERT-WORLD
acl2-8.5>  PROVE
acl2-8.5> 
acl2-8.5> Finished loading "prove.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "defuns.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  CERT-DATA-PAIR
acl2-8.5>  CERT-DATA-VAL
acl2-8.5>  CERT-DATA-ENTRY-PAIR
acl2-8.5>  CERT-DATA-ENTRY
acl2-8.5>  IN-ENCAPSULATEP
acl2-8.5>  (CONTAINS-LAMBDA-OBJECTP CONTAINS-LAMBDA-OBJECT-LISTP)
acl2-8.5>  STORE-CERT-DATA
acl2-8.5>  WEAK-TRANSLATE-CERT-DATA-RECORD-P
acl2-8.5>  UPDATE-TRANSLATE-CERT-DATA-FN
acl2-8.5>  UPDATE-TRANSLATE-CERT-DATA
acl2-8.5>  *MUTUAL-RECURSION-CTX-STRING*
acl2-8.5>  TRANSLATE-BODIES1
acl2-8.5>  CHK-NON-EXECUTABLE-BODIES
acl2-8.5>  COLLECT-UNTOUCHABLE-FNS
acl2-8.5>  COLLECT-UNTOUCHABLE-VARS
acl2-8.5>  GET-TRANSLATE-CERT-DATA-RECORD
acl2-8.5>  GET-TRANSLATE-BODIES
acl2-8.5>  TRANSLATE-BODIES
acl2-8.5>  CHK-MUTUAL-RECURSION-BAD-NAMES
acl2-8.5>  *CHK-MUTUAL-RECURSION-STRING*
acl2-8.5>  CHK-MUTUAL-RECURSION1
acl2-8.5>  CHK-MUTUAL-RECURSION
acl2-8.5>  (FFNNAMEP-MOD-MBE FFNNAMEP-MOD-MBE-LST)
acl2-8.5>  PUTPROP-RECURSIVEP-LST
acl2-8.5>  PROPER-DUMB-OCCUR-AS-OUTPUT
acl2-8.5>  ALWAYS-TESTED-AND-CHANGEDP
acl2-8.5>  GUESS-MEASURE
acl2-8.5>  GUESS-MEASURE-ALIST
acl2-8.5>  TILDE-*-MEASURE-PHRASE1
acl2-8.5>  TILDE-*-MEASURE-PHRASE
acl2-8.5>  FIND-?-MEASURE
acl2-8.5>  PROVE-TERMINATION
acl2-8.5>  PUTPROP-JUSTIFICATION-LST
acl2-8.5>  UNION-EQUAL-TO-END
acl2-8.5>  CROSS-TESTS-AND-CALLS3
acl2-8.5>  CROSS-TESTS-AND-CALLS2
acl2-8.5>  CROSS-TESTS-AND-CALLS1
acl2-8.5>  SUBLIS-TESTS-REV
acl2-8.5>  ALL-CALLS-TEST-ALIST
acl2-8.5>  CROSS-TESTS-AND-CALLS
acl2-8.5>  MARK-LOOP$-RECURSION-NUGGET
acl2-8.5>  MARKED-LOOP$-RECURSION-NUGGETP
acl2-8.5>  (INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST)
acl2-8.5>  SIMPLIFY-TESTS-AND-CALLS
acl2-8.5>  SIMPLIFY-TESTS-AND-CALLS-LST
acl2-8.5>  (LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST)
acl2-8.5>  INDUCTION-MACHINE-FOR-FN
acl2-8.5>  CLEAN-UP-NOTS
acl2-8.5>  CLEAN-UP-NOTS-LST
acl2-8.5>  CLEAN-UP-CONJUNCTION1
acl2-8.5>  CLEAN-UP-CONJUNCTION
acl2-8.5>  CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE
acl2-8.5>  INDUCTION-MACHINES
acl2-8.5>  PUTPROP-INDUCTION-MACHINE-LST
acl2-8.5>  QUICK-BLOCK-INITIAL-SETTINGS
acl2-8.5>  QUICK-BLOCK-INFO1
acl2-8.5>  QUICK-BLOCK-INFO2
acl2-8.5>  QUICK-BLOCK-SETTINGS
acl2-8.5>  QUICK-BLOCK-DOWN-T-MACHINE
acl2-8.5>  QUICK-BLOCK-INFO
acl2-8.5>  PUTPROP-QUICK-BLOCK-INFO-LST
acl2-8.5>  BIG-MUTREC
acl2-8.5>  GET-SIG-FNS1
acl2-8.5>  GET-SIG-FNS
acl2-8.5>  SELECTED-ALL-FNNAMES-LST
acl2-8.5>  SUBVERSIVEP
acl2-8.5>  SUBVERSIVE-CLIQUEP
acl2-8.5>  PROVE-TERMINATION-NON-RECURSIVE
acl2-8.5>  PROVE-TERMINATION-RECURSIVE
acl2-8.5>  PUT-INDUCTION-INFO-RECURSIVE
acl2-8.5>  MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE
acl2-8.5>  COLLECT-PROBLEMATIC-QUOTED-FNS
acl2-8.5>  MAYBE-WARN-ON-PROBLEMATIC-QUOTED-FNS
acl2-8.5>  PUT-INDUCTION-INFO
acl2-8.5>  DESTRUCTURE-DEFINITION
acl2-8.5>  MEMBER-REWRITE-RULE-RUNE
acl2-8.5>  REPLACE-REWRITE-RULE-RUNE
acl2-8.5>  PREPROCESS-HYP
acl2-8.5>  PREPROCESS-HYPS
acl2-8.5>  ADD-DEFINITION-RULE-WITH-TTREE
acl2-8.5>  ADD-DEFINITION-RULE
acl2-8.5>  PUTPROP-BODY-LST
acl2-8.5>  TYPE-SET-IMPLIED-BY-TERM1
acl2-8.5>  TYPE-SET-IMPLIED-BY-TERM
acl2-8.5>  PUTPROP-INITIAL-TYPE-PRESCRIPTIONS
acl2-8.5>  MAP-RETURNED-FORMALS-VIA-FORMALS
acl2-8.5>  MAP-TYPE-SETS-VIA-FORMALS
acl2-8.5>  VECTOR-TS-UNION
acl2-8.5>  MAP-CONS-TAG-TREES
acl2-8.5>  TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1
acl2-8.5>  TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE
acl2-8.5>  TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES
acl2-8.5>  (TYPE-SET-AND-RETURNED-FORMALS TYPE-SET-AND-RETURNED-FORMALS-LST)
acl2-8.5>  TYPE-SET-AND-RETURNED-FORMALS-TOP
acl2-8.5>  GUESS-TYPE-PRESCRIPTION-FOR-FN-STEP
acl2-8.5>  *CLIQUE-STEP-INSTALL-INTERVAL*
acl2-8.5>  GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE-STEP
acl2-8.5>  (GUARDED-TERMP GUARDED-TERM-LISTP)
acl2-8.5>  CONJOIN-TYPE-PRESCRIPTIONS
acl2-8.5>  CLEANSE-TYPE-PRESCRIPTIONS
acl2-8.5>  GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE
acl2-8.5>  GET-NORMALIZED-BODIES
acl2-8.5>  CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE
acl2-8.5>  PUTPROP-TYPE-PRESCRIPTION-LST
acl2-8.5>  PUTPROP-LEVEL-NO-LST
acl2-8.5>  PRIMITIVE-RECURSIVE-ARGP
acl2-8.5>  PRIMITIVE-RECURSIVE-CALLP
acl2-8.5>  PRIMITIVE-RECURSIVE-CALLSP
acl2-8.5>  PRIMITIVE-RECURSIVE-MACHINEP
acl2-8.5>  PUTPROP-PRIMITIVE-RECURSIVE-DEFUNP-LST
acl2-8.5>  MAKE-CONTROLLER-POCKET
acl2-8.5>  MAKE-CONTROLLER-ALIST1
acl2-8.5>  MAKE-CONTROLLER-ALIST
acl2-8.5>  MAX-NUME-EXCEEDED-ERROR
acl2-8.5>  PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS1
acl2-8.5>  PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS
acl2-8.5>  PRINT-VERIFY-GUARDS-MSG
acl2-8.5>  COLLECT-IDEALS
acl2-8.5>  COLLECT-NON-IDEALS
acl2-8.5>  COLLECT-NON-COMMON-LISP-COMPLIANTS
acl2-8.5>  ALL-FNNAMES1-EXEC
acl2-8.5>  ALL-FNNAMES-EXEC
acl2-8.5>  COLLECT-GUARDS-AND-BODIES
acl2-8.5>  CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP
acl2-8.5>  CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS
acl2-8.5>  CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP
acl2-8.5>  GUARD-SIMPLIFY-MSG
acl2-8.5>  GUARD-SIMPLIFY-P
acl2-8.5>  CHK-ACCEPTABLE-VERIFY-GUARDS-CMP
acl2-8.5>  CHK-ACCEPTABLE-VERIFY-GUARDS
acl2-8.5>  GUARD-OBLIGATION-CLAUSES
acl2-8.5>  GUARD-OBLIGATION
acl2-8.5>  PROVE-GUARD-CLAUSES-MSG
acl2-8.5>  VERIFY-GUARDS-FORMULA-FN
acl2-8.5>  VERIFY-GUARDS-FORMULA
acl2-8.5>  PROVE-GUARD-CLAUSES
acl2-8.5>  MAYBE-REMOVE-INVARIANT-RISK
acl2-8.5>  VERIFY-GUARDS-FN1
acl2-8.5>  CONVERT-RUNES-TO-UNORDERED-MAPPING-PAIRS
acl2-8.5>  AUGMENT-THEORY-WEAK
acl2-8.5>  WITH-USELESS-RUNES-AUX
acl2-8.5>  ACCP-INFO
acl2-8.5>  USELESS-RUNES
acl2-8.5>  BAD-USELESS-RUNES
acl2-8.5>  SET-DIFFERENCE-EQUAL-SORTED
acl2-8.5>  REMOVE-EXECUTABLE-COUNTERPART-USELESS-RUNES1
acl2-8.5>  EXECUTABLE-COUNTERPART-USELESS-RUNES-P
acl2-8.5>  REMOVE-EXECUTABLE-COUNTERPART-USELESS-RUNES
acl2-8.5>  PRINT-RUNE
acl2-8.5>  USELESS-RUNES-REPORT-P
acl2-8.5>  PRINT-USELESS-RUNES-TUPLES-REC
acl2-8.5>  PRINT-USELESS-RUNES-TUPLES
acl2-8.5>  PRINT-USELESS-RUNES
acl2-8.5>  AUGMENTED-RUNES-AFTER-1
acl2-8.5>  AUGMENTED-RUNES-AFTER
acl2-8.5>  EXTEND-SET-DIFFERENCE-THEORIES
acl2-8.5>  USELESS-RUNES-ENS
acl2-8.5>  WITH-USELESS-RUNES
acl2-8.5>  VERIFY-GUARDS-FN
acl2-8.5>  *SUPER-DEFUN-WART-TABLE*
acl2-8.5>  PROJECT-OUT-COLUMNS-I-AND-J
acl2-8.5>  *SUPER-DEFUN-WART-BINDING-ALIST*
acl2-8.5>  *SUPER-DEFUN-WART-STOBJS-IN-ALIST*
acl2-8.5>  SUPER-DEFUN-WART-BINDINGS
acl2-8.5>  STORE-STOBJS-INS
acl2-8.5>  STORE-SUPER-DEFUN-WARTS-STOBJS-IN
acl2-8.5>  COLLECT-OLD-NAMEPS
acl2-8.5>  PUT-INVARIANT-RISK1
acl2-8.5>  STOBJS-GUARD-ONLY-LST
acl2-8.5>  STOBJS-GUARD-ONLY
acl2-8.5>  REMOVE-GUARD-T
acl2-8.5>  *BOOT-STRAP-INVARIANT-RISK-ALIST*
acl2-8.5>  PUT-INVARIANT-RISK
acl2-8.5>  DEFUNS-FN-SHORT-CUT
acl2-8.5>  PRINT-DEFUN-MSG/COLLECT-TYPE-PRESCRIPTIONS
acl2-8.5>  PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS1
acl2-8.5>  PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS
acl2-8.5>  SIMPLE-SIGNATUREP
acl2-8.5>  ALL-SIMPLE-SIGNATURESP
acl2-8.5>  PRINT-DEFUN-MSG/SIGNATURES1
acl2-8.5>  PRINT-DEFUN-MSG/SIGNATURES
acl2-8.5>  PRINT-DEFUN-MSG
acl2-8.5>  GET-IGNORES
acl2-8.5>  GET-IGNORABLES
acl2-8.5>  IRRELEVANT-VARS
acl2-8.5>  GET-IRRELEVANTS
acl2-8.5>  CHK-ALL-STOBJ-NAMES
acl2-8.5>  GET-DECLARED-STOBJ-NAMES
acl2-8.5>  GET-STOBJS-IN-LST
acl2-8.5>  CHK-STOBJS-OUT-BOUND
acl2-8.5>  STORE-STOBJS-OUT
acl2-8.5>  UNPARSE-SIGNATURE
acl2-8.5>  CHK-DEFUN-MODE
acl2-8.5>  SCAN-TO-CLTL-COMMAND
acl2-8.5>  DCL-FIELDS1
acl2-8.5>  DCL-FIELDS
acl2-8.5>  SET-EQUALP-EQ
acl2-8.5>  NON-IDENTICAL-DEFP-CHK-MEASURES
acl2-8.5>  NON-IDENTICAL-DEFP
acl2-8.5>  IDENTICAL-DEFP
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNP0
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNP
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNSP10
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNSP1
acl2-8.5>  RECOVER-DEFS-LST
acl2-8.5>  GET-CLIQUE
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNSP0
acl2-8.5>  STRIP-LAST-ELEMENTS
acl2-8.5>  REDUNDANT-OR-RECLASSIFYING-DEFUNSP
acl2-8.5>  COLLECT-WHEN-CADR-EQ
acl2-8.5>  ALL-PROGRAMP
acl2-8.5>  FORMAL-POSITION
acl2-8.5>  MAKE-POSNS
acl2-8.5>  (RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST
acl2-8.5>                       RELEVANT-POSNS-CALL)
acl2-8.5>  RELEVANT-POSNS-CLIQUE1
acl2-8.5>  RELEVANT-POSNS-CLIQUE-RECUR
acl2-8.5>  RELEVANT-POSNS-CLIQUE-INIT
acl2-8.5>  (RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST)
acl2-8.5>  RELEVANT-POSNS-MERGE
acl2-8.5>  RELEVANT-POSNS-LAMBDAS-TOP
acl2-8.5>  RELEVANT-POSNS-CLIQUE
acl2-8.5>  IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2
acl2-8.5>  IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1
acl2-8.5>  IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE
acl2-8.5>  TILDE-*-IRRELEVANT-FORMALS-MSG1
acl2-8.5>  TILDE-*-IRRELEVANT-FORMALS-MSG
acl2-8.5>  MISSING-IRRELEVANT-SLOTS1
acl2-8.5>  MISSING-IRRELEVANT-SLOTS
acl2-8.5>  FIND-SLOT
acl2-8.5>  BOGUS-IRRELEVANTS-ALIST2
acl2-8.5>  BOGUS-IRRELEVANTS-ALIST1
acl2-8.5>  BOGUS-IRRELEVANTS-ALIST
acl2-8.5>  TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG1
acl2-8.5>  TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG
acl2-8.5>  CHK-IRRELEVANT-FORMALS-MSG
acl2-8.5>  CHK-IRRELEVANT-FORMALS
acl2-8.5>  CHK-LOGIC-SUBFUNCTIONS
acl2-8.5>  COLLECT-UNBADGED
acl2-8.5>  CHK-BADGED-QUOTED-SUBFUNCTIONS
acl2-8.5>  UNION-COLLECT-NON-X
acl2-8.5>  TRANSLATE-MEASURES
acl2-8.5>  REDUNDANT-PREDEFINED-ERROR-MSG
acl2-8.5>  CHK-ACCEPTABLE-DEFUNS-REDUNDANCY
acl2-8.5>  CHK-ACCEPTABLE-DEFUNS-VERIFY-GUARDS-ER
acl2-8.5>  CHK-NON-EXECUTABLEP
acl2-8.5>  CHK-ACCEPTABLE-DEFUNS0
acl2-8.5>  GET-BOOLEAN-UNAMBIGUOUS-XARGS-FLG-LST
acl2-8.5>  GET-IRRELEVANTS-ALIST
acl2-8.5>  RAW-LAMBDA$S-TO-LAMBDAS
acl2-8.5>  *DEFAULT-STATE-VARS*
acl2-8.5>  CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS1
acl2-8.5>  CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS2
acl2-8.5>  CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS
acl2-8.5>  WEAK-LOOP$-ALIST-ENTRY-P
acl2-8.5>  LOOP$-ALIST-TERM
acl2-8.5>  *PRIMITIVE-UNTRANSLATE-ALIST*
acl2-8.5>  (LOGIC-CODE-TO-RUNNABLE-CODE LOGIC-CODE-TO-RUNNABLE-CODE-LST)
acl2-8.5>  AUTHENTICATE-TAGGED-LAMBDA$
acl2-8.5>  MAKE-COMPILEABLE-GUARD-AND-BODY-LAMBDAS
acl2-8.5>  CONVERT-TAGGED-LOOP$S-TO-PAIRS
acl2-8.5>  CHK-ACCEPTABLE-LOOP$-TRANSLATIONS1
acl2-8.5>  CHK-ACCEPTABLE-LOOP$-TRANSLATIONS2
acl2-8.5>  CHK-ACCEPTABLE-LOOP$-TRANSLATIONS
acl2-8.5>  (STATE-GLOBALS-SET-BY STATE-GLOBALS-SET-BY-LST)
acl2-8.5>  (CHK-LAMBDAS-FOR-LOOP$-RECURSION1 CHK-LAMBDAS-FOR-LOOP$-RECURSION1-LST)
acl2-8.5>  CHK-LAMBDAS-FOR-LOOP$-RECURSION
acl2-8.5>  WEAK-LAMBDA-INFO-P
acl2-8.5>  (REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST)
acl2-8.5>  REMOVE-LAMBDAS
acl2-8.5>  TYPE-PRESCRIPTION-DISJUNCTP
acl2-8.5>  TYPE-PRESCRIPTION-CONCLP
acl2-8.5>  SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT
acl2-8.5>  SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL
acl2-8.5>  UNPRETTYIFY-TP
acl2-8.5>  DESTRUCTURE-TYPE-PRESCRIPTION
acl2-8.5>  GET-XARGS-TYPE-PRESCRIPTION-LST
acl2-8.5>  CHK-TYPE-PRESCRIPTION-LST
acl2-8.5>  GLOBAL-STOBJS-PROP
acl2-8.5>  CHK-ACCEPTABLE-DEFUNS1
acl2-8.5>  CONDITIONALLY-MEMOIZED-FNS
acl2-8.5>  CHK-ACCEPTABLE-DEFUNS
acl2-8.5>  UNION-EQ1-REV
acl2-8.5>  COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES
acl2-8.5>  PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST
acl2-8.5>  DEFUNS-FN1
acl2-8.5>  DEFUNS-FN0
acl2-8.5>  STRIP-NON-HIDDEN-PACKAGE-NAMES
acl2-8.5>  IN-PACKAGE-FN
acl2-8.5>  DEFSTOBJ-FUNCTIONSP
acl2-8.5>  INDEX-OF-NON-NUMBER
acl2-8.5>  MAKE-UDF-INSIGS
acl2-8.5>  INTRO-UDF
acl2-8.5>  INTRO-UDF-LST1
acl2-8.5>  INTRO-UDF-LST2
acl2-8.5>  INTRO-UDF-LST
acl2-8.5>  DEFUN-CTX
acl2-8.5>  INSTALL-EVENT-DEFUNS
acl2-8.5>  DEFUNS-FN
acl2-8.5>  DEFUN-FN
acl2-8.5>  ARGS-FN
acl2-8.5>  ARGS
acl2-8.5>  MAKE-VERIFY-TERMINATION-DEF
acl2-8.5>  MAKE-VERIFY-TERMINATION-DEFS-LST
acl2-8.5>  CHK-ACCEPTABLE-VERIFY-TERMINATION1
acl2-8.5>  UNIFORM-DEFUN-MODES
acl2-8.5>  CHK-ACCEPTABLE-VERIFY-TERMINATION
acl2-8.5>  VERIFY-TERMINATION1
acl2-8.5>  VERIFY-TERMINATION-BOOT-STRAP-FN1
acl2-8.5>  VERIFY-TERMINATION-BOOT-STRAP-FN
acl2-8.5>  WHEN-LOGIC3
acl2-8.5>  VERIFY-TERMINATION-FN
acl2-8.5>  FNS-USED-IN-AXIOMS
acl2-8.5>  CHECK-OUT-INSTANTIABLEP1
acl2-8.5>  CHECK-OUT-INSTANTIABLEP
acl2-8.5>  *AVOID-ONEIFY-FNS*
acl2-8.5> 
acl2-8.5> Finished loading "defuns.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "proof-builder-a.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  PC-VALUE
acl2-8.5>  PC-ASSIGN
acl2-8.5>  INITIALIZE-PC-ACL2
acl2-8.5>  STATE-STACK
acl2-8.5>  OLD-SS
acl2-8.5>  SS-ALIST
acl2-8.5>  WEAK-PC-INFO-P
acl2-8.5>  PC-PRINT-PROMPT-AND-INSTR-FLG
acl2-8.5>  PC-PRINT-MACROEXPANSION-FLG
acl2-8.5>  PC-PROMPT
acl2-8.5>  PC-PROMPT-DEPTH-PREFIX
acl2-8.5>  WEAK-PC-STATE-P
acl2-8.5>  *PC-STATE-FIELDS-FOR-PRIMITIVES*
acl2-8.5>  INSTRUCTION
acl2-8.5>  GOALS
acl2-8.5>  ABBREVIATIONS
acl2-8.5>  LOCAL-TAG-TREE
acl2-8.5>  PC-ENS
acl2-8.5>  TAG-TREE
acl2-8.5>  WEAK-GOAL-P
acl2-8.5>  *GOAL-FIELDS*
acl2-8.5>  CONC
acl2-8.5>  HYPS
acl2-8.5>  CURRENT-ADDR
acl2-8.5>  GOAL-NAME
acl2-8.5>  DEPENDS-ON
acl2-8.5>  MAKE-OFFICIAL-PC-COMMAND
acl2-8.5>  INTERN-IN-KEYWORD-PACKAGE
acl2-8.5>  MAKE-PRETTY-PC-COMMAND
acl2-8.5>  MAKE-PRETTY-PC-INSTR
acl2-8.5>  CHANGE-PC-STATE
acl2-8.5>  MAKE-OFFICIAL-PC-INSTR
acl2-8.5>  CHECK-FORMALS-LENGTH
acl2-8.5>  CHECK-&OPTIONAL-AND-&REST
acl2-8.5>  MAKE-LET-PAIRS-FROM-FORMALS
acl2-8.5>  (ALL-SYMBOLS ALL-SYMBOLS-LIST)
acl2-8.5>  MAKE-ACCESS-BINDINGS
acl2-8.5>  LET-FORM-FOR-PC-STATE-VARS
acl2-8.5>  CHECK-FIELD-NAMES
acl2-8.5>  PRINT-NO-CHANGE
acl2-8.5>  PRINT-NO-CHANGE2
acl2-8.5>  PRINT-NO-CHANGE-FN
acl2-8.5>  MAYBE-UPDATE-INSTRUCTION
acl2-8.5>  PC-PRIMITIVE-DEFUN-FORM
acl2-8.5>  PC-COMMAND-TABLE-GUARD
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  ADD-PC-COMMAND
acl2-8.5>  PC-COMMAND-TYPE
acl2-8.5>  PRINT-NO-CHANGE3
acl2-8.5>  ADD-PC-COMMAND-1
acl2-8.5>  TOGGLE-PC-MACRO-FN
acl2-8.5>  PC-META-OR-MACRO-DEFUN
acl2-8.5>  GOAL-NAMES
acl2-8.5>  INSTRUCTIONS-OF-STATE-STACK
acl2-8.5>  FMS0
acl2-8.5>  WITH-OUTPUT-FORCED
acl2-8.5>  PRINT-PC-PROMPT
acl2-8.5>  PC-MACROEXPAND
acl2-8.5>  FIND-GOAL
acl2-8.5>  PRINT-ALL-GOALS-PROVED-MESSAGE
acl2-8.5>  WHEN-GOALS
acl2-8.5>  WHEN-GOALS-TRIP
acl2-8.5>  CURRENT-IMMEDIATE-DEPS
acl2-8.5>  GOAL-DEPENDENT-P
acl2-8.5>  CURRENT-ALL-DEPS
acl2-8.5>  MAYBE-PRINT-PROVED-GOAL-MESSAGE
acl2-8.5>  ACCUMULATE-TTREE-IN-PC-STATE
acl2-8.5>  PC-PROCESS-ASSUMPTIONS
acl2-8.5>  MAKE-IMPLICATION
acl2-8.5>  CL-SET-TO-IMPLICATIONS
acl2-8.5>  KNOWN-ASSUMPTIONS
acl2-8.5>  ADD-ASSUMPTIONS-TO-TOP-GOAL
acl2-8.5>  UNPROVED-GOALS
acl2-8.5>  MAKE-PC-ENS
acl2-8.5>  INITIAL-RCNST-FROM-ENS
acl2-8.5>  MAKE-NEW-GOALS-FIXED-HYPS
acl2-8.5>  PC-SINGLE-STEP-PRIMITIVE
acl2-8.5>  MAYBE-PRINT-MACROEXPANSION
acl2-8.5>  PC-SINGLE-STEP-1
acl2-8.5>  UNION-LASTN-PC-TAG-TREES
acl2-8.5>  PC-SINGLE-STEP
acl2-8.5>  *PC-COMPLETE-SIGNAL*
acl2-8.5>  PRINT-RE-ENTERING-PROOF-BUILDER
acl2-8.5>  CHK-ABSSTOBJ-INVARIANTS
acl2-8.5>  PC-MAIN-LOOP
acl2-8.5>  MAKE-INITIAL-GOAL
acl2-8.5>  INITIAL-STATE-STACK
acl2-8.5>  EVENT-NAME-AND-TYPES-AND-RAW-TERM
acl2-8.5>  INSTALL-INITIAL-STATE-STACK
acl2-8.5>  PC-MAIN1
acl2-8.5>  PC-MAIN
acl2-8.5>  PC-TOP
acl2-8.5>  (ILLEGAL-FNP ILLEGAL-FNP-LIST)
acl2-8.5>  VERIFY-FN
acl2-8.5>  PRINT-UNPROVED-GOALS-MESSAGE
acl2-8.5>  STATE-STACK-FROM-INSTRUCTIONS
acl2-8.5>  STATE-FROM-INSTRUCTIONS
acl2-8.5>  PRINT-PC-DEFTHM
acl2-8.5>  PRINT-PC-GOAL
acl2-8.5>  PRINT-PC-STATE
acl2-8.5>  PROOF-BUILDER
acl2-8.5>  VERIFY
acl2-8.5>  GUARD-MSG-TABLE
acl2-8.5>  (SUBLIS-EXPR-NON-QUOTEPS SUBLIS-EXPR-NON-QUOTEPS-LST)
acl2-8.5>  INVERT-ABBREVIATIONS-ALIST
acl2-8.5>  ABBREVIATE
acl2-8.5>  UNTRANS0
acl2-8.5>  UNTRANS0-LST-FN
acl2-8.5>  UNTRANS0-LST
acl2-8.5> 
acl2-8.5> Finished loading "proof-builder-a.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "defthm.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  FORM-OF-REWRITE-QUOTED-CONSTANT-RULE
acl2-8.5>  INTERPRET-TERM-AS-REWRITE-RULE2
acl2-8.5>  INTERPRET-TERM-AS-REWRITE-RULE1
acl2-8.5>  INTERPRET-TERM-AS-REWRITE-RULE
acl2-8.5>  (NON-RECURSIVE-FNNAMES-ALIST-REC NON-RECURSIVE-FNNAMES-ALIST-REC-LST)
acl2-8.5>  NON-RECURSIVE-FNNAMES-ALIST
acl2-8.5>  NON-RECURSIVE-FNNAMES-ALIST-LST
acl2-8.5>  HIDE-LAMBDAS1
acl2-8.5>  HIDE-LAMBDAS
acl2-8.5>  VARIANTP
acl2-8.5>  (SURROUNDING-FNS1 SURROUNDING-FNS-LST)
acl2-8.5>  SURROUNDING-FNS
acl2-8.5>  LOOP-STOPPER1
acl2-8.5>  LOOP-STOPPER
acl2-8.5>  REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS
acl2-8.5>  PUT-MATCH-FREE-VALUE
acl2-8.5>  FREE-VARS-IN-HYPS
acl2-8.5>  FREE-VARS-IN-HYPS-SIMPLE
acl2-8.5>  FREE-VARS-IN-FC-HYPS
acl2-8.5>  FREE-VARS-IN-HYPS-CONSIDERING-BIND-FREE
acl2-8.5>  ALL-VARS-IN-HYPS
acl2-8.5>  MATCH-FREE-VALUE
acl2-8.5>  MATCH-FREE-FC-VALUE
acl2-8.5>  RULE-BACKCHAIN-LIMIT-LST
acl2-8.5>  CREATE-REWRITE-RULE
acl2-8.5>  HYPS-THAT-INSTANTIATE-FREE-VARS
acl2-8.5>  (MAYBE-ONE-WAY-UNIFY MAYBE-ONE-WAY-UNIFY-LST)
acl2-8.5>  MAYBE-ONE-WAY-UNIFY-WITH-SOME
acl2-8.5>  MAYBE-SUBSUMES
acl2-8.5>  SUBSUMES-REWRITE-RULE
acl2-8.5>  FIND-SUBSUMED-RULE-NAMES
acl2-8.5>  FIND-SUBSUMING-RULE-NAMES
acl2-8.5>  FORCED-HYPS
acl2-8.5>  STRIP-TOP-LEVEL-NOTS-AND-FORCES
acl2-8.5>  FREE-VARIABLE-ERROR?
acl2-8.5>  EXTEND-GENEQV-ALIST
acl2-8.5>  (COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST)
acl2-8.5>  UNCOVERED-EQUIVS
acl2-8.5>  (UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST)
acl2-8.5>  DOUBLE-REWRITE-OPPORTUNITIES
acl2-8.5>  SHOW-DOUBLE-REWRITE-OPPORTUNITIES1
acl2-8.5>  SHOW-DOUBLE-REWRITE-OPPORTUNITIES
acl2-8.5>  IRRELEVANT-LOOP-STOPPER-PAIRS
acl2-8.5>  NON-REC-DEF-RULES-MSG-1
acl2-8.5>  NON-REC-DEF-RULES-MSG
acl2-8.5>  CHK-REWRITE-RULE-WARNINGS
acl2-8.5>  CHK-ACCEPTABLE-REWRITE-RULE2
acl2-8.5>  CHK-ACCEPTABLE-REWRITE-RULE1
acl2-8.5>  CHK-ACCEPTABLE-REWRITE-RULE
acl2-8.5>  ADD-REWRITE-RULE2
acl2-8.5>  ADD-REWRITE-RULE1
acl2-8.5>  ADD-REWRITE-RULE
acl2-8.5>  EXPAND-INEQUALITY-FNCALL1
acl2-8.5>  EXPAND-INEQUALITY-FNCALL
acl2-8.5>  ALL-VARS-IN-POLY-LST
acl2-8.5>  SUBBAGP-EQ
acl2-8.5>  ALWAYS-BIGGERP-DATA
acl2-8.5>  ALWAYS-BIGGERP-DATA-LST
acl2-8.5>  ALWAYS-BIGGERP
acl2-8.5>  NO-ELEMENT-ALWAYS-BIGGERP
acl2-8.5>  MAXIMAL-TERMS1
acl2-8.5>  MAXIMAL-TERMS
acl2-8.5>  COLLECT-WHEN-FFNNAMESP
acl2-8.5>  MAKE-FREE-MAX-TERMS-MSG1
acl2-8.5>  MAKE-FREE-MAX-TERMS-MSG
acl2-8.5>  EXTERNAL-LINEARIZE
acl2-8.5>  BAD-SYNP-HYP-MSG-FOR-LINEAR
acl2-8.5>  SHOW-DOUBLE-REWRITE-OPPORTUNITIES-LINEAR
acl2-8.5>  NO-LINEAR-MSG
acl2-8.5>  ALL-NON-NUMERIC
acl2-8.5>  CHK-ACCEPTABLE-LINEAR-RULE2
acl2-8.5>  CHK-ACCEPTABLE-LINEAR-RULE1
acl2-8.5>  CHK-ACCEPTABLE-LINEAR-RULE
acl2-8.5>  ADD-LINEAR-RULE3
acl2-8.5>  ADD-LINEAR-RULE2
acl2-8.5>  ADD-LINEAR-RULE1
acl2-8.5>  ADD-LINEAR-RULE
acl2-8.5>  DESTRUCTURE-WELL-FOUNDED-RELATION-RULE
acl2-8.5>  CHK-ACCEPTABLE-WELL-FOUNDED-RELATION-RULE
acl2-8.5>  ADD-WELL-FOUNDED-RELATION-RULE
acl2-8.5>  CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE2
acl2-8.5>  CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE1
acl2-8.5>  CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE
acl2-8.5>  (FN-AND-MAXIMAL-LEVEL-NO FN-AND-MAXIMAL-LEVEL-NO-LST)
acl2-8.5>  BUILT-IN-CLAUSE-DISCRIMINATOR-FN
acl2-8.5>  ALL-FNNAMES-SUBSUMER
acl2-8.5>  MAKE-BUILT-IN-CLAUSE-RULES1
acl2-8.5>  CHK-INITIAL-BUILT-IN-CLAUSES
acl2-8.5>  MAKE-BUILT-IN-CLAUSE-RULES
acl2-8.5>  CLASSIFY-AND-STORE-BUILT-IN-CLAUSE-RULES
acl2-8.5>  ADD-BUILT-IN-CLAUSE-RULE
acl2-8.5>  DESTRUCTURE-COMPOUND-RECOGNIZER
acl2-8.5>  MAKE-RECOGNIZER-TUPLE
acl2-8.5>  COMMENT-ON-NEW-RECOG-TUPLE1
acl2-8.5>  COMMENT-ON-NEW-RECOG-TUPLE
acl2-8.5>  CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE
acl2-8.5>  ADD-COMPOUND-RECOGNIZER-RULE
acl2-8.5>  CHK-TRIGGERS
acl2-8.5>  DESTRUCTURE-FORWARD-CHAINING-TERM
acl2-8.5>  CHK-ACCEPTABLE-FORWARD-CHAINING-RULE
acl2-8.5>  PUTPROP-FORWARD-CHAINING-RULES-LST
acl2-8.5>  ADD-FORWARD-CHAINING-RULE
acl2-8.5>  EVALUATOR-CLAUSE/ARGLIST
acl2-8.5>  EVALUATOR-CLAUSE
acl2-8.5>  EVALUATOR-CLAUSES1
acl2-8.5>  EVALUATOR-CLAUSES
acl2-8.5>  CDRP
acl2-8.5>  EXPAND-EQ-AND-ATOM-TERM-LST
acl2-8.5>  NORMALIZE-ALLEGED-EVALUATOR-CLAUSE
acl2-8.5>  NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET
acl2-8.5>  SHALLOW-CLAUSIFY1
acl2-8.5>  SHALLOW-CLAUSIFY
acl2-8.5>  FIND-EVFN-LST-IN-CLAUSE
acl2-8.5>  GUESS-EVFN-LST-FOR-EVFN
acl2-8.5>  FIND-FN-IN-CLAUSE
acl2-8.5>  GUESS-FN-ARGS-LST-FOR-EVFN
acl2-8.5>  NORMALIZED-EVALUATOR-CL-SET
acl2-8.5>  CHK-EVALUATOR
acl2-8.5>  NAMEDP-PREFIX
acl2-8.5>  DEFEVALUATOR-FORM/DEFTHM-NAME
acl2-8.5>  DEFEVALUATOR-FORM/DEFTHM-HINTS
acl2-8.5>  DEFEVALUATOR-FORM/DEFTHM
acl2-8.5>  DEFEVALUATOR-FORM/DEFTHMS
acl2-8.5>  CAR-CADR-CADDR-ETC
acl2-8.5>  DEFEVALUATOR-FORM/FNS-CLAUSES
acl2-8.5>  *DEFEVALUATOR-FORM-BASE-THEORY*
acl2-8.5>  DEFEVALUATOR-FORM
acl2-8.5>  PAIRS-TO-MACRO-ALIAS-MSGS
acl2-8.5>  DEFEVALUATOR-CHECK-MSG
acl2-8.5>  DEFEVALUATOR-CHECK
acl2-8.5>  DEFEVALUATOR-CHECK-FORM
acl2-8.5>  DEFEVALUATOR
acl2-8.5>  TERM-TABLE
acl2-8.5>  TERM-TABLE
acl2-8.5>  REMOVE-META-EXTRACT-CONTEXTUAL-HYPS
acl2-8.5>  REMOVE-META-EXTRACT-GLOBAL-HYPS
acl2-8.5>  META-RULE-HYPOTHESIS-FUNCTIONS
acl2-8.5>  META-FN-ARGS
acl2-8.5>  CHK-META-FUNCTION
acl2-8.5>  EV-LST-FROM-EV
acl2-8.5>  ATTACHED-FNS
acl2-8.5>  SIBLINGS
acl2-8.5>  CANONICAL-SIBLING
acl2-8.5>  (CANONICAL-FFN-SYMBS CANONICAL-FFN-SYMBS-LST)
acl2-8.5>  COLLECT-CANONICAL-SIBLINGS
acl2-8.5>  CONSTRAINTS-LIST
acl2-8.5>  CONSTRAINT-INFO+
acl2-8.5>  IMMEDIATE-CANONICAL-ANCESTORS
acl2-8.5>  CANONICAL-ANCESTORS-REC
acl2-8.5>  CANONICAL-ANCESTORS
acl2-8.5>  CANONICAL-ANCESTORS-LST
acl2-8.5>  CHK-EVALUATOR-USE-IN-RULE
acl2-8.5>  CHK-RULE-FN-GUARD
acl2-8.5>  ADD-NEW-NEVER-UNTOUCHABLE-FNS
acl2-8.5>  COLLECT-NEVER-UNTOUCHABLE-FNS-ENTRIES
acl2-8.5>  INTERPRET-TERM-AS-META-RULE
acl2-8.5>  CHK-ACCEPTABLE-META-RULE
acl2-8.5>  ADD-META-RULE1
acl2-8.5>  MAYBE-PUTPROP-LST
acl2-8.5>  MARK-ATTACHMENT-DISALLOWED2
acl2-8.5>  MARK-ATTACHMENT-DISALLOWED1
acl2-8.5>  MARK-ATTACHMENT-DISALLOWED
acl2-8.5>  ADD-META-RULE
acl2-8.5>  (DESTRUCTORS DESTRUCTORS-LST)
acl2-8.5>  STRIP-FFN-SYMBS
acl2-8.5>  CHK-ACCEPTABLE-ELIM-RULE1
acl2-8.5>  CHK-ACCEPTABLE-ELIM-RULE
acl2-8.5>  ADD-ELIM-RULE1
acl2-8.5>  ADD-ELIM-RULE
acl2-8.5>  CHK-ACCEPTABLE-GENERALIZE-RULE
acl2-8.5>  ADD-GENERALIZE-RULE
acl2-8.5>  FIND-TYPE-PRESCRIPTION-PAT
acl2-8.5>  ADD-TYPE-PRESCRIPTION-RULE
acl2-8.5>  STRONG-COMPOUND-RECOGNIZER-P1
acl2-8.5>  STRONG-COMPOUND-RECOGNIZER-P
acl2-8.5>  WARNED-NON-REC-FNS-ALIST-FOR-TP
acl2-8.5>  WARNED-NON-REC-FNS-ALIST-TP-HYPS1
acl2-8.5>  WARNED-NON-REC-FNS-ALIST-TP-HYPS
acl2-8.5>  CHK-ACCEPTABLE-TYPE-PRESCRIPTION-RULE
acl2-8.5>  FIX-PKG
acl2-8.5>  FIX-INTERN$
acl2-8.5>  FIX-INTERN-IN-PKG-OF-SYM
acl2-8.5>  PACK-TO-STRING
acl2-8.5>  GEN-SYM-SYM
acl2-8.5>  BOOLEAN-FN
acl2-8.5>  REFLEXIVITY
acl2-8.5>  SYMMETRY
acl2-8.5>  TRANSITIVITY
acl2-8.5>  EQUIVALENCE-RELATION-CONDITION
acl2-8.5>  FIND-CANDIDATE-EQUIVALENCE-RELATION
acl2-8.5>  COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES
acl2-8.5>  CHK-ACCEPTABLE-EQUIVALENCE-RULE
acl2-8.5>  ADD-EQUIVALENCE-RULE
acl2-8.5>  CHK-ACCEPTABLE-REFINEMENT-RULE
acl2-8.5>  COLLECT-COARSENINGS
acl2-8.5>  PUTPROP-COARSENINGS
acl2-8.5>  UNION-VALUES
acl2-8.5>  EXTEND-VALUE-SET
acl2-8.5>  EXTEND-EACH-VALUE-SET
acl2-8.5>  CLOSE-VALUE-SETS
acl2-8.5>  ADD-REFINEMENT-RULE
acl2-8.5>  CORRESPONDING-ARGS-EQ-EXCEPT
acl2-8.5>  (DUPLICATE-VARS-1 DUPLICATE-VARS-1-LST)
acl2-8.5>  DUPLICATE-VARS
acl2-8.5>  (REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1
acl2-8.5>       REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1-LST)
acl2-8.5>  REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR
acl2-8.5>  SPLIT-AT-POSITION
acl2-8.5>  MAKE-PEQUIV-PATTERN
acl2-8.5>  MAKE-PEQUIV
acl2-8.5>  (VAR-ADDRESS VAR-ADDRESS-LST)
acl2-8.5>  INTERPRET-TERM-AS-CONGRUENCE-RULE
acl2-8.5>  SOME-CONGRUENCE-RULE-SAME
acl2-8.5>  SOME-CONGRUENCE-RULE-HAS-REFINEMENT
acl2-8.5>  CHK-ACCEPTABLE-CONGRUENCE-RULE
acl2-8.5>  ADD-CONGRUENCE-RULE-TO-CONGRUENCE
acl2-8.5>  CONS-ASSOC-EQ-REC
acl2-8.5>  CONS-ASSOC-EQ
acl2-8.5>  ADD-CONGRUENCE-RULE
acl2-8.5>  CHK-DESTRUCTURE-DEFINITION
acl2-8.5>  CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY
acl2-8.5>  CHK-ACCEPTABLE-DEFINITION-RULE
acl2-8.5>  CHK-ACCEPTABLE-INDUCTION-RULE
acl2-8.5>  ADD-INDUCTION-RULE
acl2-8.5>  CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE
acl2-8.5>  ADD-TYPE-SET-INVERTER-RULE
acl2-8.5>  TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG
acl2-8.5>  DESTRUCTURE-CLAUSE-PROCESSOR-RULE
acl2-8.5>  CHK-ACCEPTABLE-CLAUSE-PROCESSOR-RULE
acl2-8.5>  ADD-CLAUSE-PROCESSOR-RULE
acl2-8.5>  TRUSTED-CL-PROC-TABLE-GUARD
acl2-8.5>  TRUSTED-CL-PROC-TABLE
acl2-8.5>  DEFINE-TRUSTED-CLAUSE-PROCESSOR
acl2-8.5>  PRIMITIVE-INSTRUCTIONP
acl2-8.5>  NON-PRIMITIVE-INSTRUCTIONS
acl2-8.5>  CHK-PRIMITIVE-INSTRUCTION-LISTP
acl2-8.5>  TRANSLATE-INSTRUCTIONS
acl2-8.5>  CONTROLLER-ALISTP
acl2-8.5>  ALIST-TO-KEYWORD-ALIST
acl2-8.5>  ELIMINATE-MACRO-ALIASES
acl2-8.5>  FIX-LOOP-STOPPER-ALIST
acl2-8.5>  GUESS-CONTROLLER-ALIST-FOR-DEFINITION-RULE
acl2-8.5>  CHK-LEGAL-LINEAR-TRIGGER-TERMS1
acl2-8.5>  CHK-LEGAL-LINEAR-TRIGGER-TERMS
acl2-8.5>  BACKCHAIN-LIMIT-LISTP
acl2-8.5>  RECOVER-METAFUNCTION-OR-CLAUSE-PROCESSOR-SIGNATURES
acl2-8.5>  EQUAL-EXCEPT-ON-NON-STOBJS
acl2-8.5>  ARITY-ALISTP
acl2-8.5>  COMPATIBLE-ARITY-ALISTSP
acl2-8.5>  COLLECT-DISAGREEING-ARITY-ASSUMPTIONS
acl2-8.5>  INTERPRET-TERM-AS-WELL-FORMEDNESS-GUARANTEE-THM
acl2-8.5>  TRANSLATE-WELL-FORMEDNESS-GUARANTEE
acl2-8.5>  TRANSLATE-RULE-CLASS-ALIST
acl2-8.5>  TRANSLATE-RULE-CLASS1
acl2-8.5>  REASON-FOR-NON-KEYWORD-VALUE-LISTP
acl2-8.5>  TRANSLATE-RULE-CLASS
acl2-8.5>  TRANSLATE-RULE-CLASSES1
acl2-8.5>  TRANSLATE-RULE-CLASSES
acl2-8.5>  CHK-ACCEPTABLE-X-RULE
acl2-8.5>  CHK-ACCEPTABLE-X-RULES
acl2-8.5>  COLLECT-KEYS-EQ
acl2-8.5>  CHK-ACCEPTABLE-RULES
acl2-8.5>  ADD-X-RULE
acl2-8.5>  ADD-RULES1
acl2-8.5>  TRUNCATE-CLASS-ALIST
acl2-8.5>  TRUNCATE-CLASSES
acl2-8.5>  MAKE-RUNES1
acl2-8.5>  MAKE-RUNES
acl2-8.5>  MAKE-RUNIC-MAPPING-PAIRS
acl2-8.5>  ADD-RULES
acl2-8.5>  REDUNDANT-THEOREMP
acl2-8.5>  NON-TAUTOLOGICAL-CLASSES
acl2-8.5>  PROVE-COROLLARIES1
acl2-8.5>  PROVE-COROLLARIES
acl2-8.5>  ENABLED-RUNEP-STRING
acl2-8.5>  UNTRANSLATE-HYPS
acl2-8.5>  INFO-FOR-LEMMAS
acl2-8.5>  ASSOC-EQ-EQ
acl2-8.5>  INFO-FOR-WELL-FOUNDED-RELATION-RULES
acl2-8.5>  INFO-FOR-BUILT-IN-CLAUSE-RULES1
acl2-8.5>  INFO-FOR-BUILT-IN-CLAUSE-RULES
acl2-8.5>  INFO-FOR-COMPOUND-RECOGNIZER-RULES
acl2-8.5>  INFO-FOR-GENERALIZE-RULES
acl2-8.5>  INFO-FOR-LINEAR-LEMMAS
acl2-8.5>  INFO-FOR-ELIMINATE-DESTRUCTORS-RULE
acl2-8.5>  INFO-FOR-CONGRUENCES
acl2-8.5>  INFO-FOR-PEQUIVS
acl2-8.5>  INFO-FOR-COARSENINGS
acl2-8.5>  INFO-FOR-FORWARD-CHAINING-RULES
acl2-8.5>  DECODE-TYPE-SET-LST
acl2-8.5>  INFO-FOR-TYPE-PRESCRIPTIONS
acl2-8.5>  INFO-FOR-INDUCTION-RULES
acl2-8.5>  INFO-FOR-TYPE-SET-INVERTER-RULES
acl2-8.5>  INFO-FOR-X-RULES
acl2-8.5>  INFO-FOR-RULES
acl2-8.5>  PRINT-INFO-FOR-RULES-ENTRY
acl2-8.5>  PRINT-INFO-FOR-RULES
acl2-8.5>  REPLACE-PROP
acl2-8.5>  RESTRICT-PKG-IMPORTS
acl2-8.5>  PR-BODY
acl2-8.5>  PR-FN
acl2-8.5>  PRINT-CLAUSE-PROCESSOR-RULES1
acl2-8.5>  PRINT-CLAUSE-PROCESSOR-RULES
acl2-8.5>  NEW-NUMES
acl2-8.5>  WORLD-TO-NEXT-COMMAND
acl2-8.5>  PR!-FN
acl2-8.5>  PR
acl2-8.5>  PR!
acl2-8.5>  DISABLEDP-FN-LST
acl2-8.5>  DISABLEDP-FN
acl2-8.5>  DISABLEDP
acl2-8.5>  COLLECT-ABBREVIATION-SUBCLASS
acl2-8.5>  RUNES-TO-MONITOR1
acl2-8.5>  *MONITORABLE-RUNE-TYPES*
acl2-8.5>  MONITORABLE-RUNES
acl2-8.5>  MONITORABLE-RUNES-FROM-MAPPING-PAIRS
acl2-8.5>  RUNES-TO-MONITOR
acl2-8.5>  REMOVE1-ASSOC-EQUAL?
acl2-8.5>  REMOVE1-ASSOC-EQUAL?-LST
acl2-8.5>  MONITOR1
acl2-8.5>  REMOVE1-ASSOC-EQUAL-LST
acl2-8.5>  SET-DIFFERENCE-ASSOC-EQUAL
acl2-8.5>  UNMONITOR1
acl2-8.5>  MONITOR-FN
acl2-8.5>  UNMONITOR-FN
acl2-8.5>  MONITORED-RUNES-FN
acl2-8.5>  BRR-FN
acl2-8.5>  BRR
acl2-8.5>  MONITOR!
acl2-8.5>  BRR@
acl2-8.5>  MONITOR
acl2-8.5>  UNMONITOR
acl2-8.5>  MONITORED-RUNES
acl2-8.5>  PROCEED-FROM-BRKPT1
acl2-8.5>  EXIT-BRR
acl2-8.5>  OK-IF-FN
acl2-8.5>  OK-IF
acl2-8.5>  PRINT-RULE-STORAGE-DEPENDENCIES
acl2-8.5>  DEFAXIOM-SUPPORTERS
acl2-8.5>  WHEN-LOGIC-OR-BOOT-STRAP
acl2-8.5>  DEFAXIOM-FN
acl2-8.5>  WARN-ON-INAPPROPRIATE-DEFUN-MODE
acl2-8.5>  WITH-WATERFALL-PARALLELISM-TIMINGS
acl2-8.5>  TRANSLATE-FOR-DEFTHM
acl2-8.5>  DEFTHM-FN1
acl2-8.5>  DEFTHM-FN
acl2-8.5>  THM-FN
acl2-8.5>  THM
acl2-8.5>  CHK-EXTENSIBLE-RULE-CLASSES
acl2-8.5>  EXTEND-RULE-CLASSES
acl2-8.5>  *DEFEQUIV-PACKAGE-VALUES*
acl2-8.5>  DEFEQUIV-FORM
acl2-8.5>  DEFEQUIV-FN
acl2-8.5>  DEFEQUIV
acl2-8.5>  *DEFREFINEMENT-PACKAGE-VALUES*
acl2-8.5>  DEFREFINEMENT-FORM
acl2-8.5>  DEFREFINEMENT-FN
acl2-8.5>  DEFREFINEMENT
acl2-8.5>  *DEFCONG-PACKAGE-VALUES*
acl2-8.5>  DEFCONG-FORM
acl2-8.5>  DEFCONG-FN
acl2-8.5>  DEFCONG
acl2-8.5> 
acl2-8.5> Finished loading "defthm.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "other-events.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  MACRO-VARS-KEY
acl2-8.5>  MACRO-VARS-AFTER-REST
acl2-8.5>  MACRO-VARS-OPTIONAL
acl2-8.5>  MACRO-VARS
acl2-8.5>  CHK-LEGAL-DEFCONST-NAME
acl2-8.5>  DEFCONST-FN1
acl2-8.5>  WEAK-HCOMP-BOOK-HT-ENTRY-P
acl2-8.5>  DEFCONST-VAL
acl2-8.5>  LARGE-CONSP
acl2-8.5>  DEFCONST-FN
acl2-8.5>  CHK-LEGAL-INIT-MSG
acl2-8.5>  CHK-LEGAL-INIT
acl2-8.5>  CHK-MACRO-ARGLIST-KEYS
acl2-8.5>  CHK-MACRO-ARGLIST-AFTER-REST
acl2-8.5>  CHK-MACRO-ARGLIST-OPTIONAL
acl2-8.5>  CHK-MACRO-ARGLIST1
acl2-8.5>  CHK-MACRO-ARGLIST-MSG
acl2-8.5>  CHK-MACRO-ARGLIST
acl2-8.5>  DEFMACRO-FN1
acl2-8.5>  CHK-DEFMACRO-WIDTH
acl2-8.5>  REDUNDANT-DEFMACROP
acl2-8.5>  COLLECT-NON-APPLY$-PRIMPS2
acl2-8.5>  (COLLECT-NON-APPLY$-PRIMPS1 COLLECT-NON-APPLY$-PRIMPS1-LST)
acl2-8.5>  COLLECT-NON-APPLY$-PRIMPS
acl2-8.5>  CHK-DEFMACRO-UNTOUCHABLE
acl2-8.5>  DEFMACRO-FN
acl2-8.5>  *INITIAL-EVENT-DEFMACROS*
acl2-8.5>  BOOT-TRANSLATE
acl2-8.5>  PRIMORDIAL-EVENT-MACRO-AND-FN1
acl2-8.5>  PRIMORDIAL-EVENT-MACRO-AND-FN
acl2-8.5>  PRIMORDIAL-EVENT-MACROS-AND-FNS
acl2-8.5>  *INITIAL-TYPE-PRESCRIPTIONS*
acl2-8.5>  COLLECT-WORLD-GLOBALS
acl2-8.5>  PRIMORDIAL-WORLD-GLOBALS
acl2-8.5>  ARGLISTS-TO-NILS
acl2-8.5>  *UNATTACHABLE-PRIMITIVES*
acl2-8.5>  PUTPROP-RECOGNIZER-ALIST
acl2-8.5>  PRIMORDIAL-WORLD
acl2-8.5>  SAME-NAME-TWICE
acl2-8.5>  CONFLICTING-IMPORTS
acl2-8.5>  CHK-NEW-STRINGP-NAME
acl2-8.5>  CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS
acl2-8.5>  REMOVE-LISP-SUFFIX
acl2-8.5>  CONVERT-BOOK-NAME-TO-CERT-NAME
acl2-8.5>  UNRELATIVIZE-BOOK-PATH
acl2-8.5>  TILDE-@-DEFPKG-ERROR-PHRASE
acl2-8.5>  *1*-PKG-PREFIX*
acl2-8.5>  CHK-ACCEPTABLE-DEFPKG
acl2-8.5>  DEFPKG-FN
acl2-8.5>  THEORY-FN-CALLP
acl2-8.5>  INTERSECTION-AUGMENTED-THEORIES-FN1
acl2-8.5>  CHECK-THEORY-MSG1
acl2-8.5>  CHECK-THEORY-MSG
acl2-8.5>  CHECK-THEORY-ACTION
acl2-8.5>  CHECK-THEORY
acl2-8.5>  MAYBE-CHECK-THEORY
acl2-8.5>  INTERSECTION-THEORIES-FN
acl2-8.5>  INTERSECTION-THEORIES
acl2-8.5>  UNION-AUGMENTED-THEORIES-FN1
acl2-8.5>  UNION-THEORIES-FN1
acl2-8.5>  UNION-THEORIES-FN
acl2-8.5>  UNION-AUGMENTED-THEORIES-FN1+
acl2-8.5>  SET-DIFFERENCE-AUGMENTED-THEORIES-FN1
acl2-8.5>  SET-DIFFERENCE-AUGMENTED-THEORIES-FN1+
acl2-8.5>  SET-DIFFERENCE-THEORIES-FN1
acl2-8.5>  SET-DIFFERENCE-THEORIES-FN
acl2-8.5>  NO-AUGMENTED-RUNE-BASED-ON
acl2-8.5>  REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS1
acl2-8.5>  REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS
acl2-8.5>  CURRENT-THEORY-FN1
acl2-8.5>  CURRENT-THEORY-FN
acl2-8.5>  CURRENT-THEORY1-AUGMENTED
acl2-8.5>  UNION-CURRENT-THEORY-FN
acl2-8.5>  UNION-THEORIES
acl2-8.5>  SET-DIFFERENCE-CURRENT-THEORY-FN
acl2-8.5>  SET-DIFFERENCE-THEORIES
acl2-8.5>  UNIVERSAL-THEORY-FN1
acl2-8.5>  UNIVERSAL-THEORY-FN
acl2-8.5>  UNIVERSAL-THEORY
acl2-8.5>  FUNCTION-THEORY-FN1
acl2-8.5>  FUNCTION-THEORY-FN
acl2-8.5>  FUNCTION-THEORY
acl2-8.5>  EXECUTABLE-COUNTERPART-THEORY-FN
acl2-8.5>  EXECUTABLE-COUNTERPART-THEORY
acl2-8.5>  STANDARD-THEORIES
acl2-8.5>  CURRENT-THEORY
acl2-8.5>  END-PREHISTORIC-WORLD
acl2-8.5>  THEORY-NAMEP
acl2-8.5>  THEORY-FN
acl2-8.5>  THEORY
acl2-8.5>  REDUNDANT-DEFTHEORY-P
acl2-8.5>  DEFTHEORY-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-IN-THEORY-REDUNDANT-OKP
acl2-8.5>  IN-THEORY-FN
acl2-8.5>  IN-ARITHMETIC-THEORY-FN
acl2-8.5>  DISABLE
acl2-8.5>  ENABLE
acl2-8.5>  THEORY-INVARIANT-TABLE-GUARD
acl2-8.5>  THEORY-INVARIANT-TABLE
acl2-8.5>  THEORY-INVARIANT-FN
acl2-8.5>  THEORY-INVARIANT
acl2-8.5>  INCOMPATIBLE
acl2-8.5>  INCOMPATIBLE!
acl2-8.5>  *GENERIC-BAD-SIGNATURE-STRING*
acl2-8.5>  *SIGNATURE-KEYWORDS*
acl2-8.5>  DUPLICATE-KEY-IN-KEYWORD-VALUE-LISTP
acl2-8.5>  FORMALS-PRETTY-FLAGS-MISMATCH-MSG
acl2-8.5>  CHK-GLOBAL-STOBJS-VALUE
acl2-8.5>  CHK-SIGNATURE
acl2-8.5>  CHK-SIGNATURES
acl2-8.5>  CHK-ACCEPTABLE-ENCAPSULATE1
acl2-8.5>  NAME-INTRODUCED
acl2-8.5>  CHK-EMBEDDED-EVENT-FORM-ORIG-FORM-MSG
acl2-8.5>  *ACL2-DEFAULTS-TABLE-MACROS*
acl2-8.5>  CHK-EMBEDDED-EVENT-FORM
acl2-8.5>  DESTRUCTURE-EXPANSION
acl2-8.5>  REBUILD-EXPANSION
acl2-8.5>  SET-RAW-MODE-ON
acl2-8.5>  SET-RAW-MODE-OFF
acl2-8.5>  SET-RAW-MODE-ON!
acl2-8.5>  SET-RAW-MODE
acl2-8.5>  ALIST-TO-BINDINGS
acl2-8.5>  ACL2-RAW-EVAL
acl2-8.5>  GET-AND-CHK-LAST-MAKE-EVENT-EXPANSION
acl2-8.5>  *LOCAL-VALUE-TRIPLE-ELIDED*
acl2-8.5>  ELIDE-LOCALS
acl2-8.5>  (ELIDE-LOCALS-REC ELIDE-LOCALS-LST)
acl2-8.5>  MAKE-RECORD-EXPANSION?
acl2-8.5>  ACL2-SYSTEM-TABLE
acl2-8.5>  MAYBE-ADD-EVENT-LANDMARK
acl2-8.5>  EVAL-EVENT-LST
acl2-8.5>  EQUAL-INSIG
acl2-8.5>  BAD-SIGNATURE-ALIST
acl2-8.5>  IF-NS
acl2-8.5>  TILDE-*-BAD-INSIGS-PHRASE1
acl2-8.5>  TILDE-*-BAD-INSIGS-PHRASE
acl2-8.5>  UNION-EQ-CARS
acl2-8.5>  CHK-ACCEPTABLE-ENCAPSULATE2
acl2-8.5>  CONJOIN-INTO-ALIST
acl2-8.5>  CLASSES-THEOREMS
acl2-8.5>  CONSTRAINTS-INTRODUCED1
acl2-8.5>  NEW-TRIPS-REC
acl2-8.5>  NEW-TRIPS
acl2-8.5>  CONSTRAINTS-INTRODUCED
acl2-8.5>  PUTPROP-CONSTRAINTS
acl2-8.5>  MAYBE-INSTALL-ACL2-DEFAULTS-TABLE
acl2-8.5>  UPDATE-FOR-REDO-FLAT
acl2-8.5>  REDO-FLAT
acl2-8.5>  CERT-OP
acl2-8.5>  EVAL-EVENT-LST-ENVIRONMENT
acl2-8.5>  PROCESS-EMBEDDED-EVENTS
acl2-8.5>  CONSTRAINED-FUNCTIONS
acl2-8.5>  COLLECT-LOGICALS
acl2-8.5>  EXPORTED-FUNCTION-NAMES
acl2-8.5>  GET-SUBVERSIVES
acl2-8.5>  ANCESTRAL-FFN-SYMBS-LST
acl2-8.5>  ENCAPSULATE-CONSTRAINT
acl2-8.5>  BOGUS-EXPORTED-COMPLIANTS
acl2-8.5>  REMOVE-TYPE-PRESCRIPTION-CERT-DATA
acl2-8.5>  ENCAPSULATE-RETURN-VALUE-P
acl2-8.5>  ENCAPSULATE-PASS-2
acl2-8.5>  TILDE-@-ABBREVIATE-OBJECT-PHRASE
acl2-8.5>  ENCAPSULATE-CTX
acl2-8.5>  PRINT-ENCAPSULATE-MSG1
acl2-8.5>  PRINT-ENCAPSULATE-MSG2
acl2-8.5>  PRINT-ENCAPSULATE-MSG3/EXPORTED-NAMES
acl2-8.5>  PRINT-ENCAPSULATE-MSG3/CONSTRAINTS
acl2-8.5>  PRINT-ENCAPSULATE-MSG3
acl2-8.5>  (FIND-FIRST-NON-LOCAL-NAME FIND-FIRST-NON-LOCAL-NAME-LST)
acl2-8.5>  EQUAL-MOD-ELIDE-LOCALS1
acl2-8.5>  (EQUAL-MOD-ELIDE-LOCALS EQUAL-MOD-ELIDE-LOCALS-LST)
acl2-8.5>  CORRESPONDING-ENCAP-EVENTS
acl2-8.5>  CORRESPONDING-ENCAPS
acl2-8.5>  REDUNDANT-ENCAPSULATE-TUPLEP
acl2-8.5>  REDUNDANT-ENCAPSULATEP
acl2-8.5>  MARK-MISSING-AS-HIDDEN-P
acl2-8.5>  KNOWN-PACKAGE-ALIST-INCLUDED-P
acl2-8.5>  ENCAPSULATE-FIX-KNOWN-PACKAGE-ALIST
acl2-8.5>  SUBST-BY-POSITION1
acl2-8.5>  SUBST-BY-POSITION
acl2-8.5>  INTRO-UDF-GUARDS
acl2-8.5>  INTRO-UDF-GLOBAL-STOBJS
acl2-8.5>  INTRO-UDF-NON-CLASSICALP
acl2-8.5>  ASSOC-PROOF-SUPPORTERS-ALIST
acl2-8.5>  UPDATE-PROOF-SUPPORTERS-ALIST-3
acl2-8.5>  POSN-FIRST-NON-EVENT
acl2-8.5>  UPDATE-PROOF-SUPPORTERS-ALIST-2
acl2-8.5>  UPDATE-PROOF-SUPPORTERS-ALIST-1
acl2-8.5>  UPDATE-PROOF-SUPPORTERS-ALIST
acl2-8.5>  INSTALL-PROOF-SUPPORTERS-ALIST
acl2-8.5>  EMPTY-ENCAPSULATE
acl2-8.5>  CERT-DATA-TP-FROM-RUNIC-TYPE-PRESCRIPTION
acl2-8.5>  CERT-DATA-TPS-FROM-FNS
acl2-8.5>  CERT-DATA-FOR-CERTIFICATE
acl2-8.5>  NEWLY-DEFINED-TOP-LEVEL-FNS-REC
acl2-8.5>  NEWLY-DEFINED-TOP-LEVEL-FNS
acl2-8.5>  CERT-DATA-TPS-1
acl2-8.5>  CERT-DATA-TPS
acl2-8.5>  CERT-DATA-PASS1-SAVED
acl2-8.5>  FUNCTIONAL-SUBSTITUTION-P
acl2-8.5>  NEW-PROVED-FUNCTIONAL-INSTANCES-ALIST
acl2-8.5>  FAST-ALIST-FREE-CERT-DATA-ON-EXIT
acl2-8.5>  ENCAPSULATE-FN
acl2-8.5>  PROGN-FN1
acl2-8.5>  PROGN-FN
acl2-8.5>  PROGN!-FN
acl2-8.5>  CHK-BOOK-NAME
acl2-8.5>  INCLUDE-BOOK-ALIST-SUBSETP
acl2-8.5>  CBD-FN
acl2-8.5>  CBD
acl2-8.5>  GET-PORTCULLIS-CMDS
acl2-8.5>  OUR-MERGE-PATHNAMES
acl2-8.5>  CANONICAL-PATHNAME
acl2-8.5>  CANONICAL-DIRNAME!
acl2-8.5>  DIRECTORY-OF-ABSOLUTE-PATHNAME
acl2-8.5>  EXTEND-PATHNAME
acl2-8.5>  MAYBE-ADD-SEPARATOR
acl2-8.5>  SET-CBD-FN
acl2-8.5>  SET-CBD
acl2-8.5>  SET-CBD-STATE
acl2-8.5>  PARSE-BOOK-NAME
acl2-8.5>  SYSFILE-P
acl2-8.5>  SYSFILE-FILENAME
acl2-8.5>  FILENAME-TO-SYSFILE
acl2-8.5>  SYSFILE-TO-FILENAME
acl2-8.5>  (MAKE-INCLUDE-BOOKS-ABSOLUTE-1 MAKE-INCLUDE-BOOKS-ABSOLUTE-LST)
acl2-8.5>  MAKE-INCLUDE-BOOKS-ABSOLUTE
acl2-8.5>  FIRST-KNOWN-PACKAGE-ALIST
acl2-8.5>  DEFPKG-ITEMS-REC
acl2-8.5>  NEW-DEFPKG-P
acl2-8.5>  DEFPKG-ITEMS
acl2-8.5>  NEW-DEFPKG-LIST2
acl2-8.5>  MAKE-HIDDEN-DEFPKG
acl2-8.5>  NEW-DEFPKG-LIST1
acl2-8.5>  NEW-DEFPKG-LIST
acl2-8.5>  (TERM-IGNORE-OKP TERM-LIST-IGNORE-OKP)
acl2-8.5>  HIDDEN-DEFPKG-EVENTS1
acl2-8.5>  HIDDEN-DEFPKG-EVENTS
acl2-8.5>  FIX-PORTCULLIS-CMDS1
acl2-8.5>  FIX-PORTCULLIS-CMDS
acl2-8.5>  COLLECT-UNCERTIFIED-BOOKS
acl2-8.5>  CHK-IN-PACKAGE
acl2-8.5>  ILL-FORMED-CERTIFICATE-ER
acl2-8.5>  INCLUDE-BOOK-ER-WARNING-SUMMARY
acl2-8.5>  INCLUDE-BOOK-ER1
acl2-8.5>  INCLUDE-BOOK-ER
acl2-8.5>  POST-ALIST-FROM-CHANNEL
acl2-8.5>  CERTIFICATE-FILE-AND-INPUT-CHANNEL1
acl2-8.5>  PCERT-OP-P
acl2-8.5>  CERTIFICATE-FILE-AND-INPUT-CHANNEL
acl2-8.5>  CERT-ANNOTATIONS-AND-CHECKSUM-FROM-CERT-FILE
acl2-8.5>  TILDE-@-CERT-POST-ALIST-PHRASE
acl2-8.5>  ASSOC-FAMILIAR-NAME
acl2-8.5>  TILDE-*-BOOK-HASH-PHRASE1
acl2-8.5>  TILDE-*-BOOK-HASH-PHRASE
acl2-8.5>  GET-CMDS-FROM-PORTCULLIS1
acl2-8.5>  HIDDEN-DEFPKG-EVENTS-SIMPLE
acl2-8.5>  GET-CMDS-FROM-PORTCULLIS
acl2-8.5>  CONVERT-BOOK-NAME-TO-PORT-NAME
acl2-8.5>  CHK-RAISE-PORTCULLIS2
acl2-8.5>  CHK-RAISE-PORTCULLIS1
acl2-8.5>  MARK-LOCAL-INCLUDED-BOOKS
acl2-8.5>  UNMARK-AND-DELETE-LOCAL-INCLUDED-BOOKS
acl2-8.5>  EARLIER-ACL2-VERSIONP
acl2-8.5>  ACL2-VERSION-R-P
acl2-8.5>  SYSFILE-OR-STRING-LISTP
acl2-8.5>  TTAG-ALISTP
acl2-8.5>  CERT-ANNOTATIONSP
acl2-8.5>  WEAK-CERT-OBJ-P
acl2-8.5>  *TRIVIAL-BOOK-HASH*
acl2-8.5>  CERT-HASH
acl2-8.5>  INCLUDE-BOOK-ALIST-ENTRY-P
acl2-8.5>  SYSFILE-TO-FILENAME-TTAG-ALIST-VAL
acl2-8.5>  SYSFILE-TO-FILENAME-TTAG-ALISTP
acl2-8.5>  SYSFILE-TO-FILENAME-CERT-ANNOTATIONS
acl2-8.5>  SYSFILE-TO-FILENAME-INCLUDE-BOOK-ENTRY
acl2-8.5>  SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST1
acl2-8.5>  SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST
acl2-8.5>  FILENAME-TO-SYSFILE-TTAG-ALIST-VAL
acl2-8.5>  FILENAME-TO-SYSFILE-TTAG-ALISTP
acl2-8.5>  FILENAME-TO-SYSFILE-CERT-ANNOTATIONS
acl2-8.5>  FILENAME-TO-SYSFILE-INCLUDE-BOOK-ENTRY
acl2-8.5>  FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST1
acl2-8.5>  FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST
acl2-8.5>  KEYWORD-LISTP
acl2-8.5>  READ-FILE-INTO-TEMPLATE
acl2-8.5>  FAST-CERT-DATA
acl2-8.5>  CHK-RAISE-PORTCULLIS
acl2-8.5>  CHK-CERTIFICATE-FILE1
acl2-8.5>  CERTIFICATE-FILE
acl2-8.5>  CHK-CERTIFICATE-FILE
acl2-8.5>  EQUAL-MODULO-HIDDEN-DEFPKGS
acl2-8.5>  CERT-OBJ-FOR-CONVERT
acl2-8.5>  CHK-ACCEPTABLE-CERTIFY-BOOK1
acl2-8.5>  TRANSLATE-BOOK-NAMES
acl2-8.5>  FIX-TTAGS
acl2-8.5>  CHK-WELL-FORMED-TTAGS
acl2-8.5>  CHECK-CERTIFICATE-FILE-EXISTS
acl2-8.5>  ILLEGAL-TO-CERTIFY-CHECK
acl2-8.5>  CHK-ACCEPTABLE-CERTIFY-BOOK
acl2-8.5>  PRINT-OBJECTS
acl2-8.5>  REPLACE-INITIAL-SUBSTRING
acl2-8.5>  REPLACE-STRING-PREFIX-IN-TREE
acl2-8.5>  WITH-OUTPUT-OBJECT-CHANNEL-SHARING
acl2-8.5>  ELIDE-LOCALS-AND-SPLIT-EXPANSION-ALIST
acl2-8.5>  MAKE-CERTIFICATE-FILE1
acl2-8.5>  MAKE-CERTIFICATE-FILE
acl2-8.5>  MAKE-CERTIFICATE-FILES
acl2-8.5>  OPEN-INPUT-OBJECT-FILE
acl2-8.5>  READ-OBJECT-FILE1
acl2-8.5>  READ-OBJECT-FILE
acl2-8.5>  CHK-CERT-ANNOTATIONS
acl2-8.5>  CHK-CERT-ANNOTATIONS-POST-ALIST
acl2-8.5>  CHK-INPUT-OBJECT-FILE
acl2-8.5>  INCLUDE-BOOK-DIR
acl2-8.5>  INCLUDE-BOOK-DIR-WITH-CHK
acl2-8.5>  ACCUMULATE-POST-ALIST
acl2-8.5>  SKIPPED-PROOFSP-IN-POST-ALIST
acl2-8.5>  BOOK-HASH-ALIST
acl2-8.5>  BOOK-HASH
acl2-8.5>  WITH-HCOMP-BINDINGS
acl2-8.5>  WITH-HCOMP-HT-BINDINGS
acl2-8.5>  GET-DECLAIM-LIST
acl2-8.5>  TILDE-@-BOOK-STACK-MSG
acl2-8.5>  CONVERT-BOOK-NAME-TO-ACL2X-NAME
acl2-8.5>  ACL2X-ALISTP
acl2-8.5>  READ-ACL2X-FILE
acl2-8.5>  EVAL-PORT-FILE
acl2-8.5>  GETENV!
acl2-8.5>  UPDATE-PCERT-BOOKS
acl2-8.5>  CONVERT-NON-NIL-SYMBOLS-TO-KEYWORDS
acl2-8.5>  INCLUDE-BOOK-FN1
acl2-8.5>  CHK-INCLUDE-BOOK-INPUTS
acl2-8.5>  INCLUDE-BOOK-FN
acl2-8.5>  SPONTANEOUS-DECERTIFICATIONP1
acl2-8.5>  SPONTANEOUS-DECERTIFICATIONP
acl2-8.5>  REMOVE-DUPLICATES-EQUAL-FROM-END
acl2-8.5>  INCLUDE-BOOK-ALIST-SUBSETP-FAILURE-WITNESSES
acl2-8.5>  EXPANSION-FILENAME
acl2-8.5>  TOP-LEVEL-LOOP$-ALIST-REC
acl2-8.5>  TOP-LEVEL-LOOP$-ALIST
acl2-8.5>  WRITE-EXPANSION-FILE
acl2-8.5>  COLLECT-IDEAL-USER-DEFUNS1
acl2-8.5>  COLLECT-IDEAL-USER-DEFUNS
acl2-8.5>  SET-DIFFERENCE-EQ-SORTED
acl2-8.5>  PKG-NAMES0
acl2-8.5>  HONS-UNION-ORDERED-STRING-LISTS
acl2-8.5>  PKG-NAMES
acl2-8.5>  DELETE-NAMES-FROM-KPA-REC
acl2-8.5>  DELETE-NAMES-FROM-KPA
acl2-8.5>  PRINT-CERTIFY-BOOK-STEP-2
acl2-8.5>  PRINT-CERTIFY-BOOK-STEP-3
acl2-8.5>  PRINT-CERTIFY-BOOK-GUARDS-WARNING
acl2-8.5>  CHK-CERTIFY-BOOK-STEP-3
acl2-8.5>  PRINT-CERTIFY-BOOK-STEP-4
acl2-8.5>  PRINT-CERTIFY-BOOK-STEP-5
acl2-8.5>  HCOMP-BUILD-FROM-STATE
acl2-8.5>  ACL2X-EXPANSION-ALIST
acl2-8.5>  HONS-COPY-WITH-STATE
acl2-8.5>  IDENTITY-WITH-STATE
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  WRITE-ACL2X-FILE
acl2-8.5>  MERGE-INTO-EXPANSION-ALIST1
acl2-8.5>  ACL2X-ALISTP-DOMAINS-SUBSETP
acl2-8.5>  MERGE-INTO-EXPANSION-ALIST
acl2-8.5>  RESTRICT-EXPANSION-ALIST
acl2-8.5>  ELIDE-LOCALS-FROM-EXPANSION-ALIST
acl2-8.5>  WRITE-PORT-FILE
acl2-8.5>  SAVE-PARALLELISM-SETTINGS
acl2-8.5>  INCLUDE-BOOK-ALIST-EQUAL-MODULO-LOCAL
acl2-8.5>  COPY-OBJECT-CHANNEL-UNTIL-MARKER
acl2-8.5>  COPY-PCERT0-TO-PCERT1
acl2-8.5>  TOUCH?
acl2-8.5>  CONVERT-BOOK-NAME-TO-COMPILED-NAME
acl2-8.5>  CERTIFY-BOOK-FINISH-CONVERT
acl2-8.5>  INCLUDE-BOOK-ALIST-UNCERTIFIED-BOOKS
acl2-8.5>  COUNT-FORMS-IN-CHANNEL
acl2-8.5>  SKIP-FORMS-IN-CHANNEL
acl2-8.5>  POST-ALIST-FROM-PCERT1-1
acl2-8.5>  POST-ALIST-FROM-PCERT1
acl2-8.5>  CERTIFICATE-POST-ALIST
acl2-8.5>  CERTIFY-BOOK-FINISH-COMPLETE
acl2-8.5>  EXPANSION-ALIST-CONFLICT
acl2-8.5>  SYMBOL-PACKAGE-NAME-SET
acl2-8.5>  NAMES-OF-SYMBOLS-IN-PACKAGE
acl2-8.5>  SYMBOL-LIST-TO-PACKAGE-ALIST1
acl2-8.5>  SYMBOL-LIST-TO-PACKAGE-ALIST
acl2-8.5>  BOOKDATA-ALIST1
acl2-8.5>  BOOKDATA-ALIST
acl2-8.5>  MAYBE-WRITE-BOOKDATA
acl2-8.5>  FROMTO
acl2-8.5>  REMOVE-SMALLER-KEYS-FROM-SORTED-ALIST
acl2-8.5>  CERT-INCLUDE-EXPANSION-ALIST
acl2-8.5>  EVAL-HIDDEN-PACKAGES
acl2-8.5>  WITH-PACKAGES-UNHIDDEN
acl2-8.5>  READ-USELESS-RUNES2
acl2-8.5>  READ-USELESS-RUNES1
acl2-8.5>  READ-FILE-ITERATE-SAFE
acl2-8.5>  USELESS-RUNES-ENV-INFO
acl2-8.5>  USELESS-RUNES-SOURCE-MSG
acl2-8.5>  READ-USELESS-RUNES
acl2-8.5>  FREE-USELESS-RUNES
acl2-8.5>  USELESS-RUNES-VALUE
acl2-8.5>  INITIAL-USELESS-RUNES
acl2-8.5>  MAYBE-REFRESH-USELESS-RUNES
acl2-8.5>  UPDATE-USELESS-RUNES
acl2-8.5>  EVAL-SOME-PORTCULLIS-CMDS
acl2-8.5>  CERTIFY-BOOK-FN
acl2-8.5>  CERTIFY-BOOK
acl2-8.5>  CERTIFY-BOOK!
acl2-8.5>  REDUNDANT-DEFCHOOSEP
acl2-8.5>  CHK-ARGLIST-FOR-DEFCHOOSE
acl2-8.5>  WITHOUT-WARNINGS-FN
acl2-8.5>  WITHOUT-WARNINGS
acl2-8.5>  TRANSLATE-IGNORE-OK
acl2-8.5>  TRANSLATE-WITHOUT-WARNINGS-IGNORE-OK
acl2-8.5>  DEFCHOOSE-CONSTRAINT-BASIC
acl2-8.5>  GENERATE-VARIABLE-LST-SIMPLE
acl2-8.5>  DEFCHOOSE-CONSTRAINT-EXTRA
acl2-8.5>  DEFCHOOSE-CONSTRAINT
acl2-8.5>  DEFCHOOSE-FN
acl2-8.5>  *DEFUN-SK-KEYWORDS*
acl2-8.5>  NON-ACCEPTABLE-DEFUN-SK-P
acl2-8.5>  DEFINITION-RULE-NAME
acl2-8.5>  VERIFY-GUARDS?
acl2-8.5>  PARSE-DEFUN-SK-DCLS
acl2-8.5>  MAP-WITH-OUTPUT
acl2-8.5>  DEFUN-SK-FN
acl2-8.5>  TAMENESS-CONDITIONS
acl2-8.5>  SUCCESSIVE-CADRS
acl2-8.5>  MAKE-APPLY$-WARRANT-DEFUN-SK
acl2-8.5>  DEFUN-SK
acl2-8.5>  DOUBLET-STYLE-SYMBOL-TO-SYMBOL-ALISTP
acl2-8.5>  CHK-LEGAL-DEFSTOBJ-NAME
acl2-8.5>  CHK-UNRESTRICTED-GUARDS-FOR-TYPE-SPEC-TERM
acl2-8.5>  CHK-STOBJ-FIELD-TYPE-TERM
acl2-8.5>  CHK-STOBJ-FIELD-ETYPE
acl2-8.5>  CHK-STOBJ-FIELD-DESCRIPTOR
acl2-8.5>  CHK-ACCEPTABLE-DEFSTOBJ-RENAMING
acl2-8.5>  CHK-ACCEPTABLE-DEFSTOBJ1
acl2-8.5>  OLD-FIELD-DESCRIPTORS
acl2-8.5>  REDUNDANT-DEFSTOBJP
acl2-8.5>  CONGRUENT-STOBJ-FIELDS
acl2-8.5>  CHK-ACCEPTABLE-DEFSTOBJ
acl2-8.5>  DEFSTOBJ-FIELD-FNS-AXIOMATIC-DEFS
acl2-8.5>  DEFSTOBJ-AXIOMATIC-INIT-FIELDS
acl2-8.5>  DEFSTOBJ-CREATOR-DEF
acl2-8.5>  DEFSTOBJ-AXIOMATIC-DEFS
acl2-8.5>  PUT-STOBJS-IN-AND-OUTS1
acl2-8.5>  PUT-STOBJS-IN-AND-OUTS
acl2-8.5>  DEFCONST-NAME-ALIST
acl2-8.5>  ACCESSOR-ARRAY
acl2-8.5>  PUT-DEFSTOBJ-INVARIANT-RISK
acl2-8.5>  DEFSTOBJ-FN
acl2-8.5>  DEFABSSTOBJ
acl2-8.5>  CONCRETE-STOBJ
acl2-8.5>  DEFABSSTOBJ-MISSING-EVENTS
acl2-8.5>  REDUNDANT-DEFABSSTOBJP
acl2-8.5>  ABSSTOBJ-CORRESPONDENCE-CONCL-LST
acl2-8.5>  FLATTEN-ANDS-IN-LIT!
acl2-8.5>  ABSSTOBJ-CORRESPONDENCE-FORMULA
acl2-8.5>  ABSSTOBJ-PRESERVED-FORMULA
acl2-8.5>  WEAK-ABSSTOBJ-METHOD-P
acl2-8.5>  (FN-STOBJ-UPDATES-P STOBJ-UPDATES-P STOBJ-UPDATES-LISTP)
acl2-8.5>  UNPROTECTED-EXPORT-P
acl2-8.5>  TRANSLATE-ABSSTOBJ-FIELD
acl2-8.5>  SIMPLE-TRANSLATE-ABSSTOBJ-FIELDS
acl2-8.5>  ONE-WAY-UNIFY-P
acl2-8.5>  OBVIOUSLY-EQUAL-LAMBDA-ARGS
acl2-8.5>  (OBVIOUSLY-EQUIV-TERMS OBVIOUSLY-EQUIV-TERMS-LST)
acl2-8.5>  OBVIOUSLY-IFF-EQUIV-TERMS
acl2-8.5>  CHK-DEFABSSTOBJ-METHOD-LEMMAS
acl2-8.5>  CHK-DEFABSSTOBJ-METHOD
acl2-8.5>  INTERSPERSE
acl2-8.5>  SORT-ABSSTOBJ-NAMES
acl2-8.5>  CHK-ACCEPTABLE-DEFABSSTOBJ1
acl2-8.5>  FIRST-KEYWORD
acl2-8.5>  COLLECT-DEFABSSTOBJ-UPDATERS
acl2-8.5>  CHK-DEFABSSTOBJ-UPDATERS-1
acl2-8.5>  CHK-DEFABSSTOBJ-UPDATERS
acl2-8.5>  CHK-ACCEPTABLE-DEFABSSTOBJ
acl2-8.5>  DEFABSSTOBJ-AXIOMATIC-DEFS
acl2-8.5>  WITH-INSIDE-ABSSTOBJ-UPDATE
acl2-8.5>  DEFABSSTOBJ-RAW-DEF
acl2-8.5>  DEFABSSTOBJ-RAW-DEFS-REC
acl2-8.5>  DEFABSSTOBJ-RAW-DEFS
acl2-8.5>  EXPAND-RECOGNIZER
acl2-8.5>  PUT-ABSSTOBJS-IN-AND-OUTS
acl2-8.5>  METHOD-EXEC
acl2-8.5>  DEFABSSTOBJ-RAW-INIT
acl2-8.5>  DEFABSSTOBJ-MISSING-MSG
acl2-8.5>  UPDATE-GUARD-POST
acl2-8.5>  DEFABSSTOBJ-LOGIC-SUBST
acl2-8.5>  CHK-DEFABSSTOBJ-GUARD
acl2-8.5>  CHK-DEFABSSTOBJ-GUARDS1
acl2-8.5>  CHK-DEFABSSTOBJ-GUARDS
acl2-8.5>  MAKE-ABSSTOBJ-TUPLES
acl2-8.5>  PUT-DEFABSSTOBJ-INVARIANT-RISK
acl2-8.5>  KEY-POSITION-FROM-END-EQ
acl2-8.5>  CONGRUENT-ABSSTOBJ-TUPLES-REC
acl2-8.5>  CONGRUENT-ABSSTOBJ-TUPLES
acl2-8.5>  DEFABSSTOBJ-FN1
acl2-8.5>  DEFABSSTOBJ-FN
acl2-8.5>  CREATE-STATE
acl2-8.5>  WITH-LOCAL-STATE
acl2-8.5>  STOBJ-LET
acl2-8.5>  COLLECT-BADGED-FNS
acl2-8.5>  COLLECT-MACROS
acl2-8.5>  PUSH-UNTOUCHABLE-FN
acl2-8.5>  REMOVE-UNTOUCHABLE-FN
acl2-8.5>  DEF-BODY-LEMMAS
acl2-8.5>  SHOW-BODIES
acl2-8.5>  SET-BODY-FN1
acl2-8.5>  SET-BODY-FN
acl2-8.5>  TRACE-MULTIPLICITY
acl2-8.5>  *1*DEFP
acl2-8.5>  TRACE$-ER-MSG
acl2-8.5>  DECLS-AND-DOC
acl2-8.5>  TRACE$-WHEN-GCOND
acl2-8.5>  STOBJ-EVISCERATION-ALIST
acl2-8.5>  TRACE-EVISCERATION-ALIST
acl2-8.5>  SET-TRACE-EVISC-TUPLE
acl2-8.5>  CHK-TRACE-OPTIONS-AUX
acl2-8.5>  TRACE$-VALUE-MSGP
acl2-8.5>  CHK-TRACE-OPTIONS
acl2-8.5>  MEMOIZE-OFF-TRACE-ERROR
acl2-8.5>  UNTRACE$-FN1
acl2-8.5>  UNTRACE$-REC
acl2-8.5>  UNTRACE$-FN
acl2-8.5>  MAYBE-UNTRACE$-FN
acl2-8.5>  MAYBE-UNTRACE$
acl2-8.5>  TRACE$-FN-GENERAL
acl2-8.5>  TRACE$-FN-SIMPLE
acl2-8.5>  *TRACE-KEYWORDS*
acl2-8.5>  *TRACE-KEYWORDS-NEEDING-TTAG*
acl2-8.5>  FIRST-ASSOC-KEYWORD
acl2-8.5>  *ILLEGAL-TRACE-SPEC-FMT-STRING*
acl2-8.5>  TRACE$-FN
acl2-8.5>  TRACE$-LST
acl2-8.5>  TRACE$
acl2-8.5>  WITH-UBT!
acl2-8.5>  TRACE!
acl2-8.5>  UNTRACE$
acl2-8.5>  OPEN-TRACE-FILE-FN
acl2-8.5>  OPEN-TRACE-FILE
acl2-8.5>  CLOSE-TRACE-FILE-FN
acl2-8.5>  CLOSE-TRACE-FILE
acl2-8.5>  BREAK-ON-ERROR
acl2-8.5>  DEFEXEC-EXTRACT-KEY
acl2-8.5>  PARSE-DEFEXEC-DCLS-1
acl2-8.5>  FIX-EXEC-XARGS
acl2-8.5>  PARSE-DEFEXEC-DCLS
acl2-8.5>  DEFEXEC
acl2-8.5>  WEAK-SAR-P
acl2-8.5>  APPLICABLE-REWRITE-RULES1
acl2-8.5>  APPLICABLE-LINEAR-RULES1
acl2-8.5>  PC-RELIEVE-HYP
acl2-8.5>  (PC-RELIEVE-HYPS1-ITER PC-RELIEVE-HYPS1)
acl2-8.5>  PC-RELIEVE-HYPS
acl2-8.5>  REMOVE-TRIVIAL-LITS
acl2-8.5>  UNRELIEVED-HYPS
acl2-8.5>  UNTRANSLATE-SUBST-ABB
acl2-8.5>  SHOW-REWRITE-LINEAR
acl2-8.5>  SHOW-REWRITES-LINEARS
acl2-8.5>  EXPAND-ASSUMPTIONS-1
acl2-8.5>  EXPAND-ASSUMPTIONS
acl2-8.5>  HYPS-TYPE-ALIST
acl2-8.5>  SHOW-REWRITES-LINEARS-FN
acl2-8.5>  SHOW-META-LEMMAS1
acl2-8.5>  SHOW-META-LEMMAS
acl2-8.5>  DECODED-TYPE-SET-FROM-TP-RULE
acl2-8.5>  SHOW-TYPE-PRESCRIPTION-RULE
acl2-8.5>  SHOW-TYPE-PRESCRIPTION-RULES1
acl2-8.5>  SHOW-TYPE-PRESCRIPTION-RULES
acl2-8.5>  PL2-FN
acl2-8.5>  PL-FN
acl2-8.5>  PL
acl2-8.5>  PL2
acl2-8.5>  ACL2-DEFAULTS-TABLE-LOCAL-CTX-P
acl2-8.5>  CHANGE-INCLUDE-BOOK-DIR
acl2-8.5>  ADD-CUSTOM-KEYWORD-HINT-FN
acl2-8.5>  RESET-PREHISTORY
acl2-8.5>  DISABLE-UBT
acl2-8.5>  RESET-KILL-RING
acl2-8.5>  RESET-PREHISTORY-FN
acl2-8.5>  MEMOIZE-TABLE-CHK-COMMUTATIVE-MSG
acl2-8.5>  NON-MEMOIZABLE-STOBJS
acl2-8.5>  FILTER-ABSSTOBJS
acl2-8.5>  REMOVE-STOBJS-IN-BY-POSITION
acl2-8.5>  ADD-SUFFIX-TO-FN
acl2-8.5>  (FSUBCOR-VAR FSUBCOR-VAR-LST)
acl2-8.5>  (PRINT-GV-SUBSTITUTE-P1 PRINT-GV-SUBSTITUTE-P1-LST)
acl2-8.5>  PRINT-GV-SUBSTITUTE-P
acl2-8.5>  PRINT-GV-FORM
acl2-8.5>  PRINT-GV-CONJUNCT
acl2-8.5>  PRINT-GV1
acl2-8.5>  PRINT-GV-FN
acl2-8.5>  SET-PRINT-GV-DEFAULTS-FN
acl2-8.5>  SET-PRINT-GV-DEFAULTS
acl2-8.5>  PRINT-GV-EVISC-TUPLE
acl2-8.5>  PRINT-GV-DEFAULT
acl2-8.5>  PRINT-GV
acl2-8.5>  DISABLE-IPRINT-AR
acl2-8.5>  ENABLE-IPRINT-AR
acl2-8.5>  *IPRINT-ACTIONS*
acl2-8.5>  SET-IPRINT-FN1
acl2-8.5>  INIT-IPRINT-FAL+
acl2-8.5>  SET-IPRINT-FN
acl2-8.5>  SET-IPRINT
acl2-8.5>  *EVISC-TUPLE-SITES*
acl2-8.5>  SET-SITE-EVISC-TUPLE
acl2-8.5>  CHK-EVISC-TUPLE
acl2-8.5>  SET-EVISC-TUPLE-LST
acl2-8.5>  SET-EVISC-TUPLE-FN1
acl2-8.5>  IPRINT-VIRGINP
acl2-8.5>  SET-EVISC-TUPLE-FN
acl2-8.5>  SET-EVISC-TUPLE
acl2-8.5>  TOP-LEVEL
acl2-8.5>  NECC-NAME-ARGS-INSTANCE
acl2-8.5>  DEFWARRANT-EVENTS
acl2-8.5>  TRANSLATE-DEFATTACH-HELPERS
acl2-8.5>  *DEFATTACH-KEYS*
acl2-8.5>  DEFATTACH-UNKNOWN-CONSTRAINTS-ERROR
acl2-8.5>  INTERSECTION-DOMAINS
acl2-8.5>  PROCESS-DEFATTACH-ARGS1
acl2-8.5>  DUPLICATE-KEYSP-EQ
acl2-8.5>  SPLIT-AT-FIRST-KEYWORD
acl2-8.5>  MAYBE-REMOVE1-EQ
acl2-8.5>  FILTER-FOR-ATTACHMENT
acl2-8.5>  *DEFATTACH-KEYS-EXTENDED*
acl2-8.5>  PROCESS-DEFATTACH-ARGS
acl2-8.5>  PROVE-DEFATTACH-GUARDS1
acl2-8.5>  PROVE-DEFATTACH-GUARDS
acl2-8.5>  TRUE-APPLY$-WARRANT
acl2-8.5>  DEFATTACH-CONSTRAINT-REC
acl2-8.5>  DEFATTACH-CONSTRAINT
acl2-8.5>  PROVE-DEFATTACH-CONSTRAINT
acl2-8.5>  ATTACHMENT-COMPONENT-OWNER
acl2-8.5>  DEFATTACH-COMPONENT-HAS-OWNER
acl2-8.5>  DEFATTACH-MERGE-INTO-COMPONENT
acl2-8.5>  DEFATTACH-MERGE-COMPONENTS
acl2-8.5>  DEFATTACH-MERGE
acl2-8.5>  DEFATTACH-MERGE-LST
acl2-8.5>  DEFATTACH-MERGE-LST-LST
acl2-8.5>  DEFATTACH-LOOP-ERROR-MSG
acl2-8.5>  DEFATTACH-LOOP-ERROR
acl2-8.5>  DEFATTACH-CLOSE
acl2-8.5>  DEFATTACH-ERASE-COMPONENTS
acl2-8.5>  DEFATTACH-ERASE-P
acl2-8.5>  DEFATTACH-ERASE1
acl2-8.5>  DEFATTACH-ERASE
acl2-8.5>  COLLECT-EXT-ANC
acl2-8.5>  EXTEND-ATTACHMENT-COMPONENTS
acl2-8.5>  COMPONENT-PATH-EXTENSION
acl2-8.5>  EXTEND-ATTACHMENT-RECORD
acl2-8.5>  UPDATE-ATTACHMENT-RECORDS1
acl2-8.5>  UPDATE-ATTACHMENT-RECORDS
acl2-8.5>  ATTACHMENT-RECORDS
acl2-8.5>  CHK-DEFATTACH-LOOP
acl2-8.5>  DEFAXIOM-SUPPORTER-MSG-LIST
acl2-8.5>  DEFATTACH-GLOBAL-STOBJS-MSG
acl2-8.5>  CHK-ACCEPTABLE-DEFATTACH
acl2-8.5>  ATTACHMENT-CLTL-CMD
acl2-8.5>  DEFATTACH-FN
acl2-8.5>  DEFATTACH-SYSTEM
acl2-8.5>  CHK-RETURN-LAST-ENTRY
acl2-8.5>  RETURN-LAST-TABLE
acl2-8.5>  DEFMACRO-LAST
acl2-8.5>  *FMT-CONTROL-DEFAULTS*
acl2-8.5>  *FIXED-FMT-CONTROLS*
acl2-8.5>  FMT-CONTROL-BINDINGS1
acl2-8.5>  FMT-CONTROL-BINDINGS
acl2-8.5>  SET-IPRINT-AR
acl2-8.5>  OVERRIDE-GLOBAL-EVISC-TABLE
acl2-8.5>  CHANNEL-TO-STRING
acl2-8.5>  *FMT-CONTROL-DEFAULTS-KEYS*
acl2-8.5>  FMS-TO-STRING-FN
acl2-8.5>  FMS-TO-STRING
acl2-8.5>  FMS!-TO-STRING-FN
acl2-8.5>  FMS!-TO-STRING
acl2-8.5>  FMT-TO-STRING-FN
acl2-8.5>  FMT-TO-STRING
acl2-8.5>  FMT!-TO-STRING-FN
acl2-8.5>  FMT!-TO-STRING
acl2-8.5>  FMT1-TO-STRING-FN
acl2-8.5>  FMT1-TO-STRING
acl2-8.5>  FMT1!-TO-STRING-FN
acl2-8.5>  FMT1!-TO-STRING
acl2-8.5>  ATTACHMENT-PAIRS
acl2-8.5>  SIBLING-ATTACHMENTS
acl2-8.5>  EXT-ANCESTORS-ATTACHMENTS4
acl2-8.5>  EXT-ANCESTORS-ATTACHMENTS3
acl2-8.5>  EXT-ANCESTORS-ATTACHMENTS2
acl2-8.5>  CANONICAL-CDRS
acl2-8.5>  EXT-ANCESTORS-ATTACHMENTS1
acl2-8.5>  ATTACHMENT-RECORDS-FAL
acl2-8.5>  EXT-ANCESTORS-ATTACHMENTS
acl2-8.5>  EXT-ANC-ATTACHMENT-MISSING
acl2-8.5>  EXT-ANC-ATTACHMENTS-VALID-P-1
acl2-8.5>  EXT-ANC-ATTACHMENTS-VALID-P
acl2-8.5>  *INLINE-SUFFIX-LEN-MINUS-1*
acl2-8.5>  *NOTINLINE-SUFFIX*
acl2-8.5>  *NOTINLINE-SUFFIX-LEN-MINUS-1*
acl2-8.5>  *NON-STOBJ-VAR-ROOT*
acl2-8.5>  DEFUN-INLINE-FORM
acl2-8.5>  DEFUN-INLINE
acl2-8.5>  DEFUND-INLINE
acl2-8.5>  DEFUN-NOTINLINE
acl2-8.5>  DEFUND-NOTINLINE
acl2-8.5>  REGENERATE-TAU-DATABASE-FN0
acl2-8.5>  REGENERATE-TAU-DATABASE-FN1
acl2-8.5>  REGENERATE-TAU-DATABASE-FN
acl2-8.5>  RATIONAL-TO-DECIMAL-STRING
acl2-8.5>  DEFUND
acl2-8.5>  MAGIC-EV-FNCALL
acl2-8.5>  MAKE-EVENT-CTX
acl2-8.5>  PROTECTED-EVAL
acl2-8.5>  MAKE-EVENT-DEBUG-PRE
acl2-8.5>  MAKE-EVENT-DEBUG-POST
acl2-8.5>  DO-PROOFS?
acl2-8.5>  MAKE-EVENT-FN2
acl2-8.5>  MAKE-EVENT-FN2-LST
acl2-8.5>  MAKE-EVENT-FN1
acl2-8.5>  ULTIMATE-EXPANSION
acl2-8.5>  MAKE-EVENT-FN
acl2-8.5>  GET-CHECK-INVARIANT-RISK
acl2-8.5>  SET-CHECK-INVARIANT-RISK
acl2-8.5>  SET-CHECK-INVARIANT-RISK-FN
acl2-8.5>  GET-REGISTER-INVARIANT-RISK
acl2-8.5>  SET-REGISTER-INVARIANT-RISK
acl2-8.5>  SORT-FBOUNDPS
acl2-8.5>  DOPPELGANGER-BADGE-USERFN
acl2-8.5>  DOPPELGANGER-APPLY$-USERFN
acl2-8.5>  APPLY$-LAMBDA-LOGICAL
acl2-8.5>  OUR-QUOTE-MACRO
acl2-8.5>  VALUE-TRIPLE-FN1
acl2-8.5>  CHK-VALUE-TRIPLE
acl2-8.5>  VALUE-TRIPLE-FN
acl2-8.5>  COLLECT-NON-REDUNDANT
acl2-8.5>  REMOVE-VAR-FROM-TYPE-DCLS
acl2-8.5>  MEMOIZE-PARTIAL-DEF
acl2-8.5>  MEMOIZE-PARTIAL-DECLARE
acl2-8.5>  MEMOIZE-PARTIAL-SUPPORTING-EVENTS-1
acl2-8.5>  MEMOIZE-PARTIAL-SUPPORTING-EVENTS-REC
acl2-8.5>  FLET-BINDINGS
acl2-8.5>  MEMOIZE-PARTIAL-SUPPORTING-EVENTS
acl2-8.5>  MEMOIZE-PARTIAL-TUPLE-SHAPE-P
acl2-8.5>  MEMOIZE-PARTIAL-TRANSLATIONS-MSG-FORMALS
acl2-8.5>  (FREE-EXACTLY-IN-LAST-ARG-OF-CALLS FREE-EXACTLY-IN-LAST-ARG-OF-CALLS-LST)
acl2-8.5>  MEMOIZE-PARTIAL-TRANSLATIONS-MSG-BODIES
acl2-8.5>  MEMOIZE-PARTIAL-TRANSLATIONS-MSG
acl2-8.5>  PARTIAL-FUNCTIONS-TABLE-GUARD-MSG
acl2-8.5>  PARTIAL-FUNCTIONS-TABLE-GUARD
acl2-8.5>  PARTIAL-FUNCTIONS-TABLE
acl2-8.5>  MEMOIZE-INVOKE-EQUALITY-P
acl2-8.5>  MEMOIZE-INVOKE-EQUALITY-EXISTS
acl2-8.5>  MEMOIZE-INVOKE-GUARD-IMPLICATION-DEFAULT-NAME
acl2-8.5>  MEMOIZE-INVOKE-GUARD-IMPLICATION-TERM
acl2-8.5>  VERIFY-GUARD-IMPLICATION
acl2-8.5>  MEMOIZE-INVOKE-GUARD-THM-EXISTS-1
acl2-8.5>  MEMOIZE-INVOKE-GUARD-THM-EXISTS
acl2-8.5>  MEMOIZE-TABLE-CHK-INVOKE-MSG
acl2-8.5>  MEMOIZE-TABLE-CHK
acl2-8.5>  MEMOIZE-TABLE
acl2-8.5>  MEMOIZE-PARTIAL-CALLS
acl2-8.5>  MEMOIZE-PARTIAL-TUPLE-1
acl2-8.5>  MEMOIZE-PARTIAL-TUPLE
acl2-8.5>  MEMOIZE-PARTIAL-TUPLES
acl2-8.5>  MEMOIZE-PARTIAL-BASIC-CHECKS
acl2-8.5>  MEMOIZE-PARTIAL
acl2-8.5> 
acl2-8.5> Finished loading "other-events.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "ld.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  WEAK-LD-PROMPT-MEMO-P
acl2-8.5>  DEFAULT-PRINT-PROMPT
acl2-8.5>  PRINT-PROMPT
acl2-8.5>  INITIALIZE-TIMERS
acl2-8.5>  MAYBE-ADD-COMMAND-LANDMARK
acl2-8.5>  REPLACE-LAST-CDR
acl2-8.5>  LD-STANDARD-OI-MISSING
acl2-8.5>  CHK-ACCEPTABLE-LD-FN1-PAIR
acl2-8.5>  CLOSE-CHANNELS
acl2-8.5>  CHK-ACCEPTABLE-LD-FN1
acl2-8.5>  CHK-ACCEPTABLE-LD-FN
acl2-8.5>  F-PUT-LD-SPECIALS
acl2-8.5>  F-GET-LD-SPECIALS
acl2-8.5>  LD-READ-KEYWORD-COMMAND1
acl2-8.5>  EXIT-LD
acl2-8.5>  LD-READ-KEYWORD-COMMAND
acl2-8.5>  LD-FIX-COMMAND
acl2-8.5>  LD-READ-COMMAND
acl2-8.5>  LD-PRINT-COMMAND
acl2-8.5>  CONTINUE-FROM-ILLEGAL-STATE
acl2-8.5>  LD-FILTER-COMMAND
acl2-8.5>  LD-PRINT-RESULTS
acl2-8.5>  LD-PRINT-PROMPT
acl2-8.5>  LD-RETURN-ERROR
acl2-8.5>  INITIALIZE-ACCUMULATED-WARNINGS
acl2-8.5>  *EMPTY-LD-HISTORY-ENTRY*
acl2-8.5>  LD-HISTORY
acl2-8.5>  LD-HISTORY-ENTRY-INPUT
acl2-8.5>  LD-HISTORY-ENTRY-ERROR-FLG
acl2-8.5>  LD-HISTORY-ENTRY-STOBJS-OUT/VALUE
acl2-8.5>  LD-HISTORY-ENTRY-STOBJS-OUT
acl2-8.5>  LD-HISTORY-ENTRY-VALUE
acl2-8.5>  LD-HISTORY-ENTRY-USER-DATA
acl2-8.5>  SET-LD-HISTORY-ENTRY-USER-DATA
acl2-8.5>  SET-LD-HISTORY-ENTRY-USER-DATA-DEFAULT
acl2-8.5>  ADJUST-LD-HISTORY
acl2-8.5>  EXTEND-LD-HISTORY
acl2-8.5>  LD-READ-EVAL-PRINT
acl2-8.5>  LD-LOOP
acl2-8.5>  GET-DIRECTORY-OF-FILE
acl2-8.5>  UPDATE-CBD
acl2-8.5>  LD-FN-BODY
acl2-8.5>  LD-FN1
acl2-8.5>  LD-FN-ALIST
acl2-8.5>  LD-FN0
acl2-8.5>  LD-FN
acl2-8.5>  LD
acl2-8.5>  QUICK-TEST
acl2-8.5>  WORMHOLE-PROMPT
acl2-8.5>  RESET-LD-SPECIALS-FN
acl2-8.5>  RESET-LD-SPECIALS
acl2-8.5>  MAYBE-RESET-DEFAULTS-TABLE1
acl2-8.5>  MAYBE-RESET-DEFAULTS-TABLE2
acl2-8.5>  MAYBE-RESET-DEFAULTS-TABLE
acl2-8.5>  DELETE-SOMETHING
acl2-8.5>  STORE-IN-KILL-RING
acl2-8.5>  ROTATE-KILL-RING1
acl2-8.5>  ROTATE-KILL-RING
acl2-8.5>  UBT-UBU-FN1
acl2-8.5>  UBT?-UBU?-FN
acl2-8.5>  UBT-UBU-FN
acl2-8.5>  UBT!-UBU!-FN
acl2-8.5>  UBT-PREHISTORY
acl2-8.5>  UBT-PREHISTORY-FN
acl2-8.5>  OOPS-WARNING
acl2-8.5>  OOPS-FN
acl2-8.5>  OOPS
acl2-8.5>  I-AM-HERE
acl2-8.5>  REBUILD-FN-READ-FILTER
acl2-8.5>  REBUILD-FN
acl2-8.5>  REBUILD
acl2-8.5>  *BASIC-SWEEP-ERROR-STR*
acl2-8.5>  SWEEP-SYMBOL-BINDING-FOR-BAD-SYMBOL
acl2-8.5>  SWEEP-GLOBAL-LST
acl2-8.5>  SWEEP-STACK-ENTRY-FOR-BAD-SYMBOL
acl2-8.5>  SWEEP-T-STACK
acl2-8.5>  SWEEP-ACL2-ORACLE
acl2-8.5>  SWEEP-GLOBAL-STATE-FOR-LISP-OBJECTS
acl2-8.5>  WET
acl2-8.5>  DISASSEMBLE$
acl2-8.5>  NEAR-MISSES
acl2-8.5>  COMPILE-FUNCTION
acl2-8.5>  KEEP-TMP-FILES
acl2-8.5>  COMP-FN
acl2-8.5>  COMP
acl2-8.5>  COMP-GCL
acl2-8.5>  SCAN-PAST-DEEPER-EVENT-LANDMARKS
acl2-8.5>  PUFFABLE-ENCAPSULATE-P
acl2-8.5>  PUFFABLE-COMMAND-BLOCKP
acl2-8.5>  PUFFABLE-COMMAND-NUMBERP
acl2-8.5>  PUFF-INCLUDE-BOOK
acl2-8.5>  PUFF-COMMAND-BLOCK1
acl2-8.5>  PUFF-COMMAND-BLOCK
acl2-8.5>  COMMANDS-BACK-TO-1
acl2-8.5>  COMMANDS-BACK-TO
acl2-8.5>  PUFFED-COMMAND-SEQUENCE
acl2-8.5>  LD-READ-EVAL-PRINT-SIMPLE
acl2-8.5>  LD-LOOP-SIMPLE
acl2-8.5>  LD-SIMPLE
acl2-8.5>  PUFF-FN1
acl2-8.5>  PUFF-REPORT
acl2-8.5>  PUFF-FN
acl2-8.5>  PUFF*-FN11
acl2-8.5>  PUFF*-FN1
acl2-8.5>  PUFF*-FN
acl2-8.5>  PUFF
acl2-8.5>  PUFF*
acl2-8.5>  MINI-PROVEALL
acl2-8.5>  SET-GUARD-CHECKING
acl2-8.5>  GET-GUARD-CHECKING
acl2-8.5>  DMR-STOP-FN
acl2-8.5>  DMR-STOP
acl2-8.5>  DMR-START-FN
acl2-8.5>  DMR-START
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1A*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1B*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1C*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1D*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-1E*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-2*
acl2-8.5>  *META-LEVEL-FUNCTION-PROBLEM-3*
acl2-8.5>  MFC-AP-FN
acl2-8.5>  MFC-RELIEVE-HYP-FN
acl2-8.5>  MFC-RELIEVE-HYP-TTREE
acl2-8.5>  MFC-RW+-FN
acl2-8.5>  MFC-RW+-TTREE
acl2-8.5>  MFC-RW-FN
acl2-8.5>  MFC-RW-TTREE
acl2-8.5>  MFC-TS-FN
acl2-8.5>  MFC-TS-TTREE
acl2-8.5>  TRUST-MFC
acl2-8.5>  MFC-TS
acl2-8.5>  MFC-RW
acl2-8.5>  MFC-RW+
acl2-8.5>  MFC-RELIEVE-HYP
acl2-8.5>  MFC-AP
acl2-8.5>  CONGRUENCE-RULE-LISTP
acl2-8.5>  TERM-ALISTP-FAILURE-MSG
acl2-8.5>  FIND-RUNED-LINEAR-LEMMA
acl2-8.5>  MFC-FORCE-FLG
acl2-8.5>  UPDATE-RNCST-FOR-FORCEP
acl2-8.5>  PRINT-SAVED-OUTPUT-LST
acl2-8.5>  PRINT-SAVED-OUTPUT
acl2-8.5>  CONVERT-IO-MARKERS-LST
acl2-8.5>  CONVERT-IO-MARKERS
acl2-8.5>  PSO
acl2-8.5>  PSOG
acl2-8.5>  PSO!
acl2-8.5>  SET-RAW-PROOF-FORMAT
acl2-8.5>  SET-RAW-WARNING-FORMAT
acl2-8.5>  SET-STANDARD-CO-STATE
acl2-8.5>  SET-PROOFS-CO-STATE
acl2-8.5>  WITH-STANDARD-CO-AND-PROOFS-CO-TO-FILE
acl2-8.5>  WOF
acl2-8.5>  PSOF
acl2-8.5>  SET-LD-EVISC-TUPLE
acl2-8.5>  SET-LD-EVISC-TUPLE-STATE
acl2-8.5>  SET-ABBREV-EVISC-TUPLE
acl2-8.5>  SET-ABBREV-EVISC-TUPLE-STATE
acl2-8.5>  SET-GAG-MODE-EVISC-TUPLE
acl2-8.5>  SET-GAG-MODE-EVISC-TUPLE-STATE
acl2-8.5>  SET-TERM-EVISC-TUPLE
acl2-8.5>  SET-TERM-EVISC-TUPLE-STATE
acl2-8.5>  WITHOUT-EVISC-FN
acl2-8.5>  WITHOUT-EVISC
acl2-8.5> 
acl2-8.5> Finished loading "ld.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "proof-builder-b.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  INSTALL-NEW-PC-META-OR-MACRO
acl2-8.5>  DEFINE-PC-META-OR-MACRO-FN
acl2-8.5>  DEFINE-PC-META
acl2-8.5>  DEFINE-PC-MACRO
acl2-8.5>  DEFINE-PC-ATOMIC-MACRO
acl2-8.5>  TOGGLE-PC-MACRO
acl2-8.5>  DEFINE-PC-PRIMITIVE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  NON-BOUNDED-NUMS
acl2-8.5>  DELETE-BY-POSITION
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  CHK-ASSUMPTION-FREE-TTREE-1
acl2-8.5>  PUT-CDR-ASSOC-QUERY-ID
acl2-8.5>  SET-QUERY-VAL
acl2-8.5>  QUERY-ON-EXIT
acl2-8.5>  REPLAY-QUERY
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PRINT-COMMANDS
acl2-8.5>  MAKE-PRETTY-START-INSTR
acl2-8.5>  RAW-INDEXED-INSTRS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  DEFINE-PC-HELP
acl2-8.5>  EVISC-INDEXED-INSTRS-1
acl2-8.5>  EVISC-INDEXED-INSTRS-REC
acl2-8.5>  MARK-UNFINISHED-INSTRS
acl2-8.5>  EVISC-INDEXED-INSTRS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PROMOTE-GUTS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  REMOVE-BY-INDICES
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  BOUNDED-INTEGER-LISTP
acl2-8.5>  FETCH-TERM-AND-CL
acl2-8.5>  FETCH-TERM
acl2-8.5>  GOVERNORS
acl2-8.5>  TERM-ID-IFF
acl2-8.5>  ?
acl2-8.5>  ?-FN
acl2-8.5>  ABBREVIATIONS-ALIST
acl2-8.5>  (CHK-?S CHK-?S-LST)
acl2-8.5>  REMOVE-?S
acl2-8.5>  TRANSLATE-ABB
acl2-8.5>  TRANS0
acl2-8.5>  P-BODY
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  TAKE-BY-INDICES
acl2-8.5>  PRINT-HYPS
acl2-8.5>  SOME->
acl2-8.5>  PRINT-HYPS-TOP
acl2-8.5>  PRINT-GOVERNORS-TOP
acl2-8.5>  PAIR-INDICES
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PAIR-KEYWORDS
acl2-8.5>  NULL-POOL
acl2-8.5>  INITIAL-PSPV
acl2-8.5>  PC-PROVE
acl2-8.5>  ABBREVIATIONS-ALIST-?
acl2-8.5>  FIND-?-FN
acl2-8.5>  UNPROVED-PC-PROVE-CLAUSES
acl2-8.5>  PROVER-CALL
acl2-8.5>  MAKE-NEW-GOALS
acl2-8.5>  SAME-GOAL
acl2-8.5>  REMOVE-BYES-FROM-TAG-TREE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST-1
acl2-8.5>  ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST
acl2-8.5>  ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST!
acl2-8.5>  *BASH-SKIP-FORCING-ROUND-HINTS*
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  NOT-IN-DOMAIN-EQ
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PRINT-ABBREVIATIONS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  DROP-FROM-END
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  EXPAND-ADDRESS-RECURSE
acl2-8.5>  DIVE-ONCE-MORE-ERROR
acl2-8.5>  ABBREVIATION-RAW-TERM-P
acl2-8.5>  ADDR-RECUR
acl2-8.5>  OR-ADDR
acl2-8.5>  AND-ADDR
acl2-8.5>  DIVE-INTO-MACROS-TABLE
acl2-8.5>  ADD-DIVE-INTO-MACRO
acl2-8.5>  REMOVE-DIVE-INTO-MACRO
acl2-8.5>  DIVE-INTO-MACROS-TABLE
acl2-8.5>  RASSOC-EQ-AS-CAR
acl2-8.5>  *CA<D^N>R-ALIST*
acl2-8.5>  CAR/CDR^N
acl2-8.5>  EXPAND-ADDRESS-MSG
acl2-8.5>  EXPAND-ADDRESS
acl2-8.5>  DV-ERROR
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  (DEPOSIT-TERM DEPOSIT-TERM-LST)
acl2-8.5>  GENEQV-AT-SUBTERM
acl2-8.5>  GENEQV-AT-SUBTERM-TOP
acl2-8.5>  MAYBE-TRUNCATE-CURRENT-ADDRESS
acl2-8.5>  DEPOSIT-TERM-IN-GOAL
acl2-8.5>  SPLIT-IMPLIES
acl2-8.5>  FIND-EQUIVALENCE-HYP-TERM
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PRINT-ON-SEPARATE-LINES
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  MODIFIED-ERROR-TRIPLE-FOR-SEQUENCE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  EXTRACT-GOAL
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  CHANGE-BY-POSITION
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  DEFINE-PC-BIND*
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  FIND-EQUIVALENCE-HYP-TERM-NO-TARGET
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  APPLICABLE-REWRITE-RULES
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  TRANSLATE-SUBST-ABB1
acl2-8.5>  SINGLE-VALUED-SYMBOLP-ALISTP
acl2-8.5>  CHECK-CARS-ARE-VARIABLES
acl2-8.5>  TRANSLATE-SUBST-ABB
acl2-8.5>  MAKE-REWRITE-INSTR
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  APPLICABLE-LINEAR-RULES
acl2-8.5>  MAKE-LINEAR-INSTR
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-REWRITE*-1
acl2-8.5>  PC-REWRITE*
acl2-8.5>  MAKE-GOALS-FROM-ASSUMPTIONS
acl2-8.5>  MAKE-NEW-GOALS-FROM-ASSUMPTIONS
acl2-8.5>  *DEFAULT-S-REPEAT-LIMIT*
acl2-8.5>  HYPS-TYPE-ALIST-AND-POT-LST
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  BUILD-PC-ENABLED-STRUCTURE-FROM-ENS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  CHANGE-LAST
acl2-8.5>  ASSIGN-EVENT-NAME-AND-RULE-CLASSES
acl2-8.5>  SAVE-FN
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  RETRIEVE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  UNSAVE-FN
acl2-8.5>  UNSAVE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  SHOW-RETRIEVED-GOAL
acl2-8.5>  RETRIEVE-FN
acl2-8.5>  PRINT-ALL-GOALS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PRINT-CONC
acl2-8.5>  PRINT-ALL-CONCS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  GEN-VAR-MARKER
acl2-8.5>  TRANSLATE-GENERALIZE-ALIST-1
acl2-8.5>  NON-GEN-VAR-MARKERS
acl2-8.5>  FIND-DUPLICATE-GENERALIZE-ENTRIES
acl2-8.5>  TRANSLATE-GENERALIZE-ALIST-2
acl2-8.5>  TRANSLATE-GENERALIZE-ALIST
acl2-8.5>  ALL-VARS-GOALS
acl2-8.5>  PC-STATE-VARS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  RUN-INSTR-ON-GOALS-GUTS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  INSTR-NAME
acl2-8.5>  PC-FREE-INSTR-P
acl2-8.5>  FIND-POSSIBLE-PUT
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  SAVE-FC-REPORT-SETTINGS
acl2-8.5>  RESTORE-FC-REPORT-SETTINGS
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  ACL2-WRAP
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  GOAL-TERMS
acl2-8.5>  WRAP1-AUX1
acl2-8.5>  WRAP1-AUX2
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  SHOW-GENEQV
acl2-8.5>  PC-COMMAND-TABLE
acl2-8.5>  GOALS-TO-CLAUSE-LIST
acl2-8.5>  PROOF-BUILDER-CLAUSE-LIST
acl2-8.5>  TTREE-TO-SUMMARY-DATA
acl2-8.5>  PROOF-BUILDER-CL-PROC-1
acl2-8.5>  PROOF-BUILDER-CL-PROC
acl2-8.5>  T
acl2-8.5>  ((:INSTRUCTIONS
acl2-8.5>     (SPLICE-KEYWORD-ALIST :INSTRUCTIONS
acl2-8.5>                           (LIST :CLAUSE-PROCESSOR (LIST :FUNCTION # :HINT #))
acl2-8.5>                           KEYWORD-ALIST)
acl2-8.5>     (VALUE T)))
acl2-8.5> 
acl2-8.5> Finished loading "proof-builder-b.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading "defpkgs.lisp".
acl2-8.5>  "ACL2"
acl2-8.5>  *ACL2-EXPORTS*
acl2-8.5>  "ACL2-USER"
acl2-8.5> 
acl2-8.5> Finished loading "defpkgs.lisp".
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFUN TAILS-AC (LST AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN TAILS (LST)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (MBE :LOGIC (COND # #)
acl2-8.5>               :EXEC (TAILS-AC LST NIL)))
acl2-8.5>   (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (# T) (T #)))
acl2-8.5>   (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN LOOP$-AS-AC (TUPLE AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  TAILS-AC
acl2-8.5>  TAILS
acl2-8.5>  EMPTY-LOOP$-AS-TUPLEP
acl2-8.5>  CAR-LOOP$-AS-TUPLE
acl2-8.5>  CDR-LOOP$-AS-TUPLE
acl2-8.5>  LOOP$-AS-AC
acl2-8.5>  LOOP$-AS
acl2-8.5>  FROM-TO-BY-MEASURE
acl2-8.5>  FROM-TO-BY-AC
acl2-8.5>  FROM-TO-BY
acl2-8.5>  REVAPPEND-TRUE-LIST-FIX
acl2-8.5>  *APPLY$-USERFN-CALLERS*
acl2-8.5>  *BLACKLISTED-APPLY$-FNS*
acl2-8.5>  SPLIT-SYSTEM-VERIFY-GUARDS-ALIST
acl2-8.5>  *SYSTEM-VERIFY-GUARDS-ALIST*
acl2-8.5>  NIL
acl2-8.5>  COMPUTE-BADGE-OF-PRIMITIVES
acl2-8.5>  NIL
acl2-8.5>  APPLY$-BADGEP
acl2-8.5>  N-CAR-CADR-CADDR-ETC
acl2-8.5>  MAKE-APPLY$-PRIM-BODY-FN
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFUN TAILS-AC (LST AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN TAILS (LST)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (MBE :LOGIC (COND # #)
acl2-8.5>               :EXEC (TAILS-AC LST NIL)))
acl2-8.5>   (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (# T) (T #)))
acl2-8.5>   (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN LOOP$-AS-AC (TUPLE AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2 (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM BADGE-USERFN-TYPE #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES NIL))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (DEFSTUB UNTAME-EV$ (X A) T)
acl2-8.5>                (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
acl2-8.5>                          (CONS # #)))).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2 (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM BADGE-USERFN-TYPE #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES NIL))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (DEFSTUB UNTAME-EV$ (X A) T)
acl2-8.5>                (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
acl2-8.5>                          (CONS # #)))).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2
acl2-8.5>        (DEFUN BADGE (FN)
acl2-8.5>               (DECLARE #)
acl2-8.5>               (COND # # # # # # ...))
acl2-8.5>        (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
acl2-8.5>        (DEFABBREV TAMEP-LAMBDAP (FN)
acl2-8.5>                   (AND # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN TAMEP # # #)
acl2-8.5>                          (DEFUN TAMEP-FUNCTIONP # # #)
acl2-8.5>                          (DEFUN SUITABLY-TAMEP-LISTP # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN APPLY$ # # #)
acl2-8.5>                          (DEFUN APPLY$-LAMBDA # # #)
acl2-8.5>                          (DEFUN EV$ # # #)
acl2-8.5>                          (DEFUN EV$-LIST # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #)
acl2-8.5>                          (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #))
acl2-8.5>        ...)).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2
acl2-8.5>        (DEFUN BADGE (FN)
acl2-8.5>               (DECLARE #)
acl2-8.5>               (COND # # # # # # ...))
acl2-8.5>        (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
acl2-8.5>        (DEFABBREV TAMEP-LAMBDAP (FN)
acl2-8.5>                   (AND # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN TAMEP # # #)
acl2-8.5>                          (DEFUN TAMEP-FUNCTIONP # # #)
acl2-8.5>                          (DEFUN SUITABLY-TAMEP-LISTP # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN APPLY$ # # #)
acl2-8.5>                          (DEFUN APPLY$-LAMBDA # # #)
acl2-8.5>                          (DEFUN EV$ # # #)
acl2-8.5>                          (DEFUN EV$-LIST # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #)
acl2-8.5>                          (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #))
acl2-8.5>        ...)).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading '((LOGIC)).
acl2-8.5> 
acl2-8.5> Finished loading '((LOGIC)).
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
acl2-8.5>             '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
acl2-8.5>                                 &AUX *PRINT-PPRINT-DISPATCH*
acl2-8.5>                                 &BODY *PRINT-PRETTY* &ENVIRONMENT ...))
acl2-8.5>   (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
acl2-8.5>             '(* ** *** *BREAK-ON-SIGNALS*
acl2-8.5>                 *COMPILE-FILE-PATHNAME*
acl2-8.5>                 *COMPILE-FILE-TRUENAME*
acl2-8.5>                 *COMPILE-PRINT* ...))
acl2-8.5>   (DEFCONST NIL 'NIL)
acl2-8.5>   (DEFCONST T 'T)
acl2-8.5>   (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
acl2-8.5>   (DEFMACRO MAKE-PACKAGE-ENTRY
acl2-8.5>             (&KEY NAME IMPORTS HIDDEN-P
acl2-8.5>                   BOOK-PATH DEFPKG-EVENT-FORM TTERM)
acl2-8.5>             (CONS 'LIST* (CONS NAME #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  IFF
acl2-8.5>  XOR
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  IFF-IS-AN-EQUIVALENCE
acl2-8.5>  :REDUNDANT
acl2-8.5>  IFF-IMPLIES-EQUAL-IMPLIES-1
acl2-8.5>  IFF-IMPLIES-EQUAL-IMPLIES-2
acl2-8.5>  :REDUNDANT
acl2-8.5>  IFF-IMPLIES-EQUAL-NOT
acl2-8.5>  HIDE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LIST-MACRO
acl2-8.5>  :REDUNDANT
acl2-8.5>  AND-MACRO
acl2-8.5>  :REDUNDANT
acl2-8.5>  OR-MACRO
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BOOLEANP-COMPOUND-RECOGNIZER
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 887)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  COND-CLAUSESP
acl2-8.5>  COND-MACRO
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  EQLABLEP-RECOG
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 895)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  EQLABLE-ALISTP-FORWARD-TO-ALISTP
acl2-8.5>  ACONS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP
acl2-8.5>  SYMBOL-DOUBLET-LISTP
acl2-8.5>  REVERSE-STRIP-CARS
acl2-8.5>  :REDUNDANT
acl2-8.5>  REVERSE-STRIP-CDRS
acl2-8.5>  STRIP-CDRS
acl2-8.5>  :REDUNDANT
acl2-8.5>  ILLEGAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  RETURN-LAST-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  TRUE-LISTP-APPEND
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  APPEND-TO-NIL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  STRING-LISTP
acl2-8.5>  STRING-APPEND-LST
acl2-8.5>  GUARD-CHECK-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MEMBER-EQ-EXEC-IS-MEMBER-EQUAL
acl2-8.5>  MEMBER-EQL-EXEC-IS-MEMBER-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  SUBSETP-EQ-EXEC
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SUBSETP-EQ-EXEC-IS-SUBSETP-EQUAL
acl2-8.5>  SUBSETP-EQL-EXEC-IS-SUBSETP-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP
acl2-8.5>  CHARACTER-ALISTP
acl2-8.5>  CHARACTER-ALISTP-FORWARD-TO-EQLABLE-ALISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ASSOC-EQ-EXEC-IS-ASSOC-EQUAL
acl2-8.5>  ASSOC-EQL-EXEC-IS-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  ASSOC-EQ-EQUAL-ALISTP
acl2-8.5>  ASSOC-EQ-SAFE
acl2-8.5>  ASSOC-EQ-EQUAL
acl2-8.5>  ASSOC-EQ-CADR
acl2-8.5>  ASSOC-EQUAL-CADR
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ZP-COMPOUND-RECOGNIZER
acl2-8.5>  ZP-OPEN
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 976)
acl2-8.5>  :REDUNDANT
acl2-8.5>  ZIP-COMPOUND-RECOGNIZER
acl2-8.5>  ZIP-OPEN
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 977)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SLEEP
acl2-8.5>  PROPER-CONSP
acl2-8.5>  IMPROPER-CONSP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CONJUGATE
acl2-8.5>  ADD-SUFFIX
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 991)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  COMPLEX-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 991)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  EXTRA-INFO
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 991)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 991)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BASIC-TAU-RULES
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NO-DUPLICATESP-EQ-EXEC-IS-NO-DUPLICATESP-EQUAL
acl2-8.5>  NO-DUPLICATESP-EQL-EXEC-IS-NO-DUPLICATESP-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  R-EQLABLE-ALISTP
acl2-8.5>  R-SYMBOL-ALISTP
acl2-8.5>  RASSOC-EQ-EXEC
acl2-8.5>  RASSOC-EQL-EXEC
acl2-8.5>  RASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  RASSOC-EQ-EXEC-IS-RASSOC-EQUAL
acl2-8.5>  RASSOC-EQL-EXEC-IS-RASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  RFIX
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NATP-COMPOUND-RECOGNIZER
acl2-8.5>  NAT-ALISTP
acl2-8.5>  NAT-ALISTP-FORWARD-TO-EQLABLE-ALISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  BITP-COMPOUND-RECOGNIZER
acl2-8.5>  BITP-AS-INEQUALITY
acl2-8.5>  :REDUNDANT
acl2-8.5>  POSP-COMPOUND-RECOGNIZER
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  O-P
acl2-8.5>  O-P-IMPLIES-O<G
acl2-8.5>  O-P
acl2-8.5>  MAKE-ORD
acl2-8.5>  :REDUNDANT
acl2-8.5>  STANDARD-CHAR-P
acl2-8.5>  STANDARD-CHAR-P+
acl2-8.5>  STANDARD-CHAR-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP
acl2-8.5>  STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1051)
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALPHA-CHAR-P
acl2-8.5>  UPPER-CASE-P
acl2-8.5>  LOWER-CASE-P
acl2-8.5>  CHAR-UPCASE
acl2-8.5>  CHAR-DOWNCASE
acl2-8.5>  LOWER-CASE-P-CHAR-DOWNCASE
acl2-8.5>  UPPER-CASE-P-CHAR-UPCASE
acl2-8.5>  LOWER-CASE-P-FORWARD-TO-ALPHA-CHAR-P
acl2-8.5>  UPPER-CASE-P-FORWARD-TO-ALPHA-CHAR-P
acl2-8.5>  ALPHA-CHAR-P-FORWARD-TO-STANDARD-CHAR-P
acl2-8.5>  STANDARD-CHAR-P-FORWARD-TO-CHARACTERP
acl2-8.5>  CHARACTERP-CHAR-DOWNCASE
acl2-8.5>  CHARACTERP-CHAR-UPCASE
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1069)
acl2-8.5>  STRING-DOWNCASE1
acl2-8.5>  CHARACTER-LISTP-STRING-DOWNCASE-1
acl2-8.5>  STRING-DOWNCASE
acl2-8.5>  STRING-UPCASE1
acl2-8.5>  CHARACTER-LISTP-STRING-UPCASE1-1
acl2-8.5>  STRING-UPCASE
acl2-8.5>  OUR-DIGIT-CHAR-P
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHAR-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  ATOM-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  GOOD-ATOM-LISTP-FORWARD-TO-ATOM-LISTP
acl2-8.5>  CHARACTERP-NTH
acl2-8.5>  STANDARD-STRING-P1
acl2-8.5>  STANDARD-STRING-P
acl2-8.5>  STANDARD-STRING-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  STANDARD-STRING-ALISTP
acl2-8.5>  STANDARD-STRING-ALISTP-FORWARD-TO-ALISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  LIST*-MACRO
acl2-8.5>  :REDUNDANT
acl2-8.5>  THROW-OR-ATTACH-CALL
acl2-8.5>  NULL-BODY-ER
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  KEYWORDP
acl2-8.5>  KEYWORDP-FORWARD-TO-SYMBOLP
acl2-8.5>  :REDUNDANT
acl2-8.5>  SYMBOL-PACKAGE-NAME-OF-SYMBOL-IS-NOT-EMPTY-STRING
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1124)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-PKG-IMPORTS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  STANDARD-CHAR-LISTP-APPEND
acl2-8.5>  CHARACTER-LISTP-APPEND
acl2-8.5>  CONS-WITH-HINT
acl2-8.5>  REMOVE-EQ-EXEC
acl2-8.5>  REMOVE-EQL-EXEC
acl2-8.5>  REMOVE-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE-EQ-EXEC-IS-REMOVE-EQUAL
acl2-8.5>  REMOVE-EQL-EXEC-IS-REMOVE-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE1-EQ-EXEC
acl2-8.5>  REMOVE1-EQL-EXEC
acl2-8.5>  REMOVE1-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE1-EQ-EXEC-IS-REMOVE1-EQUAL
acl2-8.5>  REMOVE1-EQL-EXEC-IS-REMOVE1-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE-DUPLICATES-EQ-EXEC
acl2-8.5>  REMOVE-DUPLICATES-EQL-EXEC
acl2-8.5>  REMOVE-DUPLICATES-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE-DUPLICATES-EQ-EXEC-IS-REMOVE-DUPLICATES-EQUAL
acl2-8.5>  REMOVE-DUPLICATES-EQL-EXEC-IS-REMOVE-DUPLICATES-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHARACTER-LISTP-REMOVE-DUPLICATES
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  IDENTITY
acl2-8.5>  :REDUNDANT
acl2-8.5>  TRUE-LISTP-REVAPPEND-TYPE-PRESCRIPTION
acl2-8.5>  CHARACTER-LISTP-REVAPPEND
acl2-8.5>  REVERSE
acl2-8.5>  PAIRLIS$-TAILREC
acl2-8.5>  PAIRLIS$
acl2-8.5>  PAIRLIS$-TAILREC-IS-PAIRLIS$
acl2-8.5>  PAIRLIS$
acl2-8.5>  SET-DIFFERENCE-EQ-EXEC
acl2-8.5>  SET-DIFFERENCE-EQL-EXEC
acl2-8.5>  SET-DIFFERENCE-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-DIFFERENCE-EQ-EXEC-IS-SET-DIFFERENCE-EQUAL
acl2-8.5>  SET-DIFFERENCE-EQL-EXEC-IS-SET-DIFFERENCE-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LAST
acl2-8.5>  :REDUNDANT
acl2-8.5>  TRUE-LISTP-FIRST-N-AC-TYPE-PRESCRIPTION
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MUTUAL-RECURSION-GUARDP
acl2-8.5>  COLLECT-CADRS-WHEN-CAR-MEMBER-EQ
acl2-8.5>  :REDUNDANT
acl2-8.5>  LEGAL-CONSTANTP1
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  EVENT-KEYWORD-NAME
acl2-8.5>  EVENT-KEYWORD-NAME-LST
acl2-8.5>  ADD-TO-SET-EQ-EXEC
acl2-8.5>  ADD-TO-SET-EQL-EXEC
acl2-8.5>  ADD-TO-SET-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ADD-TO-SET-EQ-EXEC-IS-ADD-TO-SET-EQUAL
acl2-8.5>  ADD-TO-SET-EQL-EXEC-IS-ADD-TO-SET-EQUAL
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1266)
acl2-8.5>  :REDUNDANT
acl2-8.5>  KEYWORD-VALUE-LISTP
acl2-8.5>  KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  THROW-NONEXEC-ERROR
acl2-8.5>  EVENS
acl2-8.5>  ODDS
acl2-8.5>  MV-NTH
acl2-8.5>  MAKE-MV-NTHS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LEGAL-CASE-CLAUSESP
acl2-8.5>  CASE-TEST
acl2-8.5>  CASE-LIST
acl2-8.5>  CASE-LIST-CHECK
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  TRUE-LIST-LISTP
acl2-8.5>  TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  LEGAL-LET*-P
acl2-8.5>  WELL-FORMED-TYPE-DECLS-P
acl2-8.5>  SYMBOL-LIST-LISTP
acl2-8.5>  GET-TYPE-DECLS
acl2-8.5>  LET*-MACRO
acl2-8.5>  COLLECT-CDRS-WHEN-CAR-EQ
acl2-8.5>  APPEND-LST
acl2-8.5>  RESTRICT-ALIST
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LOGNOT
acl2-8.5>  DIGIT-TO-CHAR
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NTHCDR
acl2-8.5>  TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION
acl2-8.5>  UNION-EQ-EXEC
acl2-8.5>  UNION-EQL-EXEC
acl2-8.5>  UNION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  UNION-EQ-EXEC-IS-UNION-EQUAL
acl2-8.5>  UNION-EQL-EXEC-IS-UNION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  PLAUSIBLE-DCLSP1
acl2-8.5>  PLAUSIBLE-DCLSP
acl2-8.5>  STRIP-KEYWORD-LIST
acl2-8.5>  STRIP-DCLS1
acl2-8.5>  STRIP-DCLS
acl2-8.5>  FETCH-DCL-FIELDS2
acl2-8.5>  FETCH-DCL-FIELDS1
acl2-8.5>  FETCH-DCL-FIELDS
acl2-8.5>  FETCH-DCL-FIELD
acl2-8.5>  WITH-OUTPUT-ON-OFF-BINDING-VAL
acl2-8.5>  WITH-OUTPUT-ON-OFF-ARG
acl2-8.5>  MSGP
acl2-8.5>  CTXP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFUN-NX-DCLS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ASSOC-KEYWORD
acl2-8.5>  PROGRAM-DECLARED-P2
acl2-8.5>  PROGRAM-DECLARED-P1
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  PAIRLIS-X1
acl2-8.5>  PAIRLIS-X2
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  QUOTEP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  KWOTE
acl2-8.5>  MAYBE-KWOTE
acl2-8.5>  KWOTE-LST
acl2-8.5>  :REDUNDANT
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  :REDUNDANT
acl2-8.5>  PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  PSEUDO-TERM-LIST-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  LAMBDA-OBJECT-FORMALS
acl2-8.5>  LAMBDA-OBJECT-DCL
acl2-8.5>  LAMBDA-OBJECT-BODY
acl2-8.5>  LAMBDA-OBJECT-SHAPEP
acl2-8.5>  MAKE-LAMBDA-OBJECT
acl2-8.5>  :REDUNDANT
acl2-8.5>  FN-SYMB
acl2-8.5>  :REDUNDANT
acl2-8.5>  FARGN1
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  (ALL-VARS1 ALL-VARS1-LST)
acl2-8.5>  ALL-VARS
acl2-8.5>  :REDUNDANT
acl2-8.5>  INTERSECTP-EQ-EXEC
acl2-8.5>  INTERSECTP-EQL-EXEC
acl2-8.5>  INTERSECTP-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  INTERSECTP-EQ-EXEC-IS-INTERSECTP-EQUAL
acl2-8.5>  INTERSECTP-EQL-EXEC-IS-INTERSECTP-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHK-NO-STOBJ-INDEX-ALIASING
acl2-8.5>  MAKE-FMT-BINDINGS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHECK-VARS-NOT-FREE-TEST
acl2-8.5>  :REDUNDANT
acl2-8.5>  ER-PROGN-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  POSITION-AC-EQ-EXEC
acl2-8.5>  NATP-POSITION-AC-EQ-EXEC
acl2-8.5>  POSITION-AC-EQL-EXEC
acl2-8.5>  NATP-POSITION-AC-EQL-EXEC
acl2-8.5>  POSITION-EQUAL-AC
acl2-8.5>  NATP-POSITION-EQUAL-AC
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  POSITION-AC-EQ-EXEC-IS-POSITION-EQUAL-AC
acl2-8.5>  POSITION-AC-EQL-EXEC-IS-POSITION-EQUAL-AC
acl2-8.5>  :REDUNDANT
acl2-8.5>  POSITION-EQ-EXEC
acl2-8.5>  POSITION-EQL-EXEC
acl2-8.5>  POSITION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  POSITION-EQ-EXEC-IS-POSITION-EQUAL
acl2-8.5>  POSITION-EQL-EXEC-IS-POSITION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE
acl2-8.5>  RATIONALP-EXPT-TYPE-PRESCRIPTION
acl2-8.5>  LOGBITP
acl2-8.5>  ASH
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHAR<
acl2-8.5>  CHAR>
acl2-8.5>  CHAR<=
acl2-8.5>  CHAR>=
acl2-8.5>  STRING<-L
acl2-8.5>  STRING<
acl2-8.5>  STRING>
acl2-8.5>  STRING<=
acl2-8.5>  STRING>=
acl2-8.5>  SYMBOL<
acl2-8.5>  STRING<-L-IRREFLEXIVE
acl2-8.5>  STRING<-IRREFLEXIVE
acl2-8.5>  SUBSTITUTE-AC
acl2-8.5>  SUBSTITUTE
acl2-8.5>  STRINGP-SUBSTITUTE-TYPE-PRESCRIPTION
acl2-8.5>  TRUE-LISTP-SUBSTITUTE-TYPE-PRESCRIPTION
acl2-8.5>  :REDUNDANT
acl2-8.5>  SUBST
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  PLIST-WORLDP-FORWARD-TO-ASSOC-EQ-EQUAL-ALISTP
acl2-8.5>  PUTPROP
acl2-8.5>  :REDUNDANT
acl2-8.5>  GETPROP-DEFAULT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ORDERED-SYMBOL-ALISTP
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1672)
acl2-8.5>  ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP
acl2-8.5>  ADD-PAIR
acl2-8.5>  REMOVE1-ASSOC-EQ-EXEC
acl2-8.5>  REMOVE1-ASSOC-EQL-EXEC
acl2-8.5>  REMOVE1-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE1-ASSOC-EQ-EXEC-IS-REMOVE1-ASSOC-EQUAL
acl2-8.5>  REMOVE1-ASSOC-EQL-EXEC-IS-REMOVE1-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE-ASSOC-EQ-EXEC
acl2-8.5>  REMOVE-ASSOC-EQL-EXEC
acl2-8.5>  REMOVE-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE-ASSOC-EQ-EXEC-IS-REMOVE-ASSOC-EQUAL
acl2-8.5>  REMOVE-ASSOC-EQL-EXEC-IS-REMOVE-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  GETPROPS1
acl2-8.5>  :REDUNDANT
acl2-8.5>  GETPROPS
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 1724)
acl2-8.5>  EQUAL-CHAR-CODE
acl2-8.5>  HAS-PROPSP1
acl2-8.5>  HAS-PROPSP
acl2-8.5>  EXTEND-WORLD
acl2-8.5>  RETRACT-WORLD
acl2-8.5>  GLOBAL-VAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CONJOIN2
acl2-8.5>  CONJOIN
acl2-8.5>  CONJOIN-UNTRANSLATED-TERMS
acl2-8.5>  DISJOIN2
acl2-8.5>  DISJOIN
acl2-8.5>  DISJOIN-LST
acl2-8.5>  KWOTE?
acl2-8.5>  CONJOIN?
acl2-8.5>  <=?
acl2-8.5>  >?
acl2-8.5>  DISJOIN?
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  WEAK-SATISFIES-TYPE-SPEC-P
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  THE-CHECK
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  THE-CHECK-FOR-*1*
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BOUNDED-INTEGER-ALISTP
acl2-8.5>  BOUNDED-INTEGER-ALISTP-FORWARD-TO-EQLABLE-ALISTP
acl2-8.5>  KEYWORD-VALUE-LISTP-ASSOC-KEYWORD
acl2-8.5>  CONSP-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  ARRAY1P
acl2-8.5>  ARRAY1P-FORWARD
acl2-8.5>  ARRAY1P-LINEAR
acl2-8.5>  BOUNDED-INTEGER-ALISTP2
acl2-8.5>  ASSOC2
acl2-8.5>  ARRAY2P
acl2-8.5>  ARRAY2P-FORWARD
acl2-8.5>  ARRAY2P-LINEAR
acl2-8.5>  HEADER
acl2-8.5>  DIMENSIONS
acl2-8.5>  MAXIMUM-LENGTH
acl2-8.5>  DEFAULT
acl2-8.5>  AREF1
acl2-8.5>  COMPRESS11
acl2-8.5>  ARRAY-ORDER
acl2-8.5>  COMPRESS1
acl2-8.5>  ARRAY1P-CONS
acl2-8.5>  ASET1
acl2-8.5>  ASET1-TRUSTED
acl2-8.5>  AREF2
acl2-8.5>  COMPRESS211
acl2-8.5>  COMPRESS21
acl2-8.5>  COMPRESS2
acl2-8.5>  ARRAY2P-CONS
acl2-8.5>  ASET2
acl2-8.5>  FLUSH-COMPRESS
acl2-8.5>  MAYBE-FLUSH-AND-COMPRESS1
acl2-8.5>  CDRN
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  UPDATE-NTH
acl2-8.5>  UPDATE-NTH-ARRAY
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  32-BIT-INTEGERP
acl2-8.5>  32-BIT-INTEGERP-FORWARD-TO-INTEGERP
acl2-8.5>  ACL2-NUMBER-LISTP
acl2-8.5>  ACL2-NUMBER-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  RATIONAL-LISTP
acl2-8.5>  RATIONAL-LISTP-FORWARD-TO-ACL2-NUMBER-LISTP
acl2-8.5>  INTEGER-LISTP
acl2-8.5>  INTEGER-LISTP-FORWARD-TO-RATIONAL-LISTP
acl2-8.5>  NAT-LISTP
acl2-8.5>  NAT-LISTP-FORWARD-TO-INTEGER-LISTP
acl2-8.5>  32-BIT-INTEGER-LISTP
acl2-8.5>  32-BIT-INTEGER-LISTP-FORWARD-TO-INTEGER-LISTP
acl2-8.5>  OPEN-INPUT-CHANNELS
acl2-8.5>  UPDATE-OPEN-INPUT-CHANNELS
acl2-8.5>  OPEN-OUTPUT-CHANNELS
acl2-8.5>  UPDATE-OPEN-OUTPUT-CHANNELS
acl2-8.5>  GLOBAL-TABLE
acl2-8.5>  UPDATE-GLOBAL-TABLE
acl2-8.5>  T-STACK
acl2-8.5>  UPDATE-T-STACK
acl2-8.5>  32-BIT-INTEGER-STACK
acl2-8.5>  UPDATE-32-BIT-INTEGER-STACK
acl2-8.5>  BIG-CLOCK-ENTRY
acl2-8.5>  UPDATE-BIG-CLOCK-ENTRY
acl2-8.5>  IDATES
acl2-8.5>  UPDATE-IDATES
acl2-8.5>  ACL2-ORACLE
acl2-8.5>  UPDATE-ACL2-ORACLE
acl2-8.5>  FILE-CLOCK
acl2-8.5>  UPDATE-FILE-CLOCK
acl2-8.5>  READABLE-FILES
acl2-8.5>  WRITTEN-FILES
acl2-8.5>  UPDATE-WRITTEN-FILES
acl2-8.5>  READ-FILES
acl2-8.5>  UPDATE-READ-FILES
acl2-8.5>  WRITEABLE-FILES
acl2-8.5>  LIST-ALL-PACKAGE-NAMES-LST
acl2-8.5>  UPDATE-LIST-ALL-PACKAGE-NAMES-LST
acl2-8.5>  USER-STOBJ-ALIST1
acl2-8.5>  UPDATE-USER-STOBJ-ALIST1
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  UNTOUCHABLE-MARKER
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  INIT-IPRINT-AR
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  T
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALL-BOUNDP
acl2-8.5>  KNOWN-PACKAGE-ALISTP
acl2-8.5>  KNOWN-PACKAGE-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
acl2-8.5>  TIMER-ALISTP
acl2-8.5>  TIMER-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-SYMBOL-ALISTP
acl2-8.5>  TYPED-IO-LISTP
acl2-8.5>  TYPED-IO-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  OPEN-CHANNEL1
acl2-8.5>  OPEN-CHANNEL1-FORWARD-TO-TRUE-LISTP-AND-CONSP
acl2-8.5>  OPEN-CHANNEL-LISTP
acl2-8.5>  OPEN-CHANNELS-P
acl2-8.5>  OPEN-CHANNELS-P-FORWARD
acl2-8.5>  FILE-CLOCK-P
acl2-8.5>  FILE-CLOCK-P-FORWARD-TO-INTEGERP
acl2-8.5>  READABLE-FILE
acl2-8.5>  READABLE-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP
acl2-8.5>  READABLE-FILES-LISTP
acl2-8.5>  READABLE-FILES-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
acl2-8.5>  READABLE-FILES-P
acl2-8.5>  READABLE-FILES-P-FORWARD-TO-READABLE-FILES-LISTP
acl2-8.5>  WRITTEN-FILE
acl2-8.5>  WRITTEN-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP
acl2-8.5>  WRITTEN-FILE-LISTP
acl2-8.5>  WRITTEN-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
acl2-8.5>  WRITTEN-FILES-P
acl2-8.5>  WRITTEN-FILES-P-FORWARD-TO-WRITTEN-FILE-LISTP
acl2-8.5>  READ-FILE-LISTP1
acl2-8.5>  READ-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP
acl2-8.5>  READ-FILE-LISTP
acl2-8.5>  READ-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP
acl2-8.5>  READ-FILES-P
acl2-8.5>  READ-FILES-P-FORWARD-TO-READ-FILE-LISTP
acl2-8.5>  WRITABLE-FILE-LISTP1
acl2-8.5>  WRITABLE-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP
acl2-8.5>  WRITABLE-FILE-LISTP
acl2-8.5>  WRITABLE-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP
acl2-8.5>  WRITEABLE-FILES-P
acl2-8.5>  WRITEABLE-FILES-P-FORWARD-TO-WRITABLE-FILE-LISTP
acl2-8.5>  STATE-P1
acl2-8.5>  STATE-P1-FORWARD
acl2-8.5>  STATE-P
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2094)
acl2-8.5>  STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BUILD-STATE1
acl2-8.5>  COERCE-STATE-TO-OBJECT
acl2-8.5>  COERCE-OBJECT-TO-STATE
acl2-8.5>  CREATE-STATE
acl2-8.5>  GLOBAL-TABLE-CARS1
acl2-8.5>  GLOBAL-TABLE-CARS
acl2-8.5>  BOUNDP-GLOBAL1
acl2-8.5>  BOUNDP-GLOBAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  MAKUNBOUND-GLOBAL
acl2-8.5>  GET-GLOBAL
acl2-8.5>  PUT-GLOBAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALWAYS-BOUNDP-GLOBAL
acl2-8.5>  STATE-GLOBAL-LET*-BINDINGS-P
acl2-8.5>  STATE-GLOBAL-LET*-GET-GLOBALS
acl2-8.5>  STATE-GLOBAL-LET*-PUT-GLOBALS
acl2-8.5>  STATE-GLOBAL-LET*-CLEANUP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  T
acl2-8.5>  STANDARD-CHAR-P-NTH
acl2-8.5>  STRING-EQUAL
acl2-8.5>  ASSOC-STRING-EQUAL
acl2-8.5>  MEMBER-STRING-EQUAL
acl2-8.5>  XXXJOIN
acl2-8.5>  NIL
acl2-8.5>  EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>  TRUE-LISTP-EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>  T
acl2-8.5>  MAKE-VAR-LST
acl2-8.5>  TRUE-LISTP-TAKE
acl2-8.5>  T
acl2-8.5>  BUTLAST
acl2-8.5>  DEFUN-NX-FORM
acl2-8.5>  DEFUN-NX-FN
acl2-8.5>  UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1
acl2-8.5>  UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
acl2-8.5>  PROGRAM-DECLARED-P
acl2-8.5>  SOME-PROGRAM-DECLARED-P
acl2-8.5>  PARSE-ARGS-AND-TEST
acl2-8.5>  INTEGER-RANGE-P
acl2-8.5>  NIL
acl2-8.5>  SIGNED-BYTE-P
acl2-8.5>  UNSIGNED-BYTE-P
acl2-8.5>  INTEGER-RANGE-P-FORWARD
acl2-8.5>  SIGNED-BYTE-P-FORWARD-TO-INTEGERP
acl2-8.5>  UNSIGNED-BYTE-P-FORWARD-TO-NONNEGATIVE-INTEGERP
acl2-8.5>  :REDUNDANT
acl2-8.5>  ZPF
acl2-8.5>  NIL
acl2-8.5>  SUBSTITUTE
acl2-8.5>  NIL
acl2-8.5>  ALL-VARS1
acl2-8.5>  ALL-VARS
acl2-8.5>  NIL
acl2-8.5>  CHECK-VARS-NOT-FREE-TEST
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-SYMBOL-NAME
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-SYMBOL-PACKAGE-NAME
acl2-8.5>  SYMBOL-EQUALITY
acl2-8.5>  T
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  INTEGER-LENGTH
acl2-8.5>  BINARY-LOGAND
acl2-8.5>  LOGNAND
acl2-8.5>  BINARY-LOGIOR
acl2-8.5>  LOGORC1
acl2-8.5>  LOGORC2
acl2-8.5>  LOGANDC1
acl2-8.5>  LOGANDC2
acl2-8.5>  BINARY-LOGEQV
acl2-8.5>  BINARY-LOGXOR
acl2-8.5>  LOGNOR
acl2-8.5>  LOGTEST
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BOOLE$
acl2-8.5>  SET-FORMS-FROM-BINDINGS
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALIST-DIFFERENCE-EQ
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  EXPLODE-ATOM
acl2-8.5>  :REDUNDANT
acl2-8.5>  EXPLODE-ATOM+
acl2-8.5>  TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP-ASSOC-EQUAL
acl2-8.5>  TRUE-LISTP-CADR-ASSOC-EQ-FOR-OPEN-CHANNELS-P
acl2-8.5>  NIL
acl2-8.5>  OPEN-INPUT-CHANNEL-P1
acl2-8.5>  OPEN-OUTPUT-CHANNEL-P1
acl2-8.5>  OPEN-INPUT-CHANNEL-P
acl2-8.5>  OPEN-OUTPUT-CHANNEL-P
acl2-8.5>  OPEN-OUTPUT-CHANNEL-ANY-P1
acl2-8.5>  OPEN-OUTPUT-CHANNEL-ANY-P
acl2-8.5>  OPEN-INPUT-CHANNEL-ANY-P1
acl2-8.5>  OPEN-INPUT-CHANNEL-ANY-P
acl2-8.5>  NON-FREE-VAR-RUNES
acl2-8.5>  FREE-VAR-RUNES
acl2-8.5>  NATP-POSITION-AC
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  OS
acl2-8.5>  ABSOLUTE-PATHNAME-STRING-P
acl2-8.5>  ILLEGAL-RULER-EXTENDERS-VALUES
acl2-8.5>  :REDUNDANT
acl2-8.5>  RULER-EXTENDERS-MSG-AUX
acl2-8.5>  RULER-EXTENDERS-MSG
acl2-8.5>  STRICT-SYMBOL<-SORTEDP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  INCLUDE-BOOK-DIR-ALIST-ENTRY-P
acl2-8.5>  INCLUDE-BOOK-DIR-ALISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  TTAG
acl2-8.5>  GET-REGISTER-INVARIANT-RISK-WORLD
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-PRINT-CASE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-PRINT-BASE
acl2-8.5>  SET-PRINT-CIRCLE
acl2-8.5>  SET-PRINT-ESCAPE
acl2-8.5>  SET-PRINT-PRETTY
acl2-8.5>  SET-PRINT-RADIX
acl2-8.5>  SET-PRINT-READABLY
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-PRINT-LENGTH
acl2-8.5>  SET-PRINT-LEVEL
acl2-8.5>  SET-PRINT-LINES
acl2-8.5>  SET-PRINT-RIGHT-MARGIN
acl2-8.5>  RAW-PRINT-VARS-ALIST
acl2-8.5>  :REDUNDANT
acl2-8.5>  PRINC$
acl2-8.5>  WRITE-BYTE$
acl2-8.5>  W
acl2-8.5>  GET-SERIALIZE-CHARACTER
acl2-8.5>  SET-SERIALIZE-CHARACTER-FN
acl2-8.5>  SET-SERIALIZE-CHARACTER
acl2-8.5>  SET-SERIALIZE-CHARACTER-SYSTEM
acl2-8.5>  ALL-BOUNDP-PRESERVES-ASSOC-EQUAL
acl2-8.5>  NIL
acl2-8.5>  PRINT-OBJECT$+-ALIST
acl2-8.5>  MAKE-INPUT-CHANNEL
acl2-8.5>  MAKE-OUTPUT-CHANNEL
acl2-8.5>  OPEN-INPUT-CHANNEL
acl2-8.5>  NTH-UPDATE-NTH
acl2-8.5>  TRUE-LISTP-UPDATE-NTH
acl2-8.5>  NIL
acl2-8.5>  NTH-UPDATE-NTH-ARRAY
acl2-8.5>  CLOSE-INPUT-CHANNEL
acl2-8.5>  OPEN-OUTPUT-CHANNEL
acl2-8.5>  OPEN-OUTPUT-CHANNEL!
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  COMMENT-WINDOW-CO
acl2-8.5>  FMT-TO-COMMENT-WINDOW
acl2-8.5>  FMT-TO-COMMENT-WINDOW!
acl2-8.5>  FMT-TO-COMMENT-WINDOW+
acl2-8.5>  FMT-TO-COMMENT-WINDOW!+
acl2-8.5>  PAIRLIS2
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LOCK-SYMBOL-NAME-P
acl2-8.5>  ASSIGN-LOCK
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  GET-OUTPUT-STREAM-STRING$-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  CLOSE-OUTPUT-CHANNEL
acl2-8.5>  MAYBE-FINISH-OUTPUT$
acl2-8.5>  READ-CHAR$
acl2-8.5>  PEEK-CHAR$
acl2-8.5>  READ-BYTE$
acl2-8.5>  RAW-MODE-P
acl2-8.5>  READ-OBJECT
acl2-8.5>  READ-OBJECT-WITH-CASE
acl2-8.5>  READ-OBJECT-SUPPRESS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SOME-SLASHABLE
acl2-8.5>  PRIN1-WITH-SLASHES1
acl2-8.5>  PRIN1-WITH-SLASHES
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MAY-NEED-SLASHES1
acl2-8.5>  NIL
acl2-8.5>  ALL-DOTS
acl2-8.5>  MAY-NEED-SLASHES-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  NEEDS-SLASHES
acl2-8.5>  T-STACK-LENGTH1
acl2-8.5>  T-STACK-LENGTH
acl2-8.5>  MAKE-LIST-AC
acl2-8.5>  :REDUNDANT
acl2-8.5>  EXTEND-T-STACK
acl2-8.5>  T
acl2-8.5>  STRINGP-SUBSEQ-TYPE-PRESCRIPTION
acl2-8.5>  TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION
acl2-8.5>  NIL
acl2-8.5>  W
acl2-8.5>  SET-SERIALIZE-CHARACTER-FN
acl2-8.5>  SET-SERIALIZE-CHARACTER
acl2-8.5>  SET-SERIALIZE-CHARACTER-SYSTEM
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SHRINK-T-STACK
acl2-8.5>  AREF-T-STACK
acl2-8.5>  ASET-T-STACK
acl2-8.5>  32-BIT-INTEGER-STACK-LENGTH1
acl2-8.5>  32-BIT-INTEGER-STACK-LENGTH
acl2-8.5>  EXTEND-32-BIT-INTEGER-STACK
acl2-8.5>  SHRINK-32-BIT-INTEGER-STACK
acl2-8.5>  AREF-32-BIT-INTEGER-STACK
acl2-8.5>  ASET-32-BIT-INTEGER-STACK
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BIG-CLOCK-NEGATIVE-P
acl2-8.5>  DECREMENT-BIG-CLOCK
acl2-8.5>  LIST-ALL-PACKAGE-NAMES
acl2-8.5>  USER-STOBJ-ALIST
acl2-8.5>  UPDATE-USER-STOBJ-ALIST
acl2-8.5>  POWER-EVAL
acl2-8.5>  READ-IDATE
acl2-8.5>  READ-RUN-TIME
acl2-8.5>  READ-ACL2-ORACLE
acl2-8.5>  READ-ACL2-ORACLE@PAR
acl2-8.5>  GETENV$
acl2-8.5>  SETENV$
acl2-8.5>  RANDOM$
acl2-8.5>  NATP-RANDOM$
acl2-8.5>  RANDOM$-LINEAR
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2608)
acl2-8.5>  SYS-CALL
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2610)
acl2-8.5>  SYS-CALL-STATUS
acl2-8.5>  T
acl2-8.5>  UPDATE-ACL2-ORACLE-PRESERVES-STATE-P1
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2614)
acl2-8.5>  SYS-CALL+
acl2-8.5>  SYS-CALL*
acl2-8.5>  NIL
acl2-8.5>  READ-RUN-TIME-PRESERVES-STATE-P1
acl2-8.5>  READ-ACL2-ORACLE-PRESERVES-STATE-P1
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2621)
acl2-8.5>  NIL
acl2-8.5>  NTH-0-READ-RUN-TIME-TYPE-PRESCRIPTION
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2621)
acl2-8.5>  NIL
acl2-8.5>  MAIN-TIMER
acl2-8.5>  PUT-ASSOC-EQ-EXEC
acl2-8.5>  PUT-ASSOC-EQL-EXEC
acl2-8.5>  PUT-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  PUT-ASSOC-EQ-EXEC-IS-PUT-ASSOC-EQUAL
acl2-8.5>  PUT-ASSOC-EQL-EXEC-IS-PUT-ASSOC-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  SET-TIMER
acl2-8.5>  GET-TIMER
acl2-8.5>  NIL
acl2-8.5>  PUSH-TIMER
acl2-8.5>  RATIONALP-+
acl2-8.5>  RATIONALP-*
acl2-8.5>  RATIONALP-UNARY--
acl2-8.5>  RATIONALP-UNARY-/
acl2-8.5>  RATIONALP-IMPLIES-ACL2-NUMBERP
acl2-8.5>  POP-TIMER
acl2-8.5>  ADD-TIMERS
acl2-8.5>  NTH-0-CONS
acl2-8.5>  NIL
acl2-8.5>  NTH-ADD1
acl2-8.5>  ORDERED-SYMBOL-ALISTP-ADD-PAIR-FORWARD
acl2-8.5>  ASSOC-ADD-PAIR
acl2-8.5>  ADD-PAIR-PRESERVES-ALL-BOUNDP
acl2-8.5>  STATE-P1-UPDATE-MAIN-TIMER
acl2-8.5>  INCREMENT-TIMER
acl2-8.5>  PRINT-RATIONAL-AS-DECIMAL
acl2-8.5>  PRINT-TIMER
acl2-8.5>  STATE-P1-UPDATE-PRINT-BASE
acl2-8.5>  SET-PRINT-BASE-RADIX
acl2-8.5>  KNOWN-PACKAGE-ALIST
acl2-8.5>  SYMBOL-IN-CURRENT-PACKAGE-P
acl2-8.5>  PRIN1$
acl2-8.5>  NIL
acl2-8.5>  CURRENT-PACKAGE
acl2-8.5>  STATE-P1-UPDATE-NTH-2-WORLD
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  LD-SKIP-PROOFSP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  INTERSECTION-EQ-EXEC
acl2-8.5>  INTERSECTION-EQL-EXEC
acl2-8.5>  INTERSECTION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  INTERSECTION-EQ-EXEC-IS-INTERSECTION-EQUAL
acl2-8.5>  INTERSECTION-EQL-EXEC-IS-INTERSECTION-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  GET-ENFORCE-REDUNDANCY
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-VERIFY-GUARDS-EAGERNESS
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-COMPILE-FNS
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-COMPILER-ENABLED
acl2-8.5>  SET-PORT-FILE-ENABLED
acl2-8.5>  DEFAULT-MEASURE-FUNCTION
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-WELL-FOUNDED-RELATION
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-DEFUN-MODE
acl2-8.5>  DEFAULT-DEFUN-MODE-FROM-STATE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  INVISIBLE-FNS-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  UNARY-FUNCTION-SYMBOL-LISTP
acl2-8.5>  INVISIBLE-FNS-ENTRYP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  REMOVE1-ASSOC-STRING-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  BACKCHAIN-LIMIT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-BACKCHAIN-LIMIT
acl2-8.5>  STEP-LIMIT-FROM-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  REWRITE-STACK-LIMIT
acl2-8.5>  CASE-SPLIT-LIMITATIONS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  UNTRANS-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MATCH-FREE-DEFAULT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MATCH-FREE-OVERRIDE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  RAW-INCLUDE-BOOK-DIR-P
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NON-LINEARP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  TAU-AUTO-MODEP
acl2-8.5>  :REDUNDANT
acl2-8.5>  GET-IN-THEORY-REDUNDANT-OKP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NTH-ALIASES
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-HINTS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  T
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2803)
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  PAIRLIS$-TRUE-LIST-FIX
acl2-8.5>  BOOLEAN-LISTP
acl2-8.5>  BOOLEAN-LISTP-CONS
acl2-8.5>  BOOLEAN-LISTP-FORWARD
acl2-8.5>  BOOLEAN-LISTP-FORWARD-TO-SYMBOL-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-+-1
acl2-8.5>  DEFAULT-+-2
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-*-1
acl2-8.5>  DEFAULT-*-2
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-UNARY-MINUS
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-UNARY-/
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-<-1
acl2-8.5>  DEFAULT-<-2
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-CAR
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-CDR
acl2-8.5>  CONS-CAR-CDR
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-CHAR-CODE
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-CODE-CHAR
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-COMPLEX-1
acl2-8.5>  DEFAULT-COMPLEX-2
acl2-8.5>  COMPLEX-0
acl2-8.5>  ADD-DEF-COMPLEX
acl2-8.5>  REALPART-+
acl2-8.5>  IMAGPART-+
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-COERCE-1
acl2-8.5>  MAKE-CHARACTER-LIST-MAKE-CHARACTER-LIST
acl2-8.5>  DEFAULT-COERCE-2
acl2-8.5>  DEFAULT-COERCE-3
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-DENOMINATOR
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-IMAGPART
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-INTERN-IN-PACKAGE-OF-SYMBOL
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-NUMERATOR
acl2-8.5>  :REDUNDANT
acl2-8.5>  DEFAULT-REALPART
acl2-8.5>  DOUBLE-REWRITE
acl2-8.5>  CHK-WITH-PROVER-TIME-LIMIT-ARG
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  TIME-LIMIT5-REACHED-P
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CHK-WITH-GUARD-CHECKING-ARG
acl2-8.5>  :REDUNDANT
acl2-8.5>  WITH-GUARD-CHECKING-GATE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ABORT!
acl2-8.5>  :REDUNDANT
acl2-8.5>  P!
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2854)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  WORMHOLE1
acl2-8.5>  WORMHOLE-P
acl2-8.5>  DUPLICATES
acl2-8.5>  SET-EQUALP-EQUAL
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  RECORD-ACCESSOR-FUNCTION-NAME
acl2-8.5>  :REDUNDANT
acl2-8.5>  MFC-CLAUSE
acl2-8.5>  MFC-RDEPTH
acl2-8.5>  TYPE-ALIST-ENTRYP
acl2-8.5>  TYPE-ALISTP
acl2-8.5>  MFC-TYPE-ALIST
acl2-8.5>  MFC-ANCESTORS
acl2-8.5>  MFC-UNIFY-SUBST
acl2-8.5>  MFC-WORLD
acl2-8.5>  PSEUDO-TERM-LISTP-MFC-CLAUSE
acl2-8.5>  TYPE-ALISTP-MFC-TYPE-ALIST
acl2-8.5>  :REDUNDANT
acl2-8.5>  BAD-ATOM-COMPOUND-RECOGNIZER
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2897)
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  ALPHORDER
acl2-8.5>  LEXORDER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  ALPHORDER-REFLEXIVE
acl2-8.5>  NIL
acl2-8.5>  ALPHORDER-TRANSITIVE
acl2-8.5>  ALPHORDER-ANTI-SYMMETRIC
acl2-8.5>  ALPHORDER-TOTAL
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2907)
acl2-8.5>  LEXORDER-REFLEXIVE
acl2-8.5>  LEXORDER-ANTI-SYMMETRIC
acl2-8.5>  LEXORDER-TRANSITIVE
acl2-8.5>  LEXORDER-TOTAL
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 2909)
acl2-8.5>  MERGE-LEXORDER
acl2-8.5>  NIL
acl2-8.5>  NIL
acl2-8.5>  TRUE-LISTP-MERGE-SORT-LEXORDER
acl2-8.5>  MERGE-SORT-LEXORDER
acl2-8.5>  :REDUNDANT
acl2-8.5>  RESIZE-LIST-EXEC
acl2-8.5>  RESIZE-LIST
acl2-8.5>  RESIZE-LIST-EXEC-IS-RESIZE-LIST
acl2-8.5>  RESIZE-LIST
acl2-8.5>  E/D-FN
acl2-8.5>  :REDUNDANT
acl2-8.5> <state>
acl2-8.5> 
acl2-8.5> To verify that the 30 encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOGIC)
acl2-8.5> 
acl2-8.5> The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> :INVISIBLE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ALISTP ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SYMBOL-ALISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-ALISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN TRUE-LISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TRUE-LISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN)
acl2-8.5> 
acl2-8.5> The event ( DEFUN LEN ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LEN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH)
acl2-8.5> 
acl2-8.5> The event ( DEFUN LENGTH ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LENGTH ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH)
acl2-8.5> 
acl2-8.5> The event ( DEFUN NTH ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NTH ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR)
acl2-8.5> 
acl2-8.5> The event ( DEFUN CHAR ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CHAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN EQLABLE-ALISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EQLABLE-ALISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ASSOC-EQL-EXEC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQL-EXEC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ASSOC-EQUAL ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQUAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SUBLIS ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBLIS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX)
acl2-8.5> 
acl2-8.5> The event ( DEFUN NFIX ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NFIX ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX)
acl2-8.5> 
acl2-8.5> The event ( DEFUN IFIX ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN IFIX ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS)
acl2-8.5> 
acl2-8.5> The event ( DEFUN INTEGER-ABS ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN INTEGER-ABS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ACL2-COUNT ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ACL2-COUNT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT)
acl2-8.5> 
acl2-8.5> The event ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR)
acl2-8.5> 
acl2-8.5> The event ( DEFUN FLOOR ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FLOOR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SYMBOL-LISTP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-LISTP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND)
acl2-8.5> 
acl2-8.5> The event ( DEFUN BINARY-APPEND ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BINARY-APPEND ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND)
acl2-8.5> 
acl2-8.5> The event ( DEFUN STRING-APPEND ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STRING-APPEND ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN PLIST-WORLDP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PLIST-WORLDP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN FGETPROP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FGETPROP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SGETPROP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SGETPROP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN FUNCTION-SYMBOLP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FUNCTION-SYMBOLP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS)
acl2-8.5> 
acl2-8.5> The event ( DEFUN STRIP-CARS ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STRIP-CARS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ASSOC-EQ-EXEC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ASSOC-EQ-EXEC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST)
acl2-8.5> 
acl2-8.5> The event ( DEFUN TABLE-ALIST ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TABLE-ALIST ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...):  The submitted
acl2-8.5> encapsulate event has created no new ACL2 events, and thus is leaving
acl2-8.5> the ACL2 logical world unchanged.  See :DOC encapsulate.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOGIC) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5> 
acl2-8.5> Since MOD-EXPT is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of MOD-EXPT is described by the theorem 
acl2-8.5> (ACL2-NUMBERP (MOD-EXPT BASE EXP MOD)).  We used the :type-prescription
acl2-8.5> rule MOD.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for MOD-EXPT....
acl2-8.5> 
acl2-8.5> The guard conjecture for MOD-EXPT is trivial to prove, given the :executable-
acl2-8.5> counterpart of EQLABLEP and the :type-prescription rules 
acl2-8.5> EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION.
acl2-8.5> MOD-EXPT is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MOD-EXPT ...)
acl2-8.5> Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP)
acl2-8.5>         (:TYPE-PRESCRIPTION EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE)
acl2-8.5>         (:TYPE-PRESCRIPTION MOD)
acl2-8.5>         (:TYPE-PRESCRIPTION RATIONALP-EXPT-TYPE-PRESCRIPTION))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MOD-EXPT
acl2-8.5> 
acl2-8.5> Since CONJOIN-CLAUSES is non-recursive, its admission is trivial. 
acl2-8.5> We could deduce no constraints on the type of CONJOIN-CLAUSES.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CONJOIN-CLAUSES....
acl2-8.5> 
acl2-8.5> The guard conjecture for CONJOIN-CLAUSES is trivial to prove, given
acl2-8.5> the :type-prescription rule DISJOIN-LST.  CONJOIN-CLAUSES is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONJOIN-CLAUSES ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION DISJOIN-LST))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CONJOIN-CLAUSES
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *TRUE-CLAUSE* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TRUE-CLAUSE* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *FALSE-CLAUSE* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *FALSE-CLAUSE* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since CLAUSES-RESULT is non-recursive, its admission is trivial.  We
acl2-8.5> could deduce no constraints on the type of CLAUSES-RESULT.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CLAUSES-RESULT....
acl2-8.5> 
acl2-8.5> The guard conjecture for CLAUSES-RESULT is trivial to prove, given
acl2-8.5> primitive type reasoning.  CLAUSES-RESULT is compliant with Common
acl2-8.5> Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CLAUSES-RESULT ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CLAUSES-RESULT
acl2-8.5> 
acl2-8.5> The event ( TABLE EVISC-TABLE ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( TABLE EVISC-TABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *TOP-HINT-KEYWORDS* ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TOP-HINT-KEYWORDS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *HINT-KEYWORDS* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *HINT-KEYWORDS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( TABLE CUSTOM-KEYWORDS-TABLE ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( TABLE CUSTOM-KEYWORDS-TABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> For the admission of SPLICE-KEYWORD-ALIST we will use the relation
acl2-8.5> O< (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT KEYWORD-ALIST).  The non-trivial part of
acl2-8.5> the measure conjecture is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (NOT (ENDP KEYWORD-ALIST))
acl2-8.5>               (NOT (EQ KEY (CAR KEYWORD-ALIST))))
acl2-8.5>          (O< (ACL2-COUNT (CDDR KEYWORD-ALIST))
acl2-8.5>              (ACL2-COUNT KEYWORD-ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP and EQ we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (CONSP KEYWORD-ALIST)
acl2-8.5>               (NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
acl2-8.5>          (O< (ACL2-COUNT (CDDR KEYWORD-ALIST))
acl2-8.5>              (ACL2-COUNT KEYWORD-ALIST))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<,
acl2-8.5> primitive type reasoning and the :type-prescription rule ACL2-COUNT,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (CONSP KEYWORD-ALIST)
acl2-8.5>               (NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
acl2-8.5>          (< (ACL2-COUNT (CDDR KEYWORD-ALIST))
acl2-8.5>             (+ 1 (ACL2-COUNT (CAR KEYWORD-ALIST))
acl2-8.5>                (ACL2-COUNT (CDR KEYWORD-ALIST))))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR KEYWORD-ALIST) and (CDR KEYWORD-ALIST) can
acl2-8.5> be eliminated.  Furthermore, those terms are at the root of a chain
acl2-8.5> of two rounds of destructor elimination.  (1) Use CAR-CDR-ELIM to replace
acl2-8.5> KEYWORD-ALIST by (CONS KEYWORD-ALIST1 KEYWORD-ALIST2), (CAR KEYWORD-ALIST)
acl2-8.5> by KEYWORD-ALIST1 and (CDR KEYWORD-ALIST) by KEYWORD-ALIST2.  (2) Use
acl2-8.5> CAR-CDR-ELIM, again, to replace KEYWORD-ALIST2 by 
acl2-8.5> (CONS KEYWORD-ALIST3 KEYWORD-ALIST4), (CAR KEYWORD-ALIST2) by KEYWORD-ALIST3
acl2-8.5> and (CDR KEYWORD-ALIST2) by KEYWORD-ALIST4.  These steps produce the
acl2-8.5> following two goals.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2))
acl2-8.5>               (CONSP (CONS KEYWORD-ALIST1 KEYWORD-ALIST2))
acl2-8.5>               (NOT (EQUAL KEY KEYWORD-ALIST1)))
acl2-8.5>          (< (ACL2-COUNT (CDR KEYWORD-ALIST2))
acl2-8.5>             (+ 1 (ACL2-COUNT KEYWORD-ALIST1)
acl2-8.5>                (ACL2-COUNT KEYWORD-ALIST2)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :executable-counterpart of ACL2-COUNT, primitive
acl2-8.5> type reasoning and the :rewrite rule DEFAULT-CDR, to
acl2-8.5> 
acl2-8.5> Subgoal 2'
acl2-8.5> (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2))
acl2-8.5>               (NOT (EQUAL KEY KEYWORD-ALIST1)))
acl2-8.5>          (< 0
acl2-8.5>             (+ 1 (ACL2-COUNT KEYWORD-ALIST1)
acl2-8.5>                (ACL2-COUNT KEYWORD-ALIST2)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using primitive type reasoning
acl2-8.5> and the :type-prescription rule ACL2-COUNT.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (CONSP (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))
acl2-8.5>               (CONSP (LIST* KEYWORD-ALIST1
acl2-8.5>                             KEYWORD-ALIST3 KEYWORD-ALIST4))
acl2-8.5>               (NOT (EQUAL KEY KEYWORD-ALIST1)))
acl2-8.5>          (< (ACL2-COUNT KEYWORD-ALIST4)
acl2-8.5>             (+ 1 (ACL2-COUNT KEYWORD-ALIST1)
acl2-8.5>                (ACL2-COUNT (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT and SYNP, the :executable-
acl2-8.5> counterpart of BINARY-+, primitive type reasoning and the :rewrite
acl2-8.5> rules CAR-CONS, CDR-CONS, COMMUTATIVITY-2-OF-+ and FOLD-CONSTS-IN-+,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal 1'
acl2-8.5> (IMPLIES (NOT (EQUAL KEY KEYWORD-ALIST1))
acl2-8.5>          (< (ACL2-COUNT KEYWORD-ALIST4)
acl2-8.5>             (+ 2 (ACL2-COUNT KEYWORD-ALIST1)
acl2-8.5>                (ACL2-COUNT KEYWORD-ALIST3)
acl2-8.5>                (ACL2-COUNT KEYWORD-ALIST4)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic, primitive
acl2-8.5> type reasoning and the :type-prescription rule ACL2-COUNT.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for SPLICE-KEYWORD-ALIST.
acl2-8.5> Thus, we admit this function under the principle of definition.  We
acl2-8.5> could deduce no constraints on the type of SPLICE-KEYWORD-ALIST.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SPLICE-KEYWORD-ALIST....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SPLICE-KEYWORD-ALIST,
acl2-8.5> given primitive type reasoning, the :forward-chaining rules 
acl2-8.5> KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP and KEYWORDP-FORWARD-TO-SYMBOLP
acl2-8.5> and the :type-prescription rules KEYWORD-VALUE-LISTP and KEYWORDP,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (TRUE-LISTP NEW-SEGMENT)
acl2-8.5>               (KEYWORD-VALUE-LISTP KEYWORD-ALIST)
acl2-8.5>               (KEYWORDP KEY)
acl2-8.5>               (NOT (ENDP KEYWORD-ALIST))
acl2-8.5>               (NOT (EQ KEY (CAR KEYWORD-ALIST))))
acl2-8.5>          (KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ENDP, EQ and KEYWORDP we reduce the conjecture
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP NEW-SEGMENT)
acl2-8.5>               (KEYWORD-VALUE-LISTP KEYWORD-ALIST)
acl2-8.5>               (SYMBOLP KEY)
acl2-8.5>               (EQUAL (SYMBOL-PACKAGE-NAME KEY)
acl2-8.5>                      "KEYWORD")
acl2-8.5>               (CONSP KEYWORD-ALIST)
acl2-8.5>               (NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
acl2-8.5>          (KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions 
acl2-8.5> KEYWORD-VALUE-LISTP and KEYWORDP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SPLICE-KEYWORD-ALIST.
acl2-8.5> SPLICE-KEYWORD-ALIST is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SPLICE-KEYWORD-ALIST ...)
acl2-8.5> Rules: ((:DEFINITION ACL2-COUNT)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION KEYWORD-VALUE-LISTP)
acl2-8.5>         (:DEFINITION KEYWORDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:ELIM CAR-CDR-ELIM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ACL2-COUNT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING KEYWORDP-FORWARD-TO-SYMBOLP)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE DEFAULT-CDR)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:TYPE-PRESCRIPTION ACL2-COUNT)
acl2-8.5>         (:TYPE-PRESCRIPTION KEYWORD-VALUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION KEYWORDP))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  1844
acl2-8.5>  SPLICE-KEYWORD-ALIST
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since SEARCH-FN-GUARD is non-recursive, its admission is trivial. 
acl2-8.5> We observe that the type of SEARCH-FN-GUARD is described by the theorem
acl2-8.5> (OR (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                             START1 START2 END1 END2 END1P END2P)
acl2-8.5>            T)
acl2-8.5>     (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                             START1 START2 END1 END2 END1P END2P)
acl2-8.5>            NIL)).
acl2-8.5> We used primitive type reasoning and the :type-prescription rules HARD-ERROR
acl2-8.5> and STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SEARCH-FN-GUARD....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SEARCH-FN-GUARD, given
acl2-8.5> the :executable-counterpart of HARD-ERROR, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>  (LET ((X TEST) (L '(EQUAL CHAR-EQUAL)))
acl2-8.5>       (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>            (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>            (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                   (MEMBER-EQ-EXEC X L))))
acl2-8.5>  (IMPLIES
acl2-8.5>   (COND
acl2-8.5>    ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
acl2-8.5>     (HARD-ERROR
acl2-8.5>      'SEARCH
acl2-8.5>      "For the macro ~x0, only the :test values ~x1 and ~x2 are ~
acl2-8.5>                    supported; ~x3 is not.  If you need other tests supported, ~
acl2-8.5>                    please contact the ACL2 implementors."
acl2-8.5>      (LIST '(#\0 . SEARCH)
acl2-8.5>            '(#\1 . EQUAL)
acl2-8.5>            '(#\2 . CHAR-EQUAL)
acl2-8.5>            (CONS #\3 TEST))))
acl2-8.5>    ((AND (STRINGP SEQ1) (STRINGP SEQ2))
acl2-8.5>     (OR
acl2-8.5>      (EQ TEST 'EQUAL)
acl2-8.5>      (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>           (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>      (HARD-ERROR
acl2-8.5>       'SEARCH
acl2-8.5>       "When ~x0 is called on two strings, they must both ~
acl2-8.5>                        consist of standard characters.  However, this is not ~
acl2-8.5>                        the case for ~x1."
acl2-8.5>       (LIST '(#\0 . SEARCH)
acl2-8.5>             (CONS #\1
acl2-8.5>                   (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                       SEQ2 SEQ1))))))
acl2-8.5>    ((EQ TEST 'CHAR-EQUAL) NIL)
acl2-8.5>    ((AND (TRUE-LISTP SEQ1)
acl2-8.5>          (TRUE-LISTP SEQ2))
acl2-8.5>     T)
acl2-8.5>    (T NIL))
acl2-8.5>   (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>         (END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>        (AND (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (RATIONALP END1))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (RATIONALP START1))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (RATIONALP END2))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (RATIONALP START2))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (TRUE-LISTP SEQ1)
acl2-8.5>                 (STRINGP SEQ1))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (RATIONALP (LENGTH SEQ1)))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (RATIONALP END1))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (< (LENGTH SEQ1) END1)
acl2-8.5>                 (TRUE-LISTP SEQ2)
acl2-8.5>                 (STRINGP SEQ2))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (< (LENGTH SEQ1) END1)
acl2-8.5>                 (RATIONALP (LENGTH SEQ2)))
acl2-8.5>             (OR (NOT (NATP START1))
acl2-8.5>                 (NOT (NATP START2))
acl2-8.5>                 (NOT (NATP END1))
acl2-8.5>                 (NOT (NATP END2))
acl2-8.5>                 (< END1 START1)
acl2-8.5>                 (< END2 START2)
acl2-8.5>                 (< (LENGTH SEQ1) END1)
acl2-8.5>                 (RATIONALP END2)))))
acl2-8.5>  (IMPLIES
acl2-8.5>   (AND
acl2-8.5>    (COND
acl2-8.5>     ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
acl2-8.5>      (HARD-ERROR
acl2-8.5>       'SEARCH
acl2-8.5>       "For the macro ~x0, only the :test values ~x1 and ~x2 are ~
acl2-8.5>                    supported; ~x3 is not.  If you need other tests supported, ~
acl2-8.5>                    please contact the ACL2 implementors."
acl2-8.5>       (LIST '(#\0 . SEARCH)
acl2-8.5>             '(#\1 . EQUAL)
acl2-8.5>             '(#\2 . CHAR-EQUAL)
acl2-8.5>             (CONS #\3 TEST))))
acl2-8.5>     ((AND (STRINGP SEQ1) (STRINGP SEQ2))
acl2-8.5>      (OR
acl2-8.5>       (EQ TEST 'EQUAL)
acl2-8.5>       (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>            (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>       (HARD-ERROR
acl2-8.5>        'SEARCH
acl2-8.5>        "When ~x0 is called on two strings, they must both ~
acl2-8.5>                        consist of standard characters.  However, this is not ~
acl2-8.5>                        the case for ~x1."
acl2-8.5>        (LIST '(#\0 . SEARCH)
acl2-8.5>              (CONS #\1
acl2-8.5>                    (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                        SEQ2 SEQ1))))))
acl2-8.5>     ((EQ TEST 'CHAR-EQUAL) NIL)
acl2-8.5>     ((AND (TRUE-LISTP SEQ1)
acl2-8.5>           (TRUE-LISTP SEQ2))
acl2-8.5>      T)
acl2-8.5>     (T NIL))
acl2-8.5>    (NOT END1P)
acl2-8.5>    (NOT (TRUE-LISTP SEQ1)))
acl2-8.5>   (STRINGP SEQ1))
acl2-8.5>  (IMPLIES
acl2-8.5>   (AND
acl2-8.5>    (COND
acl2-8.5>     ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
acl2-8.5>      (HARD-ERROR
acl2-8.5>       'SEARCH
acl2-8.5>       "For the macro ~x0, only the :test values ~x1 and ~x2 are ~
acl2-8.5>                    supported; ~x3 is not.  If you need other tests supported, ~
acl2-8.5>                    please contact the ACL2 implementors."
acl2-8.5>       (LIST '(#\0 . SEARCH)
acl2-8.5>             '(#\1 . EQUAL)
acl2-8.5>             '(#\2 . CHAR-EQUAL)
acl2-8.5>             (CONS #\3 TEST))))
acl2-8.5>     ((AND (STRINGP SEQ1) (STRINGP SEQ2))
acl2-8.5>      (OR
acl2-8.5>       (EQ TEST 'EQUAL)
acl2-8.5>       (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>            (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>       (HARD-ERROR
acl2-8.5>        'SEARCH
acl2-8.5>        "When ~x0 is called on two strings, they must both ~
acl2-8.5>                        consist of standard characters.  However, this is not ~
acl2-8.5>                        the case for ~x1."
acl2-8.5>        (LIST '(#\0 . SEARCH)
acl2-8.5>              (CONS #\1
acl2-8.5>                    (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                        SEQ2 SEQ1))))))
acl2-8.5>     ((EQ TEST 'CHAR-EQUAL) NIL)
acl2-8.5>     ((AND (TRUE-LISTP SEQ1)
acl2-8.5>           (TRUE-LISTP SEQ2))
acl2-8.5>      T)
acl2-8.5>     (T NIL))
acl2-8.5>    (NOT END2P)
acl2-8.5>    (NOT (TRUE-LISTP SEQ2)))
acl2-8.5>   (STRINGP SEQ2))).
acl2-8.5> 
acl2-8.5> By the simple :definitions EQ and HARD-ERROR, the :executable-counterparts
acl2-8.5> of IF, SYMBOL-LISTP, TAU-SYSTEM and TRUE-LISTP and the simple :rewrite
acl2-8.5> rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))
acl2-8.5>               (COND ((AND (STRINGP SEQ1) (STRINGP SEQ2))
acl2-8.5>                      (OR (EQUAL TEST 'EQUAL)
acl2-8.5>                          (AND (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                                    (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>                               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))))
acl2-8.5>                     ((EQUAL TEST 'CHAR-EQUAL) NIL)
acl2-8.5>                     ((TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2))
acl2-8.5>                     (T NIL)))
acl2-8.5>          (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>                (END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>               (AND (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (RATIONALP END1))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (RATIONALP START1))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (RATIONALP END2))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (RATIONALP START2))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (RATIONALP (LENGTH SEQ1)))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (RATIONALP END1))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (< (LENGTH SEQ1) END1)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (< (LENGTH SEQ1) END1)
acl2-8.5>                        (RATIONALP (LENGTH SEQ2)))
acl2-8.5>                    (OR (NOT (NATP START1))
acl2-8.5>                        (NOT (NATP START2))
acl2-8.5>                        (NOT (NATP END1))
acl2-8.5>                        (NOT (NATP END2))
acl2-8.5>                        (< END1 START1)
acl2-8.5>                        (< END2 START2)
acl2-8.5>                        (< (LENGTH SEQ1) END1)
acl2-8.5>                        (RATIONALP END2))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definition MEMBER-EQUAL, the :executable-
acl2-8.5> counterparts of CAR, CDR, CONSP and EQUAL, primitive type reasoning
acl2-8.5> and the :type-prescription rules LENGTH and STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SEARCH-FN-GUARD.
acl2-8.5> SEARCH-FN-GUARD is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FN-GUARD ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION HARD-ERROR)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CAR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART HARD-ERROR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART IF)
acl2-8.5>         (:EXECUTABLE-COUNTERPART SYMBOL-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TRUE-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION HARD-ERROR)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP))
acl2-8.5> Time:  0.02 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  1480
acl2-8.5>  SEARCH-FN-GUARD
acl2-8.5> 
acl2-8.5> For the admission of SEARCH-FROM-START we will use the relation O<
acl2-8.5> (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (NFIX (+ 1 END2 (- START2))).  The non-trivial part
acl2-8.5> of the measure conjecture is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>     (O-P (NFIX (+ 1 END2 (- START2))))
acl2-8.5>     (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2))))
acl2-8.5>                   (NOT (EQUAL SEQ1
acl2-8.5>                               (SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1)))))
acl2-8.5>                   (< (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>              (O< (NFIX (+ 1 END2 (- (+ 1 START2))))
acl2-8.5>                  (NFIX (+ 1 END2 (- START2)))))).
acl2-8.5> 
acl2-8.5> By the :executable-counterpart of UNARY-- and the simple :rewrite rule
acl2-8.5> DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (O-P (NFIX (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2))))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1)))))
acl2-8.5>               (< (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>          (O< (NFIX (+ 1 END2 -1 (- START2)))
acl2-8.5>              (NFIX (+ 1 END2 (- START2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions FIX, LENGTH (if-intro), NFIX
acl2-8.5> (if-intro), NOT (if-intro), O-FINP, O< (if-intro), SUBSEQ (if-intro),
acl2-8.5> SUBSEQ-LIST and SYNP, the :executable-counterparts of BINARY-+ and
acl2-8.5> NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+,
acl2-8.5> COMMUTATIVITY-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0 and the :type-
acl2-8.5> prescription rule LEN, to the following twelve conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 1.12
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2)
acl2-8.5>                                            (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.11
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2)
acl2-8.5>                                            (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.10
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2)
acl2-8.5>                                            (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.9
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2)
acl2-8.5>                                    (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.8
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2)
acl2-8.5>                                    (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.7
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2)
acl2-8.5>                                    (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.6
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.5
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.4
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.3
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.2
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.1
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ2))
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for SEARCH-FROM-START.
acl2-8.5> Thus, we admit this function under the principle of definition.  We
acl2-8.5> observe that the type of SEARCH-FROM-START is described by the theorem
acl2-8.5> (OR (INTEGERP (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))
acl2-8.5>     (EQUAL (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)
acl2-8.5>            NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SEARCH-FROM-START....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SEARCH-FROM-START,
acl2-8.5> given primitive type reasoning and the :type-prescription rule LENGTH,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (TRUE-LISTP SEQ2)
acl2-8.5>                    (TRUE-LISTP SEQ1))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (<= 0 START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (INTEGERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (INTEGERP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NOT BOUND2)
acl2-8.5>                             (<= START2 BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (TRUE-LISTP SEQ2)
acl2-8.5>                    (STRINGP SEQ1))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (<= 0 START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (INTEGERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (INTEGERP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NOT BOUND2)
acl2-8.5>                             (<= START2 BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (STRINGP SEQ2)
acl2-8.5>                    (TRUE-LISTP SEQ1))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (<= 0 START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (INTEGERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (INTEGERP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NOT BOUND2)
acl2-8.5>                             (<= START2 BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (STRINGP SEQ2)
acl2-8.5>                    (STRINGP SEQ1))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (<= 0 START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (INTEGERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NULL BOUND2)
acl2-8.5>                             (INTEGERP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (NOT BOUND2)
acl2-8.5>                             (<= START2 BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP BOUND2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (RATIONALP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                                 (NOT (INTEGERP START2)))
acl2-8.5>                             (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                             (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))).
acl2-8.5> 
acl2-8.5> By the simple :definition NULL and the simple :rewrite rule 
acl2-8.5> ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (<= 0 START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (INTEGERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (NOT BOUND2)
acl2-8.5>                        (<= START2 BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
acl2-8.5> and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
acl2-8.5> reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+
acl2-8.5> and the :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= START2 (+ START2 (LEN SEQ1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (TAKE (+ START2 (- START2) (LEN SEQ1))
acl2-8.5>                                 (NTHCDR START2 SEQ2))))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= (+ 1 START2 (LEN SEQ1)) END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (<= 0 START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (INTEGERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (NOT BOUND2)
acl2-8.5>                        (<= START2 BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
acl2-8.5> and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
acl2-8.5> reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+
acl2-8.5> and the :type-prescription rules LEN and TRUE-LISTP-TAKE, to the following
acl2-8.5> three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= START2
acl2-8.5>              (+ START2 (LEN (COERCE SEQ1 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (<= 0 START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (INTEGERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (NOT BOUND2)
acl2-8.5>                        (<= START2 BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
acl2-8.5> and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
acl2-8.5> reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+
acl2-8.5> and the :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN SEQ1))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= START2 (+ START2 (LEN SEQ1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= (+ 1 START2 (LEN SEQ1)) END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (<= 0 START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (INTEGERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (NOT BOUND2)
acl2-8.5>                        (<= START2 BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP BOUND2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (RATIONALP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (OR (NOT (INTEGERP END2))
acl2-8.5>                            (NOT (INTEGERP START2)))
acl2-8.5>                        (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
acl2-8.5>                        (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
acl2-8.5> and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
acl2-8.5> reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+
acl2-8.5> and the :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 1.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= START2
acl2-8.5>              (+ START2 (LEN (COERCE SEQ1 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (EQUAL SEQ1
acl2-8.5>                           (COERCE (TAKE (+ START2 (- START2)
acl2-8.5>                                            (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                                         (NTHCDR START2 (COERCE SEQ2 'LIST)))
acl2-8.5>                                   'STRING)))
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SEARCH-FROM-START.
acl2-8.5> SEARCH-FROM-START is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FROM-START ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NULL)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O-P)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:DEFINITION SUBSEQ)
acl2-8.5>         (:DEFINITION SUBSEQ-LIST)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART UNARY--)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE ASSOCIATIVITY-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION LENGTH)
acl2-8.5>              (:DEFINITION NFIX)
acl2-8.5>              (:DEFINITION NOT)
acl2-8.5>              (:DEFINITION O<)
acl2-8.5>              (:DEFINITION SUBSEQ))
acl2-8.5> Time:  0.08 seconds (prove: 0.06, print: 0.01, other: 0.01)
acl2-8.5> Prover steps counted:  12127
acl2-8.5>  SEARCH-FROM-START
acl2-8.5> 
acl2-8.5> For the admission of SEARCH-FROM-END we will use the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (NFIX (+ 1 END2 (- START2))).  The non-trivial part of the
acl2-8.5> measure conjecture is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (O-P (NFIX (+ 1 END2 (- START2))))
acl2-8.5>      (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                             (NOT (INTEGERP START2))))
acl2-8.5>                    (< (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>               (O< (NFIX (+ 1 END2 (- (+ 1 START2))))
acl2-8.5>                   (NFIX (+ 1 END2 (- START2)))))).
acl2-8.5> 
acl2-8.5> By the :executable-counterpart of UNARY-- and the simple :rewrite rule
acl2-8.5> DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (O-P (NFIX (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2))))
acl2-8.5>               (< (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>          (O< (NFIX (+ 1 END2 -1 (- START2)))
acl2-8.5>              (NFIX (+ 1 END2 (- START2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions FIX, LENGTH (if-intro), NFIX
acl2-8.5> (if-intro), NOT (if-intro), O-FINP, O< (if-intro) and SYNP, the :executable-
acl2-8.5> counterparts of BINARY-+ and NOT, primitive type reasoning and the
acl2-8.5> :rewrite rules COMMUTATIVITY-2-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0,
acl2-8.5> to the following six conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 1.6
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.5
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.4
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.3
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.2
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (< (+ END2 (- START2)) 0))
acl2-8.5>          (< 0 (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.1
acl2-8.5> (IMPLIES (AND (INTEGERP END2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= 0 (+ END2 (- START2))))
acl2-8.5>          (< (+ END2 (- START2))
acl2-8.5>             (+ 1 END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for SEARCH-FROM-END.
acl2-8.5> Thus, we admit this function under the principle of definition.  We
acl2-8.5> observe that the type of SEARCH-FROM-END is described by the theorem
acl2-8.5> (OR (OR (INTEGERP (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC))
acl2-8.5>         (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
acl2-8.5>                NIL))
acl2-8.5>     (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
acl2-8.5>            ACC)
acl2-8.5>     (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
acl2-8.5>            START2)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SEARCH-FROM-END....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SEARCH-FROM-END, given
acl2-8.5> primitive type reasoning and the :type-prescription rule LENGTH, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (TRUE-LISTP SEQ2)
acl2-8.5>                    (TRUE-LISTP SEQ1)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                             (NOT (INTEGERP START2)))))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (<= 0 START2)
acl2-8.5>                         (INTEGERP START2)
acl2-8.5>                         (OR (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (NULL BOUND2) (INTEGERP BOUND2))
acl2-8.5>                         (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                         (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                         (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (RATIONALP BOUND2)
acl2-8.5>                         (RATIONALP END2)
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (TRUE-LISTP SEQ2)
acl2-8.5>                    (STRINGP SEQ1)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                             (NOT (INTEGERP START2)))))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (<= 0 START2)
acl2-8.5>                         (INTEGERP START2)
acl2-8.5>                         (OR (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (NULL BOUND2) (INTEGERP BOUND2))
acl2-8.5>                         (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                         (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                         (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (RATIONALP BOUND2)
acl2-8.5>                         (RATIONALP END2)
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (STRINGP SEQ2)
acl2-8.5>                    (TRUE-LISTP SEQ1)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                             (NOT (INTEGERP START2)))))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (<= 0 START2)
acl2-8.5>                         (INTEGERP START2)
acl2-8.5>                         (OR (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (NULL BOUND2) (INTEGERP BOUND2))
acl2-8.5>                         (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                         (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                         (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (RATIONALP BOUND2)
acl2-8.5>                         (RATIONALP END2)
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))
acl2-8.5>      (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>                    (<= END2 (LENGTH SEQ2))
acl2-8.5>                    (INTEGERP END2)
acl2-8.5>                    (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (STRINGP SEQ2)
acl2-8.5>                    (STRINGP SEQ1)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                             (NOT (INTEGERP START2)))))
acl2-8.5>               (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>                    (AND (<= 0 START2)
acl2-8.5>                         (INTEGERP START2)
acl2-8.5>                         (OR (NULL BOUND2)
acl2-8.5>                             (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (NULL BOUND2) (INTEGERP BOUND2))
acl2-8.5>                         (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                         (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                         (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                         (RATIONALP BOUND2)
acl2-8.5>                         (RATIONALP END2)
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (ACL2-NUMBERP START2))
acl2-8.5>                         (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (INTEGERP (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= (+ (+ 1 START2) (LENGTH SEQ1))
acl2-8.5>                                 END2))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= END2 (LENGTH SEQ2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (<= 0 (+ 1 START2)))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ1)
acl2-8.5>                             (STRINGP SEQ1))
acl2-8.5>                         (OR (<= END2 BOUND2)
acl2-8.5>                             (TRUE-LISTP SEQ2)
acl2-8.5>                             (STRINGP SEQ2)))))).
acl2-8.5> 
acl2-8.5> By the simple :definition NULL and the simple :rewrite rule 
acl2-8.5> ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2)))))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                    (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                    (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (RATIONALP BOUND2)
acl2-8.5>                    (RATIONALP END2)
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH and NOT (if-intro),
acl2-8.5> the :executable-counterpart of NOT, primitive type reasoning and the
acl2-8.5> :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= START2 (+ START2 (LEN SEQ1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= (+ 1 START2 (LEN SEQ1)) END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2)))))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                    (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                    (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (RATIONALP BOUND2)
acl2-8.5>                    (RATIONALP END2)
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH and NOT (if-intro),
acl2-8.5> the :executable-counterpart of NOT, primitive type reasoning and the
acl2-8.5> :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= START2
acl2-8.5>              (+ START2 (LEN (COERCE SEQ1 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2)))))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                    (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                    (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (RATIONALP BOUND2)
acl2-8.5>                    (RATIONALP END2)
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH and NOT (if-intro),
acl2-8.5> the :executable-counterpart of NOT, primitive type reasoning and the
acl2-8.5> :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN SEQ1))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1))
acl2-8.5>          (<= START2 (+ START2 (LEN SEQ1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (< (+ START2 (LEN SEQ1)) END2))
acl2-8.5>          (<= (+ 1 START2 (LEN SEQ1)) END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (NOT (OR (NOT (INTEGERP END2))
acl2-8.5>                        (NOT (INTEGERP START2)))))
acl2-8.5>          (LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
acl2-8.5>               (AND (<= 0 START2)
acl2-8.5>                    (INTEGERP START2)
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (<= BOUND2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (EQUAL BOUND2 NIL)
acl2-8.5>                        (INTEGERP BOUND2))
acl2-8.5>                    (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
acl2-8.5>                    (OR (NOT BOUND2) (<= START2 BOUND2))
acl2-8.5>                    (OR BOUND2 (<= START2 (LENGTH SEQ2)))
acl2-8.5>                    (RATIONALP BOUND2)
acl2-8.5>                    (RATIONALP END2)
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (ACL2-NUMBERP START2))
acl2-8.5>                    (OR (<= END2 BOUND2) (INTEGERP END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (INTEGERP (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= (+ 1 START2 (LENGTH SEQ1)) END2))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= END2 (LENGTH SEQ2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (<= 0 (+ 1 START2)))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ1)
acl2-8.5>                        (STRINGP SEQ1))
acl2-8.5>                    (OR (<= END2 BOUND2)
acl2-8.5>                        (TRUE-LISTP SEQ2)
acl2-8.5>                        (STRINGP SEQ2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH and NOT (if-intro),
acl2-8.5> the :executable-counterpart of NOT, primitive type reasoning and the
acl2-8.5> :type-prescription rule LEN, to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 1.3
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.2
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1))
acl2-8.5>          (<= START2
acl2-8.5>              (+ START2 (LEN (COERCE SEQ1 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.1
acl2-8.5> (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   END2)
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (< (+ START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                  END2))
acl2-8.5>          (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SEARCH-FROM-END.
acl2-8.5> SEARCH-FROM-END is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FROM-END ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NULL)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O-P)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART UNARY--)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE ASSOCIATIVITY-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION LENGTH)
acl2-8.5>              (:DEFINITION NFIX)
acl2-8.5>              (:DEFINITION NOT)
acl2-8.5>              (:DEFINITION O<))
acl2-8.5> Time:  0.06 seconds (prove: 0.04, print: 0.01, other: 0.01)
acl2-8.5> Prover steps counted:  5163
acl2-8.5>  SEARCH-FROM-END
acl2-8.5> 
acl2-8.5> To verify that the 18 encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1
acl2-8.5>                        (EQUAL (LEN (STRING-DOWNCASE1 X))
acl2-8.5>                               (LEN X))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into one derived induction scheme.
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (LEN X).  This suggestion
acl2-8.5> was produced using the :induction rules LEN and STRING-DOWNCASE1. 
acl2-8.5> If we let (:P X) denote *1 above then the induction scheme we'll use
acl2-8.5> is
acl2-8.5> (AND (IMPLIES (NOT (CONSP X)) (:P X))
acl2-8.5>      (IMPLIES (AND (CONSP X) (:P (CDR X)))
acl2-8.5>               (:P X))).
acl2-8.5> This induction is justified by the same argument used to admit LEN.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (NOT (CONSP X))
acl2-8.5>          (EQUAL (LEN (STRING-DOWNCASE1 X))
acl2-8.5>                 (LEN X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions LEN and
acl2-8.5> STRING-DOWNCASE1 and the :executable-counterparts of EQUAL and LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (LEN (STRING-DOWNCASE1 (CDR X)))
acl2-8.5>                      (LEN (CDR X))))
acl2-8.5>          (EQUAL (LEN (STRING-DOWNCASE1 X))
acl2-8.5>                 (LEN X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions LEN and
acl2-8.5> STRING-DOWNCASE1, primitive type reasoning, the :rewrite rule CDR-CONS
acl2-8.5> and the :type-prescription rule STRING-DOWNCASE1.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-STRING-DOWNCASE1 ...)
acl2-8.5> Rules: ((:DEFINITION LEN)
acl2-8.5>         (:DEFINITION STRING-DOWNCASE1)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART LEN)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION LEN)
acl2-8.5>         (:INDUCTION STRING-DOWNCASE1)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION STRING-DOWNCASE1))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  190
acl2-8.5> LEN-STRING-DOWNCASE1
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM STRINGP-SUBSEQ
acl2-8.5>                        (IMPLIES (STRINGP STR)
acl2-8.5>                                 (STRINGP (SUBSEQ STR START END)))))
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM STRINGP-SUBSEQ ...):  A :REWRITE
acl2-8.5> rule generated from STRINGP-SUBSEQ will be triggered only by terms
acl2-8.5> containing the function symbol SUBSEQ, which has a non-recursive definition.
acl2-8.5> Unless this definition is disabled, this rule is unlikely ever to be
acl2-8.5> used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :type-prescription rule 
acl2-8.5> STRINGP-SUBSEQ-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM STRINGP-SUBSEQ ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION))
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> STRINGP-SUBSEQ
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-NTHCDR
acl2-8.5>                   (IMPLIES (STANDARD-CHAR-LISTP X)
acl2-8.5>                            (STANDARD-CHAR-LISTP (NTHCDR N X)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into one derived induction scheme.
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (NTHCDR N X).  This
acl2-8.5> suggestion was produced using the :induction rules NTHCDR and 
acl2-8.5> STANDARD-CHAR-LISTP.  If we let (:P N X) denote *1 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X)))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (ZP N) (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit NTHCDR.
acl2-8.5> Note, however, that the unmeasured variable X is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> three nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (STANDARD-CHAR-LISTP (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X))
acl2-8.5>          (STANDARD-CHAR-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definitions NTHCDR and STANDARD-CHAR-LISTP, the :executable-counterparts
acl2-8.5> of CDR and CONSP, primitive type reasoning, the :rewrite rule 
acl2-8.5> COMMUTATIVITY-OF-+ and the :type-prescription rule STANDARD-CHAR-LISTP,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (STANDARD-CHAR-LISTP (NTHCDR (+ N -1) NIL))
acl2-8.5>               (NOT X))
acl2-8.5>          (STANDARD-CHAR-LISTP (NTHCDR (+ -1 N) NIL))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :rewrite rule 
acl2-8.5> COMMUTATIVITY-OF-+.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X))
acl2-8.5>          (STANDARD-CHAR-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition 
acl2-8.5> STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP and
acl2-8.5> STANDARD-CHAR-LISTP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ZP N) (STANDARD-CHAR-LISTP X))
acl2-8.5>          (STANDARD-CHAR-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions NTHCDR and STANDARD-CHAR-LISTP,
acl2-8.5> the :executable-counterparts of CONSP and STANDARD-CHAR-LISTP, primitive
acl2-8.5> type reasoning and the :type-prescription rules STANDARD-CHAR-LISTP
acl2-8.5> and STANDARD-CHAR-P.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of STANDARD-CHAR-LISTP-NTHCDR depends upon the :type-prescription
acl2-8.5> rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM STANDARD-CHAR-LISTP-NTHCDR ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION NTHCDR)
acl2-8.5>         (:DEFINITION STANDARD-CHAR-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION NTHCDR)
acl2-8.5>         (:INDUCTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-P))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  565
acl2-8.5> STANDARD-CHAR-LISTP-NTHCDR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND
acl2-8.5>                   (IMPLIES (AND (STANDARD-CHAR-LISTP X)
acl2-8.5>                                 (STANDARD-CHAR-LISTP AC))
acl2-8.5>                            (STANDARD-CHAR-LISTP (REVAPPEND X AC)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  These merge into two derived induction
acl2-8.5> schemes.  However, one of these is flawed and so we are left with one
acl2-8.5> viable candidate.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (REVAPPEND X AC).
acl2-8.5> This suggestion was produced using the :induction rules REVAPPEND and
acl2-8.5> STANDARD-CHAR-LISTP.  If we let (:P AC X) denote *1 above then the
acl2-8.5> induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>                    (:P (CONS (CAR X) AC) (CDR X)))
acl2-8.5>               (:P AC X))
acl2-8.5>      (IMPLIES (ENDP X) (:P AC X))).
acl2-8.5> This induction is justified by the same argument used to admit REVAPPEND.
acl2-8.5> Note, however, that the unmeasured variable AC is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/4'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions REVAPPEND
acl2-8.5> and STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition 
acl2-8.5> STANDARD-CHAR-LISTP, primitive type reasoning, the :forward-chaining
acl2-8.5> rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, 
acl2-8.5> CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP
acl2-8.5> and STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP, the :rewrite rules
acl2-8.5> CAR-CONS and CDR-CONS and the :type-prescription rules ATOM-LISTP,
acl2-8.5> CHARACTER-LISTP, EQLABLE-LISTP, STANDARD-CHAR-LISTP and STANDARD-CHAR-P.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition 
acl2-8.5> STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ENDP X)
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP X))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (STANDARD-CHAR-LISTP AC))
acl2-8.5>          (STANDARD-CHAR-LISTP (REVAPPEND X AC))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions REVAPPEND
acl2-8.5> and STANDARD-CHAR-LISTP, the :executable-counterpart of CONSP, primitive
acl2-8.5> type reasoning and the :type-prescription rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of STANDARD-CHAR-LISTP-REVAPPEND depends upon the :type-
acl2-8.5> prescription rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM STANDARD-CHAR-LISTP-REVAPPEND ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION REVAPPEND)
acl2-8.5>         (:DEFINITION STANDARD-CHAR-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
acl2-8.5>         (:FORWARD-CHAINING STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP)
acl2-8.5>         (:INDUCTION REVAPPEND)
acl2-8.5>         (:INDUCTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION ATOM-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-P))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  760
acl2-8.5> STANDARD-CHAR-LISTP-REVAPPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL
acl2-8.5>           (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE
acl2-8.5>                   (IMPLIES (AND (STANDARD-CHAR-LISTP X)
acl2-8.5>                                 (<= N (LEN X)))
acl2-8.5>                            (STANDARD-CHAR-LISTP (TAKE N X)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  Subsumption reduces that number to two.
acl2-8.5> These merge into one derived induction scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (TAKE N X).  This
acl2-8.5> suggestion was produced using the :induction rules LEN, STANDARD-CHAR-LISTP
acl2-8.5> and TAKE.  If we let (:P N X) denote *1 above then the induction scheme
acl2-8.5> we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X)))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (ZP N) (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit TAKE.
acl2-8.5> Note, however, that the unmeasured variable X is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (STANDARD-CHAR-LISTP (TAKE (+ -1 N) (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (STANDARD-CHAR-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP
acl2-8.5> and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive
acl2-8.5> type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type-
acl2-8.5> prescription rules STANDARD-CHAR-LISTP, STANDARD-CHAR-P and TRUE-LISTP-TAKE.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (< (LEN (CDR X)) (+ -1 N))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (STANDARD-CHAR-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN and STANDARD-CHAR-LISTP,
acl2-8.5> the :executable-counterparts of CDR, CONSP and LEN, primitive type
acl2-8.5> reasoning and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (STANDARD-CHAR-LISTP (CDR X)))
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (STANDARD-CHAR-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition 
acl2-8.5> STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP, LEN
acl2-8.5> and STANDARD-CHAR-LISTP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ZP N)
acl2-8.5>               (STANDARD-CHAR-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (STANDARD-CHAR-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP
acl2-8.5> and TAKE, the :executable-counterparts of CONSP, LEN and STANDARD-CHAR-LISTP
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of STANDARD-CHAR-LISTP-OF-TAKE depends upon the :type-
acl2-8.5> prescription rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM STANDARD-CHAR-LISTP-OF-TAKE ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION LEN)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION STANDARD-CHAR-LISTP)
acl2-8.5>         (:DEFINITION TAKE)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART LEN)
acl2-8.5>         (:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION LEN)
acl2-8.5>         (:INDUCTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:INDUCTION TAKE)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-P)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  587
acl2-8.5> STANDARD-CHAR-LISTP-OF-TAKE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE
acl2-8.5>                        (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X)))
acl2-8.5>                                 (CHARACTER-LISTP (TAKE N X)))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  These merge into one derived induction
acl2-8.5> scheme.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (TAKE N X).  This
acl2-8.5> suggestion was produced using the :induction rules CHARACTER-LISTP,
acl2-8.5> LEN and TAKE.  If we let (:P N X) denote *1 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X)))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (ZP N) (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit TAKE.
acl2-8.5> Note, however, that the unmeasured variable X is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (CHARACTER-LISTP (TAKE (+ -1 N) (CDR X)))
acl2-8.5>               (CHARACTER-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (CHARACTER-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN
acl2-8.5> and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive
acl2-8.5> type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type-
acl2-8.5> prescription rules CHARACTER-LISTP and TRUE-LISTP-TAKE.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (< (LEN (CDR X)) (+ -1 N))
acl2-8.5>               (CHARACTER-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (CHARACTER-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and LEN,
acl2-8.5> the :executable-counterparts of CDR, CONSP and LEN, primitive type
acl2-8.5> reasoning and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (CHARACTER-LISTP (CDR X)))
acl2-8.5>               (CHARACTER-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (CHARACTER-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition CHARACTER-LISTP,
acl2-8.5> the :executable-counterparts of CDR, CHARACTER-LISTP, CONSP and LEN
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ZP N)
acl2-8.5>               (CHARACTER-LISTP X)
acl2-8.5>               (<= N (LEN X)))
acl2-8.5>          (CHARACTER-LISTP (TAKE N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN
acl2-8.5> and TAKE, the :executable-counterparts of CHARACTER-LISTP, CONSP and
acl2-8.5> LEN and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of CHARACTER-LISTP-OF-TAKE depends upon the :type-prescription
acl2-8.5> rule CHARACTER-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM CHARACTER-LISTP-OF-TAKE ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION CHARACTER-LISTP)
acl2-8.5>         (:DEFINITION LEN)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION TAKE)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART LEN)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION CHARACTER-LISTP)
acl2-8.5>         (:INDUCTION LEN)
acl2-8.5>         (:INDUCTION TAKE)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  532
acl2-8.5> CHARACTER-LISTP-OF-TAKE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR
acl2-8.5>                        (IMPLIES (CHARACTER-LISTP X)
acl2-8.5>                                 (CHARACTER-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into one derived induction scheme.
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (NTHCDR N X).  This
acl2-8.5> suggestion was produced using the :induction rules CHARACTER-LISTP
acl2-8.5> and NTHCDR.  If we let (:P N X) denote *1 above then the induction
acl2-8.5> scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X)))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (ZP N) (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit NTHCDR.
acl2-8.5> Note, however, that the unmeasured variable X is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> three nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (CHARACTER-LISTP (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>               (CHARACTER-LISTP X))
acl2-8.5>          (CHARACTER-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts
acl2-8.5> of CDR and CONSP, primitive type reasoning, the :rewrite rule 
acl2-8.5> COMMUTATIVITY-OF-+ and the :type-prescription rule CHARACTER-LISTP,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (CHARACTER-LISTP (NTHCDR (+ N -1) NIL))
acl2-8.5>               (NOT X))
acl2-8.5>          (CHARACTER-LISTP (NTHCDR (+ -1 N) NIL))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (CHARACTER-LISTP (CDR X)))
acl2-8.5>               (CHARACTER-LISTP X))
acl2-8.5>          (CHARACTER-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition CHARACTER-LISTP,
acl2-8.5> the :executable-counterparts of CDR, CHARACTER-LISTP and CONSP and
acl2-8.5> primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ZP N) (CHARACTER-LISTP X))
acl2-8.5>          (CHARACTER-LISTP (NTHCDR N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR,
acl2-8.5> the :executable-counterparts of CHARACTER-LISTP and CONSP, primitive
acl2-8.5> type reasoning and the :type-prescription rule CHARACTER-LISTP.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of CHARACTER-LISTP-NTHCDR depends upon the :type-prescription
acl2-8.5> rule CHARACTER-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM CHARACTER-LISTP-NTHCDR ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION CHARACTER-LISTP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTHCDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION CHARACTER-LISTP)
acl2-8.5>         (:INDUCTION NTHCDR)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  447
acl2-8.5> CHARACTER-LISTP-NTHCDR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL)))
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (NOT (NTHCDR N NIL)).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  One induction scheme is suggested
acl2-8.5> by this conjecture.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (NTHCDR N NIL). 
acl2-8.5> This suggestion was produced using the :induction rule NTHCDR.  If
acl2-8.5> we let (:P N) denote *1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1)))
acl2-8.5>               (:P N))
acl2-8.5>      (IMPLIES (ZP N) (:P N))).
acl2-8.5> This induction is justified by the same argument used to admit NTHCDR.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (NTHCDR (+ N -1) NIL)))
acl2-8.5>          (NOT (NTHCDR N NIL))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (ZP N) (NOT (NTHCDR N NIL))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM NTHCDR-NIL ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTHCDR)
acl2-8.5>         (:INDUCTION NTHCDR))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  135
acl2-8.5> NTHCDR-NIL
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM LEN-NTHCDR
acl2-8.5>                        (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                               (NFIX (- (LEN X) (NFIX N))))))
acl2-8.5> 
acl2-8.5> This simplifies, using the :definition NFIX (if-intro), to the following
acl2-8.5> three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (NOT (INTEGERP N))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                 (NFIX (+ (LEN X) 0)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, NFIX and NTHCDR,
acl2-8.5> primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and
acl2-8.5> UNICITY-OF-0 and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (INTEGERP N) (<= 0 N))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                 (NFIX (+ (LEN X) (- N))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definition NFIX (if-intro), primitive type
acl2-8.5> reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
acl2-8.5> rule LEN, to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2.2
acl2-8.5> (IMPLIES (AND (INTEGERP N)
acl2-8.5>               (<= 0 N)
acl2-8.5>               (< (+ (- N) (LEN X)) 0))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X)) 0)).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Subgoal 2.1
acl2-8.5> (IMPLIES (AND (INTEGERP N)
acl2-8.5>               (<= 0 N)
acl2-8.5>               (<= 0 (+ (- N) (LEN X))))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                 (+ (- N) (LEN X)))).
acl2-8.5> 
acl2-8.5> Normally we would attempt to prove Subgoal 2.1 by induction.  However,
acl2-8.5> we prefer in this instance to focus on the original input conjecture
acl2-8.5> rather than this simplified special case.  We therefore abandon our
acl2-8.5> previous work on this conjecture and reassign the name *1 to the original
acl2-8.5> conjecture.  (See :DOC otf-flg.)
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into one derived induction scheme.
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (LEN X), but modified
acl2-8.5> to accommodate (NTHCDR N X).  These suggestions were produced using
acl2-8.5> the :induction rules LEN and NTHCDR.  If we let (:P N X) denote *1
acl2-8.5> above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (NOT (CONSP X)) (:P N X))
acl2-8.5>      (IMPLIES (AND (CONSP X) (:P (+ N -1) (CDR X)))
acl2-8.5>               (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit LEN.
acl2-8.5> Note, however, that the unmeasured variable N is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (NOT (CONSP X))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                 (NFIX (+ (LEN X) (- (NFIX N)))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions FIX (if-intro), LEN, NFIX (if-
acl2-8.5> intro) and NTHCDR (if-intro), primitive type reasoning and the :rewrite
acl2-8.5> rule UNICITY-OF-0, to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal *1/2.2
acl2-8.5> (IMPLIES (AND (NOT (CONSP X)) (ZP N))
acl2-8.5>          (EQUAL (LEN X) 0)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LEN and
acl2-8.5> the :executable-counterpart of EQUAL.
acl2-8.5> 
acl2-8.5> Subgoal *1/2.1
acl2-8.5> (IMPLIES (AND (NOT (CONSP X)) (NOT (ZP N)))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 0)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :executable-counterparts
acl2-8.5> of EQUAL and LEN and the :rewrite rules COMMUTATIVITY-OF-+, DEFAULT-CDR
acl2-8.5> and NTHCDR-NIL.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) (- (NFIX (+ N -1)))))))
acl2-8.5>          (EQUAL (LEN (NTHCDR N X))
acl2-8.5>                 (NFIX (+ (LEN X) (- (NFIX N)))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definitions LEN, NFIX (if-intro), NTHCDR (if-intro) and SYNP,
acl2-8.5> the :executable-counterparts of BINARY-+ and UNARY--, primitive type
acl2-8.5> reasoning, the :rewrite rules ASSOCIATIVITY-OF-+, COMMUTATIVITY-2-OF-+,
acl2-8.5> COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+ and the :type-prescription
acl2-8.5> rule LEN, to the following eight conjectures.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.8
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (INTEGERP (+ -1 N))
acl2-8.5>               (<= 0 (+ -1 N))
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) (- (+ -1 N)))))
acl2-8.5>               (< (+ 1 (- N) (LEN (CDR X))) 0))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 0)).
acl2-8.5> 
acl2-8.5> By the :executable-counterpart of UNARY-- and the simple :rewrite rule
acl2-8.5> DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1.8'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (INTEGERP (+ -1 N))
acl2-8.5>               (<= 0 (+ -1 N))
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 1 (- N))))
acl2-8.5>               (< (+ 1 (- N) (LEN (CDR X))) 0))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 0)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition NFIX, the
acl2-8.5> :executable-counterpart of EQUAL, primitive type reasoning, the :rewrite
acl2-8.5> rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription
acl2-8.5> rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.7
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (INTEGERP (+ -1 N))
acl2-8.5>               (<= 0 (+ -1 N))
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) (- (+ -1 N)))))
acl2-8.5>               (<= 0 (+ 1 (- N) (LEN (CDR X)))))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 (+ 1 (- N) (LEN (CDR X))))).
acl2-8.5> 
acl2-8.5> By the :executable-counterpart of UNARY-- and the simple :rewrite rule
acl2-8.5> DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1.7'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (INTEGERP (+ -1 N))
acl2-8.5>               (<= 0 (+ -1 N))
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 1 (- N))))
acl2-8.5>               (<= 0 (+ 1 (- N) (LEN (CDR X)))))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 (+ 1 (- N) (LEN (CDR X))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition NFIX, primitive
acl2-8.5> type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and 
acl2-8.5> COMMUTATIVITY-OF-+ and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.6
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (ZP N)
acl2-8.5>               (NOT (INTEGERP N)))
acl2-8.5>          (EQUAL (LEN X)
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) 0)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive
acl2-8.5> type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.5
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (NOT (INTEGERP N)))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) 0)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.4
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (<= 0 N))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) (- N))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.3
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (ZP N)
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (<= 0 N))
acl2-8.5>          (EQUAL (LEN X)
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) (- N))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
acl2-8.5> the :executable-counterparts of <, BINARY-+, INTEGERP, NOT, UNARY--
acl2-8.5> and ZP and linear arithmetic, to
acl2-8.5> 
acl2-8.5> Subgoal *1/1.3'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (LEN (NTHCDR -1 (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0))))
acl2-8.5>          (EQUAL (LEN X)
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) 0)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions FIX, LEN,
acl2-8.5> NFIX and NTHCDR, the :executable-counterpart of ZP, primitive type
acl2-8.5> reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and
acl2-8.5> the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.2
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (ZP N)
acl2-8.5>               (< N 0))
acl2-8.5>          (EQUAL (LEN X)
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) 0)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive
acl2-8.5> type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.1
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                      (NFIX (+ (LEN (CDR X)) 0)))
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (< N 0))
acl2-8.5>          (EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
acl2-8.5>                 (NFIX (+ 1 (LEN (CDR X)) 0)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-NTHCDR ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LEN)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTHCDR)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART <)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART INTEGERP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART LEN)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART UNARY--)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ZP)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION LEN)
acl2-8.5>         (:INDUCTION NTHCDR)
acl2-8.5>         (:REWRITE ASSOCIATIVITY-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE DEFAULT-CDR)
acl2-8.5>         (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE NTHCDR-NIL)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION FIX)
acl2-8.5>              (:DEFINITION NFIX)
acl2-8.5>              (:DEFINITION NTHCDR))
acl2-8.5> Time:  0.03 seconds (prove: 0.02, print: 0.01, other: 0.00)
acl2-8.5> Prover steps counted:  2644
acl2-8.5> LEN-NTHCDR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL
acl2-8.5>          (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
acl2-8.5>                  (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>                                (NATP START)
acl2-8.5>                                (NATP END)
acl2-8.5>                                (<= START END)
acl2-8.5>                                (<= END (LENGTH SEQ))
acl2-8.5>                                (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
acl2-8.5>                           (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END)
acl2-8.5>                                                        'LIST)))))
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
acl2-8.5> ...):  A :REWRITE rule generated from SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
acl2-8.5> will be triggered only by terms containing the function symbol SUBSEQ,
acl2-8.5> which has a non-recursive definition.  Unless this definition is disabled,
acl2-8.5> this rule is unlikely ever to be used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END)
acl2-8.5>               (<= END (LENGTH SEQ))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, SUBSEQ and SUBSEQ-LIST,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END)
acl2-8.5>               (<= END (LEN (COERCE SEQ 'LIST)))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
acl2-8.5>          (STANDARD-CHAR-LISTP
acl2-8.5>               (COERCE (COERCE (TAKE (+ END (- START))
acl2-8.5>                                     (NTHCDR START (COERCE SEQ 'LIST)))
acl2-8.5>                               'STRING)
acl2-8.5>                       'LIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition NFIX, linear
acl2-8.5> arithmetic, primitive type reasoning, the :forward-chaining rule 
acl2-8.5> CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR,
acl2-8.5> CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR,
acl2-8.5> STANDARD-CHAR-LISTP-NTHCDR and STANDARD-CHAR-LISTP-OF-TAKE and the
acl2-8.5> :type-prescription rules CHARACTER-LISTP, LEN and STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP depends upon the
acl2-8.5> :type-prescription rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ...)
acl2-8.5> Rules: ((:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION SUBSEQ)
acl2-8.5>         (:DEFINITION SUBSEQ-LIST)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-NTHCDR)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-OF-TAKE)
acl2-8.5>         (:REWRITE COERCE-INVERSE-1)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE LEN-NTHCDR)
acl2-8.5>         (:REWRITE STANDARD-CHAR-LISTP-NTHCDR)
acl2-8.5>         (:REWRITE STANDARD-CHAR-LISTP-OF-TAKE)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP))
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  582
acl2-8.5> SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
acl2-8.5>                        (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                               (TRUE-LISTP Y))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  However, one of these is flawed and so we are
acl2-8.5> left with one viable candidate.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (REVAPPEND X Y).
acl2-8.5> This suggestion was produced using the :induction rule REVAPPEND. 
acl2-8.5> If we let (:P X Y) denote *1 above then the induction scheme we'll
acl2-8.5> use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>                    (:P (CDR X) (CONS (CAR X) Y)))
acl2-8.5>               (:P X Y))
acl2-8.5>      (IMPLIES (ENDP X) (:P X Y))).
acl2-8.5> This induction is justified by the same argument used to admit REVAPPEND.
acl2-8.5> Note, however, that the unmeasured variable Y is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
acl2-8.5>                      (TRUE-LISTP (CONS (CAR X) Y))))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
acl2-8.5>                      (TRUE-LISTP (CONS (CAR X) Y))))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions REVAPPEND
acl2-8.5> and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (ENDP X)
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (NOT (CONSP X))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition REVAPPEND
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM TRUE-LISTP-REVAPPEND ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION REVAPPEND)
acl2-8.5>         (:DEFINITION TRUE-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION REVAPPEND)
acl2-8.5>         (:REWRITE CDR-CONS))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  311
acl2-8.5> TRUE-LISTP-REVAPPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
acl2-8.5>                        (IMPLIES (TRUE-LISTP X)
acl2-8.5>                                 (TRUE-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :type-prescription rule 
acl2-8.5> TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription
acl2-8.5> rule TRUE-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM TRUE-LISTP-NTHCDR ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRUE-LISTP-NTHCDR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ
acl2-8.5>                        (IMPLIES (TRUE-LISTP SEQ)
acl2-8.5>                                 (TRUE-LISTP (SUBSEQ SEQ START END)))
acl2-8.5>                        :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION)))
acl2-8.5> 
acl2-8.5> ACL2 Observation in ( DEFTHM TRUE-LISTP-SUBSEQ ...):  Our heuristics
acl2-8.5> choose (SUBSEQ SEQ START END) as the :TYPED-TERM.
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM TRUE-LISTP-SUBSEQ ...):  A :REWRITE
acl2-8.5> rule generated from TRUE-LISTP-SUBSEQ will be triggered only by terms
acl2-8.5> containing the function symbol SUBSEQ, which has a non-recursive definition.
acl2-8.5> Unless this definition is disabled, this rule is unlikely ever to be
acl2-8.5> used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :type-prescription rule 
acl2-8.5> TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of TRUE-LISTP-SUBSEQ depends upon the :type-prescription
acl2-8.5> rule TRUE-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM TRUE-LISTP-SUBSEQ ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION))
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRUE-LISTP-SUBSEQ
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM LEN-REVAPPEND
acl2-8.5>                        (EQUAL (LEN (REVAPPEND X Y))
acl2-8.5>                               (+ (LEN X) (LEN Y)))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Three induction schemes are
acl2-8.5> suggested by this conjecture.  These merge into two derived induction
acl2-8.5> schemes.  However, one of these is flawed and so we are left with one
acl2-8.5> viable candidate.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (LEN X), but modified
acl2-8.5> to accommodate (REVAPPEND X Y).  These suggestions were produced using
acl2-8.5> the :induction rules LEN and REVAPPEND.  If we let (:P X Y) denote
acl2-8.5> *1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (NOT (CONSP X)) (:P X Y))
acl2-8.5>      (IMPLIES (AND (CONSP X)
acl2-8.5>                    (:P (CDR X) (CONS (CAR X) Y)))
acl2-8.5>               (:P X Y))).
acl2-8.5> This induction is justified by the same argument used to admit LEN.
acl2-8.5> Note, however, that the unmeasured variable Y is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (NOT (CONSP X))
acl2-8.5>          (EQUAL (LEN (REVAPPEND X Y))
acl2-8.5>                 (+ (LEN X) (LEN Y)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions FIX, LEN
acl2-8.5> and REVAPPEND, primitive type reasoning, the :rewrite rule UNICITY-OF-0
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y)))
acl2-8.5>                      (+ (LEN (CDR X))
acl2-8.5>                         (LEN (CONS (CAR X) Y)))))
acl2-8.5>          (EQUAL (LEN (REVAPPEND X Y))
acl2-8.5>                 (+ (LEN X) (LEN Y)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions LEN and
acl2-8.5> REVAPPEND, primitive type reasoning and the :rewrite rules CDR-CONS,
acl2-8.5> COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-REVAPPEND ...)
acl2-8.5> Rules: ((:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LEN)
acl2-8.5>         (:DEFINITION REVAPPEND)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION LEN)
acl2-8.5>         (:INDUCTION REVAPPEND)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  331
acl2-8.5> LEN-REVAPPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM LEN-OF-TAKE
acl2-8.5>                        (EQUAL (LEN (TAKE N LST)) (NFIX N))))
acl2-8.5> 
acl2-8.5> This simplifies, using the :definition NFIX (if-intro), to the following
acl2-8.5> three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (NOT (INTEGERP N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) 0)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable-
acl2-8.5> counterparts of EQUAL and LEN.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (INTEGERP N) (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (< N 0)
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) 0)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable-
acl2-8.5> counterparts of EQUAL and LEN.
acl2-8.5> 
acl2-8.5> So we now return to *1, which is
acl2-8.5> 
acl2-8.5> (IMPLIES (AND (INTEGERP N) (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  One induction scheme is suggested
acl2-8.5> by this conjecture.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (TAKE N LST).  This
acl2-8.5> suggestion was produced using the :induction rule TAKE.  If we let
acl2-8.5> (:P LST N) denote *1 above then the induction scheme we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ZP N))
acl2-8.5>                    (:P (CDR LST) (+ -1 N)))
acl2-8.5>               (:P LST N))
acl2-8.5>      (IMPLIES (ZP N) (:P LST N))).
acl2-8.5> This induction is justified by the same argument used to admit TAKE.
acl2-8.5> Note, however, that the unmeasured variable LST is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (EQUAL (LEN (TAKE (+ -1 N) (CDR LST)))
acl2-8.5>                      (+ -1 N))
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN, SYNP and TAKE,
acl2-8.5> the :executable-counterpart of BINARY-+, primitive type reasoning,
acl2-8.5> the :rewrite rules CDR-CONS, FOLD-CONSTS-IN-+ and UNICITY-OF-0 and
acl2-8.5> the :type-prescription rule TRUE-LISTP-TAKE.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (< (+ -1 N) 0)
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :compound-recognizer rule
acl2-8.5> ZP-COMPOUND-RECOGNIZER and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ZP N))
acl2-8.5>               (NOT (INTEGERP (+ -1 N)))
acl2-8.5>               (INTEGERP N)
acl2-8.5>               (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :compound-recognizer rule
acl2-8.5> ZP-COMPOUND-RECOGNIZER.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ZP N) (INTEGERP N) (<= 0 N))
acl2-8.5>          (EQUAL (LEN (TAKE N LST)) N)).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
acl2-8.5> the :executable-counterparts of <, INTEGERP, NOT and ZP and linear
acl2-8.5> arithmetic, to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (EQUAL (LEN (TAKE 0 LST)) 0).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition TAKE and
acl2-8.5> the :executable-counterparts of EQUAL, LEN and ZP.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-OF-TAKE ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LEN)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:DEFINITION TAKE)
acl2-8.5>         (:EXECUTABLE-COUNTERPART <)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART INTEGERP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART LEN)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ZP)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION TAKE)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION NFIX))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  380
acl2-8.5> LEN-OF-TAKE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ
acl2-8.5>                        (IMPLIES (AND (TRUE-LISTP SEQ)
acl2-8.5>                                      (NATP START)
acl2-8.5>                                      (NATP END)
acl2-8.5>                                      (<= START END))
acl2-8.5>                                 (EQUAL (LEN (SUBSEQ SEQ START END))
acl2-8.5>                                        (- END START)))))
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ ...):  A :REWRITE rule
acl2-8.5> generated from LEN-SUBSEQ will be triggered only by terms containing
acl2-8.5> the function symbol SUBSEQ, which has a non-recursive definition. 
acl2-8.5> Unless this definition is disabled, this rule is unlikely ever to be
acl2-8.5> used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (TRUE-LISTP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END))
acl2-8.5>          (EQUAL (LEN (SUBSEQ SEQ START END))
acl2-8.5>                 (+ END (- START)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST,
acl2-8.5> primitive type reasoning and the :rewrite rule LEN-OF-TAKE, to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (TRUE-LISTP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END)
acl2-8.5>               (< (+ END (- START)) 0))
acl2-8.5>          (EQUAL 0 (+ END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-SUBSEQ ...)
acl2-8.5> Rules: ((:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION SUBSEQ)
acl2-8.5>         (:DEFINITION SUBSEQ-LIST)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE LEN-OF-TAKE))
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  286
acl2-8.5> LEN-SUBSEQ
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL
acl2-8.5>           (DEFTHM LEN-SUBSEQ-STRING
acl2-8.5>                   (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>                                 (NATP START)
acl2-8.5>                                 (NATP END)
acl2-8.5>                                 (<= START END)
acl2-8.5>                                 (<= END (LEN (COERCE SEQ 'LIST))))
acl2-8.5>                            (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
acl2-8.5>                                   (- END START)))
acl2-8.5>                   :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ)))))
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ-STRING ...):  A :REWRITE
acl2-8.5> rule generated from LEN-SUBSEQ-STRING will be triggered only by terms
acl2-8.5> containing the function symbol SUBSEQ, which has a non-recursive definition.
acl2-8.5> Unless this definition is disabled, this rule is unlikely ever to be
acl2-8.5> used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END)
acl2-8.5>               (<= END (LEN (COERCE SEQ 'LIST))))
acl2-8.5>          (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
acl2-8.5>                 (+ END (- START)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST,
acl2-8.5> linear arithmetic, primitive type reasoning, the :forward-chaining
acl2-8.5> rule CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR,
acl2-8.5> CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR
acl2-8.5> and LEN-OF-TAKE and the :type-prescription rules CHARACTER-LISTP and
acl2-8.5> LEN, to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (<= START END)
acl2-8.5>               (<= END (LEN (COERCE SEQ 'LIST)))
acl2-8.5>               (< (+ END (- START)) 0))
acl2-8.5>          (EQUAL 0 (+ END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM LEN-SUBSEQ-STRING ...)
acl2-8.5> Rules: ((:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION SUBSEQ)
acl2-8.5>         (:DEFINITION SUBSEQ-LIST)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-NTHCDR)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-OF-TAKE)
acl2-8.5>         (:REWRITE COERCE-INVERSE-1)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE LEN-NTHCDR)
acl2-8.5>         (:REWRITE LEN-OF-TAKE)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN))
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  384
acl2-8.5> LEN-SUBSEQ-STRING
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFUN
acl2-8.5>          SEARCH-FN
acl2-8.5>          (SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                START1 START2 END1 END2 END1P END2P)
acl2-8.5>          (DECLARE
acl2-8.5>           (XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                                          START1 START2 END1 END2 END1P END2P)
acl2-8.5>                  :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ)))))
acl2-8.5>          (LET*
acl2-8.5>           ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>            (END2 (IF END2P END2 (LENGTH SEQ2)))
acl2-8.5>            (SEQ1 (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>           (MV-LET
acl2-8.5>             (SEQ1 SEQ2)
acl2-8.5>             (COND ((EQ TEST 'CHAR-EQUAL)
acl2-8.5>                    (MV (STRING-DOWNCASE SEQ1)
acl2-8.5>                        (STRING-DOWNCASE SEQ2)))
acl2-8.5>                   (T (MV SEQ1 SEQ2)))
acl2-8.5>             (AND (<= (- END1 START1) (- END2 START2))
acl2-8.5>                  (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL))
acl2-8.5>                        (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)))))))
acl2-8.5> 
acl2-8.5> Since SEARCH-FN is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of SEARCH-FN is described by the theorem 
acl2-8.5> (OR (OR (INTEGERP (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                              START1 START2 END1 END2 END1P END2P))
acl2-8.5>         (EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                           START1 START2 END1 END2 END1P END2P)
acl2-8.5>                NIL))
acl2-8.5>     (EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                       START1 START2 END1 END2 END1P END2P)
acl2-8.5>            START2)).
acl2-8.5> We used the :type-prescription rules SEARCH-FROM-END and SEARCH-FROM-START.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SEARCH-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SEARCH-FN is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>  (IMPLIES
acl2-8.5>   (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                    START1 START2 END1 END2 END1P END2P)
acl2-8.5>   (LET
acl2-8.5>    ((END1 (IF END1P END1 (LENGTH SEQ1))))
acl2-8.5>    (AND
acl2-8.5>      (OR END2P (TRUE-LISTP SEQ2)
acl2-8.5>          (STRINGP SEQ2))
acl2-8.5>      (LET ((END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>           (AND (<= 0 START1)
acl2-8.5>                (INTEGERP START1)
acl2-8.5>                (OR (NULL END1) (<= END1 (LENGTH SEQ1)))
acl2-8.5>                (OR (NULL END1) (INTEGERP END1))
acl2-8.5>                (OR (TRUE-LISTP SEQ1) (STRINGP SEQ1))
acl2-8.5>                (OR (NOT END1) (<= START1 END1))
acl2-8.5>                (OR END1 (<= START1 (LENGTH SEQ1)))
acl2-8.5>                (LET ((SEQ1 (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>                     (AND (OR (NOT (EQ TEST 'CHAR-EQUAL))
acl2-8.5>                              (STRINGP SEQ1))
acl2-8.5>                          (OR (NOT (EQ TEST 'CHAR-EQUAL))
acl2-8.5>                              (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)))
acl2-8.5>                          (OR (NOT (EQ TEST 'CHAR-EQUAL))
acl2-8.5>                              (STRINGP SEQ2))
acl2-8.5>                          (OR (NOT (EQ TEST 'CHAR-EQUAL))
acl2-8.5>                              (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>                          (MV-LET (SEQ1 SEQ2)
acl2-8.5>                                  (IF (EQ TEST 'CHAR-EQUAL)
acl2-8.5>                                      (MV (STRING-DOWNCASE SEQ1)
acl2-8.5>                                          (STRING-DOWNCASE SEQ2))
acl2-8.5>                                      (MV SEQ1 SEQ2))
acl2-8.5>                                  (AND (ACL2-NUMBERP START2)
acl2-8.5>                                       (ACL2-NUMBERP END2)
acl2-8.5>                                       (ACL2-NUMBERP (- START2))
acl2-8.5>                                       (ACL2-NUMBERP START1)
acl2-8.5>                                       (ACL2-NUMBERP END1)
acl2-8.5>                                       (ACL2-NUMBERP (- START1))
acl2-8.5>                                       (RATIONALP (+ END2 (- START2)))
acl2-8.5>                                       (RATIONALP (+ END1 (- START1)))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (INTEGERP END2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (INTEGERP START2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (<= (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (<= END2 (LENGTH SEQ2)))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (<= 0 START2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (TRUE-LISTP SEQ1)
acl2-8.5>                                           (STRINGP SEQ1))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           (NOT FROM-END)
acl2-8.5>                                           (TRUE-LISTP SEQ2)
acl2-8.5>                                           (STRINGP SEQ2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (INTEGERP END2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (INTEGERP START2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END
acl2-8.5>                                           (<= (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (<= END2 (LENGTH SEQ2)))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (<= 0 START2))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (TRUE-LISTP SEQ1)
acl2-8.5>                                           (STRINGP SEQ1))
acl2-8.5>                                       (OR (< (+ END2 (- START2))
acl2-8.5>                                              (+ END1 (- START1)))
acl2-8.5>                                           FROM-END (TRUE-LISTP SEQ2)
acl2-8.5>                                           (STRINGP SEQ2)))))))))))
acl2-8.5>  (IMPLIES (AND (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
acl2-8.5>                                 START1 START2 END1 END2 END1P END2P)
acl2-8.5>                (NOT END1P)
acl2-8.5>                (NOT (TRUE-LISTP SEQ1)))
acl2-8.5>           (STRINGP SEQ1))).
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> By the simple :definitions EQ, NULL, SEARCH-FN-GUARD and STRING-DOWNCASE
acl2-8.5> and the :executable-counterpart of TAU-SYSTEM we reduce the conjecture
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES
acl2-8.5>  (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))
acl2-8.5>       (COND ((STRINGP SEQ1)
acl2-8.5>              (AND (STRINGP SEQ2)
acl2-8.5>                   (COND ((EQUAL TEST 'EQUAL)
acl2-8.5>                          (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>                                (END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>                               (AND (NATP START1)
acl2-8.5>                                    (NATP START2)
acl2-8.5>                                    (NATP END1)
acl2-8.5>                                    (NATP END2)
acl2-8.5>                                    (NOT (< END1 START1))
acl2-8.5>                                    (NOT (< END2 START2))
acl2-8.5>                                    (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                                    (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>                         ((STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>                          (AND (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>                               (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>                                     (END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>                                    (AND (NATP START1)
acl2-8.5>                                         (NATP START2)
acl2-8.5>                                         (NATP END1)
acl2-8.5>                                         (NATP END2)
acl2-8.5>                                         (NOT (< END1 START1))
acl2-8.5>                                         (NOT (< END2 START2))
acl2-8.5>                                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                                         (NOT (< (LENGTH SEQ2) END2))))))
acl2-8.5>                         (T NIL))))
acl2-8.5>             ((EQUAL TEST 'CHAR-EQUAL) NIL)
acl2-8.5>             ((TRUE-LISTP SEQ1)
acl2-8.5>              (AND (TRUE-LISTP SEQ2)
acl2-8.5>                   (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
acl2-8.5>                         (END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>                        (AND (NATP START1)
acl2-8.5>                             (NATP START2)
acl2-8.5>                             (NATP END1)
acl2-8.5>                             (NATP END2)
acl2-8.5>                             (NOT (< END1 START1))
acl2-8.5>                             (NOT (< END2 START2))
acl2-8.5>                             (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                             (NOT (< (LENGTH SEQ2) END2))))))
acl2-8.5>             (T NIL)))
acl2-8.5>  (LET
acl2-8.5>   ((END1 (IF END1P END1 (LENGTH SEQ1))))
acl2-8.5>   (AND
acl2-8.5>    (OR END2P (TRUE-LISTP SEQ2)
acl2-8.5>        (STRINGP SEQ2))
acl2-8.5>    (LET
acl2-8.5>     ((END2 (IF END2P END2 (LENGTH SEQ2))))
acl2-8.5>     (AND
acl2-8.5>      (<= 0 START1)
acl2-8.5>      (INTEGERP START1)
acl2-8.5>      (OR (EQUAL END1 NIL)
acl2-8.5>          (<= END1 (LENGTH SEQ1)))
acl2-8.5>      (OR (EQUAL END1 NIL) (INTEGERP END1))
acl2-8.5>      (OR (TRUE-LISTP SEQ1) (STRINGP SEQ1))
acl2-8.5>      (OR (NOT END1) (<= START1 END1))
acl2-8.5>      (OR END1 (<= START1 (LENGTH SEQ1)))
acl2-8.5>      (LET ((SEQ1 (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>           (AND (OR (NOT (EQUAL TEST 'CHAR-EQUAL))
acl2-8.5>                    (STRINGP SEQ1))
acl2-8.5>                (OR (NOT (EQUAL TEST 'CHAR-EQUAL))
acl2-8.5>                    (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)))
acl2-8.5>                (OR (NOT (EQUAL TEST 'CHAR-EQUAL))
acl2-8.5>                    (STRINGP SEQ2))
acl2-8.5>                (OR (NOT (EQUAL TEST 'CHAR-EQUAL))
acl2-8.5>                    (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
acl2-8.5>                (MV-LET (SEQ1 SEQ2)
acl2-8.5>                        (IF (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>                            (MV (COERCE (STRING-DOWNCASE1 (COERCE SEQ1 'LIST))
acl2-8.5>                                        'STRING)
acl2-8.5>                                (COERCE (STRING-DOWNCASE1 (COERCE SEQ2 'LIST))
acl2-8.5>                                        'STRING))
acl2-8.5>                            (MV SEQ1 SEQ2))
acl2-8.5>                        (AND (ACL2-NUMBERP START2)
acl2-8.5>                             (ACL2-NUMBERP END2)
acl2-8.5>                             (ACL2-NUMBERP (- START2))
acl2-8.5>                             (ACL2-NUMBERP START1)
acl2-8.5>                             (ACL2-NUMBERP END1)
acl2-8.5>                             (ACL2-NUMBERP (- START1))
acl2-8.5>                             (RATIONALP (+ END2 (- START2)))
acl2-8.5>                             (RATIONALP (+ END1 (- START1)))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (INTEGERP END2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (INTEGERP START2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (<= (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (<= END2 (LENGTH SEQ2)))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (<= 0 START2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (TRUE-LISTP SEQ1)
acl2-8.5>                                 (STRINGP SEQ1))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 (NOT FROM-END)
acl2-8.5>                                 (TRUE-LISTP SEQ2)
acl2-8.5>                                 (STRINGP SEQ2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (INTEGERP END2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (INTEGERP START2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END
acl2-8.5>                                 (<= (+ START2 (LENGTH SEQ1)) END2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (<= END2 (LENGTH SEQ2)))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (<= 0 START2))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (TRUE-LISTP SEQ1)
acl2-8.5>                                 (STRINGP SEQ1))
acl2-8.5>                             (OR (< (+ END2 (- START2))
acl2-8.5>                                    (+ END1 (- START1)))
acl2-8.5>                                 FROM-END (TRUE-LISTP SEQ2)
acl2-8.5>                                 (STRINGP SEQ2))))))))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definitions LENGTH, MEMBER-EQUAL (if-intro), MV-NTH and NOT (if-
acl2-8.5> intro), the :executable-counterparts of ACL2-NUMBERP, CAR, CDR, CONSP,
acl2-8.5> EQUAL and NOT, linear arithmetic, primitive type reasoning, the :rewrite
acl2-8.5> rules CHARACTER-LISTP-STRING-DOWNCASE-1, COERCE-INVERSE-1, 
acl2-8.5> COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+, LEN-STRING-DOWNCASE1, LEN-SUBSEQ,
acl2-8.5> LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the
acl2-8.5> :type-prescription rules LEN, STANDARD-CHAR-LISTP, 
acl2-8.5> STRINGP-SUBSEQ-TYPE-PRESCRIPTION and TRUE-LISTP-SUBSEQ, to the following
acl2-8.5> 183 conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 183
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 182
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 181
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 180
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 179
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 178
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 177
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (INTEGERP END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 176
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 175
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 175'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 174
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 174'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH and the :rewrite rules COMMUTATIVITY-2-OF-+,
acl2-8.5> COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING, to
acl2-8.5> 
acl2-8.5> Subgoal 174''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ END1 (- START1) START2) END2)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 173
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 172
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 171
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 170
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 169
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 168
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          END1).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 167
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ NIL (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 166
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 165
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 164
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 164'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 163
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 162
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 161
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 160
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 159
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 158
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 157
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 156
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 155
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>              (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 154
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 153
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 152
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ (- START1)
acl2-8.5>                 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 151
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 151'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>                   (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 150
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 149
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 148
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 147
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 146
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 145
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 144
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL)
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 143
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL)
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ (- START2)
acl2-8.5>                        (LEN (COERCE SEQ2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 142
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 141
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 141'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 140
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL)
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 139
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL)
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          END1).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 138
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 137
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 136
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 135
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 135'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LENGTH SEQ2))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, 
acl2-8.5> COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING and the :type-prescription
acl2-8.5> rule LEN, to
acl2-8.5> 
acl2-8.5> Subgoal 135''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ END1 (- START1) START2)
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic, primitive
acl2-8.5> type reasoning and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 134
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ (- START2)
acl2-8.5>                        (LEN (COERCE SEQ2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 133
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (INTEGERP END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 132
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 131
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 130
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 129
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ (- START2)
acl2-8.5>                        (LEN (COERCE SEQ2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 128
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>              (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 127
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 126
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 125
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 124
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 123
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ (- START1)
acl2-8.5>                 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 122
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 121
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 120
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 119
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 118
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 117
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 116
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (INTEGERP END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 115
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 114
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 114'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 113
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 113'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH and the :rewrite rules COMMUTATIVITY-2-OF-+,
acl2-8.5> COMMUTATIVITY-OF-+ and LEN-SUBSEQ, to
acl2-8.5> 
acl2-8.5> Subgoal 113''
acl2-8.5> (IMPLIES (AND (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LEN SEQ1))
acl2-8.5>               (<= END2 (LEN SEQ2))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ END1 (- START1) START2) END2)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 112
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 111
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 110
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2)
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 109
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 108
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 107
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          END1).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 106
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ NIL (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 105
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 104
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 103
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 103'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 102
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 NIL)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 101
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 100
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 99
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 98
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 97
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 96
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 95
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 94
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN SEQ1) (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 93
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 92
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 91
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ (- START1) START2 (LEN SEQ1))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 90
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 90'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP (LEN SEQ1))
acl2-8.5>               (<= 0 (LEN SEQ1))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 (LEN SEQ1))
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= (LEN SEQ1) (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 89
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 88
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 87
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN SEQ1)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 86
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 85
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 84
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 83
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 82
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ (- START2) (LEN SEQ2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 81
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 80
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 80'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN SEQ2))
acl2-8.5>               (<= 0 (LEN SEQ2))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN SEQ2))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN SEQ2) (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 79
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 78
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          END1).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 77
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 76
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 75
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (LEN SEQ2) (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 74
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 74'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN SEQ2))
acl2-8.5>               (<= 0 (LEN SEQ2))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN SEQ2))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN SEQ2) (LENGTH SEQ2))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, 
acl2-8.5> COMMUTATIVITY-OF-+ and LEN-SUBSEQ and the :type-prescription rule LEN,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal 74''
acl2-8.5> (IMPLIES (AND (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (<= 0 (LEN SEQ2))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN SEQ2))
acl2-8.5>               (<= END1 (LEN SEQ1))
acl2-8.5>               (<= (LEN SEQ2) (LEN SEQ2))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (+ END1 (- START1) START2)
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic, primitive
acl2-8.5> type reasoning and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 73
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (RATIONALP (+ (- START2) (LEN SEQ2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 72
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (INTEGERP END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 71
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (ACL2-NUMBERP START2))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 70
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 69
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 68
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ (- START2) (LEN SEQ2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 67
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN SEQ1) (LEN SEQ1))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 66
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 65
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 64
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 63
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (LEN SEQ2) (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 62
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'EQUAL)
acl2-8.5>               (NOT (STRINGP SEQ1))
acl2-8.5>               (TRUE-LISTP SEQ1)
acl2-8.5>               (TRUE-LISTP SEQ2)
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN SEQ1))
acl2-8.5>                   (+ (- START2) (LEN SEQ2))))
acl2-8.5>          (<= (+ (- START1) START2 (LEN SEQ1))
acl2-8.5>              (LEN SEQ2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 61
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 60
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 59
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          END1).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 58
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 58'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 57
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 NIL)
acl2-8.5>                                       'LIST))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 56
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 55
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 54
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 53
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (RATIONALP (+ NIL (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 52
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 51
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 50
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 49
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 48
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 47
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 46
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET ((END1 NIL))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1)
acl2-8.5>               (<= (+ NIL (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 45
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST)))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 44
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (INTEGERP END1))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                       'LIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 44'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2)))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                       'LIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite
acl2-8.5> rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription
acl2-8.5> rule STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 43
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST)))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 42
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST)))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 41
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST)))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 40
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST)))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 39
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 38
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 37
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 37'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, 
acl2-8.5> COMMUTATIVITY-OF-+, LEN-SUBSEQ-STRING and 
acl2-8.5> SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rule
acl2-8.5> STANDARD-CHAR-LISTP, to
acl2-8.5> 
acl2-8.5> Subgoal 37''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= END2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ END1 (- START1) START2) END2)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 36
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 36'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH.
acl2-8.5> 
acl2-8.5> Subgoal 35
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P END2P
acl2-8.5>               (LET NIL
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                            'LIST))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 34
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 33
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 32
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 31
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>              (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 30
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 29
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END2 (- START2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 28
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= (+ (- START1)
acl2-8.5>                 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 27
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 27'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (INTEGERP END2)
acl2-8.5>               (<= 0 END2)
acl2-8.5>               (<= START1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= START2 END2)
acl2-8.5>               (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>                   (LENGTH SEQ1))
acl2-8.5>               (<= END2 (LENGTH SEQ2))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= END2 (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 26
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 25
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 24
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               END2P
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ END2 (- START2))))
acl2-8.5>          (INTEGERP END2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 23
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 22
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                       'LIST))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 22'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LENGTH SEQ2)))
acl2-8.5>          (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                                       'LIST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite
acl2-8.5> rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription
acl2-8.5> rules LEN and STANDARD-CHAR-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 21
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 20
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ END1 (- START1)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 19
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 18
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 17
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ (- START2)
acl2-8.5>                        (LEN (COERCE SEQ2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 16
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END1 NIL)
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (NOT END1))
acl2-8.5>          (<= START1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> NATP.
acl2-8.5> 
acl2-8.5> Subgoal 15
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (INTEGERP END1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 14
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 14'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LENGTH SEQ2))
acl2-8.5>               END1)
acl2-8.5>          (<= END1 (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition LENGTH
acl2-8.5> and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 13
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 12
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 11
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 10
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (LET ((END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal 10'
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               END1P (NOT END2P)
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (INTEGERP (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LENGTH SEQ1))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LENGTH SEQ2))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ START2
acl2-8.5>                 (LEN (COERCE (SUBSEQ SEQ1 START1 END1)
acl2-8.5>                              'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, 
acl2-8.5> COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING and the :type-prescription
acl2-8.5> rule LEN, to
acl2-8.5> 
acl2-8.5> Subgoal 10''
acl2-8.5> (IMPLIES (AND (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (INTEGERP START1)
acl2-8.5>               (<= 0 START1)
acl2-8.5>               (INTEGERP START2)
acl2-8.5>               (<= 0 START2)
acl2-8.5>               (INTEGERP END1)
acl2-8.5>               (<= 0 END1)
acl2-8.5>               (<= 0 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= START1 END1)
acl2-8.5>               (<= START2 (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>               (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>                   (LEN (COERCE SEQ2 'LIST)))
acl2-8.5>               (<= (+ END1 (- START1))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ END1 (- START1) START2)
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic, primitive
acl2-8.5> type reasoning and the :type-prescription rule LEN.
acl2-8.5> 
acl2-8.5> Subgoal 9
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= 0 START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 8
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (INTEGERP START1)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 7
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (RATIONALP (+ (- START2)
acl2-8.5>                        (LEN (COERCE SEQ2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 6
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (<= (LEN (COERCE SEQ1 'LIST))
acl2-8.5>              (LEN (COERCE SEQ1 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2)))))
acl2-8.5>          (ACL2-NUMBERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= 0 START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (INTEGERP START2)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (LEN (COERCE SEQ2 'LIST))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
acl2-8.5>               (STRINGP SEQ1)
acl2-8.5>               (STRINGP SEQ2)
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
acl2-8.5>               (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
acl2-8.5>               (NOT END1P)
acl2-8.5>               (NOT END2P)
acl2-8.5>               (LET ((END1 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                     (END2 (LEN (COERCE SEQ2 'LIST))))
acl2-8.5>                    (AND (NATP START1)
acl2-8.5>                         (NATP START2)
acl2-8.5>                         (NATP END1)
acl2-8.5>                         (NATP END2)
acl2-8.5>                         (NOT (< END1 START1))
acl2-8.5>                         (NOT (< END2 START2))
acl2-8.5>                         (NOT (< (LENGTH SEQ1) END1))
acl2-8.5>                         (NOT (< (LENGTH SEQ2) END2))))
acl2-8.5>               (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>                   (+ (- START2)
acl2-8.5>                      (LEN (COERCE SEQ2 'LIST)))))
acl2-8.5>          (<= (+ (- START1)
acl2-8.5>                 START2 (LEN (COERCE SEQ1 'LIST)))
acl2-8.5>              (LEN (COERCE SEQ2 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition NATP and
acl2-8.5> the :executable-counterpart of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SEARCH-FN.  SEARCH-FN
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SEARCH-FN ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION MV-NTH)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NULL)
acl2-8.5>         (:DEFINITION SEARCH-FN-GUARD)
acl2-8.5>         (:DEFINITION STRING-DOWNCASE)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ACL2-NUMBERP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CAR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NATP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-STRING-DOWNCASE-1)
acl2-8.5>         (:REWRITE COERCE-INVERSE-1)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE LEN-STRING-DOWNCASE1)
acl2-8.5>         (:REWRITE LEN-SUBSEQ)
acl2-8.5>         (:REWRITE LEN-SUBSEQ-STRING)
acl2-8.5>         (:REWRITE SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION SEARCH-FROM-END)
acl2-8.5>         (:TYPE-PRESCRIPTION SEARCH-FROM-START)
acl2-8.5>         (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION MEMBER-EQUAL)
acl2-8.5>              (:DEFINITION NOT))
acl2-8.5> Time:  0.26 seconds (prove: 0.18, print: 0.04, other: 0.04)
acl2-8.5> Prover steps counted:  63983
acl2-8.5> SEARCH-FN
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export SEARCH-FN.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Warnings:  Non-rec
acl2-8.5> Time:  0.39 seconds (prove: 0.27, print: 0.07, other: 0.06)
acl2-8.5> Prover steps counted:  72117
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SEARCH ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SEARCH ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into one derived induction scheme.
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (NTH N X).  This
acl2-8.5> suggestion was produced using the :induction rules EQLABLE-LISTP and
acl2-8.5> NTH.  If we let (:P N X) denote *1 above then the induction scheme
acl2-8.5> we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>                    (NOT (ZP N))
acl2-8.5>                    (:P (+ -1 N) (CDR X)))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (AND (NOT (ENDP X)) (ZP N))
acl2-8.5>               (:P N X))
acl2-8.5>      (IMPLIES (ENDP X) (:P N X))).
acl2-8.5> This induction is justified by the same argument used to admit NTH.
acl2-8.5> Note, however, that the unmeasured variable X is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> four nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (EQLABLEP (NTH (+ -1 N) (CDR X)))
acl2-8.5>               (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/4'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (EQLABLEP (NTH (+ -1 N) (CDR X)))
acl2-8.5>               (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions
acl2-8.5> EQLABLE-LISTP and NTH.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR X)))
acl2-8.5>               (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/3'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (NOT (ZP N))
acl2-8.5>               (NOT (EQLABLE-LISTP (CDR X)))
acl2-8.5>               (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition EQLABLE-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (ZP N)
acl2-8.5>               (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP X) (ZP N) (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions
acl2-8.5> EQLABLE-LISTP and NTH.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (ENDP X) (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (AND (NOT (CONSP X)) (EQLABLE-LISTP X))
acl2-8.5>          (EQLABLEP (NTH N X))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions EQLABLE-LISTP
acl2-8.5> and NTH, the :executable-counterparts of CONSP and EQLABLEP and primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of EQLABLEP-NTH depends upon the :compound-recognizer rule
acl2-8.5> EQLABLEP-RECOG and the :type-prescription rule EQLABLEP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM EQLABLEP-NTH ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG)
acl2-8.5>         (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQLABLE-LISTP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTH)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQLABLEP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION EQLABLE-LISTP)
acl2-8.5>         (:INDUCTION NTH)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLEP))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  481
acl2-8.5>  EQLABLEP-NTH
acl2-8.5> 
acl2-8.5> For the admission of COUNT-STRINGP we will use the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (NFIX (+ (+ 1 END) (- START))).  The non-trivial part of the
acl2-8.5> measure conjecture is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (O-P (NFIX (+ (+ 1 END) (- START))))
acl2-8.5>      (IMPLIES (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                        (NOT (INTEGERP END))
acl2-8.5>                        (<= END START)))
acl2-8.5>               (O< (NFIX (+ (+ 1 END) (- (+ 1 START))))
acl2-8.5>                   (NFIX (+ (+ 1 END) (- START)))))).
acl2-8.5> 
acl2-8.5> By the :executable-counterpart of UNARY-- and the simple :rewrite rules
acl2-8.5> ASSOCIATIVITY-OF-+ and DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the
acl2-8.5> conjecture to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (O-P (NFIX (+ 1 END (- START)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                   (NOT (INTEGERP END))
acl2-8.5>                   (<= END START)))
acl2-8.5>          (O< (NFIX (+ 1 END -1 (- START)))
acl2-8.5>              (NFIX (+ 1 END (- START))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions FIX, NFIX (if-intro), NOT (if-
acl2-8.5> intro), O-FINP, O< (if-intro) and SYNP, the :executable-counterparts
acl2-8.5> of BINARY-+ and NOT, primitive type reasoning and the :rewrite rules
acl2-8.5> COMMUTATIVITY-2-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0, to the following
acl2-8.5> three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 1.3
acl2-8.5> (IMPLIES (AND (INTEGERP START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (< START END))
acl2-8.5>          (<= 0 (+ 1 END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.2
acl2-8.5> (IMPLIES (AND (INTEGERP START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (< START END)
acl2-8.5>               (< (+ END (- START)) 0))
acl2-8.5>          (< 0 (+ 1 END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1.1
acl2-8.5> (IMPLIES (AND (INTEGERP START)
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (< START END)
acl2-8.5>               (<= 0 (+ END (- START))))
acl2-8.5>          (< (+ END (- START))
acl2-8.5>             (+ 1 END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for COUNT-STRINGP.
acl2-8.5> Thus, we admit this function under the principle of definition.  We
acl2-8.5> observe that the type of COUNT-STRINGP is described by the theorem
acl2-8.5> (AND (INTEGERP (COUNT-STRINGP ITEM X START END))
acl2-8.5>      (<= 0 (COUNT-STRINGP ITEM X START END))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for COUNT-STRINGP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for COUNT-STRINGP, given
acl2-8.5> the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, primitive type
acl2-8.5> reasoning and the :type-prescription rules COUNT-STRINGP and LENGTH,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (<= END (LENGTH X))
acl2-8.5>                    (NATP END)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (STRINGP X)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                             (NOT (INTEGERP END))
acl2-8.5>                             (<= END START))))
acl2-8.5>               (< START (LENGTH X)))
acl2-8.5>      (IMPLIES (AND (<= END (LENGTH X))
acl2-8.5>                    (NATP END)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (STRINGP X)
acl2-8.5>                    (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                             (NOT (INTEGERP END))
acl2-8.5>                             (<= END START)))
acl2-8.5>                    (NOT (EQLABLEP ITEM)))
acl2-8.5>               (EQLABLEP (CHAR X START)))).
acl2-8.5> 
acl2-8.5> By the simple :definitions CHAR and NATP we reduce the conjecture to
acl2-8.5> the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (<= END (LENGTH X))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP X)
acl2-8.5>               (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                        (NOT (INTEGERP END))
acl2-8.5>                        (<= END START))))
acl2-8.5>          (< START (LENGTH X))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH and NOT and the :executable-
acl2-8.5> counterpart of NOT, to
acl2-8.5> 
acl2-8.5> Subgoal 2'
acl2-8.5> (IMPLIES (AND (<= END (LEN (COERCE X 'LIST)))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP X)
acl2-8.5>               (< START END))
acl2-8.5>          (< START (LEN (COERCE X 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (<= END (LENGTH X))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP X)
acl2-8.5>               (NOT (OR (NOT (INTEGERP START))
acl2-8.5>                        (NOT (INTEGERP END))
acl2-8.5>                        (<= END START)))
acl2-8.5>               (NOT (EQLABLEP ITEM)))
acl2-8.5>          (EQLABLEP (NTH START (COERCE X 'LIST)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions LENGTH
acl2-8.5> and NOT, the :executable-counterpart of NOT, the :forward-chaining
acl2-8.5> rules CHARACTER-LISTP-COERCE and CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP,
acl2-8.5> the :rewrite rule EQLABLEP-NTH and the :type-prescription rules 
acl2-8.5> CHARACTER-LISTP and EQLABLE-LISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for COUNT-STRINGP.  
acl2-8.5> COUNT-STRINGP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-STRINGP ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION CHAR)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NFIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O-P)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART UNARY--)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
acl2-8.5>         (:REWRITE ASSOCIATIVITY-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+)
acl2-8.5>         (:REWRITE EQLABLEP-NTH)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION COUNT-STRINGP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION NFIX)
acl2-8.5>              (:DEFINITION NOT)
acl2-8.5>              (:DEFINITION O<))
acl2-8.5> Time:  0.01 seconds (prove: 0.01, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  929
acl2-8.5>  COUNT-STRINGP
acl2-8.5> 
acl2-8.5> For the admission of COUNT-LISTP we will use the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT X).  The non-trivial part of the measure conjecture
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (NOT (OR (ENDP X) (ZP END)))
acl2-8.5>          (O< (ACL2-COUNT (CDR X))
acl2-8.5>              (ACL2-COUNT X))).
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (NOT (OR (ENDP X) (ZP END)))
acl2-8.5>          (O< (ACL2-COUNT (CDR X))
acl2-8.5>              (ACL2-COUNT X))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ENDP, O-FINP and O< and the
acl2-8.5> :type-prescription rule ACL2-COUNT, to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (CONSP X) (NOT (ZP END)))
acl2-8.5>          (< (ACL2-COUNT (CDR X))
acl2-8.5>             (ACL2-COUNT X))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR X) and (CDR X) can be eliminated by using
acl2-8.5> CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
acl2-8.5> by X2.  This produces the following goal.
acl2-8.5> 
acl2-8.5> Goal'''
acl2-8.5> (IMPLIES (AND (CONSP (CONS X1 X2))
acl2-8.5>               (NOT (ZP END)))
acl2-8.5>          (< (ACL2-COUNT X2)
acl2-8.5>             (ACL2-COUNT (CONS X1 X2)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definition ACL2-COUNT, primitive type reasoning
acl2-8.5> and the :rewrite rules CAR-CONS and CDR-CONS, to
acl2-8.5> 
acl2-8.5> Goal'4'
acl2-8.5> (IMPLIES (NOT (ZP END))
acl2-8.5>          (< (ACL2-COUNT X2)
acl2-8.5>             (+ 1 (ACL2-COUNT X1) (ACL2-COUNT X2)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using linear arithmetic, primitive
acl2-8.5> type reasoning and the :type-prescription rule ACL2-COUNT.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for COUNT-LISTP.  Thus,
acl2-8.5> we admit this function under the principle of definition.  We observe
acl2-8.5> that the type of COUNT-LISTP is described by the theorem 
acl2-8.5> (AND (INTEGERP (COUNT-LISTP ITEM X END)) (<= 0 (COUNT-LISTP ITEM X END))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for COUNT-LISTP....
acl2-8.5> 
acl2-8.5> The guard conjecture for COUNT-LISTP is trivial to prove, given the
acl2-8.5> :compound-recognizer rules NATP-COMPOUND-RECOGNIZER and 
acl2-8.5> ZP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription
acl2-8.5> rule COUNT-LISTP.  COUNT-LISTP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-LISTP ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION ACL2-COUNT)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:ELIM CAR-CDR-ELIM)
acl2-8.5>         (:FAKE-RUNE-FOR-LINEAR NIL)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION ACL2-COUNT)
acl2-8.5>         (:TYPE-PRESCRIPTION COUNT-LISTP))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  754
acl2-8.5>  COUNT-LISTP
acl2-8.5> 
acl2-8.5> To verify that the two encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
acl2-8.5>                        (IMPLIES (TRUE-LISTP X)
acl2-8.5>                                 (TRUE-LISTP (NTHCDR N X)))))
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :type-prescription rule 
acl2-8.5> TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription
acl2-8.5> rule TRUE-LISTP.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM TRUE-LISTP-NTHCDR ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> TRUE-LISTP-NTHCDR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFUN
acl2-8.5>          COUNT-FN (ITEM SEQUENCE START END)
acl2-8.5>          (DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE)
acl2-8.5>                                          T (STRINGP SEQUENCE))
acl2-8.5>                                      (NATP START)
acl2-8.5>                                      (OR (NULL END)
acl2-8.5>                                          (AND (NATP END)
acl2-8.5>                                               (<= END (LENGTH SEQUENCE)))))))
acl2-8.5>          (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>               (COND ((<= END START) 0)
acl2-8.5>                     ((STRINGP SEQUENCE)
acl2-8.5>                      (COUNT-STRINGP ITEM SEQUENCE START END))
acl2-8.5>                     (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE)
acl2-8.5>                                     (- END START))))))
acl2-8.5> 
acl2-8.5> Since COUNT-FN is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of COUNT-FN is described by the theorem 
acl2-8.5> (AND (INTEGERP (COUNT-FN ITEM SEQUENCE START END))
acl2-8.5>      (<= 0 (COUNT-FN ITEM SEQUENCE START END))).
acl2-8.5> We used the :type-prescription rules COUNT-LISTP and COUNT-STRINGP.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for COUNT-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for COUNT-FN, given the
acl2-8.5> :compound-recognizer rule NATP-COMPOUND-RECOGNIZER and the :type-prescription
acl2-8.5> rule LENGTH, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (EQUAL END NIL)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (STRINGP SEQUENCE))
acl2-8.5>               (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>                    (AND (RATIONALP START)
acl2-8.5>                         (RATIONALP END)
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (<= END (LENGTH SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (INTEGERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP SEQUENCE))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (<= 0 START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP (- START)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (NATP (+ END (- START)))))))
acl2-8.5>      (IMPLIES (AND (EQUAL END NIL)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (TRUE-LISTP SEQUENCE))
acl2-8.5>               (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>                    (AND (RATIONALP START)
acl2-8.5>                         (RATIONALP END)
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (<= END (LENGTH SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (INTEGERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP SEQUENCE))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (<= 0 START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP (- START)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (NATP (+ END (- START)))))))
acl2-8.5>      (IMPLIES (AND (<= END (LENGTH SEQUENCE))
acl2-8.5>                    (NATP END)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (TRUE-LISTP SEQUENCE))
acl2-8.5>               (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>                    (AND (RATIONALP START)
acl2-8.5>                         (RATIONALP END)
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (<= END (LENGTH SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (INTEGERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP SEQUENCE))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (<= 0 START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP (- START)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (NATP (+ END (- START)))))))
acl2-8.5>      (IMPLIES (AND (<= END (LENGTH SEQUENCE))
acl2-8.5>                    (NATP END)
acl2-8.5>                    (NATP START)
acl2-8.5>                    (STRINGP SEQUENCE))
acl2-8.5>               (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>                    (AND (RATIONALP START)
acl2-8.5>                         (RATIONALP END)
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (NATP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (NOT (STRINGP SEQUENCE))
acl2-8.5>                             (<= END (LENGTH SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (INTEGERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP SEQUENCE))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (<= 0 START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP START))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP END))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (ACL2-NUMBERP (- START)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                         (OR (<= END START)
acl2-8.5>                             (STRINGP SEQUENCE)
acl2-8.5>                             (NATP (+ END (- START)))))))).
acl2-8.5> 
acl2-8.5> By the simple :definition NATP we reduce the conjecture to the following
acl2-8.5> four conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (NOT END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP SEQUENCE))
acl2-8.5>          (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>               (AND (RATIONALP START)
acl2-8.5>                    (RATIONALP END)
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (<= END (LENGTH SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (INTEGERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP SEQUENCE))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (<= 0 START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP (- START)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (NATP (+ END (- START))))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER,
acl2-8.5> the :definitions LENGTH and NOT, the :executable-counterpart of NOT
acl2-8.5> and the :type-prescription rule LEN, to
acl2-8.5> 
acl2-8.5> Subgoal 4'
acl2-8.5> (IMPLIES (AND (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP SEQUENCE)
acl2-8.5>               (< START (LEN (COERCE SEQUENCE 'LIST))))
acl2-8.5>          (<= (LEN (COERCE SEQUENCE 'LIST))
acl2-8.5>              (LEN (COERCE SEQUENCE 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (NOT END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (TRUE-LISTP SEQUENCE))
acl2-8.5>          (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>               (AND (RATIONALP START)
acl2-8.5>                    (RATIONALP END)
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (<= END (LENGTH SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (INTEGERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP SEQUENCE))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (<= 0 START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP (- START)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (NATP (+ END (- START))))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable-
acl2-8.5> counterpart of NOT, primitive type reasoning, the :rewrite rule 
acl2-8.5> COMMUTATIVITY-OF-+ and the :type-prescription rules LEN and 
acl2-8.5> TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to
acl2-8.5> 
acl2-8.5> Subgoal 3'
acl2-8.5> (IMPLIES (AND (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (TRUE-LISTP SEQUENCE)
acl2-8.5>               (< START (LEN SEQUENCE)))
acl2-8.5>          (<= 0 (+ (- START) (LEN SEQUENCE)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (<= END (LENGTH SEQUENCE))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (TRUE-LISTP SEQUENCE))
acl2-8.5>          (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>               (AND (RATIONALP START)
acl2-8.5>                    (RATIONALP END)
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (<= END (LENGTH SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (INTEGERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP SEQUENCE))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (<= 0 START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP (- START)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (NATP (+ END (- START))))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable-
acl2-8.5> counterpart of NOT, primitive type reasoning and the :type-prescription
acl2-8.5> rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to
acl2-8.5> 
acl2-8.5> Subgoal 2'
acl2-8.5> (IMPLIES (AND (<= END (LEN SEQUENCE))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (TRUE-LISTP SEQUENCE)
acl2-8.5>               (< START END))
acl2-8.5>          (<= 0 (+ END (- START)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (<= END (LENGTH SEQUENCE))
acl2-8.5>               (INTEGERP END)
acl2-8.5>               (<= 0 END)
acl2-8.5>               (INTEGERP START)
acl2-8.5>               (<= 0 START)
acl2-8.5>               (STRINGP SEQUENCE))
acl2-8.5>          (LET ((END (OR END (LENGTH SEQUENCE))))
acl2-8.5>               (AND (RATIONALP START)
acl2-8.5>                    (RATIONALP END)
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (NATP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (NOT (STRINGP SEQUENCE))
acl2-8.5>                        (<= END (LENGTH SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (INTEGERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP SEQUENCE))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (<= 0 START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP START))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP END))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (ACL2-NUMBERP (- START)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (TRUE-LISTP (NTHCDR START SEQUENCE)))
acl2-8.5>                    (OR (<= END START)
acl2-8.5>                        (STRINGP SEQUENCE)
acl2-8.5>                        (NATP (+ END (- START))))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT and
acl2-8.5> the :executable-counterpart of NOT.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for COUNT-FN.  COUNT-FN
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-FN ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:TYPE-PRESCRIPTION COUNT-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION COUNT-STRINGP)
acl2-8.5>         (:TYPE-PRESCRIPTION LEN)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
acl2-8.5> Time:  0.03 seconds (prove: 0.02, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  2976
acl2-8.5> COUNT-FN
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> We export COUNT-FN.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.04 seconds (prove: 0.02, print: 0.00, other: 0.01)
acl2-8.5> Prover steps counted:  2976
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO COUNT ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO COUNT ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since CPU-CORE-COUNT is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of CPU-CORE-COUNT is described by the theorem
acl2-8.5> (AND (CONSP (CPU-CORE-COUNT STATE)) (TRUE-LISTP (CPU-CORE-COUNT STATE))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> (CPU-CORE-COUNT STATE) => (MV * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CPU-CORE-COUNT....
acl2-8.5> 
acl2-8.5> The guard conjecture for CPU-CORE-COUNT is trivial to prove, given
acl2-8.5> the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P.  CPU-CORE-COUNT is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CPU-CORE-COUNT ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CPU-CORE-COUNT
acl2-8.5> 
acl2-8.5> The event ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The admission of DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are trivial,
acl2-8.5> using the relation O< (which is known to be well-founded on the domain
acl2-8.5> recognized by O-P) and the measure (ACL2-COUNT TERM) for DUMB-OCCUR-VAR
acl2-8.5> and (ACL2-COUNT LST) for DUMB-OCCUR-VAR-LST.  We observe that the type
acl2-8.5> of DUMB-OCCUR-VAR is described by the theorem 
acl2-8.5> (OR (EQUAL (DUMB-OCCUR-VAR VAR TERM) T)
acl2-8.5>     (EQUAL (DUMB-OCCUR-VAR VAR TERM) NIL))
acl2-8.5> and the type of DUMB-OCCUR-VAR-LST is described by the theorem 
acl2-8.5> (OR (EQUAL (DUMB-OCCUR-VAR-LST VAR LST) T)
acl2-8.5>     (EQUAL (DUMB-OCCUR-VAR-LST VAR LST)
acl2-8.5>            NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for DUMB-OCCUR-VAR and
acl2-8.5> DUMB-OCCUR-VAR-LST, given the :forward-chaining rule 
acl2-8.5> PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription
acl2-8.5> rule PSEUDO-TERM-LISTP, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (PSEUDO-TERM-LISTP LST)
acl2-8.5>                    (SYMBOLP VAR)
acl2-8.5>                    (NOT (ENDP LST)))
acl2-8.5>               (PSEUDO-TERMP (CAR LST)))
acl2-8.5>      (IMPLIES (AND (PSEUDO-TERM-LISTP LST)
acl2-8.5>                    (SYMBOLP VAR)
acl2-8.5>                    (NOT (ENDP LST))
acl2-8.5>                    (NOT (DUMB-OCCUR-VAR VAR (CAR LST))))
acl2-8.5>               (PSEUDO-TERM-LISTP (CDR LST)))
acl2-8.5>      (IMPLIES (AND (PSEUDO-TERMP TERM)
acl2-8.5>                    (SYMBOLP VAR)
acl2-8.5>                    (NOT (EQ VAR TERM))
acl2-8.5>                    (NOT (ATOM TERM))
acl2-8.5>                    (NOT (EQ 'QUOTE (CAR TERM))))
acl2-8.5>               (PSEUDO-TERM-LISTP (CDR TERM)))).
acl2-8.5> 
acl2-8.5> By the simple :definitions ATOM, ENDP and EQ we reduce the conjecture
acl2-8.5> to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (PSEUDO-TERM-LISTP LST)
acl2-8.5>               (SYMBOLP VAR)
acl2-8.5>               (CONSP LST))
acl2-8.5>          (PSEUDO-TERMP (CAR LST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PSEUDO-TERM-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (PSEUDO-TERM-LISTP LST)
acl2-8.5>               (SYMBOLP VAR)
acl2-8.5>               (CONSP LST)
acl2-8.5>               (NOT (DUMB-OCCUR-VAR VAR (CAR LST))))
acl2-8.5>          (PSEUDO-TERM-LISTP (CDR LST))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition PSEUDO-TERM-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (PSEUDO-TERMP TERM)
acl2-8.5>               (SYMBOLP VAR)
acl2-8.5>               (NOT (EQUAL VAR TERM))
acl2-8.5>               (CONSP TERM)
acl2-8.5>               (NOT (EQUAL 'QUOTE (CAR TERM))))
acl2-8.5>          (PSEUDO-TERM-LISTP (CDR TERM))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions PSEUDO-TERMP
acl2-8.5> and TRUE-LISTP and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for DUMB-OCCUR-VAR and
acl2-8.5> DUMB-OCCUR-VAR-LST.  DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( MUTUAL-RECURSION ( DEFUN DUMB-OCCUR-VAR ...) ...)
acl2-8.5> Rules: ((:DEFINITION ATOM)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION PSEUDO-TERM-LISTP)
acl2-8.5>         (:DEFINITION PSEUDO-TERMP)
acl2-8.5>         (:DEFINITION TRUE-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION PSEUDO-TERM-LISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  299
acl2-8.5>  (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST)
acl2-8.5> 
acl2-8.5> Since TRIVIAL-LAMBDA-P is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of TRIVIAL-LAMBDA-P is described by the theorem
acl2-8.5> (OR (EQUAL (TRIVIAL-LAMBDA-P FORMALS ARGS BODY)
acl2-8.5>            T)
acl2-8.5>     (EQUAL (TRIVIAL-LAMBDA-P FORMALS ARGS BODY)
acl2-8.5>            NIL)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TRIVIAL-LAMBDA-P....
acl2-8.5> 
acl2-8.5> The guard conjecture for TRIVIAL-LAMBDA-P is trivial to prove, given
acl2-8.5> the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, 
acl2-8.5> EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP
acl2-8.5> and the :type-prescription rules ATOM-LISTP, EQLABLE-LISTP and SYMBOL-LISTP.
acl2-8.5> TRIVIAL-LAMBDA-P is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TRIVIAL-LAMBDA-P ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
acl2-8.5>         (:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ATOM-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION SYMBOL-LISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TRIVIAL-LAMBDA-P
acl2-8.5> 
acl2-8.5> The event ( DEFUN MAKE-SHARP-ATSIGN ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-SHARP-ATSIGN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFUN SHARP-ATSIGN-ALIST ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SHARP-ATSIGN-ALIST ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TIME$1 ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME$1 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TIME$ ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> To verify that the six encapsulated events correctly extend the current
acl2-8.5> theory we will evaluate them.  The theory thus constructed is only
acl2-8.5> ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
acl2-8.5>                        (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                               (TRUE-LISTP Y))))
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Two induction schemes are suggested
acl2-8.5> by this conjecture.  However, one of these is flawed and so we are
acl2-8.5> left with one viable candidate.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (REVAPPEND X Y).
acl2-8.5> This suggestion was produced using the :induction rule REVAPPEND. 
acl2-8.5> If we let (:P X Y) denote *1 above then the induction scheme we'll
acl2-8.5> use is
acl2-8.5> (AND (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>                    (:P (CDR X) (CONS (CAR X) Y)))
acl2-8.5>               (:P X Y))
acl2-8.5>      (IMPLIES (ENDP X) (:P X Y))).
acl2-8.5> This induction is justified by the same argument used to admit REVAPPEND.
acl2-8.5> Note, however, that the unmeasured variable Y is being instantiated.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> two nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (ENDP X))
acl2-8.5>               (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
acl2-8.5>                      (TRUE-LISTP (CONS (CAR X) Y))))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/2'
acl2-8.5> (IMPLIES (AND (CONSP X)
acl2-8.5>               (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
acl2-8.5>                      (TRUE-LISTP (CONS (CAR X) Y))))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions REVAPPEND
acl2-8.5> and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (ENDP X)
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Subgoal *1/1'
acl2-8.5> (IMPLIES (NOT (CONSP X))
acl2-8.5>          (EQUAL (TRUE-LISTP (REVAPPEND X Y))
acl2-8.5>                 (TRUE-LISTP Y))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition REVAPPEND
acl2-8.5> and primitive type reasoning.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFTHM TRUE-LISTP-REVAPPEND ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION REVAPPEND)
acl2-8.5>         (:DEFINITION TRUE-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION REVAPPEND)
acl2-8.5>         (:REWRITE CDR-CONS))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  311
acl2-8.5> TRUE-LISTP-REVAPPEND
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-GUARDS THROW-NONEXEC-ERROR)
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for THROW-NONEXEC-ERROR....
acl2-8.5> 
acl2-8.5> The guard conjecture for THROW-NONEXEC-ERROR is trivial to prove. 
acl2-8.5> THROW-NONEXEC-ERROR is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( VERIFY-GUARDS THROW-NONEXEC-ERROR)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> THROW-NONEXEC-ERROR
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FORM)
acl2-8.5> 
acl2-8.5> The event ( VERIFY-GUARDS DEFUN-NX-FORM) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( VERIFY-GUARDS DEFUN-NX-FORM)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FN)
acl2-8.5> 
acl2-8.5> The event ( VERIFY-GUARDS DEFUN-NX-FN) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( VERIFY-GUARDS DEFUN-NX-FN)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
acl2-8.5> 
acl2-8.5> The event ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
acl2-8.5> 
acl2-8.5> The event ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> Having verified that the encapsulated events validate the signatures
acl2-8.5> of the ENCAPSULATE event, we discard the ephemeral theory and extend
acl2-8.5> the original theory as directed by the signatures and the non-LOCAL
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOCAL ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  311
acl2-8.5>  T
acl2-8.5> 
acl2-8.5> Since GC$-FN is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of GC$-FN is described by the theorem 
acl2-8.5> (EQUAL (GC$-FN ARGS) NIL).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for GC$-FN....
acl2-8.5> 
acl2-8.5> The guard conjecture for GC$-FN is trivial to prove.  GC$-FN is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC$-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC$-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO GC$ ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GC$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since GC-VERBOSE-FN is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of GC-VERBOSE-FN is described by the theorem
acl2-8.5> (EQUAL (GC-VERBOSE-FN ARG1 ARG2) NIL).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for GC-VERBOSE-FN....
acl2-8.5> 
acl2-8.5> The guard conjecture for GC-VERBOSE-FN is trivial to prove.  GC-VERBOSE-FN
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC-VERBOSE-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC-VERBOSE-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO GC-VERBOSE ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GC-VERBOSE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since GET-WORMHOLE-STATUS is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of GET-WORMHOLE-STATUS is described by the
acl2-8.5> theorem 
acl2-8.5> (AND (CONSP (GET-WORMHOLE-STATUS NAME STATE))
acl2-8.5>      (TRUE-LISTP (GET-WORMHOLE-STATUS NAME STATE))).
acl2-8.5> We used the :type-prescription rule READ-ACL2-ORACLE.
acl2-8.5> 
acl2-8.5> (GET-WORMHOLE-STATUS * STATE) => (MV * * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for GET-WORMHOLE-STATUS....
acl2-8.5> 
acl2-8.5> The guard conjecture for GET-WORMHOLE-STATUS is trivial to prove, given
acl2-8.5> the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P.  GET-WORMHOLE-STATUS is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GET-WORMHOLE-STATUS ...)
acl2-8.5> Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION READ-ACL2-ORACLE)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GET-WORMHOLE-STATUS
acl2-8.5> 
acl2-8.5> Since FILE-WRITE-DATE$ is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of FILE-WRITE-DATE$ is described by the theorem
acl2-8.5> (AND (CONSP (FILE-WRITE-DATE$ FILE STATE))
acl2-8.5>      (TRUE-LISTP (FILE-WRITE-DATE$ FILE STATE))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> (FILE-WRITE-DATE$ * STATE) => (MV * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FILE-WRITE-DATE$....
acl2-8.5> 
acl2-8.5> The guard conjecture for FILE-WRITE-DATE$ is trivial to prove, given
acl2-8.5> the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P.  FILE-WRITE-DATE$ is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FILE-WRITE-DATE$ ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  FILE-WRITE-DATE$
acl2-8.5> 
acl2-8.5> Since DELETE-FILE$ is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of DELETE-FILE$ is described by the theorem 
acl2-8.5> (AND (CONSP (DELETE-FILE$ FILE STATE))
acl2-8.5>      (TRUE-LISTP (DELETE-FILE$ FILE STATE))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> (DELETE-FILE$ * STATE) => (MV * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for DELETE-FILE$....
acl2-8.5> 
acl2-8.5> The guard conjecture for DELETE-FILE$ is trivial to prove, given the
acl2-8.5> :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
acl2-8.5> the :type-prescription rule STATE-P.  DELETE-FILE$ is compliant with
acl2-8.5> Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DELETE-FILE$ ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  DELETE-FILE$
acl2-8.5> 
acl2-8.5> Since DEBUGGER-ENABLE is non-recursive, its admission is trivial. 
acl2-8.5> We could deduce no constraints on the type of DEBUGGER-ENABLE.
acl2-8.5> 
acl2-8.5> (DEBUGGER-ENABLE STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for DEBUGGER-ENABLE....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for DEBUGGER-ENABLE, given
acl2-8.5> the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
acl2-8.5>               (STATE-P STATE))
acl2-8.5>          (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE
acl2-8.5>                          STATE)).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
acl2-8.5> BOUNDP-GLOBAL1, GLOBAL-TABLE and STATE-P.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for DEBUGGER-ENABLE.
acl2-8.5> DEBUGGER-ENABLE is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DEBUGGER-ENABLE ...)
acl2-8.5> Rules: ((:DEFINITION BOUNDP-GLOBAL)
acl2-8.5>         (:DEFINITION BOUNDP-GLOBAL1)
acl2-8.5>         (:DEFINITION GLOBAL-TABLE)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION STATE-P)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  50
acl2-8.5>  DEBUGGER-ENABLE
acl2-8.5> 
acl2-8.5> Since BREAK$ is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of BREAK$ is described by the theorem (EQUAL (BREAK$) NIL).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for BREAK$....
acl2-8.5> 
acl2-8.5> The guard conjecture for BREAK$ is trivial to prove.  BREAK$ is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BREAK$ ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  BREAK$
acl2-8.5> 
acl2-8.5> Since PRINT-CALL-HISTORY is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of PRINT-CALL-HISTORY is described by the
acl2-8.5> theorem (EQUAL (PRINT-CALL-HISTORY) NIL).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for PRINT-CALL-HISTORY....
acl2-8.5> 
acl2-8.5> The guard conjecture for PRINT-CALL-HISTORY is trivial to prove.  
acl2-8.5> PRINT-CALL-HISTORY is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PRINT-CALL-HISTORY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PRINT-CALL-HISTORY
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since DEBUGGER-ENABLEDP is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of DEBUGGER-ENABLEDP is described by the theorem
acl2-8.5> (OR (EQUAL (DEBUGGER-ENABLEDP STATE) T)
acl2-8.5>     (EQUAL (DEBUGGER-ENABLEDP STATE) NIL)).
acl2-8.5> 
acl2-8.5> (DEBUGGER-ENABLEDP STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for DEBUGGER-ENABLEDP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for DEBUGGER-ENABLEDP,
acl2-8.5> given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
acl2-8.5>                    (STATE-P STATE))
acl2-8.5>               (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE))
acl2-8.5>      (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
acl2-8.5>                    (STATE-P STATE))
acl2-8.5>               (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE))
acl2-8.5>                     (L '(T :BREAK :BREAK-BT :BT-BREAK)))
acl2-8.5>                    (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                         (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                         (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                (MEMBER-EQ-EXEC X L)))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
acl2-8.5> BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable-
acl2-8.5> counterpart of TAU-SYSTEM and the simple :rewrite rule 
acl2-8.5> MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for DEBUGGER-ENABLEDP.
acl2-8.5> DEBUGGER-ENABLEDP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DEBUGGER-ENABLEDP ...)
acl2-8.5> Rules: ((:DEFINITION BOUNDP-GLOBAL)
acl2-8.5>         (:DEFINITION BOUNDP-GLOBAL1)
acl2-8.5>         (:DEFINITION GET-GLOBAL)
acl2-8.5>         (:DEFINITION GLOBAL-TABLE)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION STATE-P)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.01)
acl2-8.5> Prover steps counted:  129
acl2-8.5>  DEBUGGER-ENABLEDP
acl2-8.5> 
acl2-8.5> Since MAYBE-PRINT-CALL-HISTORY is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of MAYBE-PRINT-CALL-HISTORY is described by
acl2-8.5> the theorem (EQUAL (MAYBE-PRINT-CALL-HISTORY STATE) NIL).  We used
acl2-8.5> the :type-prescription rule PRINT-CALL-HISTORY.
acl2-8.5> 
acl2-8.5> (MAYBE-PRINT-CALL-HISTORY STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for MAYBE-PRINT-CALL-HISTORY....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for MAYBE-PRINT-CALL-HISTORY,
acl2-8.5> given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rule STATE-P, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
acl2-8.5>                    (STATE-P STATE))
acl2-8.5>               (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE))
acl2-8.5>      (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
acl2-8.5>                    (STATE-P STATE))
acl2-8.5>               (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE))
acl2-8.5>                     (L '(:BT :BREAK-BT :BT-BREAK)))
acl2-8.5>                    (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                         (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                         (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                (MEMBER-EQ-EXEC X L)))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
acl2-8.5> BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable-
acl2-8.5> counterpart of TAU-SYSTEM and the simple :rewrite rule 
acl2-8.5> MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for MAYBE-PRINT-CALL-HISTORY.
acl2-8.5> MAYBE-PRINT-CALL-HISTORY is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAYBE-PRINT-CALL-HISTORY ...)
acl2-8.5> Rules: ((:DEFINITION BOUNDP-GLOBAL)
acl2-8.5>         (:DEFINITION BOUNDP-GLOBAL1)
acl2-8.5>         (:DEFINITION GET-GLOBAL)
acl2-8.5>         (:DEFINITION GLOBAL-TABLE)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION STATE-P)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION PRINT-CALL-HISTORY)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.01)
acl2-8.5> Prover steps counted:  129
acl2-8.5>  MAYBE-PRINT-CALL-HISTORY
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WITH-RECKLESS-READTABLE ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WITH-RECKLESS-READTABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SET-DEBUGGER-ENABLE ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-DEBUGGER-ENABLE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since SET-DEBUGGER-ENABLE-FN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of SET-DEBUGGER-ENABLE-FN is described by
acl2-8.5> the theorem (CONSP (SET-DEBUGGER-ENABLE-FN VAL STATE)).  We used the
acl2-8.5> :type-prescription rule PUT-GLOBAL.
acl2-8.5> 
acl2-8.5> (SET-DEBUGGER-ENABLE-FN * STATE) => STATE.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SET-DEBUGGER-ENABLE-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SET-DEBUGGER-ENABLE-FN,
acl2-8.5> given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
acl2-8.5> and the :type-prescription rules MEMBER-EQ-EXEC$GUARD-CHECK and STATE-P,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (STATE-P STATE)
acl2-8.5>               (LET ((X VAL)
acl2-8.5>                     (L '(T NIL :NEVER
acl2-8.5>                            :BREAK :BT
acl2-8.5>                            :BREAK-BT :BT-BREAK)))
acl2-8.5>                    (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                         (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                         (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                (MEMBER-EQ-EXEC X L)))))
acl2-8.5>      (IMPLIES (AND (LET ((X VAL)
acl2-8.5>                          (L '(T NIL :NEVER
acl2-8.5>                                 :BREAK :BT
acl2-8.5>                                 :BREAK-BT :BT-BREAK)))
acl2-8.5>                         (MEMBER-EQUAL X L))
acl2-8.5>                    (STATE-P STATE))
acl2-8.5>               (LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE
acl2-8.5>                                        VAL STATE)))
acl2-8.5>                    (AND (BOUNDP-GLOBAL1 'DMRP STATE)
acl2-8.5>                         (STATE-P1 STATE)
acl2-8.5>                         (OR (NOT (CONSP (GET-GLOBAL 'DMRP STATE)))
acl2-8.5>                             (STATE-P1 STATE)))))).
acl2-8.5> 
acl2-8.5> [Note:  A hint was supplied for our processing of the goal above. 
acl2-8.5> Thanks!]
acl2-8.5> 
acl2-8.5> By the simple :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE, 
acl2-8.5> BIG-CLOCK-ENTRY, FILE-CLOCK, FILE-CLOCK-P, GET-GLOBAL, GLOBAL-TABLE,
acl2-8.5> IDATES, LIST-ALL-PACKAGE-NAMES-LST, NATP, OPEN-CHANNELS-P, 
acl2-8.5> OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, READ-FILES, READ-FILES-P,
acl2-8.5> READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, 
acl2-8.5> USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES
acl2-8.5> and WRITTEN-FILES-P, the :executable-counterpart of TAU-SYSTEM and
acl2-8.5> the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the
acl2-8.5> conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES
acl2-8.5>  (AND
acl2-8.5>   (MEMBER-EQUAL VAL
acl2-8.5>                 '(T NIL :NEVER
acl2-8.5>                     :BREAK :BT
acl2-8.5>                     :BREAK-BT :BT-BREAK))
acl2-8.5>   (TRUE-LISTP STATE)
acl2-8.5>   (EQUAL (LENGTH STATE) 15)
acl2-8.5>   (ORDERED-SYMBOL-ALISTP (NTH 0 STATE))
acl2-8.5>   (OPEN-CHANNEL-LISTP (NTH 0 STATE))
acl2-8.5>   (ORDERED-SYMBOL-ALISTP (NTH 1 STATE))
acl2-8.5>   (OPEN-CHANNEL-LISTP (NTH 1 STATE))
acl2-8.5>   (ORDERED-SYMBOL-ALISTP (NTH 2 STATE))
acl2-8.5>   (ALL-BOUNDP
acl2-8.5>    '((ABBREV-EVISC-TUPLE . :DEFAULT)
acl2-8.5>      (ABORT-SOFT . T)
acl2-8.5>      (ACCUMULATED-TTREE)
acl2-8.5>      (ACL2-RAW-MODE-P)
acl2-8.5>      (ACL2-SOURCES-DIR)
acl2-8.5>      (ACL2-VERSION . "ACL2 Version 8.5")
acl2-8.5>      (ACL2-WORLD-ALIST)
acl2-8.5>      (ACL2P-CHECKPOINTS-FOR-SUMMARY)
acl2-8.5>      (AXIOMSP)
acl2-8.5>      (BDDNOTES)
acl2-8.5>      (BOOK-HASH-ALISTP)
acl2-8.5>      (BOOT-STRAP-FLG . T)
acl2-8.5>      (BRR-EVISC-TUPLE-INITIALIZED)
acl2-8.5>      (CERT-DATA)
acl2-8.5>      (CERTIFY-BOOK-INFO)
acl2-8.5>      (CHECK-INVARIANT-RISK . :WARNING)
acl2-8.5>      (CHECK-SUM-WEIRDNESS)
acl2-8.5>      (CHECKPOINT-FORCED-GOALS)
acl2-8.5>      (CHECKPOINT-PROCESSORS ELIMINATE-DESTRUCTORS-CLAUSE
acl2-8.5>                             FERTILIZE-CLAUSE GENERALIZE-CLAUSE
acl2-8.5>                             ELIMINATE-IRRELEVANCE-CLAUSE
acl2-8.5>                             PUSH-CLAUSE :INDUCT)
acl2-8.5>      (CHECKPOINT-SUMMARY-LIMIT NIL . 3)
acl2-8.5>      (COMPILED-FILE-EXTENSION)
acl2-8.5>      (COMPILER-ENABLED)
acl2-8.5>      (CONNECTED-BOOK-DIRECTORY)
acl2-8.5>      (CURRENT-ACL2-WORLD)
acl2-8.5>      (CURRENT-PACKAGE . "ACL2")
acl2-8.5>      (DEBUG-PSPV)
acl2-8.5>      (DEBUGGER-ENABLE)
acl2-8.5>      (DEFAXIOMS-OKP-CERT . T)
acl2-8.5>      (DEFERRED-TTAG-NOTES . :NOT-DEFERRED)
acl2-8.5>      (DEFERRED-TTAG-NOTES-SAVED)
acl2-8.5>      (DMRP)
acl2-8.5>      (EVISC-HITP-WITHOUT-IPRINT)
acl2-8.5>      (EVISCERATE-HIDE-TERMS)
acl2-8.5>      (FMT-HARD-RIGHT-MARGIN . 77)
acl2-8.5>      (FMT-SOFT-RIGHT-MARGIN . 65)
acl2-8.5>      (GAG-MODE)
acl2-8.5>      (GAG-MODE-EVISC-TUPLE)
acl2-8.5>      (GAG-STATE)
acl2-8.5>      (GAG-STATE-SAVED)
acl2-8.5>      (GET-INTERNAL-TIME-AS-REALTIME)
acl2-8.5>      (GLOBAL-CTX)
acl2-8.5>      (GLOBAL-ENABLED-STRUCTURE)
acl2-8.5>      (GSTACKP)
acl2-8.5>      (GUARD-CHECKING-ON . T)
acl2-8.5>      (HOST-LISP)
acl2-8.5>      (IGNORE-CERT-FILES)
acl2-8.5>      (ILLEGAL-TO-CERTIFY-MESSAGE)
acl2-8.5>      (IN-LOCAL-FLG)
acl2-8.5>      (IN-PROVE-FLG)
acl2-8.5>      (IN-VERIFY-FLG)
acl2-8.5>      (INCLUDING-UNCERTIFIED-P)
acl2-8.5>      (INHIBIT-ER-HARD)
acl2-8.5>      (INHIBIT-OUTPUT-LST SUMMARY)
acl2-8.5>      (INHIBIT-OUTPUT-LST-STACK)
acl2-8.5>      (INHIBITED-SUMMARY-TYPES)
acl2-8.5>      (INSIDE-SKIP-PROOFS)
acl2-8.5>      (IPRINT-AR (:HEADER :DIMENSIONS (10001)
acl2-8.5>                          :MAXIMUM-LENGTH 40004
acl2-8.5>                          :DEFAULT NIL
acl2-8.5>                          :NAME IPRINT-AR
acl2-8.5>                          :ORDER :NONE)
acl2-8.5>                 (0 0))
acl2-8.5>      (IPRINT-FAL)
acl2-8.5>      (IPRINT-HARD-BOUND . 10000)
acl2-8.5>      (IPRINT-SOFT-BOUND . 1000)
acl2-8.5>      (KEEP-TMP-FILES)
acl2-8.5>      (LAST-EVENT-DATA)
acl2-8.5>      (LAST-MAKE-EVENT-EXPANSION)
acl2-8.5>      (LAST-STEP-LIMIT . -1)
acl2-8.5>      (LD-HISTORY)
acl2-8.5>      (LD-LEVEL . 0)
acl2-8.5>      (LD-OKP . :DEFAULT)
acl2-8.5>      (LD-REDEFINITION-ACTION)
acl2-8.5>      (LD-SKIP-PROOFSP)
acl2-8.5>      (LOGIC-FNS-WITH-RAW-CODE MOD-EXPT HEADER SEARCH-FN STATE-P1 AREF2
acl2-8.5>                               AREF1 FGETPROP GETENV$ WORMHOLE-EVAL
acl2-8.5>                               WORMHOLE1 GET-WORMHOLE-STATUS
acl2-8.5>                               ASET2 SGETPROP SETENV$
acl2-8.5>                               GETPROPS COMPRESS1 TIME-LIMIT5-REACHED-P
acl2-8.5>                               FMT-TO-COMMENT-WINDOW
acl2-8.5>                               FMT-TO-COMMENT-WINDOW!
acl2-8.5>                               FMT-TO-COMMENT-WINDOW+
acl2-8.5>                               FMT-TO-COMMENT-WINDOW!+
acl2-8.5>                               LEN CPU-CORE-COUNT
acl2-8.5>                               NONNEGATIVE-INTEGER-QUOTIENT
acl2-8.5>                               CHECK-PRINT-BASE
acl2-8.5>                               RETRACT-WORLD ASET1 ARRAY1P BOOLE$
acl2-8.5>                               ARRAY2P STRIP-CDRS COMPRESS2 STRIP-CARS
acl2-8.5>                               PLIST-WORLDP PLIST-WORLDP-WITH-FORMALS
acl2-8.5>                               WORMHOLE-P MAY-NEED-SLASHES-FN
acl2-8.5>                               HAS-PROPSP HARD-ERROR ABORT! P!
acl2-8.5>                               FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1
acl2-8.5>                               ALPHORDER EXTEND-WORLD
acl2-8.5>                               DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
acl2-8.5>                               USER-STOBJ-ALIST
acl2-8.5>                               READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR
acl2-8.5>                               UPDATE-USER-STOBJ-ALIST
acl2-8.5>                               DECREMENT-BIG-CLOCK PUT-GLOBAL
acl2-8.5>                               CLOSE-INPUT-CHANNEL MAKUNBOUND-GLOBAL
acl2-8.5>                               OPEN-INPUT-CHANNEL OPEN-INPUT-CHANNEL-P1
acl2-8.5>                               BOUNDP-GLOBAL1 GLOBAL-TABLE-CARS1
acl2-8.5>                               EXTEND-T-STACK LIST-ALL-PACKAGE-NAMES
acl2-8.5>                               CLOSE-OUTPUT-CHANNEL WRITE-BYTE$
acl2-8.5>                               SHRINK-T-STACK ASET-32-BIT-INTEGER-STACK
acl2-8.5>                               GET-GLOBAL 32-BIT-INTEGER-STACK-LENGTH1
acl2-8.5>                               EXTEND-32-BIT-INTEGER-STACK
acl2-8.5>                               ASET-T-STACK AREF-T-STACK
acl2-8.5>                               READ-CHAR$ AREF-32-BIT-INTEGER-STACK
acl2-8.5>                               OPEN-OUTPUT-CHANNEL
acl2-8.5>                               OPEN-OUTPUT-CHANNEL-P1
acl2-8.5>                               PRINC$ READ-OBJECT BIG-CLOCK-NEGATIVE-P
acl2-8.5>                               PEEK-CHAR$ SHRINK-32-BIT-INTEGER-STACK
acl2-8.5>                               READ-RUN-TIME READ-BYTE$ READ-IDATE
acl2-8.5>                               T-STACK-LENGTH1 PRINT-OBJECT$-FN
acl2-8.5>                               GET-OUTPUT-STREAM-STRING$-FN
acl2-8.5>                               MV-LIST RETURN-LAST ZPF IDENTITY
acl2-8.5>                               ENDP NTHCDR LAST REVAPPEND NULL BUTLAST
acl2-8.5>                               STRING NOT MOD PLUSP ATOM LISTP ZP
acl2-8.5>                               FLOOR CEILING TRUNCATE ROUND REM LOGBITP
acl2-8.5>                               ASH LOGCOUNT SIGNUM INTEGER-LENGTH
acl2-8.5>                               EXPT SUBSTITUTE ZEROP MINUSP ODDP
acl2-8.5>                               EVENP = /= MAX MIN CONJUGATE LOGANDC1
acl2-8.5>                               LOGANDC2 LOGNAND LOGNOR LOGNOT LOGORC1
acl2-8.5>                               LOGORC2 LOGTEST ABS STRING-EQUAL STRING<
acl2-8.5>                               STRING> STRING<= STRING>= STRING-UPCASE
acl2-8.5>                               STRING-DOWNCASE KEYWORDP EQ
acl2-8.5>                               EQL CHAR SUBST SUBLIS ACONS NTH SUBSEQ
acl2-8.5>                               LENGTH REVERSE ZIP STANDARD-CHAR-P
acl2-8.5>                               ALPHA-CHAR-P UPPER-CASE-P
acl2-8.5>                               LOWER-CASE-P CHAR< CHAR> CHAR<= CHAR>=
acl2-8.5>                               CHAR-EQUAL CHAR-UPCASE CHAR-DOWNCASE
acl2-8.5>                               RANDOM$ THROW-NONEXEC-ERROR
acl2-8.5>                               GC$-FN SET-COMPILER-ENABLED GOOD-BYE-FN
acl2-8.5>                               TAKE FILE-WRITE-DATE$ PRINT-CALL-HISTORY
acl2-8.5>                               SET-DEBUGGER-ENABLE-FN
acl2-8.5>                               BREAK$ PRIN1$ PRIN1-WITH-SLASHES
acl2-8.5>                               MEMBER-EQUAL ASSOC-EQUAL
acl2-8.5>                               SUBSETP-EQUAL RASSOC-EQUAL REMOVE-EQUAL
acl2-8.5>                               POSITION-EQUAL MAYBE-FINISH-OUTPUT$
acl2-8.5>                               SYMBOL-IN-CURRENT-PACKAGE-P SLEEP
acl2-8.5>                               FAST-ALIST-LEN HONS-COPY-PERSISTENT
acl2-8.5>                               HONS-SUMMARY HONS-CLEAR HONS-CLEAR!
acl2-8.5>                               HONS-WASH HONS-WASH! FAST-ALIST-CLEAN
acl2-8.5>                               FAST-ALIST-FORK HONS-EQUAL-LITE
acl2-8.5>                               NUMBER-SUBTREES FAST-ALIST-SUMMARY
acl2-8.5>                               HONS-ACONS! CLEAR-MEMOIZE-TABLES
acl2-8.5>                               HONS-COPY HONS-ACONS
acl2-8.5>                               CLEAR-MEMOIZE-TABLE FAST-ALIST-FREE
acl2-8.5>                               HONS-EQUAL HONS-RESIZE-FN HONS-GET
acl2-8.5>                               HONS FAST-ALIST-CLEAN! FAST-ALIST-FORK!
acl2-8.5>                               MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS
acl2-8.5>                               MAKE-FAST-ALIST SERIALIZE-READ-FN
acl2-8.5>                               SERIALIZE-WRITE-FN READ-OBJECT-SUPPRESS
acl2-8.5>                               READ-OBJECT-WITH-CASE
acl2-8.5>                               PRINT-OBJECT$-PRESERVING-CASE
acl2-8.5>                               ASSIGN-LOCK
acl2-8.5>                               THROW-OR-ATTACH-CALL TIME-TRACKER-FN
acl2-8.5>                               GC-VERBOSE-FN SET-ABSSTOBJ-DEBUG-FN
acl2-8.5>                               SYS-CALL-STATUS SYS-CALL
acl2-8.5>                               SYS-CALL+ SYS-CALL* CANONICAL-PATHNAME
acl2-8.5>                               DOPPELGANGER-BADGE-USERFN
acl2-8.5>                               DOPPELGANGER-APPLY$-USERFN
acl2-8.5>                               EV-FNCALL-W-GUARD1
acl2-8.5>                               PRINT-CL-CACHE-FN MFC-ANCESTORS
acl2-8.5>                               MFC-CLAUSE MFC-RDEPTH MFC-TYPE-ALIST
acl2-8.5>                               MFC-UNIFY-SUBST MFC-WORLD MFC-AP-FN
acl2-8.5>                               MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE
acl2-8.5>                               MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN
acl2-8.5>                               MFC-RW-TTREE MFC-TS-FN MFC-TS-TTREE
acl2-8.5>                               MAGIC-EV-FNCALL NEVER-MEMOIZE-FN BIG-N
acl2-8.5>                               ZP-BIG-N DECREMENT-BIG-N ANCESTORS-CHECK
acl2-8.5>                               ONCEP-TP PRINT-CLAUSE-ID-OKP
acl2-8.5>                               TOO-MANY-IFS-POST-REWRITE
acl2-8.5>                               TOO-MANY-IFS-PRE-REWRITE
acl2-8.5>                               SET-GC-STRATEGY-FN
acl2-8.5>                               GC-STRATEGY READ-FILE-INTO-STRING2
acl2-8.5>                               CONS-WITH-HINT FILE-LENGTH$
acl2-8.5>                               DELETE-FILE$ SET-BAD-LISP-CONSP-MEMOIZE
acl2-8.5>                               RETRACT-STOBJ-TABLES
acl2-8.5>                               APPLY$-LAMBDA APPLY$-PRIM)
acl2-8.5>      (MACROS-WITH-RAW-CODE THEORY-INVARIANT SET-LET*-ABSTRACTIONP
acl2-8.5>                            DEFAXIOM SET-BOGUS-MUTUAL-RECURSION-OK
acl2-8.5>                            SET-RULER-EXTENDERS
acl2-8.5>                            DELETE-INCLUDE-BOOK-DIR
acl2-8.5>                            DELETE-INCLUDE-BOOK-DIR!
acl2-8.5>                            CERTIFY-BOOK PROGN! F-PUT-GLOBAL
acl2-8.5>                            PUSH-UNTOUCHABLE SET-BACKCHAIN-LIMIT
acl2-8.5>                            SET-DEFAULT-HINTS! SET-RW-CACHE-STATE!
acl2-8.5>                            SET-INDUCTION-DEPTH-LIMIT!
acl2-8.5>                            SET-OVERRIDE-HINTS-MACRO
acl2-8.5>                            DEFTHEORY PSTK VERIFY-GUARDS DEFCHOOSE
acl2-8.5>                            SET-DEFAULT-BACKCHAIN-LIMIT SET-STATE-OK
acl2-8.5>                            SET-IGNORE-OK SET-NON-LINEARP
acl2-8.5>                            SET-TAU-AUTO-MODE WITH-OUTPUT
acl2-8.5>                            SET-COMPILE-FNS ADD-INCLUDE-BOOK-DIR
acl2-8.5>                            ADD-INCLUDE-BOOK-DIR!
acl2-8.5>                            CLEAR-PSTK ADD-CUSTOM-KEYWORD-HINT
acl2-8.5>                            INITIAL-GSTACK ACL2-UNWIND-PROTECT
acl2-8.5>                            SET-WELL-FOUNDED-RELATION
acl2-8.5>                            CATCH-TIME-LIMIT5
acl2-8.5>                            CATCH-TIME-LIMIT5@PAR DEFUNS
acl2-8.5>                            ADD-DEFAULT-HINTS! LOCAL ENCAPSULATE
acl2-8.5>                            REMOVE-DEFAULT-HINTS! INCLUDE-BOOK
acl2-8.5>                            PPROGN SET-ENFORCE-REDUNDANCY LOGIC
acl2-8.5>                            ER DEFLABEL MV-LET PROGRAM VALUE-TRIPLE
acl2-8.5>                            SET-BODY COMP SET-BOGUS-DEFUN-HINTS-OK
acl2-8.5>                            DMR-STOP DEFPKG SET-MEASURE-FUNCTION
acl2-8.5>                            SET-INHIBIT-WARNINGS!
acl2-8.5>                            SET-INHIBIT-ER-SOFT! DEFTHM MV
acl2-8.5>                            F-BIG-CLOCK-NEGATIVE-P RESET-PREHISTORY
acl2-8.5>                            MUTUAL-RECURSION SET-REWRITE-STACK-LIMIT
acl2-8.5>                            SET-PROVER-STEP-LIMIT
acl2-8.5>                            ADD-MATCH-FREE-OVERRIDE
acl2-8.5>                            SET-MATCH-FREE-DEFAULT
acl2-8.5>                            THE-MV TABLE IN-ARITHMETIC-THEORY
acl2-8.5>                            REGENERATE-TAU-DATABASE
acl2-8.5>                            SET-CASE-SPLIT-LIMITATIONS
acl2-8.5>                            SET-IRRELEVANT-FORMALS-OK
acl2-8.5>                            REMOVE-UNTOUCHABLE
acl2-8.5>                            IN-THEORY WITH-OUTPUT-FORCED
acl2-8.5>                            DMR-START REWRITE-ENTRY
acl2-8.5>                            SKIP-PROOFS F-BOUNDP-GLOBAL
acl2-8.5>                            MAKE-EVENT SET-VERIFY-GUARDS-EAGERNESS
acl2-8.5>                            WORMHOLE VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                            START-PROOF-TREE
acl2-8.5>                            F-DECREMENT-BIG-CLOCK DEFABSSTOBJ
acl2-8.5>                            DEFSTOBJ DEFUND DEFTTAG PUSH-GFRAME
acl2-8.5>                            DEFTHMD F-GET-GLOBAL CAAR CADR
acl2-8.5>                            CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR
acl2-8.5>                            CDADR CDDAR CDDDR CAAAAR CAAADR CAADAR
acl2-8.5>                            CAADDR CADAAR CADADR CADDAR CADDDR
acl2-8.5>                            CDAAAR CDAADR CDADAR CDADDR CDDAAR
acl2-8.5>                            CDDADR CDDDAR CDDDDR REST MAKE-LIST LIST
acl2-8.5>                            OR AND * LOGIOR LOGXOR LOGAND SEARCH
acl2-8.5>                            LOGEQV CONCATENATE LET* DEFUN THE > <=
acl2-8.5>                            >= + - / 1+ 1- PROGN DEFMACRO COND CASE
acl2-8.5>                            LIST* APPEND DEFCONST IN-PACKAGE INTERN
acl2-8.5>                            FIRST SECOND THIRD FOURTH FIFTH SIXTH
acl2-8.5>                            SEVENTH EIGHTH NINTH TENTH DIGIT-CHAR-P
acl2-8.5>                            UNMEMOIZE MEMOIZE DEFUNS-STD
acl2-8.5>                            DEFTHM-STD DEFUN-STD POR PAND PLET
acl2-8.5>                            PARGS SPEC-MV-LET TRACE! WITH-LIVE-STATE
acl2-8.5>                            WITH-OUTPUT-OBJECT-CHANNEL-SHARING
acl2-8.5>                            WITH-HCOMP-BINDINGS
acl2-8.5>                            WITH-HCOMP-HT-BINDINGS REDEF+
acl2-8.5>                            REDEF- BIND-ACL2-TIME-LIMIT DEFATTACH
acl2-8.5>                            DEFPROXY COUNT MEMBER ASSOC SUBSETP
acl2-8.5>                            RASSOC REMOVE REMOVE-DUPLICATES POSITION
acl2-8.5>                            CATCH-STEP-LIMIT STEP-LIMIT-ERROR
acl2-8.5>                            WATERFALL-PRINT-CLAUSE-ID@PAR
acl2-8.5>                            DEFLOCK F-PUT-GLOBAL@PAR
acl2-8.5>                            SET-WATERFALL-PARALLELISM
acl2-8.5>                            WITH-PROVER-STEP-LIMIT
acl2-8.5>                            WATERFALL1-WRAPPER@PAR
acl2-8.5>                            WITH-WATERFALL-PARALLELISM-TIMINGS
acl2-8.5>                            WITH-PARALLELISM-HAZARD-WARNINGS
acl2-8.5>                            WARN-ABOUT-PARALLELISM-HAZARD
acl2-8.5>                            WITH-ENSURED-PARALLELISM-FINISHING
acl2-8.5>                            STATE-GLOBAL-LET*
acl2-8.5>                            WITH-RECKLESS-READTABLE
acl2-8.5>                            WITH-LOCK WITH-FAST-ALIST-RAW
acl2-8.5>                            WITH-STOLEN-ALIST-RAW
acl2-8.5>                            FAST-ALIST-FREE-ON-EXIT-RAW
acl2-8.5>                            STOBJ-LET ADD-LD-KEYWORD-ALIAS!
acl2-8.5>                            SET-LD-KEYWORD-ALIASES!
acl2-8.5>                            WITH-GUARD-CHECKING-EVENT WHEN-PASS-2
acl2-8.5>                            LOOP$ OUR-WITH-TERMINAL-INPUT
acl2-8.5>                            TRUST-MFC WITH-GLOBAL-STOBJ)
acl2-8.5>      (MAIN-TIMER . 0)
acl2-8.5>      (MAKE-EVENT-DEBUG)
acl2-8.5>      (MAKE-EVENT-DEBUG-DEPTH . 0)
acl2-8.5>      (MATCH-FREE-ERROR)
acl2-8.5>      (MODIFYING-INCLUDE-BOOK-DIR-ALIST)
acl2-8.5>      (PARALLEL-EXECUTION-ENABLED)
acl2-8.5>      (PARALLELISM-HAZARDS-ACTION)
acl2-8.5>      (PC-ERP)
acl2-8.5>      (PC-INFO)
acl2-8.5>      (PC-OUTPUT)
acl2-8.5>      (PC-SS-ALIST)
acl2-8.5>      (PC-VAL)
acl2-8.5>      (PORT-FILE-ENABLED . T)
acl2-8.5>      (PPR-FLAT-RIGHT-MARGIN . 40)
acl2-8.5>      (PRINT-BASE . 10)
acl2-8.5>      (PRINT-CASE . :UPCASE)
acl2-8.5>      (PRINT-CIRCLE)
acl2-8.5>      (PRINT-CIRCLE-FILES . T)
acl2-8.5>      (PRINT-CLAUSE-IDS)
acl2-8.5>      (PRINT-ESCAPE . T)
acl2-8.5>      (PRINT-GV-DEFAULTS)
acl2-8.5>      (PRINT-LENGTH)
acl2-8.5>      (PRINT-LEVEL)
acl2-8.5>      (PRINT-LINES)
acl2-8.5>      (PRINT-PRETTY)
acl2-8.5>      (PRINT-RADIX)
acl2-8.5>      (PRINT-READABLY)
acl2-8.5>      (PRINT-RIGHT-MARGIN)
acl2-8.5>      (PROGRAM-FNS-WITH-RAW-CODE RELIEVE-HYP-SYNP
acl2-8.5>                                 EV-W-LST SIMPLIFY-CLAUSE1
acl2-8.5>                                 EV-REC-ACL2-UNWIND-PROTECT
acl2-8.5>                                 ALLOCATE-FIXNUM-RANGE TRACE$-FN-GENERAL
acl2-8.5>                                 EV-FNCALL! OPEN-TRACE-FILE-FN
acl2-8.5>                                 SET-TRACE-EVISC-TUPLE EV-FNCALL-W-BODY
acl2-8.5>                                 EV-REC SETUP-SIMPLIFY-CLAUSE-POT-LST1
acl2-8.5>                                 SAVE-EXEC-FN CW-GSTACK-FN
acl2-8.5>                                 RECOMPRESS-GLOBAL-ENABLED-STRUCTURE
acl2-8.5>                                 EV-W VERBOSE-PSTACK COMP-FN
acl2-8.5>                                 ACL2-RAW-EVAL PSTACK-FN DMR-START-FN
acl2-8.5>                                 EV-FNCALL-META LD-LOOP PRINT-SUMMARY
acl2-8.5>                                 EV EV-LST ALLEGRO-ALLOCATE-SLOWLY-FN
acl2-8.5>                                 CERTIFY-BOOK-FN TRANSLATE11-FLET-ALIST1
acl2-8.5>                                 INCLUDE-BOOK-FN1 INCLUDE-BOOK-FN
acl2-8.5>                                 SET-W PROVE-LOOP CHK-VIRGIN-MSG
acl2-8.5>                                 W-OF-ANY-STATE LD-FN-BODY UNTRANSLATE
acl2-8.5>                                 LONGEST-COMMON-TAIL-LENGTH-REC
acl2-8.5>                                 COMPILE-FUNCTION UNTRANSLATE-LST
acl2-8.5>                                 EV-SYNP ADD-POLYS DMR-STOP-FN
acl2-8.5>                                 LD-PRINT-RESULTS CLOSE-TRACE-FILE-FN
acl2-8.5>                                 EV-FNCALL-REC EV-FNCALL LD-FN0
acl2-8.5>                                 LD-FN WRITE-EXPANSION-FILE LATCH-STOBJS1
acl2-8.5>                                 CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS
acl2-8.5>                                 UNTRACE$-FN1
acl2-8.5>                                 BDD-TOP DEFSTOBJ-FIELD-FNS-RAW-DEFS
acl2-8.5>                                 TIMES-MOD-M31
acl2-8.5>                                 IPRINT-AR-AREF1 PROVE MAKE-EVENT-FN
acl2-8.5>                                 OOPS-WARNING UBT-PREHISTORY-FN
acl2-8.5>                                 GET-DECLAIM-LIST PATHNAME-UNIX-TO-OS
acl2-8.5>                                 HCOMP-BUILD-FROM-STATE
acl2-8.5>                                 DEFCONST-VAL PUSH-WARNING-FRAME
acl2-8.5>                                 POP-WARNING-FRAME PUSH-WARNING
acl2-8.5>                                 INITIALIZE-ACCUMULATED-WARNINGS
acl2-8.5>                                 EV-REC-RETURN-LAST
acl2-8.5>                                 CHK-RETURN-LAST-ENTRY FCHECKSUM-ATOM
acl2-8.5>                                 STEP-LIMIT-ERROR1 WATERFALL1-LST@PAR
acl2-8.5>                                 WATERFALL1-WRAPPER@PAR-BEFORE
acl2-8.5>                                 WATERFALL1-WRAPPER@PAR-AFTER
acl2-8.5>                                 INCREMENT-WATERFALL-PARALLELISM-COUNTER
acl2-8.5>                                 FLUSH-WATERFALL-PARALLELISM-HASHTABLES
acl2-8.5>                                 CLEAR-CURRENT-WATERFALL-PARALLELISM-HT
acl2-8.5>                                 SETUP-WATERFALL-PARALLELISM-HT-FOR-NAME
acl2-8.5>                                 SET-WATERFALL-PARALLELISM-FN
acl2-8.5>                                 FIX-STOBJ-ARRAY-TYPE
acl2-8.5>                                 SET-GC-THRESHOLD$-FN
acl2-8.5>                                 CERTIFY-BOOK-FINISH-COMPLETE
acl2-8.5>                                 CHK-ABSSTOBJ-INVARIANTS
acl2-8.5>                                 GET-STOBJ-CREATOR IPRINT-ORACLE-UPDATES
acl2-8.5>                                 IPRINT-ORACLE-UPDATES@PAR LD-FIX-COMMAND
acl2-8.5>                                 UPDATE-ENABLED-STRUCTURE-ARRAY
acl2-8.5>                                 UPDATE-ENABLED-STRUCTURE
acl2-8.5>                                 FCHECKSUM-OBJ2 CHECK-SUM-OBJ
acl2-8.5>                                 VERIFY-GUARDS-FN1 EV-FNCALL+-W
acl2-8.5>                                 EXTEND-CURRENT-THEORY DEFSTOBJ-FN
acl2-8.5>                                 APPLY-USER-STOBJ-ALIST-OR-KWOTE
acl2-8.5>                                 ACCP-INFO READ-FILE-ITERATE-SAFE)
acl2-8.5>      (PROMPT-FUNCTION . DEFAULT-PRINT-PROMPT)
acl2-8.5>      (PROMPT-MEMO)
acl2-8.5>      (PROOF-TREE)
acl2-8.5>      (PROOF-TREE-BUFFER-WIDTH . 65)
acl2-8.5>      (PROOF-TREE-CTX)
acl2-8.5>      (PROOF-TREE-INDENT . "|  ")
acl2-8.5>      (PROOF-TREE-START-PRINTED)
acl2-8.5>      (PROOFS-CO .
acl2-8.5>                 ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
acl2-8.5>      (PROTECT-MEMOIZE-STATISTICS)
acl2-8.5>      (RAW-GUARD-WARNINGP)
acl2-8.5>      (RAW-INCLUDE-BOOK-DIR!-ALIST . :IGNORE)
acl2-8.5>      (RAW-INCLUDE-BOOK-DIR-ALIST . :IGNORE)
acl2-8.5>      (RAW-PROOF-FORMAT)
acl2-8.5>      (RAW-WARNING-FORMAT)
acl2-8.5>      (REDO-FLAT-FAIL)
acl2-8.5>      (REDO-FLAT-SUCC)
acl2-8.5>      (REDUNDANT-WITH-RAW-CODE-OKP)
acl2-8.5>      (RETRACE-P)
acl2-8.5>      (SAFE-MODE)
acl2-8.5>      (SAVE-EXPANSION-FILE)
acl2-8.5>      (SAVED-OUTPUT-P)
acl2-8.5>      (SAVED-OUTPUT-REVERSED)
acl2-8.5>      (SAVED-OUTPUT-TOKEN-LST)
acl2-8.5>      (SCRIPT-MODE)
acl2-8.5>      (SERIALIZE-CHARACTER)
acl2-8.5>      (SERIALIZE-CHARACTER-SYSTEM)
acl2-8.5>      (SHOW-CUSTOM-KEYWORD-HINT-EXPANSION)
acl2-8.5>      (SKIP-NOTIFY-ON-DEFTTAG)
acl2-8.5>      (SKIP-PROOFS-BY-SYSTEM)
acl2-8.5>      (SKIP-PROOFS-OKP-CERT . T)
acl2-8.5>      (SKIP-RESET-PREHISTORY)
acl2-8.5>      (SLOW-APPLY$-ACTION . T)
acl2-8.5>      (SLOW-ARRAY-ACTION . :BREAK)
acl2-8.5>      (SPLITTER-OUTPUT . T)
acl2-8.5>      (STANDARD-CO .
acl2-8.5>                   ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
acl2-8.5>      (STANDARD-OI .
acl2-8.5>                   ACL2-OUTPUT-CHANNEL::STANDARD-OBJECT-INPUT-0)
acl2-8.5>      (STEP-LIMIT-RECORD)
acl2-8.5>      (SYSTEM-ATTACHMENTS-CACHE)
acl2-8.5>      (SYSTEM-BOOKS-DIR)
acl2-8.5>      (TEMP-TOUCHABLE-FNS)
acl2-8.5>      (TEMP-TOUCHABLE-VARS)
acl2-8.5>      (TERM-EVISC-TUPLE . :DEFAULT)
acl2-8.5>      (TIMER-ALIST)
acl2-8.5>      (TMP-DIR)
acl2-8.5>      (TOTAL-PARALLELISM-WORK-LIMIT . 8000)
acl2-8.5>      (TOTAL-PARALLELISM-WORK-LIMIT-ERROR . T)
acl2-8.5>      (TRACE-CO .
acl2-8.5>                ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
acl2-8.5>      (TRACE-SPECS)
acl2-8.5>      (TRIPLE-PRINT-PREFIX . " ")
acl2-8.5>      (TTAGS-ALLOWED . :ALL)
acl2-8.5>      (UNDONE-WORLDS-KILL-RING NIL NIL NIL)
acl2-8.5>      (USELESS-RUNES)
acl2-8.5>      (USER-HOME-DIR)
acl2-8.5>      (VERBOSE-THEORY-WARNING . T)
acl2-8.5>      (VERIFY-TERMINATION-ON-RAW-PROGRAM-OKP
acl2-8.5>           APPLY$-LAMBDA
acl2-8.5>           APPLY$-PRIM PLIST-WORLDP-WITH-FORMALS)
acl2-8.5>      (WALKABOUT-ALIST)
acl2-8.5>      (WATERFALL-PARALLELISM)
acl2-8.5>      (WATERFALL-PARALLELISM-TIMING-THRESHOLD . 10000)
acl2-8.5>      (WATERFALL-PRINTING . :FULL)
acl2-8.5>      (WATERFALL-PRINTING-WHEN-FINISHED)
acl2-8.5>      (WINDOW-INTERFACE-POSTLUDE
acl2-8.5>           .
acl2-8.5>           "#>\\>#<\\<e(acl2-window-postlude ?~sw ~xt ~xp)#>\\>")
acl2-8.5>      (WINDOW-INTERFACE-PRELUDE
acl2-8.5>           .
acl2-8.5>           "~%#<\\<e(acl2-window-prelude ?~sw ~xc)#>\\>#<\\<~sw")
acl2-8.5>      (WINDOW-INTERFACEP)
acl2-8.5>      (WORMHOLE-NAME)
acl2-8.5>      (WORMHOLE-STATUS)
acl2-8.5>      (WRITE-ACL2X)
acl2-8.5>      (WRITE-BOOKDATA)
acl2-8.5>      (WRITE-FOR-READ)
acl2-8.5>      (WRITES-OKP . T))
acl2-8.5>    (NTH 2 STATE))
acl2-8.5>   (PLIST-WORLDP (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
acl2-8.5>                                   (NTH 2 STATE))))
acl2-8.5>   (SYMBOL-ALISTP (FGETPROP 'ACL2-DEFAULTS-TABLE
acl2-8.5>                            'TABLE-ALIST
acl2-8.5>                            NIL
acl2-8.5>                            (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
acl2-8.5>                                              (NTH 2 STATE)))))
acl2-8.5>   (TIMER-ALISTP (CDR (ASSOC-EQUAL 'TIMER-ALIST
acl2-8.5>                                   (NTH 2 STATE))))
acl2-8.5>   (KNOWN-PACKAGE-ALISTP (FGETPROP 'KNOWN-PACKAGE-ALIST
acl2-8.5>                                   'GLOBAL-VALUE
acl2-8.5>                                   NIL
acl2-8.5>                                   (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
acl2-8.5>                                                     (NTH 2 STATE)))))
acl2-8.5>   (TRUE-LISTP (NTH 3 STATE))
acl2-8.5>   (32-BIT-INTEGER-LISTP (NTH 4 STATE))
acl2-8.5>   (INTEGERP (NTH 5 STATE))
acl2-8.5>   (INTEGER-LISTP (NTH 6 STATE))
acl2-8.5>   (TRUE-LISTP (NTH 7 STATE))
acl2-8.5>   (INTEGERP (NTH 8 STATE))
acl2-8.5>   (<= 0 (NTH 8 STATE))
acl2-8.5>   (READABLE-FILES-LISTP (NTH 9 STATE))
acl2-8.5>   (WRITTEN-FILE-LISTP (NTH 10 STATE))
acl2-8.5>   (READ-FILE-LISTP (NTH 11 STATE))
acl2-8.5>   (WRITABLE-FILE-LISTP (NTH 12 STATE))
acl2-8.5>   (TRUE-LIST-LISTP (NTH 13 STATE))
acl2-8.5>   (SYMBOL-ALISTP (NTH 14 STATE)))
acl2-8.5>  (LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE
acl2-8.5>                           VAL STATE)))
acl2-8.5>       (AND (BOUNDP-GLOBAL1 'DMRP STATE)
acl2-8.5>            (STATE-P1 STATE)
acl2-8.5>            (OR (NOT (CONSP (CDR (ASSOC-EQUAL 'DMRP (NTH 2 STATE)))))
acl2-8.5>                (STATE-P1 STATE))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rule NATP-COMPOUND-RECOGNIZER, the :definitions 32-BIT-INTEGER-STACK,
acl2-8.5> ACL2-ORACLE, ALL-BOUNDP, BIG-CLOCK-ENTRY, BOUNDP-GLOBAL1, FILE-CLOCK,
acl2-8.5> FILE-CLOCK-P, GLOBAL-TABLE, IDATES, LENGTH, LIST-ALL-PACKAGE-NAMES-LST,
acl2-8.5> MEMBER-EQUAL, NOT, NTH, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS, 
acl2-8.5> OPEN-OUTPUT-CHANNELS, PUT-GLOBAL, READ-FILES, READ-FILES-P, READABLE-FILES,
acl2-8.5> READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, UPDATE-GLOBAL-TABLE,
acl2-8.5> USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES
acl2-8.5> and WRITTEN-FILES-P, the :executable-counterparts of ALL-BOUNDP, BINARY-+,
acl2-8.5> CAR, CDR, CONSP, EQUAL, MAX, NFIX, NTH, OPEN-CHANNEL-LISTP, 
acl2-8.5> ORDERED-SYMBOL-ALISTP and ZP, primitive type reasoning, the :forward-
acl2-8.5> chaining rules CONSP-ASSOC-EQUAL, EQLABLE-ALISTP-FORWARD-TO-ALISTP,
acl2-8.5> ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP and 
acl2-8.5> SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP, the :rewrite rules 
acl2-8.5> ADD-PAIR-PRESERVES-ALL-BOUNDP, ASSOC-ADD-PAIR, LEN-UPDATE-NTH, 
acl2-8.5> NTH-UPDATE-NTH, ORDERED-SYMBOL-ALISTP-ADD-PAIR and 
acl2-8.5> STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription
acl2-8.5> rules 32-BIT-INTEGER-LISTP, ALISTP, CONSP-ASSOC-EQUAL, EQLABLE-ALISTP,
acl2-8.5> INTEGER-LISTP, KNOWN-PACKAGE-ALISTP, OPEN-CHANNEL-LISTP, 
acl2-8.5> ORDERED-SYMBOL-ALISTP, PLIST-WORLDP, READ-FILE-LISTP, READABLE-FILES-LISTP,
acl2-8.5> SYMBOL-ALISTP, TIMER-ALISTP, TRUE-LIST-LISTP, TRUE-LISTP-UPDATE-NTH,
acl2-8.5> UPDATE-NTH, WRITABLE-FILE-LISTP and WRITTEN-FILE-LISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SET-DEBUGGER-ENABLE-FN.
acl2-8.5> SET-DEBUGGER-ENABLE-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-DEBUGGER-ENABLE-FN ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION 32-BIT-INTEGER-STACK)
acl2-8.5>         (:DEFINITION ACL2-ORACLE)
acl2-8.5>         (:DEFINITION ALL-BOUNDP)
acl2-8.5>         (:DEFINITION BIG-CLOCK-ENTRY)
acl2-8.5>         (:DEFINITION BOUNDP-GLOBAL1)
acl2-8.5>         (:DEFINITION FILE-CLOCK)
acl2-8.5>         (:DEFINITION FILE-CLOCK-P)
acl2-8.5>         (:DEFINITION GET-GLOBAL)
acl2-8.5>         (:DEFINITION GLOBAL-TABLE)
acl2-8.5>         (:DEFINITION IDATES)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION LIST-ALL-PACKAGE-NAMES-LST)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTH)
acl2-8.5>         (:DEFINITION OPEN-CHANNELS-P)
acl2-8.5>         (:DEFINITION OPEN-INPUT-CHANNELS)
acl2-8.5>         (:DEFINITION OPEN-OUTPUT-CHANNELS)
acl2-8.5>         (:DEFINITION PUT-GLOBAL)
acl2-8.5>         (:DEFINITION READ-FILES)
acl2-8.5>         (:DEFINITION READ-FILES-P)
acl2-8.5>         (:DEFINITION READABLE-FILES)
acl2-8.5>         (:DEFINITION READABLE-FILES-P)
acl2-8.5>         (:DEFINITION STATE-P)
acl2-8.5>         (:DEFINITION STATE-P1)
acl2-8.5>         (:DEFINITION T-STACK)
acl2-8.5>         (:DEFINITION UPDATE-GLOBAL-TABLE)
acl2-8.5>         (:DEFINITION USER-STOBJ-ALIST1)
acl2-8.5>         (:DEFINITION WRITEABLE-FILES)
acl2-8.5>         (:DEFINITION WRITEABLE-FILES-P)
acl2-8.5>         (:DEFINITION WRITTEN-FILES)
acl2-8.5>         (:DEFINITION WRITTEN-FILES-P)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ALL-BOUNDP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CAR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART MAX)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NFIX)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NTH)
acl2-8.5>         (:EXECUTABLE-COUNTERPART OPEN-CHANNEL-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ORDERED-SYMBOL-ALISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ZP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING CONSP-ASSOC-EQUAL)
acl2-8.5>         (:FORWARD-CHAINING EQLABLE-ALISTP-FORWARD-TO-ALISTP)
acl2-8.5>         (:FORWARD-CHAINING ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:FORWARD-CHAINING SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP)
acl2-8.5>         (:REWRITE ADD-PAIR-PRESERVES-ALL-BOUNDP)
acl2-8.5>         (:REWRITE ASSOC-ADD-PAIR)
acl2-8.5>         (:REWRITE LEN-UPDATE-NTH)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:REWRITE NTH-UPDATE-NTH)
acl2-8.5>         (:REWRITE ORDERED-SYMBOL-ALISTP-ADD-PAIR)
acl2-8.5>         (:REWRITE STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION 32-BIT-INTEGER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION CONSP-ASSOC-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION INTEGER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION KNOWN-PACKAGE-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK)
acl2-8.5>         (:TYPE-PRESCRIPTION OPEN-CHANNEL-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ORDERED-SYMBOL-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION PLIST-WORLDP)
acl2-8.5>         (:TYPE-PRESCRIPTION PUT-GLOBAL)
acl2-8.5>         (:TYPE-PRESCRIPTION READ-FILE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION READABLE-FILES-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P)
acl2-8.5>         (:TYPE-PRESCRIPTION SYMBOL-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TIMER-ALISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LIST-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION TRUE-LISTP-UPDATE-NTH)
acl2-8.5>         (:TYPE-PRESCRIPTION UPDATE-NTH)
acl2-8.5>         (:TYPE-PRESCRIPTION WRITABLE-FILE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION WRITTEN-FILE-LISTP))
acl2-8.5> Time:  3.74 seconds (prove: 3.72, print: 0.01, other: 0.01)
acl2-8.5> Prover steps counted:  281055
acl2-8.5>  SET-DEBUGGER-ENABLE-FN
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( IN-THEORY (DISABLE ...))
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3016)
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( IN-THEORY (DISABLE ...))
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3015)
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( IN-THEORY (DISABLE ...))
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3014)
acl2-8.5> 
acl2-8.5> Since ADD-@PAR-SUFFIX is non-recursive, its admission is trivial. 
acl2-8.5> We observe that the type of ADD-@PAR-SUFFIX is described by the theorem
acl2-8.5> (SYMBOLP (ADD-@PAR-SUFFIX SYMBOL)).  We used the :type-prescription
acl2-8.5> rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for ADD-@PAR-SUFFIX....
acl2-8.5> 
acl2-8.5> The guard conjecture for ADD-@PAR-SUFFIX is trivial to prove, given
acl2-8.5> primitive type reasoning and the :type-prescription rule STRING-APPEND.
acl2-8.5> ADD-@PAR-SUFFIX is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ADD-@PAR-SUFFIX ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:TYPE-PRESCRIPTION STRING-APPEND)
acl2-8.5>         (:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  ADD-@PAR-SUFFIX
acl2-8.5> 
acl2-8.5> The admission of GENERATE-@PAR-MAPPINGS is trivial, using the relation
acl2-8.5> O< (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT SYMBOLS).  We observe that the type of
acl2-8.5> GENERATE-@PAR-MAPPINGS is described by the theorem 
acl2-8.5> (TRUE-LISTP (GENERATE-@PAR-MAPPINGS SYMBOLS)).  We used primitive type
acl2-8.5> reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for GENERATE-@PAR-MAPPINGS....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for GENERATE-@PAR-MAPPINGS,
acl2-8.5> given the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP,
acl2-8.5> EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP
acl2-8.5> and the :type-prescription rules ATOM-LISTP, EQLABLE-LISTP and SYMBOL-LISTP,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
acl2-8.5>                    (NOT (ENDP SYMBOLS)))
acl2-8.5>               (SYMBOLP (CAR SYMBOLS)))
acl2-8.5>      (IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
acl2-8.5>                    (NOT (ENDP SYMBOLS)))
acl2-8.5>               (SYMBOL-LISTP (CDR SYMBOLS)))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
acl2-8.5>               (CONSP SYMBOLS))
acl2-8.5>          (SYMBOLP (CAR SYMBOLS))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-LISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
acl2-8.5>               (CONSP SYMBOLS))
acl2-8.5>          (SYMBOL-LISTP (CDR SYMBOLS))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition SYMBOL-LISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for GENERATE-@PAR-MAPPINGS.
acl2-8.5> GENERATE-@PAR-MAPPINGS is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GENERATE-@PAR-MAPPINGS ...)
acl2-8.5> Rules: ((:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION SYMBOL-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
acl2-8.5>         (:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ATOM-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION SYMBOL-LISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  115
acl2-8.5>  GENERATE-@PAR-MAPPINGS
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *@PAR-MAPPINGS* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *@PAR-MAPPINGS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The admission of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is trivial, using
acl2-8.5> the relation O< (which is known to be well-founded on the domain recognized
acl2-8.5> by O-P) and the measure (ACL2-COUNT MAPPINGS).  We observe that the
acl2-8.5> type of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is described by the theorem
acl2-8.5> (TRUE-LISTP (MAKE-IDENTITY-FOR-@PAR-MAPPINGS MAPPINGS)).  We used primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for MAKE-IDENTITY-FOR-@PAR-MAPPINGS....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for 
acl2-8.5> MAKE-IDENTITY-FOR-@PAR-MAPPINGS, given the :forward-chaining rule 
acl2-8.5> ALISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule ALISTP,
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP MAPPINGS)
acl2-8.5>                    (NOT (ENDP MAPPINGS)))
acl2-8.5>               (ALISTP (CDR MAPPINGS)))
acl2-8.5>      (IMPLIES (AND (ALISTP MAPPINGS)
acl2-8.5>                    (NOT (ENDP MAPPINGS))
acl2-8.5>                    (NOT (CONSP (CAR MAPPINGS))))
acl2-8.5>               (EQUAL (CAR MAPPINGS) NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (ALISTP MAPPINGS) (CONSP MAPPINGS))
acl2-8.5>          (ALISTP (CDR MAPPINGS))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (ALISTP MAPPINGS)
acl2-8.5>               (CONSP MAPPINGS)
acl2-8.5>               (NOT (CONSP (CAR MAPPINGS))))
acl2-8.5>          (EQUAL (CAR MAPPINGS) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for 
acl2-8.5> MAKE-IDENTITY-FOR-@PAR-MAPPINGS.  MAKE-IDENTITY-FOR-@PAR-MAPPINGS is
acl2-8.5> compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ALISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  127
acl2-8.5>  MAKE-IDENTITY-FOR-@PAR-MAPPINGS
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO DEFINE-@PAR-MACROS ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEFINE-@PAR-MACROS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CATCH-TIME-LIMIT5@PAR (&REST RST)
acl2-8.5>                   (CONS 'CATCH-TIME-LIMIT5 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'CMP-AND-VALUE-TO-ERROR-QUADRUPLE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CMP-TO-ERROR-TRIPLE@PAR (&REST RST)
acl2-8.5>                   (CONS 'CMP-TO-ERROR-TRIPLE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ER@PAR (&REST RST)
acl2-8.5>                   (CONS 'ER RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ER@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ER-LET*@PAR (&REST RST)
acl2-8.5>                   (CONS 'ER-LET* RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ER-LET*@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER-LET*@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ER-PROGN@PAR (&REST RST)
acl2-8.5>                   (CONS 'ER-PROGN RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ER-PROGN@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ER-PROGN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ERROR-FMS@PAR (&REST RST)
acl2-8.5>                   (CONS 'ERROR-FMS RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ERROR-FMS@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-FMS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'ERROR-IN-PARALLELISM-MODE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ERROR1@PAR (&REST RST)
acl2-8.5>                   (CONS 'ERROR1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ERROR1@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST)
acl2-8.5>                   (CONS 'F-PUT-GLOBAL RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO F-PUT-GLOBAL@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO F-PUT-GLOBAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO IO?@PAR (&REST RST)
acl2-8.5>                   (CONS 'IO? RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO IO?@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO IO?@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO IO?-PROVE@PAR (&REST RST)
acl2-8.5>                   (CONS 'IO?-PROVE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO IO?-PROVE@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO IO?-PROVE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MV@PAR (&REST RST)
acl2-8.5>                   (CONS 'MV RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MV@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MV@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MV-LET@PAR (&REST RST)
acl2-8.5>                   (CONS 'MV-LET RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MV-LET@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MV-LET@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST)
acl2-8.5>                   (CONS 'PARALLEL-ONLY RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PARALLEL-ONLY@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PARALLEL-ONLY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO PPROGN@PAR (&REST RST)
acl2-8.5>                   (CONS 'PPROGN RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PPROGN@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PPROGN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
acl2-8.5> is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST)
acl2-8.5>                   (CONS 'SERIAL-ONLY RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SERIAL-ONLY@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-ONLY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO SL-LET@PAR (&REST RST)
acl2-8.5>                   (CONS 'SL-LET RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SL-LET@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SL-LET@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO STATE-MAC@PAR (&REST RST)
acl2-8.5>                   (CONS 'STATE-MAC RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO STATE-MAC@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO STATE-MAC@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO VALUE@PAR (&REST RST)
acl2-8.5>                   (CONS 'VALUE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO VALUE@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WARNING$@PAR (&REST RST)
acl2-8.5>                   (CONS 'WARNING$ RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WARNING$@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WARNING$@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'ADD-CUSTOM-KEYWORD-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST)
acl2-8.5>                   (CONS 'EVAL-CLAUSE-PROCESSOR RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO EVAL-THEORY-EXPR@PAR (&REST RST)
acl2-8.5>                   (CONS 'EVAL-THEORY-EXPR RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO EVAL-THEORY-EXPR@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-THEORY-EXPR@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO FORMAL-VALUE-TRIPLE@PAR (&REST RST)
acl2-8.5>                   (CONS 'FORMAL-VALUE-TRIPLE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO INCREMENT-TIMER@PAR (&REST RST)
acl2-8.5>                   (CONS 'INCREMENT-TIMER RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO INCREMENT-TIMER@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO INCREMENT-TIMER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'SIMPLE-TRANSLATE-AND-EVAL RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-IN-THEORY-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-PRINT-CLAUSE-ID RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-UPDATE-GAG-STATE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL1-LST@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL1-LST RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL1-LST@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL1-WRAPPER@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL1-WRAPPER RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL1-WRAPPER@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1-WRAPPER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO XTRANS-EVAL@PAR (&REST RST)
acl2-8.5>                   (CONS 'XTRANS-EVAL RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO XTRANS-EVAL@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO XTRANS-EVAL@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
acl2-8.5> ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'ADD-CUSTOM-KEYWORD-HINT-FN RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'APPLY-OVERRIDE-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT1@PAR (&REST RST)
acl2-8.5>                   (CONS 'APPLY-OVERRIDE-HINT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST)
acl2-8.5>                   (CONS 'APPLY-OVERRIDE-HINTS RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'APPLY-REORDER-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO APPLY-REORDER-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-REORDER-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST)
acl2-8.5>                   (CONS 'APPLY-TOP-HINTS-CLAUSE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'CHECK-TRANSLATED-OVERRIDE-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-ARGLIST RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-ARGLIST@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-ARGLIST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-DO-NOT-EXPR-VALUE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-EQUAL-ARITIES RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-EQUIV-CLASSICALP RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-THEORY-EXPR-VALUE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-THEORY-EXPR-VALUE1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-THEORY-INVARIANT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST)
acl2-8.5>                   (CONS 'CHK-THEORY-INVARIANT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'FIND-APPLICABLE-HINT-SETTINGS
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'FIND-APPLICABLE-HINT-SETTINGS1
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST)
acl2-8.5>                   (CONS 'GAG-STATE-EXITING-CL-ID RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'LOAD-HINT-SETTINGS-INTO-PSPV
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'LOAD-HINT-SETTINGS-INTO-RCNST
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST)
acl2-8.5>                   (CONS 'MAYBE-WARN-ABOUT-THEORY RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'MAYBE-WARN-FOR-USE-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'PAIR-CL-ID-WITH-HINT-SETTING
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'PROCESS-BACKTRACK-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST)
acl2-8.5>                   (CONS 'PUSH-CLAUSE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PUSH-CLAUSE@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PUSH-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO
acl2-8.5>              PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
acl2-8.5>              (&REST RST)
acl2-8.5>              (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
acl2-8.5>                    RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO 
acl2-8.5> PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
acl2-8.5> ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST)
acl2-8.5>                   (CONS 'RECORD-GAG-STATE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO RECORD-GAG-STATE@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO RECORD-GAG-STATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'THANKS-FOR-THE-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE1@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-BACKTRACK-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-BDD-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-BDD-HINT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-BY-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-BY-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
acl2-8.5> is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-CASES-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-DO-NOT-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-ERROR-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-EXPAND-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-EXPAND-HINT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-EXPAND-TERM RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-EXPAND-TERM1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HANDS-OFF-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINT@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINTS RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINTS@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINTS1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINTS1@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINTS2 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINTS2@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS2@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINTS+1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINTS+1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINT-EXPRESSION RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINT-EXPRESSIONS RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-HINT-SETTINGS RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-INDUCT-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-LMI RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-LMI@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-LMI/INSTANCE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-NO-OP-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-NO-THANKS-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-NONLINEARP-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-OR-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-OR-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-REORDER-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-RESTRICT-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-RW-CACHE-STATE-HINT
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-SUBSTITUTION RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-SUBSTITUTION-LST RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-TERM-LST RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-TERM-LST@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-USE-HINT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-USE-HINT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-USE-HINT1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST)
acl2-8.5>                   (CONS 'TRANSLATE-X-HINT-VALUE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-MSG RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-MSG@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-MSG@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-PRINT-CLAUSE RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-STEP RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-STEP@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-STEP1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-STEP1@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL-STEP-CLEANUP RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL0@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL0 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL0@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL0-OR-HIT RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0-OR-HIT@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR
acl2-8.5>                   (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL0-WITH-HINT-SETTINGS
acl2-8.5>                         RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(DEFMACRO WATERFALL1@PAR (&REST RST)
acl2-8.5>                   (CONS 'WATERFALL1 RST))
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WATERFALL1@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WATERFALL1@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The admission of REPLACE-DEFUN@PAR-WITH-DEFUN is trivial, using the
acl2-8.5> relation O< (which is known to be well-founded on the domain recognized
acl2-8.5> by O-P) and the measure (ACL2-COUNT FORMS).  We observe that the type
acl2-8.5> of REPLACE-DEFUN@PAR-WITH-DEFUN is described by the theorem 
acl2-8.5> (TRUE-LISTP (REPLACE-DEFUN@PAR-WITH-DEFUN FORMS)).  We used primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for REPLACE-DEFUN@PAR-WITH-DEFUN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for REPLACE-DEFUN@PAR-WITH-DEFUN,
acl2-8.5> given the :forward-chaining rule ALISTP-FORWARD-TO-TRUE-LISTP and the
acl2-8.5> :type-prescription rule ALISTP, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (ALISTP FORMS) (NOT (ENDP FORMS)))
acl2-8.5>               (ALISTP (CDR FORMS)))
acl2-8.5>      (IMPLIES (AND (ALISTP FORMS)
acl2-8.5>                    (NOT (ENDP FORMS))
acl2-8.5>                    (NOT (CONSP (CAR FORMS))))
acl2-8.5>               (EQUAL (CAR FORMS) NIL))).
acl2-8.5> 
acl2-8.5> By the simple :definition ENDP we reduce the conjecture to the following
acl2-8.5> two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (ALISTP FORMS) (CONSP FORMS))
acl2-8.5>          (ALISTP (CDR FORMS))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (ALISTP FORMS)
acl2-8.5>               (CONSP FORMS)
acl2-8.5>               (NOT (CONSP (CAR FORMS))))
acl2-8.5>          (EQUAL (CAR FORMS) NIL)).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition ALISTP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for 
acl2-8.5> REPLACE-DEFUN@PAR-WITH-DEFUN.  REPLACE-DEFUN@PAR-WITH-DEFUN is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...)
acl2-8.5> Rules: ((:DEFINITION ALISTP)
acl2-8.5>         (:DEFINITION ENDP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION ALISTP))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  127
acl2-8.5>  REPLACE-DEFUN@PAR-WITH-DEFUN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO MUTUAL-RECURSION@PAR ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO MUTUAL-RECURSION@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO DEFUN@PAR ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO DEFUN@PAR ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) is
acl2-8.5> redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SERIAL-ONLY ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SERIAL-ONLY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PARALLEL-ONLY ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PARALLEL-ONLY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO STATE-MAC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO STATE-MAC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *WATERFALL-PRINTING-VALUES* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since SYMBOL-CONSTANT-FN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of SYMBOL-CONSTANT-FN is described by the
acl2-8.5> theorem (SYMBOLP (SYMBOL-CONSTANT-FN PREFIX SYM)).  We used the :type-
acl2-8.5> prescription rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SYMBOL-CONSTANT-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SYMBOL-CONSTANT-FN,
acl2-8.5> given the :type-prescription rule STRING-APPEND-LST, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX))
acl2-8.5>          (STRING-LISTP (LIST (SYMBOL-NAME PREFIX)
acl2-8.5>                              "-" (SYMBOL-NAME SYM)))).
acl2-8.5> 
acl2-8.5> By case analysis we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX))
acl2-8.5>          (STRING-LISTP (LIST (SYMBOL-NAME PREFIX)
acl2-8.5>                              "-" (SYMBOL-NAME SYM)))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definition STRING-LISTP,
acl2-8.5> the :executable-counterparts of STRING-LISTP and STRINGP, primitive
acl2-8.5> type reasoning and the :rewrite rules CAR-CONS and CDR-CONS.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SYMBOL-CONSTANT-FN.
acl2-8.5> SYMBOL-CONSTANT-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SYMBOL-CONSTANT-FN ...)
acl2-8.5> Rules: ((:DEFINITION NOT)
acl2-8.5>         (:DEFINITION STRING-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART STRING-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART STRINGP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION STRING-APPEND-LST)
acl2-8.5>         (:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  122
acl2-8.5>  SYMBOL-CONSTANT-FN
acl2-8.5> 
acl2-8.5> Since STOBJS-IN is non-recursive, its admission is trivial.  We could
acl2-8.5> deduce no constraints on the type of STOBJS-IN.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for STOBJS-IN....
acl2-8.5> 
acl2-8.5> The guard conjecture for STOBJS-IN is trivial to prove.  STOBJS-IN
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STOBJS-IN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  STOBJS-IN
acl2-8.5> 
acl2-8.5> The event ( DEFUN ALL-NILS ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALL-NILS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *TTAG-FNS* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *TTAG-FNS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since LOGICP is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of LOGICP is described by the theorem 
acl2-8.5> (OR (EQUAL (LOGICP FN WRLD) T) (EQUAL (LOGICP FN WRLD) NIL)).  We used
acl2-8.5> primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for LOGICP....
acl2-8.5> 
acl2-8.5> The guard conjecture for LOGICP is trivial to prove.  LOGICP is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN LOGICP ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  LOGICP
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO LOGICALP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO LOGICALP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PROGRAMP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PROGRAMP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *STOBJS-OUT-INVALID* ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *STOBJS-OUT-INVALID* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since STOBJS-OUT is non-recursive, its admission is trivial.  We could
acl2-8.5> deduce no constraints on the type of STOBJS-OUT.  However, in normalizing
acl2-8.5> the definition we used the :type-prescription rule ILLEGAL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for STOBJS-OUT....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for STOBJS-OUT, given
acl2-8.5> the :type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>     (IMPLIES (AND (SYMBOLP FN) (PLIST-WORLDP W))
acl2-8.5>              (LET ((X FN)
acl2-8.5>                    (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST)))
acl2-8.5>                   (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                        (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                        (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                               (MEMBER-EQ-EXEC X L)))))
acl2-8.5>     (IMPLIES (AND (NOT (LET ((X FN)
acl2-8.5>                              (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST)))
acl2-8.5>                             (MEMBER-EQUAL X L)))
acl2-8.5>                   (PLIST-WORLDP W)
acl2-8.5>                   (SYMBOLP FN)
acl2-8.5>                   (NOT (EQ FN 'CONS)))
acl2-8.5>              (NOT (MEMBER-EQUAL FN
acl2-8.5>                                 '(IF RETURN-LAST
acl2-8.5>                                      DO$ READ-USER-STOBJ-ALIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition EQ, the
acl2-8.5> :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule
acl2-8.5> MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for STOBJS-OUT.  STOBJS-OUT
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN STOBJS-OUT ...)
acl2-8.5> Rules: ((:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION ILLEGAL)
acl2-8.5>         (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  98
acl2-8.5>  STOBJS-OUT
acl2-8.5> 
acl2-8.5> Since EV-FNCALL-W-GUARD1 is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of EV-FNCALL-W-GUARD1 is described by the
acl2-8.5> theorem 
acl2-8.5> (OR (CONSP (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS))
acl2-8.5>     (EQUAL (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS)
acl2-8.5>            NIL)).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for EV-FNCALL-W-GUARD1....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for EV-FNCALL-W-GUARD1
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>  (IMPLIES
acl2-8.5>   (AND (PLIST-WORLDP WRLD)
acl2-8.5>        (SYMBOLP FN)
acl2-8.5>        (NOT (EQ FN 'IF))
acl2-8.5>        (NOT (EQ FN 'DO$))
acl2-8.5>        (NOT (EQ FN 'READ-USER-STOBJ-ALIST)))
acl2-8.5>   (LET
acl2-8.5>    ((X FN)
acl2-8.5>     (ALIST
acl2-8.5>      '((HONS-WASH!)
acl2-8.5>        (HONS-CLEAR!)
acl2-8.5>        (OPEN-OUTPUT-CHANNEL!)
acl2-8.5>        (REMOVE-UNTOUCHABLE-FN
acl2-8.5>         "  Note that the same restriction applies to the macro ~x0, whose ~
acl2-8.5>             expansions generate calls of ~x1."
acl2-8.5>         (#\0 . REMOVE-UNTOUCHABLE)
acl2-8.5>         (#\1 . REMOVE-UNTOUCHABLE-FN))
acl2-8.5>        (SET-RAW-MODE-ON
acl2-8.5>         "  If you do not plan to certify books in this session, then ~
acl2-8.5>             instead you may want to call ~x0; see :DOC ~x0."
acl2-8.5>         (#\0 . SET-RAW-MODE-ON!))
acl2-8.5>        (SET-TEMP-TOUCHABLE-FNS)
acl2-8.5>        (SET-TEMP-TOUCHABLE-VARS)
acl2-8.5>        (SYS-CALL)
acl2-8.5>        (SYS-CALL*)
acl2-8.5>        (SYS-CALL+))))
acl2-8.5>    (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
acl2-8.5>         (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
acl2-8.5>         (EQUAL (ASSOC-EQUAL X ALIST)
acl2-8.5>                (ASSOC-EQ-EXEC X ALIST)))))
acl2-8.5>  (IMPLIES
acl2-8.5>   (AND
acl2-8.5>    (PLIST-WORLDP WRLD)
acl2-8.5>    (SYMBOLP FN)
acl2-8.5>    (NOT (EQ FN 'IF))
acl2-8.5>    (NOT (EQ FN 'DO$))
acl2-8.5>    (NOT (EQ FN 'READ-USER-STOBJ-ALIST))
acl2-8.5>    (NOT
acl2-8.5>     (ASSOC-EQUAL
acl2-8.5>      FN
acl2-8.5>      '((HONS-WASH!)
acl2-8.5>        (HONS-CLEAR!)
acl2-8.5>        (OPEN-OUTPUT-CHANNEL!)
acl2-8.5>        (REMOVE-UNTOUCHABLE-FN
acl2-8.5>         "  Note that the same restriction applies to the macro ~x0, whose ~
acl2-8.5>             expansions generate calls of ~x1."
acl2-8.5>         (#\0 . REMOVE-UNTOUCHABLE)
acl2-8.5>         (#\1 . REMOVE-UNTOUCHABLE-FN))
acl2-8.5>        (SET-RAW-MODE-ON
acl2-8.5>         "  If you do not plan to certify books in this session, then ~
acl2-8.5>             instead you may want to call ~x0; see :DOC ~x0."
acl2-8.5>         (#\0 . SET-RAW-MODE-ON!))
acl2-8.5>        (SET-TEMP-TOUCHABLE-FNS)
acl2-8.5>        (SET-TEMP-TOUCHABLE-VARS)
acl2-8.5>        (SYS-CALL)
acl2-8.5>        (SYS-CALL*)
acl2-8.5>        (SYS-CALL+)))))
acl2-8.5>   (LET
acl2-8.5>    ((FORMALS (FGETPROP FN 'FORMALS T WRLD)))
acl2-8.5>    (AND
acl2-8.5>     (SYMBOLP FN)
acl2-8.5>     (PLIST-WORLDP WRLD)
acl2-8.5>     (LET
acl2-8.5>      ((STOBJS-IN (STOBJS-IN FN WRLD)))
acl2-8.5>      (AND
acl2-8.5>       (PLIST-WORLDP WRLD)
acl2-8.5>       (LET
acl2-8.5>        ((UNTOUCHABLE-FNS (GLOBAL-VAL 'UNTOUCHABLE-FNS WRLD)))
acl2-8.5>        (AND
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (LET ((X FN) (L UNTOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                          (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                 (MEMBER-EQ-EXEC X L)))))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (MEMBER-EQUAL FN UNTOUCHABLE-FNS)
acl2-8.5>                (LET ((X FN) (L UNTOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                          (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                 (MEMBER-EQ-EXEC X L)))))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS))
acl2-8.5>                (LET ((X FN) (L TEMP-TOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                          (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                 (MEMBER-EQ-EXEC X L)))))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (NOT (NULL FORMALS))
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (NOT (NULL FORMALS))
acl2-8.5>                (PLIST-WORLDP WRLD))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (NULL FORMALS)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (PLIST-WORLDP WRLD))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (NULL FORMALS)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (NULL FORMALS)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQ FN 'RETURN-LAST)
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (NULL FORMALS)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQ FN 'RETURN-LAST)
acl2-8.5>                (NOT (LET ((X FN)
acl2-8.5>                           (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST)))
acl2-8.5>                          (MBE :LOGIC (PROG2$ (MEMBER-EQ-EXEC$GUARD-CHECK X L)
acl2-8.5>                                              (MEMBER-EQUAL X L))
acl2-8.5>                               :EXEC (MEMBER-EQ-EXEC X L)))))
acl2-8.5>            (OR (EQ FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQ T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (NULL FORMALS)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQ FN 'RETURN-LAST)
acl2-8.5>                (PLIST-WORLDP WRLD)))))))))).
acl2-8.5> 
acl2-8.5> By the simple :definitions EQ, GLOBAL-VAL, MEMBER-EQ-EXEC$GUARD-CHECK,
acl2-8.5> NULL and RETURN-LAST, the :executable-counterpart of TAU-SYSTEM and
acl2-8.5> the simple :rewrite rules ASSOC-EQ-EXEC-IS-ASSOC-EQUAL and 
acl2-8.5> MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES
acl2-8.5>  (AND
acl2-8.5>   (PLIST-WORLDP WRLD)
acl2-8.5>   (SYMBOLP FN)
acl2-8.5>   (NOT (EQUAL FN 'IF))
acl2-8.5>   (NOT (EQUAL FN 'DO$))
acl2-8.5>   (NOT (EQUAL FN 'READ-USER-STOBJ-ALIST))
acl2-8.5>   (NOT
acl2-8.5>    (ASSOC-EQUAL
acl2-8.5>     FN
acl2-8.5>     '((HONS-WASH!)
acl2-8.5>       (HONS-CLEAR!)
acl2-8.5>       (OPEN-OUTPUT-CHANNEL!)
acl2-8.5>       (REMOVE-UNTOUCHABLE-FN
acl2-8.5>        "  Note that the same restriction applies to the macro ~x0, whose ~
acl2-8.5>             expansions generate calls of ~x1."
acl2-8.5>        (#\0 . REMOVE-UNTOUCHABLE)
acl2-8.5>        (#\1 . REMOVE-UNTOUCHABLE-FN))
acl2-8.5>       (SET-RAW-MODE-ON
acl2-8.5>        "  If you do not plan to certify books in this session, then ~
acl2-8.5>             instead you may want to call ~x0; see :DOC ~x0."
acl2-8.5>        (#\0 . SET-RAW-MODE-ON!))
acl2-8.5>       (SET-TEMP-TOUCHABLE-FNS)
acl2-8.5>       (SET-TEMP-TOUCHABLE-VARS)
acl2-8.5>       (SYS-CALL)
acl2-8.5>       (SYS-CALL*)
acl2-8.5>       (SYS-CALL+)))))
acl2-8.5>  (LET
acl2-8.5>   ((FORMALS (FGETPROP FN 'FORMALS T WRLD)))
acl2-8.5>   (AND
acl2-8.5>    (SYMBOLP FN)
acl2-8.5>    (PLIST-WORLDP WRLD)
acl2-8.5>    (LET
acl2-8.5>     ((STOBJS-IN (STOBJS-IN FN WRLD)))
acl2-8.5>     (AND
acl2-8.5>      (PLIST-WORLDP WRLD)
acl2-8.5>      (LET
acl2-8.5>       ((UNTOUCHABLE-FNS
acl2-8.5>         (FGETPROP
acl2-8.5>          'UNTOUCHABLE-FNS
acl2-8.5>          'GLOBAL-VALUE
acl2-8.5>          '(:ERROR
acl2-8.5>            "GLOBAL-VAL didn't find a value.  Initialize this ~
acl2-8.5>                      symbol in PRIMORDIAL-WORLD-GLOBALS.")
acl2-8.5>          WRLD)))
acl2-8.5>       (AND (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (LET ((X FN) (L UNTOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L)))))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (MEMBER-EQUAL FN UNTOUCHABLE-FNS)
acl2-8.5>                (LET ((X FN) (L UNTOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L)))))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS))
acl2-8.5>                (LET ((X FN) (L TEMP-TOUCHABLE-FNS))
acl2-8.5>                     (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                          (OR (SYMBOLP X) (SYMBOL-LISTP L)))))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (NOT (EQUAL FORMALS NIL))
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (NOT (EQUAL FORMALS NIL))
acl2-8.5>                (PLIST-WORLDP WRLD))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (EQUAL FORMALS NIL)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (PLIST-WORLDP WRLD))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (EQUAL FORMALS NIL)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (EQUAL FORMALS NIL)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQUAL FN 'RETURN-LAST)
acl2-8.5>                (SYMBOLP FN))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (EQUAL FORMALS NIL)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQUAL FN 'RETURN-LAST)
acl2-8.5>                (NOT (MEMBER-EQUAL FN
acl2-8.5>                                   '(IF RETURN-LAST
acl2-8.5>                                        DO$ READ-USER-STOBJ-ALIST))))
acl2-8.5>            (OR (EQUAL FORMALS T)
acl2-8.5>                (NOT (TRUE-LISTP UNTOUCHABLE-FNS))
acl2-8.5>                (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
acl2-8.5>                         (EQUAL T TEMP-TOUCHABLE-FNS)
acl2-8.5>                         (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
acl2-8.5>                              (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
acl2-8.5>                (AND (EQUAL FORMALS NIL)
acl2-8.5>                     (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
acl2-8.5>                (NOT (TRUE-LISTP STOBJS-IN))
acl2-8.5>                (NOT (ALL-NILS STOBJS-IN))
acl2-8.5>                (EQUAL FN 'RETURN-LAST)
acl2-8.5>                (PLIST-WORLDP WRLD))))))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
acl2-8.5> MEMBER-EQUAL, NOT and STOBJS-IN, the :executable-counterparts of CAR,
acl2-8.5> CDR, CONSP and NOT, primitive type reasoning and the :type-prescription
acl2-8.5> rule PLIST-WORLDP.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for EV-FNCALL-W-GUARD1.
acl2-8.5> EV-FNCALL-W-GUARD1 is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EV-FNCALL-W-GUARD1 ...)
acl2-8.5> Rules: ((:DEFINITION ASSOC-EQUAL)
acl2-8.5>         (:DEFINITION EQ)
acl2-8.5>         (:DEFINITION GLOBAL-VAL)
acl2-8.5>         (:DEFINITION MEMBER-EQ-EXEC$GUARD-CHECK)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NULL)
acl2-8.5>         (:DEFINITION RETURN-LAST)
acl2-8.5>         (:DEFINITION STOBJS-IN)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CAR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION PLIST-WORLDP))
acl2-8.5> Time:  0.02 seconds (prove: 0.02, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  3651
acl2-8.5>  EV-FNCALL-W-GUARD1
acl2-8.5> 
acl2-8.5> Since EV-FNCALL-W-GUARD is non-recursive, its admission is trivial.
acl2-8.5> We could deduce no constraints on the type of EV-FNCALL-W-GUARD.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for EV-FNCALL-W-GUARD....
acl2-8.5> 
acl2-8.5> The guard conjecture for EV-FNCALL-W-GUARD is trivial to prove, given
acl2-8.5> the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription
acl2-8.5> rules EV-FNCALL-W-GUARD1 and LENGTH.  EV-FNCALL-W-GUARD is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN EV-FNCALL-W-GUARD ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG)
acl2-8.5>         (:TYPE-PRESCRIPTION EV-FNCALL-W-GUARD1)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  EV-FNCALL-W-GUARD
acl2-8.5> 
acl2-8.5> Since TIME-TRACKER-FN is non-recursive, its admission is trivial. 
acl2-8.5> We observe that the type of TIME-TRACKER-FN is described by the theorem
acl2-8.5> (EQUAL (TIME-TRACKER-FN TAG KWD KWDP TIMES INTERVAL MIN-TIME MSG) NIL).
acl2-8.5> We used the :compound-recognizer rule BOOLEANP-COMPOUND-RECOGNIZER,
acl2-8.5> the :executable-counterpart of EQUAL, primitive type reasoning and
acl2-8.5> the :type-prescription rule HARD-ERROR.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TIME-TRACKER-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for TIME-TRACKER-FN is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (NOT (AND (BOOLEANP TAG) KWDP))
acl2-8.5>               (NOT (BOOLEANP TAG))
acl2-8.5>               (SYMBOLP TAG))
acl2-8.5>          (LET ((X KWD)
acl2-8.5>                (L '(:INIT :END
acl2-8.5>                           :PRINT? :STOP
acl2-8.5>                           :START :START!)))
acl2-8.5>               (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
acl2-8.5>                    (OR (SYMBOLP X) (SYMBOL-LISTP L))
acl2-8.5>                    (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                           (MEMBER-EQ-EXEC X L))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for TIME-TRACKER-FN.
acl2-8.5> TIME-TRACKER-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TIME-TRACKER-FN ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER BOOLEANP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION HARD-ERROR))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  51
acl2-8.5>  TIME-TRACKER-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO TIME-TRACKER ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO TIME-TRACKER ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-ABSSTOBJ-DEBUG ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since <? is non-recursive, its admission is trivial.  We observe that
acl2-8.5> the type of <? is described by the theorem 
acl2-8.5> (OR (EQUAL (<? REL X Y) T) (EQUAL (<? REL X Y) NIL)).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for <?....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for <? is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (RATIONALP X)
acl2-8.5>                    (NOT (OR (NULL X) (NULL Y))))
acl2-8.5>               (LET ((X (FIX X)) (Y (FIX Y)))
acl2-8.5>                    (AND (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (RATIONALP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (<= (REALPART Y) X)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (<= (REALPART Y) X)
acl2-8.5>                             (RATIONALP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (NOT (= X (REALPART Y)))
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (NOT (= X (REALPART Y)))
acl2-8.5>                             (RATIONALP (IMAGPART Y)))
acl2-8.5>                         (OR (RATIONALP X) (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (RATIONALP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X) (RATIONALP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (RATIONALP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (RATIONALP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (NOT (= (REALPART X) Y))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (NOT (= (REALPART X) Y))
acl2-8.5>                             (RATIONALP (IMAGPART X))))))
acl2-8.5>      (IMPLIES (AND (RATIONALP Y)
acl2-8.5>                    (NOT (OR (NULL X) (NULL Y))))
acl2-8.5>               (LET ((X (FIX X)) (Y (FIX Y)))
acl2-8.5>                    (AND (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (RATIONALP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (<= (REALPART Y) X)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (<= (REALPART Y) X)
acl2-8.5>                             (RATIONALP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (ACL2-NUMBERP (REALPART Y)))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (NOT (= X (REALPART Y)))
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (NOT (RATIONALP X))
acl2-8.5>                             (RATIONALP Y)
acl2-8.5>                             (< X (REALPART Y))
acl2-8.5>                             (NOT (= X (REALPART Y)))
acl2-8.5>                             (RATIONALP (IMAGPART Y)))
acl2-8.5>                         (OR (RATIONALP X) (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (RATIONALP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X) (RATIONALP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (RATIONALP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (<= Y (REALPART X))
acl2-8.5>                             (RATIONALP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP (REALPART X)))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (ACL2-NUMBERP Y))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (NOT (= (REALPART X) Y))
acl2-8.5>                             (ACL2-NUMBERP X))
acl2-8.5>                         (OR (RATIONALP X)
acl2-8.5>                             (< (REALPART X) Y)
acl2-8.5>                             (NOT (= (REALPART X) Y))
acl2-8.5>                             (RATIONALP (IMAGPART X))))))).
acl2-8.5> 
acl2-8.5> By the simple :definitions = and NULL we reduce the conjecture to the
acl2-8.5> following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (RATIONALP X)
acl2-8.5>               (NOT (OR (EQUAL X NIL) (EQUAL Y NIL))))
acl2-8.5>          (LET ((X (FIX X)) (Y (FIX Y)))
acl2-8.5>               (AND (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (RATIONALP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (<= (REALPART Y) X)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (<= (REALPART Y) X)
acl2-8.5>                        (RATIONALP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (NOT (EQUAL X (REALPART Y)))
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (NOT (EQUAL X (REALPART Y)))
acl2-8.5>                        (RATIONALP (IMAGPART Y)))
acl2-8.5>                    (OR (RATIONALP X) (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (RATIONALP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X) (RATIONALP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (RATIONALP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (RATIONALP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (NOT (EQUAL (REALPART X) Y))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (NOT (EQUAL (REALPART X) Y))
acl2-8.5>                        (RATIONALP (IMAGPART X)))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions FIX and
acl2-8.5> NOT, the :executable-counterpart of NOT and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (RATIONALP Y)
acl2-8.5>               (NOT (OR (EQUAL X NIL) (EQUAL Y NIL))))
acl2-8.5>          (LET ((X (FIX X)) (Y (FIX Y)))
acl2-8.5>               (AND (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (RATIONALP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (<= (REALPART Y) X)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (<= (REALPART Y) X)
acl2-8.5>                        (RATIONALP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (ACL2-NUMBERP (REALPART Y)))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (NOT (EQUAL X (REALPART Y)))
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (NOT (RATIONALP X))
acl2-8.5>                        (RATIONALP Y)
acl2-8.5>                        (< X (REALPART Y))
acl2-8.5>                        (NOT (EQUAL X (REALPART Y)))
acl2-8.5>                        (RATIONALP (IMAGPART Y)))
acl2-8.5>                    (OR (RATIONALP X) (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (RATIONALP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X) (RATIONALP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (RATIONALP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (<= Y (REALPART X))
acl2-8.5>                        (RATIONALP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP (REALPART X)))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (ACL2-NUMBERP Y))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (NOT (EQUAL (REALPART X) Y))
acl2-8.5>                        (ACL2-NUMBERP X))
acl2-8.5>                    (OR (RATIONALP X)
acl2-8.5>                        (< (REALPART X) Y)
acl2-8.5>                        (NOT (EQUAL (REALPART X) Y))
acl2-8.5>                        (RATIONALP (IMAGPART X)))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :definitions FIX and
acl2-8.5> NOT, the :executable-counterpart of EQUAL and primitive type reasoning.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for <?.  <? is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN <? ...)
acl2-8.5> Rules: ((:DEFINITION =)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NULL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.03 seconds (prove: 0.02, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  2057
acl2-8.5>  <?
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-DOMAINP is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of TAU-INTERVAL-DOMAINP is described by the
acl2-8.5> theorem 
acl2-8.5> (OR (EQUAL (TAU-INTERVAL-DOMAINP DOM X) T)
acl2-8.5>     (EQUAL (TAU-INTERVAL-DOMAINP DOM X)
acl2-8.5>            NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-DOMAINP....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-DOMAINP is trivial to prove.
acl2-8.5> TAU-INTERVAL-DOMAINP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-DOMAINP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-DOMAINP
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-DOM is non-recursive, its admission is trivial.
acl2-8.5> We could deduce no constraints on the type of TAU-INTERVAL-DOM.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-DOM....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-DOM is trivial to prove.  
acl2-8.5> TAU-INTERVAL-DOM is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-DOM ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-DOM
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-LO-REL is non-recursive, its admission is trivial.
acl2-8.5> We could deduce no constraints on the type of TAU-INTERVAL-LO-REL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-LO-REL....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-LO-REL is trivial to prove. 
acl2-8.5> TAU-INTERVAL-LO-REL is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-LO-REL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-LO-REL
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-LO is non-recursive, its admission is trivial. 
acl2-8.5> We could deduce no constraints on the type of TAU-INTERVAL-LO.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-LO....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-LO is trivial to prove.  
acl2-8.5> TAU-INTERVAL-LO is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-LO ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-LO
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-HI-REL is non-recursive, its admission is trivial.
acl2-8.5> We could deduce no constraints on the type of TAU-INTERVAL-HI-REL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-HI-REL....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-HI-REL is trivial to prove. 
acl2-8.5> TAU-INTERVAL-HI-REL is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-HI-REL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-HI-REL
acl2-8.5> 
acl2-8.5> Since TAU-INTERVAL-HI is non-recursive, its admission is trivial. 
acl2-8.5> We could deduce no constraints on the type of TAU-INTERVAL-HI.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVAL-HI....
acl2-8.5> 
acl2-8.5> The guard conjecture for TAU-INTERVAL-HI is trivial to prove.  
acl2-8.5> TAU-INTERVAL-HI is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVAL-HI ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  TAU-INTERVAL-HI
acl2-8.5> 
acl2-8.5> Since MAKE-TAU-INTERVAL is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of MAKE-TAU-INTERVAL is described by the theorem
acl2-8.5> (CONSP (MAKE-TAU-INTERVAL DOM LO-REL LO HI-REL HI)).  We used primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for MAKE-TAU-INTERVAL....
acl2-8.5> 
acl2-8.5> The guard conjecture for MAKE-TAU-INTERVAL is trivial to prove.  
acl2-8.5> MAKE-TAU-INTERVAL is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MAKE-TAU-INTERVAL ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  MAKE-TAU-INTERVAL
acl2-8.5> 
acl2-8.5> Since TAU-INTERVALP is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of TAU-INTERVALP is described by the theorem
acl2-8.5> (OR (EQUAL (TAU-INTERVALP INT) T) (EQUAL (TAU-INTERVALP INT) NIL)).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for TAU-INTERVALP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for TAU-INTERVALP is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (CONSP INT)
acl2-8.5>               (CONSP (CDR INT))
acl2-8.5>               (CONSP (CADR INT))
acl2-8.5>               (CONSP (CDDR INT)))
acl2-8.5>          (LET ((DOM (TAU-INTERVAL-DOM INT)))
acl2-8.5>               (OR (EQ DOM 'INTEGERP)
acl2-8.5>                   (LET ((X DOM)
acl2-8.5>                         (L '(RATIONALP ACL2-NUMBERP NIL)))
acl2-8.5>                        (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                             (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                             (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                                    (MEMBER-EQL-EXEC X L))))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions EQ and
acl2-8.5> TAU-INTERVAL-DOM, the :executable-counterpart of TAU-SYSTEM and the
acl2-8.5> simple :rewrite rule MEMBER-EQL-EXEC-IS-MEMBER-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for TAU-INTERVALP.  
acl2-8.5> TAU-INTERVALP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAU-INTERVALP ...)
acl2-8.5> Rules: ((:DEFINITION EQ)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-DOM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:REWRITE MEMBER-EQL-EXEC-IS-MEMBER-EQUAL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  112
acl2-8.5>  TAU-INTERVALP
acl2-8.5> 
acl2-8.5> Since IN-TAU-INTERVALP is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of IN-TAU-INTERVALP is described by the theorem
acl2-8.5> (OR (EQUAL (IN-TAU-INTERVALP X INT) T) (EQUAL (IN-TAU-INTERVALP X INT) NIL)).
acl2-8.5> We used the :type-prescription rule <?.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for IN-TAU-INTERVALP....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for IN-TAU-INTERVALP,
acl2-8.5> given the :type-prescription rule FIX, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (TAU-INTERVALP INT)
acl2-8.5>               (CONSP INT))
acl2-8.5>      (IMPLIES (AND (TAU-INTERVALP INT)
acl2-8.5>                    (TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
acl2-8.5>                                          X))
acl2-8.5>               (CONSP (CADR INT)))
acl2-8.5>      (IMPLIES (AND (TAU-INTERVALP INT)
acl2-8.5>                    (TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
acl2-8.5>                                          X))
acl2-8.5>               (CONSP (CDR INT)))
acl2-8.5>      (IMPLIES (AND (TAU-INTERVALP INT)
acl2-8.5>                    (TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
acl2-8.5>                                          X)
acl2-8.5>                    (<? (TAU-INTERVAL-LO-REL INT)
acl2-8.5>                        (TAU-INTERVAL-LO INT)
acl2-8.5>                        (FIX X)))
acl2-8.5>               (CONSP (CDDR INT)))
acl2-8.5>      (IMPLIES (AND (TAU-INTERVALP INT)
acl2-8.5>                    (TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
acl2-8.5>                                          X)
acl2-8.5>                    (<? (TAU-INTERVAL-LO-REL INT)
acl2-8.5>                        (TAU-INTERVAL-LO INT)
acl2-8.5>                        (FIX X))
acl2-8.5>                    (FIX X)
acl2-8.5>                    (NOT (RATIONALP (FIX X))))
acl2-8.5>               (IMPLIES (TAU-INTERVAL-HI INT)
acl2-8.5>                        (RATIONALP (TAU-INTERVAL-HI INT))))
acl2-8.5>      (IMPLIES (AND (TAU-INTERVALP INT)
acl2-8.5>                    (TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
acl2-8.5>                                          X)
acl2-8.5>                    (TAU-INTERVAL-LO INT)
acl2-8.5>                    (NOT (RATIONALP (TAU-INTERVAL-LO INT))))
acl2-8.5>               (IMPLIES (FIX X) (RATIONALP (FIX X))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definitions 
acl2-8.5> TAU-INTERVAL-DOM, TAU-INTERVAL-HI, TAU-INTERVAL-HI-REL, TAU-INTERVAL-LO,
acl2-8.5> TAU-INTERVAL-LO-REL and TAU-INTERVALP and the :executable-counterpart
acl2-8.5> of TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for IN-TAU-INTERVALP.
acl2-8.5> IN-TAU-INTERVALP is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN IN-TAU-INTERVALP ...)
acl2-8.5> Rules: ((:DEFINITION NOT)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-DOM)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-HI)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-HI-REL)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-LO)
acl2-8.5>         (:DEFINITION TAU-INTERVAL-LO-REL)
acl2-8.5>         (:DEFINITION TAU-INTERVALP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:TYPE-PRESCRIPTION <?)
acl2-8.5>         (:TYPE-PRESCRIPTION FIX))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  1045
acl2-8.5>  IN-TAU-INTERVALP
acl2-8.5> 
acl2-8.5> The admission of DECIMAL-STRING-TO-NUMBER is trivial, using the relation
acl2-8.5> O< (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT BOUND).  We observe that the type of 
acl2-8.5> DECIMAL-STRING-TO-NUMBER is described by the theorem 
acl2-8.5> (RATIONALP (DECIMAL-STRING-TO-NUMBER S BOUND EXPO)).  We used the :executable-
acl2-8.5> counterparts of ACL2-NUMBERP, EQUAL and RATIONALP, primitive type reasoning
acl2-8.5> and the :type-prescription rules EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE
acl2-8.5> and RATIONALP-EXPT-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for DECIMAL-STRING-TO-NUMBER....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for DECIMAL-STRING-TO-NUMBER,
acl2-8.5> given the :compound-recognizer rules NATP-COMPOUND-RECOGNIZER and 
acl2-8.5> ZP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription
acl2-8.5> rule LENGTH, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES
acl2-8.5>  (AND (<= BOUND (LENGTH S))
acl2-8.5>       (NATP BOUND)
acl2-8.5>       (NATP EXPO)
acl2-8.5>       (STRINGP S)
acl2-8.5>       (NOT (ZP BOUND)))
acl2-8.5>  (LET
acl2-8.5>   ((POS (+ -1 BOUND)))
acl2-8.5>   (AND
acl2-8.5>    (STRINGP S)
acl2-8.5>    (<= 0 POS)
acl2-8.5>    (INTEGERP POS)
acl2-8.5>    (< POS (LENGTH S))
acl2-8.5>    (LET
acl2-8.5>     ((CH (CHAR S POS)))
acl2-8.5>     (AND
acl2-8.5>      (LET ((X CH)
acl2-8.5>            (L '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>           (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                (OR (EQLABLEP X) (EQLABLE-LISTP L))
acl2-8.5>                (EQUAL (MEMBER-EQUAL X L)
acl2-8.5>                       (MEMBER-EQL-EXEC X L))))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\0))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\1))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\2))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\3))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQL CH #\3)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\4))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQL CH #\3)
acl2-8.5>          (EQL CH #\4)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\5))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQL CH #\3)
acl2-8.5>          (EQL CH #\4)
acl2-8.5>          (EQL CH #\5)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\6))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQL CH #\3)
acl2-8.5>          (EQL CH #\4)
acl2-8.5>          (EQL CH #\5)
acl2-8.5>          (EQL CH #\6)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\7))
acl2-8.5>      (OR (NOT (MEMBER-EQUAL CH
acl2-8.5>                             '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>          (EQL CH #\0)
acl2-8.5>          (EQL CH #\1)
acl2-8.5>          (EQL CH #\2)
acl2-8.5>          (EQL CH #\3)
acl2-8.5>          (EQL CH #\4)
acl2-8.5>          (EQL CH #\5)
acl2-8.5>          (EQL CH #\6)
acl2-8.5>          (EQL CH #\7)
acl2-8.5>          (EQLABLEP CH)
acl2-8.5>          (EQLABLEP #\8))
acl2-8.5>      (OR
acl2-8.5>       (NOT (MEMBER-EQUAL CH
acl2-8.5>                          '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>       (LET
acl2-8.5>        ((DIGIT (CASE CH (#\0 0)
acl2-8.5>                      (#\1 1)
acl2-8.5>                      (#\2 2)
acl2-8.5>                      (#\3 3)
acl2-8.5>                      (#\4 4)
acl2-8.5>                      (#\5 5)
acl2-8.5>                      (#\6 6)
acl2-8.5>                      (#\7 7)
acl2-8.5>                      (#\8 8)
acl2-8.5>                      (OTHERWISE 9))))
acl2-8.5>        (AND
acl2-8.5>           (INTEGERP EXPO)
acl2-8.5>           (OR (NOT (EQL 10 0)) (<= 0 EXPO))
acl2-8.5>           (ACL2-NUMBERP (EXPT 10 EXPO))
acl2-8.5>           (ACL2-NUMBERP DIGIT)
acl2-8.5>           (ACL2-NUMBERP EXPO)
acl2-8.5>           (STRINGP S)
acl2-8.5>           (NATP POS)
acl2-8.5>           (NATP (+ 1 EXPO))
acl2-8.5>           (<= POS (LENGTH S))
acl2-8.5>           (ACL2-NUMBERP (* (EXPT 10 EXPO) DIGIT))
acl2-8.5>           (ACL2-NUMBERP (DECIMAL-STRING-TO-NUMBER S POS (+ 1 EXPO))))))))))).
acl2-8.5> 
acl2-8.5> By the simple :definitions CHAR, EQL and NATP, the :executable-counterparts
acl2-8.5> of EQL and EQLABLEP and the simple :rewrite rule 
acl2-8.5> MEMBER-EQL-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES
acl2-8.5>  (AND (<= BOUND (LENGTH S))
acl2-8.5>       (INTEGERP BOUND)
acl2-8.5>       (<= 0 BOUND)
acl2-8.5>       (INTEGERP EXPO)
acl2-8.5>       (<= 0 EXPO)
acl2-8.5>       (STRINGP S)
acl2-8.5>       (NOT (ZP BOUND)))
acl2-8.5>  (LET
acl2-8.5>   ((POS (+ -1 BOUND)))
acl2-8.5>   (AND
acl2-8.5>    (STRINGP S)
acl2-8.5>    (<= 0 POS)
acl2-8.5>    (INTEGERP POS)
acl2-8.5>    (< POS (LENGTH S))
acl2-8.5>    (LET
acl2-8.5>     ((CH (NTH POS (COERCE S 'LIST))))
acl2-8.5>     (AND
acl2-8.5>      (LET ((X CH)
acl2-8.5>            (L '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>           (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
acl2-8.5>                (OR (EQLABLEP X) (EQLABLE-LISTP L))))
acl2-8.5>      (OR
acl2-8.5>       (NOT (MEMBER-EQUAL CH
acl2-8.5>                          '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
acl2-8.5>       (LET
acl2-8.5>        ((DIGIT (CASE CH (#\0 0)
acl2-8.5>                      (#\1 1)
acl2-8.5>                      (#\2 2)
acl2-8.5>                      (#\3 3)
acl2-8.5>                      (#\4 4)
acl2-8.5>                      (#\5 5)
acl2-8.5>                      (#\6 6)
acl2-8.5>                      (#\7 7)
acl2-8.5>                      (#\8 8)
acl2-8.5>                      (OTHERWISE 9))))
acl2-8.5>        (AND
acl2-8.5>           (INTEGERP EXPO)
acl2-8.5>           (ACL2-NUMBERP (EXPT 10 EXPO))
acl2-8.5>           (ACL2-NUMBERP DIGIT)
acl2-8.5>           (ACL2-NUMBERP EXPO)
acl2-8.5>           (STRINGP S)
acl2-8.5>           (NATP POS)
acl2-8.5>           (NATP (+ 1 EXPO))
acl2-8.5>           (<= POS (LENGTH S))
acl2-8.5>           (ACL2-NUMBERP (* (EXPT 10 EXPO) DIGIT))
acl2-8.5>           (ACL2-NUMBERP (DECIMAL-STRING-TO-NUMBER S POS (+ 1 EXPO))))))))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :compound-recognizer rules 
acl2-8.5> NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, the :congruence
acl2-8.5> rule IFF-IMPLIES-EQUAL-NOT, the :definitions LENGTH, MEMBER-EQUAL (if-
acl2-8.5> intro) and NOT (if-intro), the :executable-counterparts of ACL2-NUMBERP,
acl2-8.5> CAR, CDR, CONSP, EQLABLE-LISTP, EQUAL, RATIONALP and TRUE-LISTP, primitive
acl2-8.5> type reasoning and the :type-prescription rules DECIMAL-STRING-TO-NUMBER,
acl2-8.5> EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION,
acl2-8.5> to the following eleven conjectures.
acl2-8.5> 
acl2-8.5> Subgoal 11
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND)))
acl2-8.5>          (< (+ -1 BOUND)
acl2-8.5>             (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 10
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\7))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 9
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\3))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 8
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\1))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 7
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\9))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 6
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\5))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 5
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\0))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 4
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\8))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 3
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\4))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 2
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\2))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal 1
acl2-8.5> (IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (INTEGERP EXPO)
acl2-8.5>               (<= 0 EXPO)
acl2-8.5>               (STRINGP S)
acl2-8.5>               (NOT (ZP BOUND))
acl2-8.5>               (EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
acl2-8.5>                      #\6))
acl2-8.5>          (<= (+ -1 BOUND)
acl2-8.5>              (LEN (COERCE S 'LIST)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for DECIMAL-STRING-TO-NUMBER.
acl2-8.5> DECIMAL-STRING-TO-NUMBER is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN DECIMAL-STRING-TO-NUMBER ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:CONGRUENCE IFF-IMPLIES-EQUAL-NOT)
acl2-8.5>         (:DEFINITION CHAR)
acl2-8.5>         (:DEFINITION EQL)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION MEMBER-EQUAL)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ACL2-NUMBERP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CAR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CDR)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CONSP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQLABLE-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQLABLEP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART RATIONALP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TRUE-LISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE MEMBER-EQL-EXEC-IS-MEMBER-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION DECIMAL-STRING-TO-NUMBER)
acl2-8.5>         (:TYPE-PRESCRIPTION EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH)
acl2-8.5>         (:TYPE-PRESCRIPTION RATIONALP-EXPT-TYPE-PRESCRIPTION))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION MEMBER-EQUAL)
acl2-8.5>              (:DEFINITION NOT))
acl2-8.5> Time:  0.02 seconds (prove: 0.01, print: 0.00, other: 0.01)
acl2-8.5> Prover steps counted:  4262
acl2-8.5>  DECIMAL-STRING-TO-NUMBER
acl2-8.5> 
acl2-8.5> Since CHECK-DCL-GUARDIAN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of CHECK-DCL-GUARDIAN is described by the
acl2-8.5> theorem (EQUAL (CHECK-DCL-GUARDIAN VAL TERM) T).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for CHECK-DCL-GUARDIAN....
acl2-8.5> 
acl2-8.5> The guard conjecture for CHECK-DCL-GUARDIAN is trivial to prove.  
acl2-8.5> CHECK-DCL-GUARDIAN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CHECK-DCL-GUARDIAN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  CHECK-DCL-GUARDIAN
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *GC-STRATEGY-ALIST* ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *GC-STRATEGY-ALIST* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since SET-GC-STRATEGY-FN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of SET-GC-STRATEGY-FN is described by the
acl2-8.5> theorem (EQUAL (SET-GC-STRATEGY-FN OP THRESHOLD) OP).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for SET-GC-STRATEGY-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for SET-GC-STRATEGY-FN,
acl2-8.5> given primitive type reasoning and the :type-prescription rule 
acl2-8.5> ASSOC-EQ-EXEC$GUARD-CHECK, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (NOT (EQ OP :CURRENT))
acl2-8.5>          (LET ((X OP)
acl2-8.5>                (ALIST '((:EGC . SET-GC-STRATEGY-BUILTIN-EGC)
acl2-8.5>                         (:DELAY . SET-GC-STRATEGY-BUILTIN-DELAY))))
acl2-8.5>               (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
acl2-8.5>                    (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
acl2-8.5>                    (EQUAL (ASSOC-EQUAL X ALIST)
acl2-8.5>                           (ASSOC-EQ-EXEC X ALIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the simple :definition EQ, the
acl2-8.5> :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule
acl2-8.5> ASSOC-EQ-EXEC-IS-ASSOC-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for SET-GC-STRATEGY-FN.
acl2-8.5> SET-GC-STRATEGY-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SET-GC-STRATEGY-FN ...)
acl2-8.5> Rules: ((:DEFINITION EQ)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION ASSOC-EQ-EXEC$GUARD-CHECK))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  38
acl2-8.5>  SET-GC-STRATEGY-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO SET-GC-STRATEGY ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO SET-GC-STRATEGY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since GC-STRATEGY is non-recursive, its admission is trivial.  We observe
acl2-8.5> that the type of GC-STRATEGY is described by the theorem 
acl2-8.5> (AND (CONSP (GC-STRATEGY STATE)) (TRUE-LISTP (GC-STRATEGY STATE))).
acl2-8.5> We used the :type-prescription rule READ-ACL2-ORACLE.
acl2-8.5> 
acl2-8.5> (GC-STRATEGY STATE) => (MV * * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for GC-STRATEGY....
acl2-8.5> 
acl2-8.5> The guard conjecture for GC-STRATEGY is trivial to prove, given the
acl2-8.5> :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
acl2-8.5> the :type-prescription rule STATE-P.  GC-STRATEGY is compliant with
acl2-8.5> Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN GC-STRATEGY ...)
acl2-8.5> Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION READ-ACL2-ORACLE)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  GC-STRATEGY
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *BBODY-ALIST* ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *BBODY-ALIST* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since BBODY-FN is non-recursive, its admission is trivial.  We could
acl2-8.5> deduce no constraints on the type of BBODY-FN.  However, in normalizing
acl2-8.5> the definition we used the :type-prescription rule ILLEGAL.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for BBODY-FN....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for BBODY-FN, given the
acl2-8.5> :type-prescription rule ASSOC-EQ-EXEC$GUARD-CHECK, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND
acl2-8.5>  (LET ((X FN)
acl2-8.5>        (ALIST '((/= IF (EQUAL X Y) 'NIL 'T)
acl2-8.5>                 (= EQUAL X Y)
acl2-8.5>                 (ATOM IF (CONSP X) 'NIL 'T)
acl2-8.5>                 (CASE-SPLIT . X)
acl2-8.5>                 (CONS-WITH-HINT CONS X Y)
acl2-8.5>                 (DOUBLE-REWRITE . X)
acl2-8.5>                 (ENDP IF (CONSP X) 'NIL 'T)
acl2-8.5>                 (EQ EQUAL X Y)
acl2-8.5>                 (EQL EQUAL X Y)
acl2-8.5>                 (FORCE . X)
acl2-8.5>                 (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
acl2-8.5>                 (IMPLIES IF P (IF Q 'T 'NIL) 'T)
acl2-8.5>                 (LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
acl2-8.5>                 (MINUSP < X '0)
acl2-8.5>                 (MV-LIST . X)
acl2-8.5>                 (NOT IF P 'NIL 'T)
acl2-8.5>                 (NULL EQUAL X 'NIL)
acl2-8.5>                 (PLUSP < '0 X)
acl2-8.5>                 (RETURN-LAST . LAST-ARG)
acl2-8.5>                 (SYNP QUOTE T)
acl2-8.5>                 (THE-CHECK . Y)
acl2-8.5>                 (WORMHOLE-EVAL QUOTE NIL)
acl2-8.5>                 (ZEROP EQUAL X '0))))
acl2-8.5>       (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
acl2-8.5>            (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
acl2-8.5>            (EQUAL (ASSOC-EQUAL X ALIST)
acl2-8.5>                   (ASSOC-EQ-EXEC X ALIST))))
acl2-8.5>  (IMPLIES (LET ((X FN)
acl2-8.5>                 (ALIST '((/= IF (EQUAL X Y) 'NIL 'T)
acl2-8.5>                          (= EQUAL X Y)
acl2-8.5>                          (ATOM IF (CONSP X) 'NIL 'T)
acl2-8.5>                          (CASE-SPLIT . X)
acl2-8.5>                          (CONS-WITH-HINT CONS X Y)
acl2-8.5>                          (DOUBLE-REWRITE . X)
acl2-8.5>                          (ENDP IF (CONSP X) 'NIL 'T)
acl2-8.5>                          (EQ EQUAL X Y)
acl2-8.5>                          (EQL EQUAL X Y)
acl2-8.5>                          (FORCE . X)
acl2-8.5>                          (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
acl2-8.5>                          (IMPLIES IF P (IF Q 'T 'NIL) 'T)
acl2-8.5>                          (LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
acl2-8.5>                          (MINUSP < X '0)
acl2-8.5>                          (MV-LIST . X)
acl2-8.5>                          (NOT IF P 'NIL 'T)
acl2-8.5>                          (NULL EQUAL X 'NIL)
acl2-8.5>                          (PLUSP < '0 X)
acl2-8.5>                          (RETURN-LAST . LAST-ARG)
acl2-8.5>                          (SYNP QUOTE T)
acl2-8.5>                          (THE-CHECK . Y)
acl2-8.5>                          (WORMHOLE-EVAL QUOTE NIL)
acl2-8.5>                          (ZEROP EQUAL X '0))))
acl2-8.5>                (ASSOC-EQUAL X ALIST))
acl2-8.5>           (LET ((PAIR (ASSOC-EQUAL FN
acl2-8.5>                                    '((/= IF (EQUAL X Y) 'NIL 'T)
acl2-8.5>                                      (= EQUAL X Y)
acl2-8.5>                                      (ATOM IF (CONSP X) 'NIL 'T)
acl2-8.5>                                      (CASE-SPLIT . X)
acl2-8.5>                                      (CONS-WITH-HINT CONS X Y)
acl2-8.5>                                      (DOUBLE-REWRITE . X)
acl2-8.5>                                      (ENDP IF (CONSP X) 'NIL 'T)
acl2-8.5>                                      (EQ EQUAL X Y)
acl2-8.5>                                      (EQL EQUAL X Y)
acl2-8.5>                                      (FORCE . X)
acl2-8.5>                                      (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
acl2-8.5>                                      (IMPLIES IF P (IF Q 'T 'NIL) 'T)
acl2-8.5>                                      (LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
acl2-8.5>                                      (MINUSP < X '0)
acl2-8.5>                                      (MV-LIST . X)
acl2-8.5>                                      (NOT IF P 'NIL 'T)
acl2-8.5>                                      (NULL EQUAL X 'NIL)
acl2-8.5>                                      (PLUSP < '0 X)
acl2-8.5>                                      (RETURN-LAST . LAST-ARG)
acl2-8.5>                                      (SYNP QUOTE T)
acl2-8.5>                                      (THE-CHECK . Y)
acl2-8.5>                                      (WORMHOLE-EVAL QUOTE NIL)
acl2-8.5>                                      (ZEROP EQUAL X '0)))))
acl2-8.5>                (AND (OR (NOT PAIR)
acl2-8.5>                         (CONSP PAIR)
acl2-8.5>                         (EQUAL PAIR NIL))
acl2-8.5>                     PAIR)))).
acl2-8.5> 
acl2-8.5> By the :executable-counterparts of ALISTP, IF and SYMBOL-ALISTP and
acl2-8.5> the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the
acl2-8.5> conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (ASSOC-EQUAL FN
acl2-8.5>                       '((/= IF (EQUAL X Y) 'NIL 'T)
acl2-8.5>                         (= EQUAL X Y)
acl2-8.5>                         (ATOM IF (CONSP X) 'NIL 'T)
acl2-8.5>                         (CASE-SPLIT . X)
acl2-8.5>                         (CONS-WITH-HINT CONS X Y)
acl2-8.5>                         (DOUBLE-REWRITE . X)
acl2-8.5>                         (ENDP IF (CONSP X) 'NIL 'T)
acl2-8.5>                         (EQ EQUAL X Y)
acl2-8.5>                         (EQL EQUAL X Y)
acl2-8.5>                         (FORCE . X)
acl2-8.5>                         (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
acl2-8.5>                         (IMPLIES IF P (IF Q 'T 'NIL) 'T)
acl2-8.5>                         (LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
acl2-8.5>                         (MINUSP < X '0)
acl2-8.5>                         (MV-LIST . X)
acl2-8.5>                         (NOT IF P 'NIL 'T)
acl2-8.5>                         (NULL EQUAL X 'NIL)
acl2-8.5>                         (PLUSP < '0 X)
acl2-8.5>                         (RETURN-LAST . LAST-ARG)
acl2-8.5>                         (SYNP QUOTE T)
acl2-8.5>                         (THE-CHECK . Y)
acl2-8.5>                         (WORMHOLE-EVAL QUOTE NIL)
acl2-8.5>                         (ZEROP EQUAL X '0)))
acl2-8.5>          (LET ((PAIR (ASSOC-EQUAL FN
acl2-8.5>                                   '((/= IF (EQUAL X Y) 'NIL 'T)
acl2-8.5>                                     (= EQUAL X Y)
acl2-8.5>                                     (ATOM IF (CONSP X) 'NIL 'T)
acl2-8.5>                                     (CASE-SPLIT . X)
acl2-8.5>                                     (CONS-WITH-HINT CONS X Y)
acl2-8.5>                                     (DOUBLE-REWRITE . X)
acl2-8.5>                                     (ENDP IF (CONSP X) 'NIL 'T)
acl2-8.5>                                     (EQ EQUAL X Y)
acl2-8.5>                                     (EQL EQUAL X Y)
acl2-8.5>                                     (FORCE . X)
acl2-8.5>                                     (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
acl2-8.5>                                     (IMPLIES IF P (IF Q 'T 'NIL) 'T)
acl2-8.5>                                     (LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
acl2-8.5>                                     (MINUSP < X '0)
acl2-8.5>                                     (MV-LIST . X)
acl2-8.5>                                     (NOT IF P 'NIL 'T)
acl2-8.5>                                     (NULL EQUAL X 'NIL)
acl2-8.5>                                     (PLUSP < '0 X)
acl2-8.5>                                     (RETURN-LAST . LAST-ARG)
acl2-8.5>                                     (SYNP QUOTE T)
acl2-8.5>                                     (THE-CHECK . Y)
acl2-8.5>                                     (WORMHOLE-EVAL QUOTE NIL)
acl2-8.5>                                     (ZEROP EQUAL X '0)))))
acl2-8.5>               (AND (OR (NOT PAIR)
acl2-8.5>                        (CONSP PAIR)
acl2-8.5>                        (EQUAL PAIR NIL))
acl2-8.5>                    PAIR))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> ALISTP, primitive type reasoning and the :forward-chaining rule 
acl2-8.5> CONSP-ASSOC-EQUAL.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for BBODY-FN.  BBODY-FN
acl2-8.5> is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BBODY-FN ...)
acl2-8.5> Rules: ((:DEFINITION NOT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ALISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART IF)
acl2-8.5>         (:EXECUTABLE-COUNTERPART SYMBOL-ALISTP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING CONSP-ASSOC-EQUAL)
acl2-8.5>         (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
acl2-8.5>         (:TYPE-PRESCRIPTION ASSOC-EQ-EXEC$GUARD-CHECK)
acl2-8.5>         (:TYPE-PRESCRIPTION ILLEGAL))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> Prover steps counted:  80
acl2-8.5>  BBODY-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO BBODY ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO BBODY ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since FILE-LENGTH$ is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of FILE-LENGTH$ is described by the theorem 
acl2-8.5> (AND (CONSP (FILE-LENGTH$ FILE STATE))
acl2-8.5>      (TRUE-LISTP (FILE-LENGTH$ FILE STATE))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> (FILE-LENGTH$ * STATE) => (MV * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for FILE-LENGTH$....
acl2-8.5> 
acl2-8.5> The guard conjecture for FILE-LENGTH$ is trivial to prove, given the
acl2-8.5> :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
acl2-8.5> the :type-prescription rule STATE-P.  FILE-LENGTH$ is compliant with
acl2-8.5> Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FILE-LENGTH$ ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  FILE-LENGTH$
acl2-8.5> 
acl2-8.5> The event ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> To verify that the twelve encapsulated events correctly extend the
acl2-8.5> current theory we will evaluate them.  The theory thus constructed
acl2-8.5> is only ephemeral.
acl2-8.5> 
acl2-8.5> Encapsulated Events:
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(LOGIC)
acl2-8.5> 
acl2-8.5> The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant.  See :DOC
acl2-8.5> redundant-events.
acl2-8.5> :INVISIBLE
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BOOLEANP)
acl2-8.5> 
acl2-8.5> The event ( DEFUN BOOLEANP ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN BOOLEANP ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS)
acl2-8.5> 
acl2-8.5> The event ( DEFUN ALL-NILS ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN ALL-NILS ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQL-EXEC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQL-EXEC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL)
acl2-8.5> 
acl2-8.5> The event ( DEFUN MEMBER-EQUAL ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN MEMBER-EQUAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SUBSETP-EQL-EXEC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQL-EXEC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...) is redundant. 
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL)
acl2-8.5> 
acl2-8.5> The event ( DEFUN SUBSETP-EQUAL ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN SUBSETP-EQUAL ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND)
acl2-8.5> 
acl2-8.5> The event ( DEFUN REVAPPEND ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN REVAPPEND ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC)
acl2-8.5> 
acl2-8.5> The event ( DEFUN FIRST-N-AC ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN FIRST-N-AC ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE)
acl2-8.5> 
acl2-8.5> The event ( DEFUN TAKE ...) is redundant.  See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN TAKE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5> :REDUNDANT
acl2-8.5> 
acl2-8.5> End of Encapsulated Events.
acl2-8.5> 
acl2-8.5> ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...):  The submitted
acl2-8.5> encapsulate event has created no new ACL2 events, and thus is leaving
acl2-8.5> the ACL2 logical world unchanged.  See :DOC encapsulate.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( ENCAPSULATE NIL (LOGIC) ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :EMPTY-ENCAPSULATE
acl2-8.5> 
acl2-8.5> The event ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...) is redundant.
acl2-8.5> See :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The admission of READ-FILE-INTO-STRING1 is trivial, using the relation
acl2-8.5> O< (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT BOUND).  We observe that the type of 
acl2-8.5> READ-FILE-INTO-STRING1 is described by the theorem 
acl2-8.5> (AND (CONSP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND))
acl2-8.5>      (TRUE-LISTP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND))).
acl2-8.5> We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> (READ-FILE-INTO-STRING1 * STATE * *) => (MV * STATE).
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for READ-FILE-INTO-STRING1....
acl2-8.5> 
acl2-8.5> The non-trivial part of the guard conjecture for READ-FILE-INTO-STRING1,
acl2-8.5> given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :executable-
acl2-8.5> counterparts of MEMBER-EQ-EXEC, MEMBER-EQ-EXEC$GUARD-CHECK, MEMBER-EQUAL
acl2-8.5> and RETURN-LAST, primitive type reasoning, the :forward-chaining rule
acl2-8.5> STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription
acl2-8.5> rule STATE-P, is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (AND (IMPLIES (AND (NATP BOUND)
acl2-8.5>                    (CHARACTER-LISTP ANS)
acl2-8.5>                    (OPEN-INPUT-CHANNEL-P CHANNEL
acl2-8.5>                                          :CHARACTER STATE)
acl2-8.5>                    (SYMBOLP CHANNEL)
acl2-8.5>                    (STATE-P STATE)
acl2-8.5>                    (NOT (ZP BOUND)))
acl2-8.5>               (MV-LET (VAL STATE)
acl2-8.5>                       (READ-CHAR$ CHANNEL STATE)
acl2-8.5>                       (AND (OR (CHARACTERP VAL)
acl2-8.5>                                (TRUE-LISTP ANS)
acl2-8.5>                                (STRINGP ANS))
acl2-8.5>                            (OR (CHARACTERP VAL)
acl2-8.5>                                (CHARACTER-LISTP (REVERSE ANS)))
acl2-8.5>                            (OR (NOT (CHARACTERP VAL))
acl2-8.5>                                (ACL2-NUMBERP BOUND))
acl2-8.5>                            (OR (NOT (CHARACTERP VAL))
acl2-8.5>                                (SYMBOLP CHANNEL))
acl2-8.5>                            (OR (NOT (CHARACTERP VAL))
acl2-8.5>                                (CHARACTER-LISTP (CONS VAL ANS)))
acl2-8.5>                            (OR (NOT (CHARACTERP VAL))
acl2-8.5>                                (OPEN-INPUT-CHANNEL-P CHANNEL
acl2-8.5>                                                      :CHARACTER STATE))
acl2-8.5>                            (OR (NOT (CHARACTERP VAL))
acl2-8.5>                                (NATP (+ -1 BOUND))))))
acl2-8.5>      (IMPLIES (AND (NATP BOUND)
acl2-8.5>                    (CHARACTER-LISTP ANS)
acl2-8.5>                    (OPEN-INPUT-CHANNEL-P CHANNEL
acl2-8.5>                                          :CHARACTER STATE)
acl2-8.5>                    (SYMBOLP CHANNEL)
acl2-8.5>                    (STATE-P STATE)
acl2-8.5>                    (NOT (ZP BOUND)))
acl2-8.5>               (OPEN-INPUT-CHANNEL-P1 CHANNEL
acl2-8.5>                                      :CHARACTER STATE))).
acl2-8.5> 
acl2-8.5> By the simple :definitions NATP, OPEN-INPUT-CHANNEL-P, OPEN-INPUT-CHANNEL-P1,
acl2-8.5> OPEN-INPUT-CHANNELS and STATE-P and the :executable-counterpart of
acl2-8.5> TAU-SYSTEM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (INTEGERP BOUND)
acl2-8.5>               (<= 0 BOUND)
acl2-8.5>               (CHARACTER-LISTP ANS)
acl2-8.5>               (ASSOC-EQUAL CHANNEL (NTH 0 STATE))
acl2-8.5>               (EQUAL (CADR (CADR (ASSOC-EQUAL CHANNEL (NTH 0 STATE))))
acl2-8.5>                      :CHARACTER)
acl2-8.5>               (SYMBOLP CHANNEL)
acl2-8.5>               (STATE-P1 STATE)
acl2-8.5>               (NOT (ZP BOUND)))
acl2-8.5>          (MV-LET (VAL STATE)
acl2-8.5>                  (READ-CHAR$ CHANNEL STATE)
acl2-8.5>                  (AND (OR (CHARACTERP VAL)
acl2-8.5>                           (TRUE-LISTP ANS)
acl2-8.5>                           (STRINGP ANS))
acl2-8.5>                       (OR (CHARACTERP VAL)
acl2-8.5>                           (CHARACTER-LISTP (REVERSE ANS)))
acl2-8.5>                       (OR (NOT (CHARACTERP VAL))
acl2-8.5>                           (ACL2-NUMBERP BOUND))
acl2-8.5>                       (OR (NOT (CHARACTERP VAL))
acl2-8.5>                           (SYMBOLP CHANNEL))
acl2-8.5>                       (OR (NOT (CHARACTERP VAL))
acl2-8.5>                           (CHARACTER-LISTP (CONS VAL ANS)))
acl2-8.5>                       (OR (NOT (CHARACTERP VAL))
acl2-8.5>                           (LET ((PAIR (ASSOC-EQUAL CHANNEL (NTH 0 STATE)))
acl2-8.5>                                 (TYP :CHARACTER))
acl2-8.5>                                (AND PAIR (EQUAL (CADR (CADR PAIR)) TYP))))
acl2-8.5>                       (OR (NOT (CHARACTERP VAL))
acl2-8.5>                           (NATP (+ -1 BOUND)))))).
acl2-8.5> 
acl2-8.5> But simplification reduces this to T, using the :compound-recognizer
acl2-8.5> rules NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, the :definitions
acl2-8.5> CHARACTER-LISTP, MV-NTH, NOT, NTH, OPEN-INPUT-CHANNELS, READ-CHAR$,
acl2-8.5> REVERSE, UPDATE-NTH and UPDATE-OPEN-INPUT-CHANNELS, the :executable-
acl2-8.5> counterparts of CHARACTER-LISTP, EQUAL and ZP, primitive type reasoning,
acl2-8.5> the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, 
acl2-8.5> CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP
acl2-8.5> and STATE-P1-FORWARD, the :rewrite rules ASSOC-ADD-PAIR, CAR-CONS,
acl2-8.5> CDR-CONS, CHARACTER-LISTP-REVAPPEND and NTH-0-CONS and the :type-prescription
acl2-8.5> rules ATOM-LISTP, CHARACTER-LISTP, EQLABLE-LISTP, LENGTH and STATE-P1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the guard theorem for READ-FILE-INTO-STRING1.
acl2-8.5> READ-FILE-INTO-STRING1 is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING1 ...)
acl2-8.5> Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
acl2-8.5>         (:DEFINITION CHARACTER-LISTP)
acl2-8.5>         (:DEFINITION MV-NTH)
acl2-8.5>         (:DEFINITION NATP)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION NTH)
acl2-8.5>         (:DEFINITION OPEN-INPUT-CHANNEL-P)
acl2-8.5>         (:DEFINITION OPEN-INPUT-CHANNEL-P1)
acl2-8.5>         (:DEFINITION OPEN-INPUT-CHANNELS)
acl2-8.5>         (:DEFINITION READ-CHAR$)
acl2-8.5>         (:DEFINITION REVERSE)
acl2-8.5>         (:DEFINITION STATE-P)
acl2-8.5>         (:DEFINITION UPDATE-NTH)
acl2-8.5>         (:DEFINITION UPDATE-OPEN-INPUT-CHANNELS)
acl2-8.5>         (:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
acl2-8.5>         (:EXECUTABLE-COUNTERPART EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC)
acl2-8.5>         (:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC$GUARD-CHECK)
acl2-8.5>         (:EXECUTABLE-COUNTERPART MEMBER-EQUAL)
acl2-8.5>         (:EXECUTABLE-COUNTERPART RETURN-LAST)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ZP)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
acl2-8.5>         (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
acl2-8.5>         (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
acl2-8.5>         (:FORWARD-CHAINING STATE-P1-FORWARD)
acl2-8.5>         (:REWRITE ASSOC-ADD-PAIR)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:REWRITE CHARACTER-LISTP-REVAPPEND)
acl2-8.5>         (:REWRITE NTH-0-CONS)
acl2-8.5>         (:TYPE-PRESCRIPTION ATOM-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION CHARACTER-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION EQLABLE-LISTP)
acl2-8.5>         (:TYPE-PRESCRIPTION LENGTH)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P)
acl2-8.5>         (:TYPE-PRESCRIPTION STATE-P1))
acl2-8.5> Time:  0.02 seconds (prove: 0.01, print: 0.00, other: 0.01)
acl2-8.5> Prover steps counted:  988
acl2-8.5>  READ-FILE-INTO-STRING1
acl2-8.5> 
acl2-8.5> Since READ-FILE-INTO-STRING2-LOGICAL is non-recursive, its admission
acl2-8.5> is trivial.  We observe that the type of READ-FILE-INTO-STRING2-LOGICAL
acl2-8.5> is described by the theorem 
acl2-8.5> (OR (EQUAL (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE)
acl2-8.5>            NIL)
acl2-8.5>     (STRINGP (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE))).
acl2-8.5> We used the :type-prescription rule STRINGP-SUBSEQ-TYPE-PRESCRIPTION.
acl2-8.5> 
acl2-8.5> (READ-FILE-INTO-STRING2-LOGICAL * * * STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for READ-FILE-INTO-STRING2-LOGICAL....
acl2-8.5> 
acl2-8.5> The guard conjecture for READ-FILE-INTO-STRING2-LOGICAL is trivial
acl2-8.5> to prove.  READ-FILE-INTO-STRING2-LOGICAL is compliant with Common
acl2-8.5> Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION))
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING2-LOGICAL
acl2-8.5> 
acl2-8.5> Since READ-FILE-INTO-STRING2 is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of READ-FILE-INTO-STRING2 is described by
acl2-8.5> the theorem 
acl2-8.5> (OR (EQUAL (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE)
acl2-8.5>            NIL)
acl2-8.5>     (STRINGP (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE))).
acl2-8.5> We used the :type-prescription rule READ-FILE-INTO-STRING2-LOGICAL.
acl2-8.5> 
acl2-8.5> (READ-FILE-INTO-STRING2 * * * STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for READ-FILE-INTO-STRING2....
acl2-8.5> 
acl2-8.5> The guard conjecture for READ-FILE-INTO-STRING2 is trivial to prove.
acl2-8.5> READ-FILE-INTO-STRING2 is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN READ-FILE-INTO-STRING2 ...)
acl2-8.5> Rules: ((:TYPE-PRESCRIPTION READ-FILE-INTO-STRING2-LOGICAL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  READ-FILE-INTO-STRING2
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO READ-FILE-INTO-STRING ...) is redundant.  See
acl2-8.5> :DOC redundant-events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO READ-FILE-INTO-STRING ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO WHEN-PASS-2 ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO WHEN-PASS-2 ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Since PRINT-CL-CACHE-FN is non-recursive, its admission is trivial.
acl2-8.5> We observe that the type of PRINT-CL-CACHE-FN is described by the theorem
acl2-8.5> (EQUAL (PRINT-CL-CACHE-FN I J) NIL).  
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for PRINT-CL-CACHE-FN....
acl2-8.5> 
acl2-8.5> The guard conjecture for PRINT-CL-CACHE-FN is trivial to prove.  
acl2-8.5> PRINT-CL-CACHE-FN is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN PRINT-CL-CACHE-FN ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  PRINT-CL-CACHE-FN
acl2-8.5> 
acl2-8.5> The event ( DEFMACRO PRINT-CL-CACHE ...) is redundant.  See :DOC redundant-
acl2-8.5> events.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFMACRO PRINT-CL-CACHE ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> The admission of HONS-REMOVE-ASSOC is trivial, using the relation O<
acl2-8.5> (which is known to be well-founded on the domain recognized by O-P)
acl2-8.5> and the measure (ACL2-COUNT X).  We observe that the type of 
acl2-8.5> HONS-REMOVE-ASSOC is described by the theorem 
acl2-8.5> (TRUE-LISTP (HONS-REMOVE-ASSOC K X)).  We used primitive type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for HONS-REMOVE-ASSOC....
acl2-8.5> 
acl2-8.5> The guard conjecture for HONS-REMOVE-ASSOC is trivial to prove.  
acl2-8.5> HONS-REMOVE-ASSOC is compliant with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN HONS-REMOVE-ASSOC ...)
acl2-8.5> Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  HONS-REMOVE-ASSOC
acl2-8.5> 
acl2-8.5> For the admission of COUNT-KEYS we will use the relation O< (which
acl2-8.5> is known to be well-founded on the domain recognized by O-P) and the
acl2-8.5> measure (ACL2-COUNT AL).  The non-trivial part of the measure conjecture
acl2-8.5> is
acl2-8.5> 
acl2-8.5> Goal
acl2-8.5> (IMPLIES (AND (NOT (ATOM AL)) (CONSP (CAR AL)))
acl2-8.5>          (O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
acl2-8.5>                                             (CDR AL)))
acl2-8.5>              (ACL2-COUNT AL))).
acl2-8.5> 
acl2-8.5> By the simple :definition ATOM we reduce the conjecture to
acl2-8.5> 
acl2-8.5> Goal'
acl2-8.5> (IMPLIES (AND (CONSP AL) (CONSP (CAR AL)))
acl2-8.5>          (O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
acl2-8.5>                                             (CDR AL)))
acl2-8.5>              (ACL2-COUNT AL))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<,
acl2-8.5> primitive type reasoning and the :type-prescription rule ACL2-COUNT,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Goal''
acl2-8.5> (IMPLIES (AND (CONSP AL) (CONSP (CAR AL)))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
acl2-8.5>                                            (CDR AL)))
acl2-8.5>             (+ 1 (ACL2-COUNT (CAR AL))
acl2-8.5>                (ACL2-COUNT (CDR AL))))).
acl2-8.5> 
acl2-8.5> The destructor terms (CAR AL) and (CDR AL) can be eliminated.  Furthermore,
acl2-8.5> those terms are at the root of a chain of two rounds of destructor
acl2-8.5> elimination.  (1) Use CAR-CDR-ELIM to replace AL by (CONS AL1 AL2),
acl2-8.5> (CAR AL) by AL1 and (CDR AL) by AL2.  (2) Use CAR-CDR-ELIM, again,
acl2-8.5> to replace AL1 by (CONS AL3 AL4), (CAR AL1) by AL3 and (CDR AL1) by
acl2-8.5> AL4.  These steps produce the following goal.
acl2-8.5> 
acl2-8.5> Goal'''
acl2-8.5> (IMPLIES (AND (CONSP (CONS AL3 AL4))
acl2-8.5>               (CONSP (CONS (CONS AL3 AL4) AL2)))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 1 (ACL2-COUNT (CONS AL3 AL4))
acl2-8.5>                (ACL2-COUNT AL2)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT and SYNP, the :executable-
acl2-8.5> counterpart of BINARY-+, primitive type reasoning and the :rewrite
acl2-8.5> rules CAR-CONS, CDR-CONS, COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+
acl2-8.5> and FOLD-CONSTS-IN-+, to
acl2-8.5> 
acl2-8.5> Goal'4'
acl2-8.5> (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>    (+ 2 (ACL2-COUNT AL2)
acl2-8.5>       (ACL2-COUNT AL3)
acl2-8.5>       (ACL2-COUNT AL4))).
acl2-8.5> 
acl2-8.5> Name the formula above *1.
acl2-8.5> 
acl2-8.5> Perhaps we can prove *1 by induction.  Four induction schemes are suggested
acl2-8.5> by this conjecture.  These merge into three derived induction schemes.
acl2-8.5> However, one of these is flawed and so we are left with two viable
acl2-8.5> candidates.  One of these has a score higher than the other.  
acl2-8.5> 
acl2-8.5> We will induct according to a scheme suggested by (ACL2-COUNT AL2),
acl2-8.5> but modified to accommodate (HONS-REMOVE-ASSOC AL3 AL2).  These suggestions
acl2-8.5> were produced using the :induction rules ACL2-COUNT and HONS-REMOVE-ASSOC.
acl2-8.5> If we let (:P AL2 AL3 AL4) denote *1 above then the induction scheme
acl2-8.5> we'll use is
acl2-8.5> (AND (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>                    (NOT (RATIONALP AL2))
acl2-8.5>                    (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>                    (NOT (STRINGP AL2)))
acl2-8.5>               (:P AL2 AL3 AL4))
acl2-8.5>      (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>                    (NOT (RATIONALP AL2))
acl2-8.5>                    (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>                    (STRINGP AL2))
acl2-8.5>               (:P AL2 AL3 AL4))
acl2-8.5>      (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>                    (NOT (RATIONALP AL2))
acl2-8.5>                    (COMPLEX-RATIONALP AL2)
acl2-8.5>                    (:P (REALPART AL2) AL3 AL4)
acl2-8.5>                    (:P (IMAGPART AL2) AL3 AL4))
acl2-8.5>               (:P AL2 AL3 AL4))
acl2-8.5>      (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>                    (RATIONALP AL2)
acl2-8.5>                    (NOT (INTEGERP AL2)))
acl2-8.5>               (:P AL2 AL3 AL4))
acl2-8.5>      (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>                    (RATIONALP AL2)
acl2-8.5>                    (INTEGERP AL2))
acl2-8.5>               (:P AL2 AL3 AL4))
acl2-8.5>      (IMPLIES (AND (CONSP AL2)
acl2-8.5>                    (:P (CAR AL2) AL3 AL4)
acl2-8.5>                    (:P (CDR AL2) AL3 AL4))
acl2-8.5>               (:P AL2 AL3 AL4))).
acl2-8.5> This induction is justified by the same argument used to admit ACL2-COUNT.
acl2-8.5> When applied to the goal at hand the above induction scheme produces
acl2-8.5> six nontautological subgoals.
acl2-8.5> 
acl2-8.5> Subgoal *1/6
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>               (NOT (STRINGP AL2)))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, FIX and HONS-REMOVE-ASSOC,
acl2-8.5> the :executable-counterpart of ACL2-COUNT, primitive type reasoning,
acl2-8.5> the :rewrite rule UNICITY-OF-0 and the :type-prescription rule ACL2-COUNT,
acl2-8.5> to
acl2-8.5> 
acl2-8.5> Subgoal *1/6'
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>               (NOT (STRINGP AL2)))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/5
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>               (STRINGP AL2))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
acl2-8.5> and LENGTH, the :executable-counterpart of ACL2-COUNT and the :rewrite
acl2-8.5> rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to
acl2-8.5> 
acl2-8.5> Subgoal *1/5'
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (NOT (COMPLEX-RATIONALP AL2))
acl2-8.5>               (STRINGP AL2))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (LEN (COERCE AL2 'LIST))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/4
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (COMPLEX-RATIONALP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT (REALPART AL2))
acl2-8.5>                     (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT (IMAGPART AL2))
acl2-8.5>                     (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4))))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
acl2-8.5> and SYNP, the :executable-counterparts of ACL2-COUNT and BINARY-+ and
acl2-8.5> the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and 
acl2-8.5> FOLD-CONSTS-IN-+, to
acl2-8.5> 
acl2-8.5> Subgoal *1/4'
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (NOT (RATIONALP AL2))
acl2-8.5>               (COMPLEX-RATIONALP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (REALPART AL2))))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (IMAGPART AL2)))))
acl2-8.5>          (< 0
acl2-8.5>             (+ 3 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (ACL2-COUNT (IMAGPART AL2))
acl2-8.5>                (ACL2-COUNT (REALPART AL2))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/3
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (RATIONALP AL2)
acl2-8.5>               (NOT (INTEGERP AL2)))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT (if-intro), 
acl2-8.5> HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart
acl2-8.5> of ACL2-COUNT, primitive type reasoning and the :rewrite rules 
acl2-8.5> COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal *1/3.2
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (RATIONALP AL2)
acl2-8.5>               (NOT (INTEGERP AL2))
acl2-8.5>               (< (NUMERATOR AL2) 0))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (DENOMINATOR AL2)
acl2-8.5>                (- (NUMERATOR AL2))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/3.1
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (RATIONALP AL2)
acl2-8.5>               (NOT (INTEGERP AL2))
acl2-8.5>               (<= 0 (NUMERATOR AL2)))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (DENOMINATOR AL2)
acl2-8.5>                (NUMERATOR AL2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/2
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (RATIONALP AL2)
acl2-8.5>               (INTEGERP AL2))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT (if-intro), 
acl2-8.5> HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart
acl2-8.5> of ACL2-COUNT and the :rewrite rules COMMUTATIVITY-2-OF-+ and 
acl2-8.5> COMMUTATIVITY-OF-+, to the following two conjectures.
acl2-8.5> 
acl2-8.5> Subgoal *1/2.2
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (INTEGERP AL2)
acl2-8.5>               (< AL2 0))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (- AL2)))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/2.1
acl2-8.5> (IMPLIES (AND (NOT (CONSP AL2))
acl2-8.5>               (INTEGERP AL2)
acl2-8.5>               (<= 0 AL2))
acl2-8.5>          (< 0
acl2-8.5>             (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                AL2))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/1
acl2-8.5> (IMPLIES (AND (CONSP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT (CAR AL2))
acl2-8.5>                     (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT (CDR AL2))
acl2-8.5>                     (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4))))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
acl2-8.5>             (+ 2 (ACL2-COUNT AL2)
acl2-8.5>                (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
acl2-8.5> (if-intro) and SYNP, the :executable-counterpart of BINARY-+ and the
acl2-8.5> :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+,
acl2-8.5> to the following three conjectures.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.3
acl2-8.5> (IMPLIES (AND (CONSP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CAR AL2))))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CDR AL2))))
acl2-8.5>               (NOT (CONSP (CAR AL2))))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>             (+ 3 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (ACL2-COUNT (CAR AL2))
acl2-8.5>                (ACL2-COUNT (CDR AL2))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.2
acl2-8.5> (IMPLIES (AND (CONSP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CAR AL2))))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CDR AL2))))
acl2-8.5>               (CONSP (CAR AL2))
acl2-8.5>               (NOT (EQUAL AL3 (CAR (CAR AL2)))))
acl2-8.5>          (< (ACL2-COUNT (CONS (CAR AL2)
acl2-8.5>                               (HONS-REMOVE-ASSOC AL3 (CDR AL2))))
acl2-8.5>             (+ 3 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (ACL2-COUNT (CAR AL2))
acl2-8.5>                (ACL2-COUNT (CDR AL2))))).
acl2-8.5> 
acl2-8.5> This simplifies, using the :definition ACL2-COUNT, primitive type reasoning,
acl2-8.5> the :rewrite rules CAR-CONS and CDR-CONS and the :type-prescription
acl2-8.5> rule HONS-REMOVE-ASSOC, to
acl2-8.5> 
acl2-8.5> Subgoal *1/1.2'
acl2-8.5> (IMPLIES (AND (CONSP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CAR AL2))))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CDR AL2))))
acl2-8.5>               (CONSP (CAR AL2))
acl2-8.5>               (NOT (EQUAL AL3 (CAR (CAR AL2)))))
acl2-8.5>          (< (+ 1 (ACL2-COUNT (CAR AL2))
acl2-8.5>                (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))))
acl2-8.5>             (+ 3 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (ACL2-COUNT (CAR AL2))
acl2-8.5>                (ACL2-COUNT (CDR AL2))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> Subgoal *1/1.1
acl2-8.5> (IMPLIES (AND (CONSP AL2)
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CAR AL2))))
acl2-8.5>               (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>                  (+ 2 (ACL2-COUNT AL3)
acl2-8.5>                     (ACL2-COUNT AL4)
acl2-8.5>                     (ACL2-COUNT (CDR AL2))))
acl2-8.5>               (EQUAL AL3 (CAR (CAR AL2))))
acl2-8.5>          (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
acl2-8.5>             (+ 3 (ACL2-COUNT AL3)
acl2-8.5>                (ACL2-COUNT AL4)
acl2-8.5>                (ACL2-COUNT (CAR AL2))
acl2-8.5>                (ACL2-COUNT (CDR AL2))))).
acl2-8.5> 
acl2-8.5> But we reduce the conjecture to T, by the :executable-counterpart of
acl2-8.5> TAU-SYSTEM.
acl2-8.5> 
acl2-8.5> That completes the proof of *1.
acl2-8.5> 
acl2-8.5> Q.E.D.
acl2-8.5> 
acl2-8.5> That completes the proof of the measure theorem for COUNT-KEYS.  Thus,
acl2-8.5> we admit this function under the principle of definition.  We observe
acl2-8.5> that the type of COUNT-KEYS is described by the theorem 
acl2-8.5> (AND (INTEGERP (COUNT-KEYS AL)) (<= 0 (COUNT-KEYS AL))).  We used primitive
acl2-8.5> type reasoning.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for COUNT-KEYS....
acl2-8.5> 
acl2-8.5> The guard conjecture for COUNT-KEYS is trivial to prove, given the
acl2-8.5> :type-prescription rule COUNT-KEYS.  COUNT-KEYS is compliant with Common
acl2-8.5> Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN COUNT-KEYS ...)
acl2-8.5> Rules: ((:DEFINITION ACL2-COUNT)
acl2-8.5>         (:DEFINITION ATOM)
acl2-8.5>         (:DEFINITION FIX)
acl2-8.5>         (:DEFINITION HONS-REMOVE-ASSOC)
acl2-8.5>         (:DEFINITION INTEGER-ABS)
acl2-8.5>         (:DEFINITION LENGTH)
acl2-8.5>         (:DEFINITION NOT)
acl2-8.5>         (:DEFINITION O-FINP)
acl2-8.5>         (:DEFINITION O<)
acl2-8.5>         (:DEFINITION SYNP)
acl2-8.5>         (:ELIM CAR-CDR-ELIM)
acl2-8.5>         (:EXECUTABLE-COUNTERPART ACL2-COUNT)
acl2-8.5>         (:EXECUTABLE-COUNTERPART BINARY-+)
acl2-8.5>         (:EXECUTABLE-COUNTERPART TAU-SYSTEM)
acl2-8.5>         (:FAKE-RUNE-FOR-TYPE-SET NIL)
acl2-8.5>         (:INDUCTION ACL2-COUNT)
acl2-8.5>         (:INDUCTION HONS-REMOVE-ASSOC)
acl2-8.5>         (:REWRITE CAR-CONS)
acl2-8.5>         (:REWRITE CDR-CONS)
acl2-8.5>         (:REWRITE COMMUTATIVITY-2-OF-+)
acl2-8.5>         (:REWRITE COMMUTATIVITY-OF-+)
acl2-8.5>         (:REWRITE FOLD-CONSTS-IN-+)
acl2-8.5>         (:REWRITE UNICITY-OF-0)
acl2-8.5>         (:TYPE-PRESCRIPTION ACL2-COUNT)
acl2-8.5>         (:TYPE-PRESCRIPTION COUNT-KEYS)
acl2-8.5>         (:TYPE-PRESCRIPTION HONS-REMOVE-ASSOC))
acl2-8.5> Splitter rules (see :DOC splitter):
acl2-8.5>   if-intro: ((:DEFINITION ACL2-COUNT)
acl2-8.5>              (:DEFINITION HONS-REMOVE-ASSOC)
acl2-8.5>              (:DEFINITION INTEGER-ABS))
acl2-8.5> Time:  0.03 seconds (prove: 0.03, print: 0.01, other: 0.00)
acl2-8.5> Prover steps counted:  5904
acl2-8.5>  COUNT-KEYS
acl2-8.5> 
acl2-8.5> Since HONS-ENABLEDP is non-recursive, its admission is trivial.  We
acl2-8.5> observe that the type of HONS-ENABLEDP is described by the theorem
acl2-8.5> (EQUAL (HONS-ENABLEDP STATE) T).  
acl2-8.5> 
acl2-8.5> (HONS-ENABLEDP STATE) => *.
acl2-8.5> 
acl2-8.5> Computing the guard conjecture for HONS-ENABLEDP....
acl2-8.5> 
acl2-8.5> The guard conjecture for HONS-ENABLEDP is trivial to prove, given the
acl2-8.5> :executable-counterpart of TRUE-LISTP.  HONS-ENABLEDP is compliant
acl2-8.5> with Common Lisp.
acl2-8.5> 
acl2-8.5> Summary
acl2-8.5> Form:  ( DEFUN HONS-ENABLEDP ...)
acl2-8.5> Rules: ((:EXECUTABLE-COUNTERPART TRUE-LISTP))
acl2-8.5> Time:  0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
acl2-8.5>  HONS-ENABLEDP
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
acl2-8.5>             '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
acl2-8.5>                                 &AUX *PRINT-PPRINT-DISPATCH*
acl2-8.5>                                 &BODY *PRINT-PRETTY* &ENVIRONMENT ...))
acl2-8.5>   (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
acl2-8.5>             '(* ** *** *BREAK-ON-SIGNALS*
acl2-8.5>                 *COMPILE-FILE-PATHNAME*
acl2-8.5>                 *COMPILE-FILE-TRUENAME*
acl2-8.5>                 *COMPILE-PRINT* ...))
acl2-8.5>   (DEFCONST NIL 'NIL)
acl2-8.5>   (DEFCONST T 'T)
acl2-8.5>   (DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
acl2-8.5>   (DEFMACRO MAKE-PACKAGE-ENTRY
acl2-8.5>             (&KEY NAME IMPORTS HIDDEN-P
acl2-8.5>                   BOOK-PATH DEFPKG-EVENT-FORM TTERM)
acl2-8.5>             (CONS 'LIST* (CONS NAME #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
acl2-8.5>   (DEFN MEMOIZE-SUMMARY NIL NIL)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
acl2-8.5>   (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
acl2-8.5>   (DEFCONST *HONS-PRIMITIVE-FNS*
acl2-8.5>             '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
acl2-8.5>                         HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  CLEAR-MEMOIZE-TABLE
acl2-8.5>  CLEAR-MEMOIZE-TABLES
acl2-8.5>  MEMOIZE-SUMMARY
acl2-8.5>  CLEAR-MEMOIZE-STATISTICS
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MEMOIZE-FORM
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  NEVER-MEMOIZE-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SET-BAD-LISP-CONSP-MEMOIZE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
acl2-8.5>   (DEFN MEMOIZE-SUMMARY NIL NIL)
acl2-8.5>   (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
acl2-8.5>   (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
acl2-8.5>   (DEFCONST *HONS-PRIMITIVE-FNS*
acl2-8.5>             '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
acl2-8.5>                         HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO DEFN (F A &REST R)
acl2-8.5>             (CONS 'DEFUN (CONS F #)))
acl2-8.5>   (DEFMACRO DEFND (F A &REST R)
acl2-8.5>             (CONS 'DEFUND (CONS F #)))
acl2-8.5>   (DEFN HONS-EQUAL (X Y)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (EQUAL X Y))
acl2-8.5>   (DEFN HONS-ASSOC-EQUAL (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (COND (# NIL) (# #) (T #)))
acl2-8.5>   (DEFN HONS-GET (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (HONS-ASSOC-EQUAL KEY ALIST))
acl2-8.5>   (DEFN HONS-ACONS (KEY VAL ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (CONS (CONS KEY VAL) ALIST))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  HONS-COPY-PERSISTENT
acl2-8.5>  HONS
acl2-8.5>  HONS-EQUAL-LITE
acl2-8.5>  HONS-CLEAR
acl2-8.5>  HONS-CLEAR!
acl2-8.5>  HONS-WASH
acl2-8.5>  HONS-WASH!
acl2-8.5>  HONS-SUMMARY
acl2-8.5>  :REDUNDANT
acl2-8.5>  HONS-RESIZE-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  HONS-ACONS!
acl2-8.5>  MAKE-FAST-ALIST
acl2-8.5>  FAST-ALIST-FORK
acl2-8.5>  FAST-ALIST-FORK!
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  FAST-ALIST-CLEAN
acl2-8.5>  FAST-ALIST-CLEAN!
acl2-8.5>  FAST-ALIST-LEN
acl2-8.5>  FAST-ALIST-SUMMARY
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  CONS-SUBTREES
acl2-8.5>  NUMBER-SUBTREES
acl2-8.5>  FLUSH-HONS-GET-HASH-TABLE-LINK
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3186)
acl2-8.5>  REMOVE-KEYWORD
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO DEFN (F A &REST R)
acl2-8.5>             (CONS 'DEFUN (CONS F #)))
acl2-8.5>   (DEFMACRO DEFND (F A &REST R)
acl2-8.5>             (CONS 'DEFUND (CONS F #)))
acl2-8.5>   (DEFN HONS-EQUAL (X Y)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (EQUAL X Y))
acl2-8.5>   (DEFN HONS-ASSOC-EQUAL (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (COND (# NIL) (# #) (T #)))
acl2-8.5>   (DEFN HONS-GET (KEY ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (HONS-ASSOC-EQUAL KEY ALIST))
acl2-8.5>   (DEFN HONS-ACONS (KEY VAL ALIST)
acl2-8.5>         (DECLARE (XARGS :MODE :LOGIC))
acl2-8.5>         (CONS (CONS KEY VAL) ALIST))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO SERIALIZE-WRITE
acl2-8.5>             (FILENAME OBJ &KEY VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-WRITE-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-WRITE-FN
acl2-8.5>          (FILENAME OBJ VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME OBJ VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  STATE))
acl2-8.5>   (DEFMACRO SERIALIZE-READ
acl2-8.5>             (FILENAME &KEY (HONS-MODE #) VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-READ-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-READ-FN
acl2-8.5>          (FILENAME HONS-MODE VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME HONS-MODE VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  (MV VAL STATE)))
acl2-8.5>   (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
acl2-8.5>             (DECLARE (XARGS :GUARD #))
acl2-8.5>             (CONS 'STATE-GLOBAL-LET* (CONS # #)))).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  :REDUNDANT
acl2-8.5>  SERIALIZE-WRITE-FN
acl2-8.5>  :REDUNDANT
acl2-8.5>  SERIALIZE-READ-FN
acl2-8.5>  :REDUNDANT
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFMACRO SERIALIZE-WRITE
acl2-8.5>             (FILENAME OBJ &KEY VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-WRITE-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-WRITE-FN
acl2-8.5>          (FILENAME OBJ VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME OBJ VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  STATE))
acl2-8.5>   (DEFMACRO SERIALIZE-READ
acl2-8.5>             (FILENAME &KEY (HONS-MODE #) VERBOSEP)
acl2-8.5>             (CONS 'SERIALIZE-READ-FN
acl2-8.5>                   (CONS FILENAME #)))
acl2-8.5>   (DEFUN SERIALIZE-READ-FN
acl2-8.5>          (FILENAME HONS-MODE VERBOSEP STATE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :STOBJS STATE)
acl2-8.5>                   (IGNORABLE FILENAME HONS-MODE VERBOSEP))
acl2-8.5>          (MV-LET (ERP VAL STATE)
acl2-8.5>                  (READ-ACL2-ORACLE STATE)
acl2-8.5>                  (DECLARE #)
acl2-8.5>                  (MV VAL STATE)))
acl2-8.5>   (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
acl2-8.5>             (DECLARE (XARGS :GUARD #))
acl2-8.5>             (CONS 'STATE-GLOBAL-LET* (CONS # #)))).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP PACKN1)
acl2-8.5>   (ENCAPSULATE NIL
acl2-8.5>                (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>                               #
acl2-8.5>                               :RULE-CLASSES #))
acl2-8.5>                (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM #
acl2-8.5>                               :RULE-CLASSES #))
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP PACKN-POS)
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL)
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP PACKN)
acl2-8.5>                ...)
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  QUOTE-LISTP
acl2-8.5>  CONS-TERM1
acl2-8.5>  CONS-TERM
acl2-8.5>  SYMBOL-CLASS
acl2-8.5>  PACKN1
acl2-8.5>  T
acl2-8.5>  :REDUNDANT
acl2-8.5>  GUARD-THEOREM-SIMPLIFY-MSG
acl2-8.5>  GUARD-OR-TERMINATION-THEOREM-MSG
acl2-8.5>  ALIST-KEYS-SUBSETP
acl2-8.5>  KEYWORD-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  FIRST-KEYWORD
acl2-8.5>  SYMBOL-NAME-LST
acl2-8.5>  SYMBOL-NAME-EQUAL
acl2-8.5>  FIX-PKG
acl2-8.5>  UNMAKE-TRUE-LIST-CONS-NEST
acl2-8.5>  DUMB-NEGATE-LIT
acl2-8.5>  FLATTEN-ANDS-IN-LIT
acl2-8.5>  UNION-EQUAL-TO-END
acl2-8.5>  FLATTEN-ANDS-IN-LIT!
acl2-8.5>  WARRANTED-FNS-OF-WORLD
acl2-8.5>  INITIALIZE-EVENT-USER
acl2-8.5>  FINALIZE-EVENT-USER
acl2-8.5>  ACL2X-EXPANSION-ALIST
acl2-8.5>  SET-LD-HISTORY-ENTRY-USER-DATA
acl2-8.5>  CANONICAL-PATHNAME
acl2-8.5>  MAGIC-EV-FNCALL
acl2-8.5>  (MFC-AP-FN MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE
acl2-8.5>             MFC-RW+-FN MFC-RW+-TTREE
acl2-8.5>             MFC-RW-FN MFC-RW-TTREE ...)
acl2-8.5>  PRINT-OBJECT$-FN
acl2-8.5>  PRINT-OBJECT$
acl2-8.5>  PRINT-OBJECT$-PRESERVING-CASE
acl2-8.5>  TOO-MANY-IFS-POST-REWRITE
acl2-8.5>  T
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  TOO-MANY-IFS-PRE-REWRITE
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST)
acl2-8.5>  MEMBER-CHAR-STRINGP
acl2-8.5>  TERMINAL-SUBSTRINGP1
acl2-8.5>  TERMINAL-SUBSTRINGP
acl2-8.5>  EVG-OCCUR
acl2-8.5>  MIN-FIXNUM
acl2-8.5>  FN-COUNT-EVG-REC
acl2-8.5>  FN-COUNT-EVG-REC-TYPE-PRESCRIPTION
acl2-8.5>  FN-COUNT-EVG-REC-BOUND
acl2-8.5>  FN-COUNT-EVG-REC
acl2-8.5>  (OCCUR OCCUR-LST)
acl2-8.5>  (WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED
acl2-8.5>                              BASIC-WORSE-THAN-LST1
acl2-8.5>                              BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN
acl2-8.5>                              SOME-SUBTERM-WORSE-THAN-OR-EQUAL
acl2-8.5>                              SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST
acl2-8.5>                              ...)
acl2-8.5>  WORSE-THAN-BUILTIN
acl2-8.5>  WORSE-THAN-OR-EQUAL-BUILTIN
acl2-8.5>  ANCESTOR-LISTP
acl2-8.5>  EARLIER-ANCESTOR-BIGGERP
acl2-8.5>  FN-COUNT-1
acl2-8.5>  FN-COUNT-1-TYPE
acl2-8.5>  FN-COUNT-1
acl2-8.5>  VAR-FN-COUNT-1
acl2-8.5>  SYMBOL-LISTP-CDR-ASSOC-EQUAL
acl2-8.5>  INTEGERP-NTH-0-VAR-FN-COUNT-1
acl2-8.5>  INTEGERP-NTH-1-VAR-FN-COUNT-1
acl2-8.5>  INTEGERP-NTH-2-VAR-FN-COUNT-1
acl2-8.5>  VAR-FN-COUNT-1
acl2-8.5>  EQUAL-MOD-COMMUTING
acl2-8.5>  ANCESTORS-CHECK1
acl2-8.5>  ANCESTORS-CHECK-BUILTIN
acl2-8.5>  MEMBER-EQUAL-MOD-COMMUTING
acl2-8.5>  STRIP-ANCESTOR-LITERALS
acl2-8.5>  T
acl2-8.5>  ANCESTORS-CHECK
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  HONS-COPY-WITH-STATE
acl2-8.5>  IDENTITY-WITH-STATE
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  RW-CACHE-DEBUG-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  RW-CACHE-DEBUG-ACTION-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  RW-CACHEABLE-FAILURE-REASON-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  ALL-DIGITS-P
acl2-8.5>  D-POS-LISTP
acl2-8.5>  POS-LISTP
acl2-8.5>  :REDUNDANT
acl2-8.5>  D-POS-LISTP-FORWARD-TO-TRUE-LISTP
acl2-8.5>  CLAUSE-ID-P
acl2-8.5>  PRINT-CLAUSE-ID-OKP
acl2-8.5>  PRINT-CLAUSE-ID-OKP-BUILTIN
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  ONCEP-TP
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES
acl2-8.5>  POS-LISTP-FORWARD-TO-INTEGER-LISTP
acl2-8.5>  CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE
acl2-8.5>  TRUE-LISTP-CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
acl2-8.5>  TRUE-LISTP-EXPLODE-ATOM
acl2-8.5>  T
acl2-8.5>  STRICT-MERGE-SYMBOL<
acl2-8.5>  T
acl2-8.5>  LD-HISTORY
acl2-8.5>  LD-HISTORY-ENTRY-INPUT
acl2-8.5>  LD-HISTORY-ENTRY-ERROR-FLG
acl2-8.5>  LD-HISTORY-ENTRY-STOBJS-OUT/VALUE
acl2-8.5>  LD-HISTORY-ENTRY-STOBJS-OUT
acl2-8.5>  LD-HISTORY-ENTRY-VALUE
acl2-8.5>  LD-HISTORY-ENTRY-USER-DATA
acl2-8.5>  SET-LD-HISTORY-ENTRY-USER-DATA-DEFAULT
acl2-8.5>  :ATTACHMENTS-RECORDED
acl2-8.5>  24
acl2-8.5>  32
acl2-8.5>  57
acl2-8.5>  *ACL2-PRIMITIVES*
acl2-8.5>  32
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3528)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3527)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3526)
acl2-8.5>  FORMALS
acl2-8.5>  CONSTRAINT-INFO
acl2-8.5>  UNKNOWN-CONSTRAINTS-P
acl2-8.5>  (:DEFUND META-EXTRACT-FORMULA)
acl2-8.5>  TYPE-SET-QUOTE
acl2-8.5>  TYPE-SET-QUOTE
acl2-8.5>  TYPESPEC-CHECK
acl2-8.5>  META-EXTRACT-RW+-TERM
acl2-8.5>  META-EXTRACT-CONTEXTUAL-FACT
acl2-8.5>  REWRITE-RULE-TERM-EXEC
acl2-8.5>  REWRITE-RULE-TERM
acl2-8.5>  LINEAR-LEMMA-TERM-EXEC
acl2-8.5>  LINEAR-LEMMA-TERM
acl2-8.5>  META-EXTRACT-GLOBAL-FACT
acl2-8.5>  FNCALL-TERM
acl2-8.5>  LOGICALLY-EQUIVALENT-STATES
acl2-8.5>  META-EXTRACT-GLOBAL-FACT+
acl2-8.5>  MACRO-ALIASES-TABLE
acl2-8.5>  :SKIPPED
acl2-8.5>  :SKIPPED
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP PACKN1)
acl2-8.5>   (ENCAPSULATE NIL
acl2-8.5>                (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER
acl2-8.5>                               #
acl2-8.5>                               :RULE-CLASSES #))
acl2-8.5>                (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM #
acl2-8.5>                               :RULE-CLASSES #))
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP PACKN-POS)
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL)
acl2-8.5>                (VERIFY-TERMINATION-BOOT-STRAP PACKN)
acl2-8.5>                ...)
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFUN TAILS-AC (LST AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN TAILS (LST)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (MBE :LOGIC (COND # #)
acl2-8.5>               :EXEC (TAILS-AC LST NIL)))
acl2-8.5>   (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (# T) (T #)))
acl2-8.5>   (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN LOOP$-AS-AC (TUPLE AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  FROM-TO-BY-MEASURE
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  :REDUNDANT
acl2-8.5>  SPLIT-SYSTEM-VERIFY-GUARDS-ALIST
acl2-8.5>  :REDUNDANT
acl2-8.5>  NIL
acl2-8.5>  :REDUNDANT
acl2-8.5>  NIL
acl2-8.5>  APPLY$-BADGEP
acl2-8.5>  N-CAR-CADR-CADDR-ETC
acl2-8.5>  :REDUNDANT
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 3583)
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (DEFUN TAILS-AC (LST AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN TAILS (LST)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (MBE :LOGIC (COND # #)
acl2-8.5>               :EXEC (TAILS-AC LST NIL)))
acl2-8.5>   (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (# T) (T #)))
acl2-8.5>   (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# NIL) (T #)))
acl2-8.5>   (DEFUN LOOP$-AS-AC (TUPLE AC)
acl2-8.5>          (DECLARE (XARGS :GUARD # :MODE :PROGRAM))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2 (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM BADGE-USERFN-TYPE #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES NIL))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (DEFSTUB UNTAME-EV$ (X A) T)
acl2-8.5>                (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
acl2-8.5>                          (CONS # #)))).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5> 
acl2-8.5> ACL2 Observation in ( DEFTHM BADGE-USERFN-TYPE ...):  The :TRIGGER-
acl2-8.5> TERMS for the :FORWARD-CHAINING rule BADGE-USERFN-TYPE will consist
acl2-8.5> of the list containing (BADGE-USERFN FN).
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM BADGE-USERFN-TYPE ...):  The term
acl2-8.5> (BADGE-USERFN FN) contains the function symbol BADGE-USERFN, which
acl2-8.5> has a non-recursive definition.  Unless this definition is disabled,
acl2-8.5> (BADGE-USERFN FN) is unlikely ever to occur as a trigger for 
acl2-8.5> BADGE-USERFN-TYPE.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Non-rec] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...):
acl2-8.5> A :REWRITE rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS will
acl2-8.5> be triggered only by terms containing the function symbol UNTAME-APPLY$,
acl2-8.5> which has a non-recursive definition.  Unless this definition is disabled,
acl2-8.5> this rule is unlikely ever to be used.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Subsume] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...):
acl2-8.5> The previously added rule UNTAME-APPLY$ subsumes a newly proposed :REWRITE
acl2-8.5> rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS, in the sense that
acl2-8.5> the old rule rewrites a more general target.  Because the new rule
acl2-8.5> will be tried first, it may nonetheless find application.
acl2-8.5> 
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2 (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM BADGE-USERFN-TYPE #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES NIL))
acl2-8.5>                (ENCAPSULATE (#)
acl2-8.5>                             (LOCAL #)
acl2-8.5>                             (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
acl2-8.5>                                     :RULE-CLASSES #))
acl2-8.5>                (DEFSTUB UNTAME-EV$ (X A) T)
acl2-8.5>                (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
acl2-8.5>                          (CONS # #)))).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2
acl2-8.5>        (DEFUN BADGE (FN)
acl2-8.5>               (DECLARE #)
acl2-8.5>               (COND # # # # # # ...))
acl2-8.5>        (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
acl2-8.5>        (DEFABBREV TAMEP-LAMBDAP (FN)
acl2-8.5>                   (AND # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN TAMEP # # #)
acl2-8.5>                          (DEFUN TAMEP-FUNCTIONP # # #)
acl2-8.5>                          (DEFUN SUITABLY-TAMEP-LISTP # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN APPLY$ # # #)
acl2-8.5>                          (DEFUN APPLY$-LAMBDA # # #)
acl2-8.5>                          (DEFUN EV$ # # #)
acl2-8.5>                          (DEFUN EV$-LIST # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #)
acl2-8.5>                          (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #))
acl2-8.5>        ...)).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (WHEN-PASS-2
acl2-8.5>        (DEFUN BADGE (FN)
acl2-8.5>               (DECLARE #)
acl2-8.5>               (COND # # # # # # ...))
acl2-8.5>        (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
acl2-8.5>        (DEFABBREV TAMEP-LAMBDAP (FN)
acl2-8.5>                   (AND # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN TAMEP # # #)
acl2-8.5>                          (DEFUN TAMEP-FUNCTIONP # # #)
acl2-8.5>                          (DEFUN SUITABLY-TAMEP-LISTP # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN APPLY$ # # #)
acl2-8.5>                          (DEFUN APPLY$-LAMBDA # # #)
acl2-8.5>                          (DEFUN EV$ # # #)
acl2-8.5>                          (DEFUN EV$-LIST # # #))
acl2-8.5>        (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #)
acl2-8.5>                          (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #))
acl2-8.5>        ...)).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP)
acl2-8.5>   (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W)
acl2-8.5>                            (DECLARE #)
acl2-8.5>                            (COND # # # # #))
acl2-8.5>                     (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W)
acl2-8.5>                            (DECLARE #)
acl2-8.5>                            (COND # #)))
acl2-8.5>   (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS
acl2-8.5>          (FNS WRLD ACC)
acl2-8.5>          (DECLARE (XARGS :GUARD #))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN NEW-VERIFY-GUARDS-FNS1
acl2-8.5>          (WRLD INSTALLED-WRLD ACC)
acl2-8.5>          (DECLARE (XARGS :GUARD #))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   (DEFUN NEW-VERIFY-GUARDS-FNS (STATE)
acl2-8.5>          (DECLARE (XARGS :STOBJS STATE))
acl2-8.5>          (LET (#)
acl2-8.5>               (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5>  "ACL2"
acl2-8.5>  SAFE-ACCESS-COMMAND-TUPLE-FORM
acl2-8.5>  ACL2-SYSTEM-NAMEP
acl2-8.5>  (SYSTEM-PSEUDO-TERMP SYSTEM-PSEUDO-TERM-LISTP)
acl2-8.5>  PAIR-FNS-WITH-MEASURED-SUBSETS
acl2-8.5>  NEW-VERIFY-GUARDS-FNS1
acl2-8.5>  NEW-VERIFY-GUARDS-FNS
acl2-8.5>  :REDUNDANT
acl2-8.5>  *DEVEL-CHECK-BOOK*
acl2-8.5>  CHK-NEW-VERIFIED-GUARDS
acl2-8.5>  SYSTEM-VERIFY-GUARDS-AUX
acl2-8.5>  CONS-ABSOLUTE-EVENT-NUMBERS
acl2-8.5>  SORT->-ABSOLUTE-EVENT-NUMBER
acl2-8.5>  SYSTEM-VERIFY-GUARDS
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EQUAL-X-CONSTANT))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS EQUAL-X-CONSTANT)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MATCH-TESTS-AND-BINDINGS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MATCH-TESTS-AND-BINDINGS)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MATCH-CLAUSE-LIST (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE-LIST)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-KEYWORDP))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-KEYWORDP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLE-OR-CONSTANT-NAMEP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLE-OR-CONSTANT-NAMEP)), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLEP))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLEP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP1)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-FIRST-BAD-ARG)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEWLINE))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS NEWLINE)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WRITE-FOR-READ))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WRITE-FOR-READ)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILLEGAL-FMT-STRING))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ILLEGAL-FMT-STRING)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SCAN-PAST-WHITESPACE (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SCAN-PAST-WHITESPACE)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ZERO-ONE-OR-MORE))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ZERO-ONE-OR-MORE)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FIND-ALTERNATIVE-SKIP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-SKIP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FIND-ALTERNATIVE-START1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START1)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-CHAR))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMT-CHAR)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FIND-ALTERNATIVE-STOP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-STOP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-VAR))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMT-VAR)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STANDARD-EVISC-TUPLEP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STANDARD-EVISC-TUPLEP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WORLD-EVISCERATION-ALIST))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WORLD-EVISCERATION-ALIST)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ABBREV-EVISC-TUPLE))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ABBREV-EVISC-TUPLE)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FMX-CW-MSG-1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG-1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-MSG))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN-GUARD))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN-GUARD)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX!-CW-FN))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FMX!-CW-FN)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PUSH-IO-RECORD))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS PUSH-IO-RECORD)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SAVED-OUTPUT-TOKEN-P))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SAVED-OUTPUT-TOKEN-P)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING-OFF-P1))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WARNING-OFF-P1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OBSERVATION1-CW))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS OBSERVATION1-CW)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFSTOBJ-FNNAME-KEY2))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DEFSTOBJ-FNNAME-KEY2)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (DOUBLET-LISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DOUBLET-LISTP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFSTOBJ-FNNAME))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DEFSTOBJ-FNNAME)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STOBJP))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STOBJP)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THE-LIVE-VAR))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THE-LIVE-VAR)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FIND-DOT-DOT (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FIND-DOT-DOT)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (COMMENT-STRING-P1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COMMENT-STRING-P1)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COMMENT-STRING-P))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COMMENT-STRING-P)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PRINT-CONTROL-P))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS PRINT-CONTROL-P)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-CONSTANTP))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LEGAL-CONSTANTP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (COLLECT-NON-X (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT-NON-X)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS PLIST-WORLDP-WITH-FORMALS)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ARITY)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFUN-MODE))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DEFUN-MODE)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (ARITIES-OKP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ARITIES-OKP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LATEST-BODY))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LATEST-BODY)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEF-BODY))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DEF-BODY)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (>=-LEN (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS >=-LEN)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (ALL->=-LEN (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ALL->=-LEN)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (STRIP-CADRS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STRIP-CADRS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CONS-TERM1-MV2))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CONS-TERM1-MV2)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SUBLIS-VAR1 (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (SUBLIS-VAR1-LST (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR-LST))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR-LST)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                                 (SUBCOR-VAR (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR-LST)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEW-NAMEP))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS NEW-NAMEP)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (TERM-LISTP (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                                     (TERMP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TERM-LISTP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TERM-LIST-LISTP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ACCESS-COMMAND-TUPLE-NUMBER))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ACCESS-COMMAND-TUPLE-NUMBER)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (SUBST-VAR-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                                  (SUBST-VAR (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBST-VAR-LST)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (ALL-FNNAMES1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ALL-FNNAMES1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (STRING-PREFIXP-1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP-1)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (REMOVE-GUARD-HOLDERS1-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (REMOVE-GUARD-HOLDERS1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS1-LST)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS-WEAK))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS-WEAK)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (COLLECT-BY-POSITION (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT-BY-POSITION)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MAKE-LAMBDA-APPLICATION))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MAKE-LAMBDA-APPLICATION)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ER-CMP-FN))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ER-CMP-FN)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SILENT-ERROR))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SILENT-ERROR)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING1-CW))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WARNING1-CW)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (CHK-LENGTH-AND-KEYS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CHK-LENGTH-AND-KEYS)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUPLICATE-KEYS-ACTION))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DUPLICATE-KEYS-ACTION)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-INITP))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LEGAL-INITP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MACRO-ARGLIST-KEYSP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-KEYSP)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-AFTER-RESTP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-AFTER-RESTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MACRO-ARGLIST-OPTIONALP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-OPTIONALP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MACRO-ARGLIST1P (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST1P)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SUBSEQUENCEP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBSEQUENCEP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (COLLECT-LAMBDA-KEYWORDPS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT-LAMBDA-KEYWORDPS)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS-STRUCTUREP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS-STRUCTUREP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (BIND-MACRO-ARGS-KEYS1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-KEYS1)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-KEYS))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-KEYS)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-AFTER-REST))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-AFTER-REST)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (BIND-MACRO-ARGS-OPTIONAL (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-OPTIONAL)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (BIND-MACRO-ARGS1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS1)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (FFNNAMEP-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                                   (FFNNAMEP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FFNNAMEP-LST)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAME-TYPE))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAME-TYPE)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CHK-ALL-BUT-NEW-NAME-CMP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CHK-ALL-BUT-NEW-NAME-CMP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FORMALIZED-VARLISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FORMALIZED-VARLISTP)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P1))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P1)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (ALIST-TO-DOUBLETS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ALIST-TO-DOUBLETS)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEREF-MACRO-NAME))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DEREF-MACRO-NAME)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>          (WEAK-BADGE-USERFN-STRUCTURE-ALISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WEAK-BADGE-USERFN-STRUCTURE-ALISTP)), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PLIST-WORLDP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ILKS-PLIST-WORLDP)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PER-ARGUMENT-SLOT))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ILKS-PER-ARGUMENT-SLOT)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (LOGIC-FNSP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LISTP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERMP))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERMP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LISTP))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LISTP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LIST-LISTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LIST-LISTP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LIST-LISTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER1))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER1)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RUNEP))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS RUNEP)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FNUME))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FNUME)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TRANSLATE-ABBREV-RUNE))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TRANSLATE-ABBREV-RUNE)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-STRUCTURE-P))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ENABLED-STRUCTURE-P)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-NUMEP))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ENABLED-NUMEP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-RUNEP))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ENABLED-RUNEP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENS))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ENS)), in the context of a book or an encapsulate
acl2-8.5> event.  Therefore, no logical claims may be soundly made in this context.
acl2-8.5> See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (STRIP-CADDRS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STRIP-CADDRS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (IMPLICATE))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS IMPLICATE)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SUBST-EXPR1-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (SUBST-EXPR1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR1-LST)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR-ERROR))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR-ERROR)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (CLEAN-BRR-STACK1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK1)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MERGE-TERM-ORDER (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MERGE-TERM-ORDER)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MERGE-SORT-TERM-ORDER (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-TERM-ORDER)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (LAMBDA-SUBTERMP (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (LAMBDA-SUBTERMP-LST (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-SUBTERMP)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (TERMIFY-CLAUSE-SET (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TERMIFY-CLAUSE-SET)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAMEP))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAMEP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RELATIVIZE-BOOK-PATH))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS RELATIVIZE-BOOK-PATH)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MERGE-SYMBOL< (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MERGE-SYMBOL<)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MERGE-SORT-SYMBOL< (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-SYMBOL<)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OVERRIDE-HINTS))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS OVERRIDE-HINTS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SCAN-TO-CLTL-COMMAND (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SCAN-TO-CLTL-COMMAND)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (REMOVE-LAMBDAS-LST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (REMOVE-LAMBDAS1 (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS-LST)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>           (STRIP-NON-HIDDEN-PACKAGE-NAMES (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS STRIP-NON-HIDDEN-PACKAGE-NAMES)), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (BACKCHAIN-LIMIT-LISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BACKCHAIN-LIMIT-LISTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (ARITY-ALISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ARITY-ALISTP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (DISABLEDP-FN-LST (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN-LST)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MACRO-VARS-KEY (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-KEY)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-AFTER-REST))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-AFTER-REST)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (MACRO-VARS-OPTIONAL (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-OPTIONAL)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THEORY-INVARIANT-TABLE-GUARD))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THEORY-INVARIANT-TABLE-GUARD)), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-P))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-P)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SYSFILE-OR-STRING-LISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-OR-STRING-LISTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (TTAG-ALISTP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TTAG-ALISTP)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CERT-ANNOTATIONSP))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CERT-ANNOTATIONSP)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (INCLUDE-BOOK-DIR))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS INCLUDE-BOOK-DIR)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ADD-SUFFIX-TO-FN))), in
acl2-8.5> the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ADD-SUFFIX-TO-FN)), in the context of a
acl2-8.5> book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FSUBCOR-VAR (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (FSUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FSUBCOR-VAR)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (TAILS-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TAILS-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (TAILS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS TAILS)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (EMPTY-LOOP$-AS-TUPLEP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS EMPTY-LOOP$-AS-TUPLEP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (CAR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CAR-LOOP$-AS-TUPLE)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (CDR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS CDR-LOOP$-AS-TUPLE)), in the context of
acl2-8.5> a book or an encapsulate event.  Therefore, no logical claims may be
acl2-8.5> soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (FROM-TO-BY-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (FROM-TO-BY (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (REVAPPEND-TRUE-LIST-FIX (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS REVAPPEND-TRUE-LIST-FIX)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-RW+-TERM))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-RW+-TERM)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-CONTEXTUAL-FACT))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-CONTEXTUAL-FACT)), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-GLOBAL-FACT+))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-GLOBAL-FACT+)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5>  T
acl2-8.5>  APPLY$-PRIM
acl2-8.5>  BADGE
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 4264)
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (SUITABLY-TAMEP-LISTP (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (TAMEP-FUNCTIONP (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (TAMEP (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUITABLY-TAMEP-LISTP)), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (EV$ (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (APPLY$ (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (EV$-LIST (DECLARE (XARGS :MEASURE #)))
acl2-8.5>                   (APPLY$-LAMBDA (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS EV$)), in the context of a book or an encapsulate
acl2-8.5> event.  Therefore, no logical claims may be soundly made in this context.
acl2-8.5> See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS UNTIL$-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS UNTIL$)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (WHEN$-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WHEN$-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (WHEN$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WHEN$)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (WHEN$+-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WHEN$+-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (WHEN$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS WHEN$+)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (SUM$-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUM$-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (SUM$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUM$)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (SUM$+-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUM$+-AC)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (SUM$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS SUM$+)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ALWAYS$)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS ALWAYS$+)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (THEREIS$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THEREIS$)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (THEREIS$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS THEREIS$+)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT$-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT$)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
acl2-8.5>                   (COLLECT$+-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT$+-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>    (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS COLLECT$+)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP (APPEND$-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS APPEND$-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>      (VERIFY-TERMINATION-BOOT-STRAP (APPEND$ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS APPEND$)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>  (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+-AC (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS APPEND$+-AC)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS
acl2-8.5>     (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+ (DECLARE (XARGS :MEASURE #))))),
acl2-8.5> in the context of a book or an encapsulate event.  Therefore, no logical
acl2-8.5> claims may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> (See :DOC set-iprint to be able to see elided values in this message.)
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS APPEND$+)), in the context of a book or
acl2-8.5> an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPLY$-PRIM))), in the
acl2-8.5> context of a book or an encapsulate event.  Therefore, no logical claims
acl2-8.5> may be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS APPLY$-PRIM)), in the context of a book
acl2-8.5> or an encapsulate event.  Therefore, no logical claims may be soundly
acl2-8.5> made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BADGE))), in the context
acl2-8.5> of a book or an encapsulate event.  Therefore, no logical claims may
acl2-8.5> be soundly made in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
acl2-8.5> "Skip-proofs" ...) ...):  ACL2 has encountered a SKIP-PROOFS form,
acl2-8.5> (SKIP-PROOFS (VERIFY-GUARDS BADGE)), in the context of a book or an
acl2-8.5> encapsulate event.  Therefore, no logical claims may be soundly made
acl2-8.5> in this context.  See :DOC SKIP-PROOFS.
acl2-8.5> 
acl2-8.5>  T
acl2-8.5>  SYSTEM-EVENT
acl2-8.5>  SYSTEM-EVENTS-FN
acl2-8.5>  SYSTEM-EVENTS
acl2-8.5>  CHECK-SYSTEM-EVENTS
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 4394)
acl2-8.5>  (:NUMBER-OF-ENABLED-RUNES 4384)
acl2-8.5>  APPLY$-EQUIVALENCE
acl2-8.5>  FN-EQUAL
acl2-8.5>  FN-EQUAL-IS-AN-EQUIVALENCE
acl2-8.5>  NATP-FROM-TO-BY-MEASURE
acl2-8.5>  MEMPOS
acl2-8.5>  T
acl2-8.5>  NIL
acl2-8.5>  :SKIPPED
acl2-8.5>  DEFDEPRECATE
acl2-8.5>  4489
acl2-8.5>  END-OF-PASS-2
acl2-8.5> 
acl2-8.5> Finished loading 
acl2-8.5> '((IN-PACKAGE "ACL2")
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM)
acl2-8.5>   (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP)
acl2-8.5>   (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W)
acl2-8.5>                            (DECLARE #)
acl2-8.5>                            (COND # # # # #))
acl2-8.5>                     (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W)
acl2-8.5>                            (DECLARE #)
acl2-8.5>                            (COND # #)))
acl2-8.5>   (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS
acl2-8.5>          (FNS WRLD ACC)
acl2-8.5>          (DECLARE (XARGS :GUARD #))
acl2-8.5>          (COND (# #) (T #)))
acl2-8.5>   (DEFUN NEW-VERIFY-GUARDS-FNS1
acl2-8.5>          (WRLD INSTALLED-WRLD ACC)
acl2-8.5>          (DECLARE (XARGS :GUARD #))
acl2-8.5>          (COND (# #) (# #) (T #)))
acl2-8.5>   (DEFUN NEW-VERIFY-GUARDS-FNS (STATE)
acl2-8.5>          (DECLARE (XARGS :STOBJS STATE))
acl2-8.5>          (LET (#)
acl2-8.5>               (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL)))
acl2-8.5>   ...).
acl2-8.5> 
acl2-8.5> 
acl2-8.5> ACL2 loading '((COMP-FN :EXEC NIL "1" STATE)).
acl2-8.5>  NIL
acl2-8.5> 
acl2-8.5> Finished loading '((COMP-FN :EXEC NIL "1" STATE)).
acl2-8.5> 
acl2-8.5> ******************************************************************************
acl2-8.5>           Initialization complete, beginning the check and save.
acl2-8.5> ******************************************************************************
acl2-8.5> [undoing binding stack and other enclosing state... done]
acl2-8.5> [performing final GC... done]
acl2-8.5> [saving current Lisp image into /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/nsaved_acl2.core:
acl2-8.5> writing 9248 bytes from the static space at 0x50100000
acl2-8.5> writing 193396736 bytes from the dynamic space at 0x1000000000
acl2-8.5> writing 21483472 bytes from the read-only space at 0xffeb80000
acl2-8.5> done]
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> Initialization SUCCEEDED.
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> if [ -f worklispext ]; then make move-to-old LISPEXT=`cat worklispext` ;\
acl2-8.5> elif [ -f saved_acl2 ]; then \
acl2-8.5> mv -f saved_acl2 osaved_acl2 ;\
acl2-8.5> else \
acl2-8.5> touch saved_acl2 ;\
acl2-8.5> mv -f saved_acl2 osaved_acl2 ;\
acl2-8.5> fi
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> if [ -f saved_acl2 ] && [ -f saved_acl2.core ]; then \
acl2-8.5> echo "Moving " saved_acl2.core " to osaved_acl2.core"; \
acl2-8.5> mv -f saved_acl2.core osaved_acl2.core; \
acl2-8.5> cat saved_acl2 | sed -e 's/saved_acl2.core$/osaved_acl2.core/' > osaved_acl2 ;\
acl2-8.5> chmod 775 osaved_acl2 ;\
acl2-8.5> rm -f saved_acl2 ; fi
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> mv -f nsaved_acl2 saved_acl2
acl2-8.5> if [ -f worklispext ]; then make move-new LISPEXT=`cat worklispext` ; fi
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> if [ -f nsaved_acl2.core ]; then \
acl2-8.5> mv -f nsaved_acl2.core saved_acl2.core ; fi
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f worklispext
acl2-8.5> rm -f workxxx
acl2-8.5> make do_saved
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -fr saved
acl2-8.5> mkdir saved
acl2-8.5> chmod 775 saved
acl2-8.5> cp *.lisp acl2-characters GNUmakefile saved/
acl2-8.5> chmod 666 saved/*
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> rm -f workxxx
acl2-8.5> make chmod_image
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> if [ -f saved_acl2 ]; then \
acl2-8.5> chmod 775 saved_acl2 ;\
acl2-8.5> fi
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> Successfully built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2.
acl2-8.5> make[1]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2'
acl2-8.5> buildPhase completed in 10 minutes 35 seconds
acl2-8.5> running tests
acl2-8.5> check flags: -j48 SHELL=/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash LISP=/nix/store/w5lnyhjh5557nnnmf9q541vbjzs07mz8-sbcl-2.3.0/bin/sbcl ACL2_MAKE_LOG=NONE VERBOSE=y mini-proveall
acl2-8.5> Mini-proveall passed.
acl2-8.5> installing
acl2-8.5> post-installation fixup
acl2-8.5> shrinking RPATHs of ELF executables and libraries in /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
acl2-8.5> shrinking /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/schmaltz-al-sammane-et-al/support/acl2link
acl2-8.5> rewriting symlink /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/bin/acl2-cert to be relative to /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
acl2-8.5> rewriting symlink /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/bin/acl2-clean to be relative to /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
acl2-8.5> rewriting symlink /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/bin/acl2 to be relative to /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
acl2-8.5> strip is /nix/store/wn31i3dzwahz6ccws8bs1nwyqrpgsvj7-gcc-wrapper-11.3.0/bin/strip
acl2-8.5> stripping (with command strip and flags -S) in  /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/bin
acl2-8.5> patching script interpreter paths in /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/new-useless-runes-files.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/make-fancy-manual.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/acl2: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/pull.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/make-tags-acl2-doc.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/bin/purity.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/doc/create-acl2-code-size: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/doc/create-doc: interpreter directive changed from "#! /bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/emacsclient-wrapper.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fancy/zip.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fancy/xdata2html.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fancy/xdataget.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fancy/xdata2sql.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fancy/xdata2sql4seo.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/book-conflicts/find-conflicts-here: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/book-conflicts/find-conflicts-files: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/quicklisp/update-libs.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/quicklisp/clean.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/vandenbroek-schmaltz/GeNoC/SubstMkf: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2020/gamboa-cowles-gamboa/build.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2018/kaufmann/write-td-cands.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/features.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/slowevents.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/compare.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/cert.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/make_cert_help.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/memsum.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/wait.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/clean.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/critpath.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/stats.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/etags.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/startjob: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-ccl-acl2h.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-gcl-ansi-acl2h.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-ccl-acl2.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-gcl-cltl1-acl2.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-ccl-acl2r.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/deprecated/build-sbcl-acl2h.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/build-multi.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/jenkins/build-single.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/write-td-cands.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/get-process-id.sh: interpreter directive changed from "#!/bin/bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/c/atc/tests/run.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/c/atc/tests/compile.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/java/atj/tests/compile.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/java/atj/tests/run.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/hdwallet/wallet: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/hdwallet/wallet-tests.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/host-before-bridge.sh: interpreter directive changed from "#!/bin/bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/clean.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/sharedlibtest/test.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/sharedlibtest/clean.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/sharedlibtest/myapp-wrap.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/satlink/add-benchmark.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/satlink/solvers/riss3g-cert: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/satlink/solvers/glucose-cert: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/vl/kit/server-demo/demo.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/vl2014/systest/errcheck.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/getopt/demo2-test.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/pcert.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/interface/macl2: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/tactics/macl2: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/pcert-scan.pl: interpreter directive changed from "#!/usr/bin/env perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level6/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level10/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/user/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/utilities/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level2/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level8/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/logic/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level5/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level11/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level7/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level4/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level9/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/ACL2/bootstrap/level3/symmetry: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/Proofs/zip-proofs.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/Proofs/clean-proofs.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/final-checks.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/milawa-cmucl: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/milawa-scl: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/milawa-sbcl: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/milawa-ccl: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/milawa-acl: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/translators/l3-to-acl2/examples/thacker/run-test.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/security/jfkr/make-etags.sh: interpreter directive changed from "#!/usr/bin/env bash" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/stobj-based/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/incremental/cnf_diff.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/incremental/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/sorted/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/cube/run.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/build: interpreter directive changed from "#! /bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/clean: interpreter directive changed from "#! /bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/run: interpreter directive changed from "#! /bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/SULFA/scripts/make_results: interpreter directive changed from "#!/usr/bin/perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/SULFA/scripts/sulfa-smt-saved-exec: interpreter directive changed from "#!/lusr/bin/perl" to "/nix/store/n48i43wkly6kfhxz4ypcxbsv2pr7ggzh-perl-5.36.0/bin/perl"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/tests/make-lstest.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/tests/makelink.sh: interpreter directive changed from "#!/bin/sh" to "/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/sh"
acl2-8.5> checking for references to /build/ in /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5...
acl2-8.5> fixupPhase completed in 2 minutes 15 seconds
acl2-8.5> certifyBooksPhase
acl2-8.5> /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2
acl2-8.5> build flags: -j48 SHELL=/nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash ACL2=/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2 all
acl2-8.5> ACL2_SYSTEM_BOOKS is /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books
acl2-8.5> Determining ACL2 features (for ACL2 = /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2)
acl2-8.5> Determining whether Glucose is installed
acl2-8.5> Determining whether an ipasir shared library is installed
acl2-8.5> Determining whether ABC is installed
acl2-8.5> Determining whether Z3 is installed, for use by SMTLink
acl2-8.5> Determining whether STP is installed
acl2-8.5> ACL2_HAS_ANSI       := 1
acl2-8.5> ACL2_HAS_PARALLEL   := 
acl2-8.5> ACL2_HAS_REALS      := 
acl2-8.5> ACL2_HAS_ACL2_DEVEL := 
acl2-8.5> ACL2_COMP_EXT       := fasl
acl2-8.5> ACL2_HOST_LISP      := SBCL
acl2-8.5> OS_HAS_ABC          := 1
acl2-8.5> OS_HAS_GLUCOSE      := 1
acl2-8.5> OS_HAS_IPASIR       := 1
acl2-8.5> OS_HAS_SMTLINK      := 1
acl2-8.5> OS_HAS_STP          := 
acl2-8.5> USE_QUICKLISP       := 1
acl2-8.5> ACL2_USELESS_RUNES  := -25
acl2-8.5> Done with features.
acl2-8.5> Scanning for books...
acl2-8.5> 
acl2-8.5> real	0m0.079s
acl2-8.5> user	0m0.022s
acl2-8.5> sys	0m0.056s
acl2-8.5> Scanning for dependencies...
acl2-8.5> 
acl2-8.5> real	7m39.974s
acl2-8.5> user	1m20.388s
acl2-8.5> sys	0m1.734s
acl2-8.5> Done scanning.
acl2-8.5> Reading book deps Makefile-deps created on Thu Oct 15 21:18:32 UTC 2026
acl2-8.5> Excluding books that are CCL-only: []
acl2-8.5> Excluding non-SBCL books: [demos/meta-wf-guarantee-example.cert]
acl2-8.5> Excluding books that need STP: [kestrel/axe/defthm-stp-tests.cert kestrel/axe/prove-with-stp-tests.cert kestrel/axe/query-tests.cert kestrel/axe/stp-clause-processor-tests.cert kestrel/axe/tactic-prover-tests.cert kestrel/axe/tests-top.cert kestrel/axe/x86/examples/popcount/popcount-32-proof.cert kestrel/axe/x86/examples/popcount/popcount-64-proof.cert kestrel/axe/x86/examples/popcount/top.cert kestrel/axe/x86/examples/top.cert]
acl2-8.5> Excluding ACL2(r)-only books: [nonstd/arc-length/length-of-a-rectifiable-curve.cert nonstd/circles/area-of-a-circle/area-of-a-circle-1.cert nonstd/circles/area-of-a-circle/area-of-a-circle-2.cert nonstd/circles/circumference-of-a-circle.cert nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/integrals/u-substitution.cert nonstd/nsa/Banach-Tarski/banach-tarski-b-0.cert nonstd/nsa/Banach-Tarski/banach-tarski-s2.cert nonstd/nsa/Banach-Tarski/banach-tarski.cert nonstd/nsa/Banach-Tarski/countable-sets.cert nonstd/nsa/Banach-Tarski/free-group.cert nonstd/nsa/Banach-Tarski/groups.cert nonstd/nsa/Banach-Tarski/hausdorff-paradox-1.cert nonstd/nsa/Banach-Tarski/hausdorff-paradox-2.cert nonstd/nsa/Banach-Tarski/rotations.cert nonstd/nsa/Banach-Tarski/supportive-theorems.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2022/gamboa-primitive-roots/order-constructions.cert workshops/2022/gamboa-primitive-roots/pfield-polynomial.cert]
acl2-8.5> Note: Skipping system/toothbrush/success.txt for host Lisp SBCL.
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/mini-theories.cert on 15-Oct-2026 21:18:33.358
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/portcullis.cert on 15-Oct-2026 21:18:33.359
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/banner.cert on 15-Oct-2026 21:18:33.359
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/basic-arithmetic-helper.cert on 15-Oct-2026 21:18:33.361
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-defuns.cert on 15-Oct-2026 21:18:33.386
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/distributivity.cert on 15-Oct-2026 21:18:33.382
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/we-are-here.cert on 15-Oct-2026 21:18:33.387
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/book-thms.cert on 15-Oct-2026 21:18:33.378
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/real-listp.cert on 15-Oct-2026 21:18:33.386
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/mv-nth.cert on 15-Oct-2026 21:18:33.404
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert on 15-Oct-2026 21:18:33.419
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/ground-zero.cert on 15-Oct-2026 21:18:33.469
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/pseudo-termp-lemmas.cert on 15-Oct-2026 21:18:33.476
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/cat-def.cert on 15-Oct-2026 21:18:33.497
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/observation1-cw.cert on 15-Oct-2026 21:18:33.506
acl2-8.5> make[1]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support'
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/portcullis.cert on 15-Oct-2026 21:18:33.547
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/basic-arithmetic-helper.cert on 15-Oct-2026 21:18:33.565
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logior1-proofs.cert on 15-Oct-2026 21:18:33.576
acl2-8.5> Updating dependencies in /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/default-hint.cert on 15-Oct-2026 21:18:33.560
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/banner.cert on 15-Oct-2026 21:18:33.698
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rewrite-theory.cert on 15-Oct-2026 21:18:33.747
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/term-defuns.cert on 15-Oct-2026 21:18:33.809
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/building-blocks.cert on 15-Oct-2026 21:18:33.812
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rom-helpers.cert on 15-Oct-2026 21:18:33.824
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/openers.cert on 15-Oct-2026 21:18:33.826
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-definitions.cert on 15-Oct-2026 21:18:33.891
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/realp.cert on 15-Oct-2026 21:18:33.903
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/util.cert on 15-Oct-2026 21:18:33.950
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/negative-syntaxp.cert on 15-Oct-2026 21:18:33.959
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/remove-hyp.cert on 15-Oct-2026 21:18:34.059
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logs.cert on 15-Oct-2026 21:18:34.052
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/package-defs.cert on 15-Oct-2026 21:18:34.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help.cert on 15-Oct-2026 21:18:34.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/ev-find-rules.cert on 15-Oct-2026 21:18:34.086
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/no-duplicates.cert on 15-Oct-2026 21:18:34.109
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/definline.cert on 15-Oct-2026 21:18:34.097
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/portcullis.cert on 15-Oct-2026 21:18:34.129
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/sublis-var.cert on 15-Oct-2026 21:18:34.127
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-minimal-2d.cert on 15-Oct-2026 21:18:34.149
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/banner.cert (0.774s) at 15-Oct-2026 21:18:34.161
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-maximal-2d.cert on 15-Oct-2026 21:18:34.171
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-defuns.cert (0.790s) at 15-Oct-2026 21:18:34.191
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/evalable-printing.cert on 15-Oct-2026 21:18:34.188
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/banner.cert (0.557s) at 15-Oct-2026 21:18:34.286
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/kaufmann/support/tool/wrapper.cert on 15-Oct-2026 21:18:34.262
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defmacfun.cert on 15-Oct-2026 21:18:34.286
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert (0.883s) at 15-Oct-2026 21:18:34.329
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/verified-termination-and-guards.cert on 15-Oct-2026 21:18:34.286
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/cat-def.cert (0.845s) at 15-Oct-2026 21:18:34.361
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/real-listp.cert (0.939s) at 15-Oct-2026 21:18:34.363
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/pseudo-termp-lemmas.cert (0.877s) at 15-Oct-2026 21:18:34.379
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-termp-lemmas.cert on 15-Oct-2026 21:18:34.376
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/inverted-factor.cert on 15-Oct-2026 21:18:34.279
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rewrite-theory.cert (0.654s) at 15-Oct-2026 21:18:34.418
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/doc-section.cert on 15-Oct-2026 21:18:34.413
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/progn-bang-enh.cert on 15-Oct-2026 21:18:34.472
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/all-ones.cert on 15-Oct-2026 21:18:34.407
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/predicate.cert on 15-Oct-2026 21:18:34.344
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/redefun.cert on 15-Oct-2026 21:18:34.564
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/package-defs.cert (0.481s) at 15-Oct-2026 21:18:34.578
acl2-8.5> Using ACL2=/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2
acl2-8.5> make[2]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support'
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/gentle.cert on 15-Oct-2026 21:18:34.598
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/basis.cert on Thu Oct 15 21:18:34 UTC 2026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/mv-nth.cert (1.191s) at 15-Oct-2026 21:18:34.636
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/computed-hint-rewrite.cert on 15-Oct-2026 21:18:34.669
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/distributivity.cert (1.294s) at 15-Oct-2026 21:18:34.717
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/we-are-here.cert (1.336s) at 15-Oct-2026 21:18:34.748
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/ev-find-rules.cert (0.653s) at 15-Oct-2026 21:18:34.768
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/evalable-printing.cert (0.572s) at 15-Oct-2026 21:18:34.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/u32-listp.cert on 15-Oct-2026 21:18:34.807
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/legal-variablep.cert on 15-Oct-2026 21:18:34.853
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/list-defuns.cert on 15-Oct-2026 21:18:34.862
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/f-put-global.cert on 15-Oct-2026 21:18:34.877
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/progn-bang-enh.cert (0.418s) at 15-Oct-2026 21:18:34.906
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/remove-hyp.cert (0.839s) at 15-Oct-2026 21:18:34.909
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/portcullis.cert on 15-Oct-2026 21:18:34.925
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/rewrite-code.cert on 15-Oct-2026 21:18:34.944
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-termp-lemmas.cert (0.592s) at 15-Oct-2026 21:18:34.997
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/predicate.cert (0.467s) at 15-Oct-2026 21:18:35.034
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/defstruct-parsing.cert on 15-Oct-2026 21:18:35.053
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/redefun.cert (0.500s) at 15-Oct-2026 21:18:35.081
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/arrays.cert on 15-Oct-2026 21:18:35.066
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/inline-book.cert on 15-Oct-2026 21:18:35.103
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/observation1-cw.cert (1.591s) at 15-Oct-2026 21:18:35.121
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/verified-termination-and-guards.cert (0.779s) at 15-Oct-2026 21:18:35.129
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/orderedp.cert on 15-Oct-2026 21:18:35.149
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/how-many.cert on 15-Oct-2026 21:18:35.202
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/portcullis.cert (1.654s) at 15-Oct-2026 21:18:35.227
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/u32-listp.cert (0.439s) at 15-Oct-2026 21:18:35.258
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/all-ones.cert (0.678s) at 15-Oct-2026 21:18:35.265
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/kaufmann/support/tool/wrapper.cert (0.915s) at 15-Oct-2026 21:18:35.275
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/portcullis.cert (1.887s) at 15-Oct-2026 21:18:35.276
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/basic-arithmetic-helper.cert on 15-Oct-2026 21:18:35.272
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/find-subterms.cert on 15-Oct-2026 21:18:35.324
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defconst-fast.cert on 15-Oct-2026 21:18:35.274
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/inverted-factor.cert on 15-Oct-2026 21:18:35.338
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/negative-syntaxp.cert on 15-Oct-2026 21:18:35.357
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/ground-zero.cert on 15-Oct-2026 21:18:35.348
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/predicate.cert on 15-Oct-2026 21:18:35.389
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/default-hint.cert (1.826s) at 15-Oct-2026 21:18:35.428
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/factorial.cert on 15-Oct-2026 21:18:35.459
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/inverted-factor.cert (1.106s) at 15-Oct-2026 21:18:35.512
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/perm.cert on 15-Oct-2026 21:18:35.501
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/sublis-var.cert (1.428s) at 15-Oct-2026 21:18:35.583
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/basic-arithmetic-helper.cert (1.989s) at 15-Oct-2026 21:18:35.583
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/sumlist.cert on 15-Oct-2026 21:18:35.582
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/f-put-global.cert (0.718s) at 15-Oct-2026 21:18:35.607
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/ground-zero.cert (2.139s) at 15-Oct-2026 21:18:35.636
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/bdd-primitives.cert on 15-Oct-2026 21:18:35.632
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/realp.cert (1.707s) at 15-Oct-2026 21:18:35.654
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/portcullis.cert (0.705s) at 15-Oct-2026 21:18:35.663
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/bool-ops.cert on 15-Oct-2026 21:18:35.653
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/how-many.cert (0.461s) at 15-Oct-2026 21:18:35.672
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test$$6.cert on 15-Oct-2026 21:18:35.672
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test$5.cert on 15-Oct-2026 21:18:35.677
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/ground-zero.cert (0.349s) at 15-Oct-2026 21:18:35.724
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/arrays.cert (0.640s) at 15-Oct-2026 21:18:35.731
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/orderedp.cert (0.567s) at 15-Oct-2026 21:18:35.756
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test4.cert on 15-Oct-2026 21:18:35.753
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test2.foo$.cert on 15-Oct-2026 21:18:35.773
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/basic-arithmetic-helper.cert (0.495s) at 15-Oct-2026 21:18:35.781
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/list-defuns.cert (0.893s) at 15-Oct-2026 21:18:35.783
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/gentle.cert (1.151s) at 15-Oct-2026 21:18:35.787
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logs.cert (1.670s) at 15-Oct-2026 21:18:35.803
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/total-order.cert on Thu Oct 15 21:18:35 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test1.cert on 15-Oct-2026 21:18:35.826
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/openers.cert (1.998s) at 15-Oct-2026 21:18:35.852
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test3.bar.cert on 15-Oct-2026 21:18:35.842
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/thm-base.cert on 15-Oct-2026 21:18:35.872
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test1$.cert on 15-Oct-2026 21:18:35.870
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/legal-variablep.cert (1.058s) at 15-Oct-2026 21:18:35.920
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/factorial.cert (0.454s) at 15-Oct-2026 21:18:35.923
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test2.foo.cert on 15-Oct-2026 21:18:35.923
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/s32-listp.cert on 15-Oct-2026 21:18:35.922
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test3.$bar.cert on 15-Oct-2026 21:18:35.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bed/portcullis.cert on 15-Oct-2026 21:18:35.934
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/negative-syntaxp.cert (0.514s) at 15-Oct-2026 21:18:35.944
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/rewrite-code.cert (1.038s) at 15-Oct-2026 21:18:36.013
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/defrstobj2/portcullis.cert on 15-Oct-2026 21:18:36.008
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/predicate.cert (0.609s) at 15-Oct-2026 21:18:36.019
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/inverted-factor.cert (0.681s) at 15-Oct-2026 21:18:36.039
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/acceptable-rewrite-rule-p.cert on 15-Oct-2026 21:18:36.027
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/building-blocks.cert (2.216s) at 15-Oct-2026 21:18:36.054
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test$5.cert (0.353s) at 15-Oct-2026 21:18:36.057
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rom-helpers.cert (2.210s) at 15-Oct-2026 21:18:36.060
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/negative-syntaxp.cert (2.072s) at 15-Oct-2026 21:18:36.061
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/util.cert (2.114s) at 15-Oct-2026 21:18:36.087
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/term-defuns.cert (2.285s) at 15-Oct-2026 21:18:36.104
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/perm.cert (0.631s) at 15-Oct-2026 21:18:36.148
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/errmsg.cert on 15-Oct-2026 21:18:36.141
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/clex/portcullis.cert on 15-Oct-2026 21:18:36.168
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-maximal-2d.cert (2.006s) at 15-Oct-2026 21:18:36.205
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/sumlist.cert (0.650s) at 15-Oct-2026 21:18:36.246
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test4.cert (0.488s) at 15-Oct-2026 21:18:36.259
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/defrstobj/portcullis.cert on 15-Oct-2026 21:18:36.246
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test2.foo$.cert (0.510s) at 15-Oct-2026 21:18:36.293
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/portcullis.cert on 15-Oct-2026 21:18:36.285
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/definline.cert (2.200s) at 15-Oct-2026 21:18:36.347
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/remove-assoc.cert on 15-Oct-2026 21:18:36.307
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/portcullis.cert (2.206s) at 15-Oct-2026 21:18:36.375
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/perm.cert on 15-Oct-2026 21:18:36.368
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/computed-hint-rewrite.cert (1.706s) at 15-Oct-2026 21:18:36.390
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test1.cert (0.555s) at 15-Oct-2026 21:18:36.397
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/portcullis.cert on 15-Oct-2026 21:18:36.372
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/bool-ops.cert (0.735s) at 15-Oct-2026 21:18:36.407
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/doc-section.cert (1.991s) at 15-Oct-2026 21:18:36.422
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/replace-impl.cert on 15-Oct-2026 21:18:36.411
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/bdd-primitives.cert (0.781s) at 15-Oct-2026 21:18:36.427
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/ap.cert on 15-Oct-2026 21:18:36.425
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/portcullis.cert on 15-Oct-2026 21:18:36.446
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar$test$$6.cert (0.868s) at 15-Oct-2026 21:18:36.547
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defpun/defpun.cert on 15-Oct-2026 21:18:36.612
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/memories/portcullis.cert on 15-Oct-2026 21:18:36.634
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/apply/apply-prim-support.cert on 15-Oct-2026 21:18:36.633
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/apply/definductor.cert on 15-Oct-2026 21:18:36.672
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/quantification/portcullis.cert on 15-Oct-2026 21:18:36.648
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/term-ordered-perms.cert on 15-Oct-2026 21:18:36.667
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/count-up.cert on 15-Oct-2026 21:18:36.667
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defung/portcullis.cert on 15-Oct-2026 21:18:36.692
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/stobj-swap.cert on 15-Oct-2026 21:18:36.663
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 10165 Oct 15 21:18 basis.cert
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 1195 Oct 15 21:18 total-order.cert
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/thm-base.cert (0.902s) at 15-Oct-2026 21:18:36.784
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/crit.cert on Thu Oct 15 21:18:36 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/portcullis.cert on 15-Oct-2026 21:18:36.789
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/util.cert on 15-Oct-2026 21:18:36.796
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test2.foo.cert (0.890s) at 15-Oct-2026 21:18:36.825
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/sets.cert on Thu Oct 15 21:18:36 UTC 2026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/no-duplicates.cert (2.726s) at 15-Oct-2026 21:18:36.862
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/s32-listp.cert (0.944s) at 15-Oct-2026 21:18:36.882
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/super-ihs/symbols.cert on 15-Oct-2026 21:18:36.878
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/errmsg.cert (0.741s) at 15-Oct-2026 21:18:36.898
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/super-ihs/min-max.cert on 15-Oct-2026 21:18:36.901
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/tau.cert on 15-Oct-2026 21:18:36.902
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bed/portcullis.cert (0.996s) at 15-Oct-2026 21:18:36.941
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/portcullis.cert (0.527s) at 15-Oct-2026 21:18:36.956
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/symbol-fns-exports.cert on 15-Oct-2026 21:18:36.969
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/remove-assoc.cert (0.639s) at 15-Oct-2026 21:18:36.995
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/ap.cert (0.522s) at 15-Oct-2026 21:18:37.001
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/alist-defuns.cert on 15-Oct-2026 21:18:37.090
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defconst-fast.cert (1.811s) at 15-Oct-2026 21:18:37.151
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint-xdoc.cert on 15-Oct-2026 21:18:37.143
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test1$.cert (1.283s) at 15-Oct-2026 21:18:37.170
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/total-order.cert on 15-Oct-2026 21:18:37.182
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/misc/stobjsim.cert on 15-Oct-2026 21:18:37.235
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/misc/memos.cert on 15-Oct-2026 21:18:37.244
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 7082 Oct 15 21:18 crit.cert
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/clex/portcullis.cert (1.105s) at 15-Oct-2026 21:18:37.312
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/nth-update-nth.cert on 15-Oct-2026 21:18:37.305
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/permutations.cert on 15-Oct-2026 21:18:37.329
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defung/portcullis.cert (0.623s) at 15-Oct-2026 21:18:37.339
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/records/inline.cert on 15-Oct-2026 21:18:37.338
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-1.cert on 15-Oct-2026 21:18:37.403
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/super-ihs/min-max.cert (0.525s) at 15-Oct-2026 21:18:37.443
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-2.cert on 15-Oct-2026 21:18:37.447
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/defrstobj2/portcullis.cert (1.508s) at 15-Oct-2026 21:18:37.527
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-5.cert on 15-Oct-2026 21:18:37.545
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test3.$bar.cert (1.611s) at 15-Oct-2026 21:18:37.557
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/apply/apply-prim-support.cert (0.905s) at 15-Oct-2026 21:18:37.569
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/defrstobj/portcullis.cert (1.266s) at 15-Oct-2026 21:18:37.571
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/obags/portcullis.cert on 15-Oct-2026 21:18:37.587
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defmacfun.cert (3.287s) at 15-Oct-2026 21:18:37.620
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/portcullis.cert (0.870s) at 15-Oct-2026 21:18:37.677
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/extend-pathname.cert on 15-Oct-2026 21:18:37.658
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/convert-normalized-term-to-pairs.cert on 15-Oct-2026 21:18:37.678
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/total-order.cert (0.495s) at 15-Oct-2026 21:18:37.698
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/super-ihs/symbols.cert (0.809s) at 15-Oct-2026 21:18:37.705
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/merge-sort-term-order.cert on 15-Oct-2026 21:18:37.725
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-3.cert on 15-Oct-2026 21:18:37.736
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/merge-sort-symbol-lt.cert on 15-Oct-2026 21:18:37.771
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/dollar-test3.bar.cert (1.933s) at 15-Oct-2026 21:18:37.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/symbol-alistp.cert on 15-Oct-2026 21:18:37.800
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint-xdoc.cert (0.658s) at 15-Oct-2026 21:18:37.843
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/stobj-swap.cert (1.173s) at 15-Oct-2026 21:18:37.882
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lookup-keyword.cert on 15-Oct-2026 21:18:37.893
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/tau.cert (0.985s) at 15-Oct-2026 21:18:37.921
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/keyword-value-listp.cert on 15-Oct-2026 21:18:37.932
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/assoc-keyword.cert on 15-Oct-2026 21:18:37.947
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/number-list-defuns.cert on 15-Oct-2026 21:18:37.986
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/map-symbol-name.cert on 15-Oct-2026 21:18:37.988
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/find-path/graph/helpers.cert on 15-Oct-2026 21:18:37.996
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/subst-var.cert on 15-Oct-2026 21:18:38.043
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/replace-impl.cert (1.669s) at 15-Oct-2026 21:18:38.114
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/member-symbol-name.cert on 15-Oct-2026 21:18:38.112
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/permutations.cert (0.819s) at 15-Oct-2026 21:18:38.159
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/mini-theories.cert (4.809s) at 15-Oct-2026 21:18:38.184
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logior1-proofs.cert (4.657s) at 15-Oct-2026 21:18:38.243
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/case-match.cert on 15-Oct-2026 21:18:38.257
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/fmx-cw.cert on 15-Oct-2026 21:18:38.299
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/all-fnnames.cert on 15-Oct-2026 21:18:38.306
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/chk-length-and-keys.cert on 15-Oct-2026 21:18:38.310
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/symbol-alistp.cert (0.562s) at 15-Oct-2026 21:18:38.375
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lookup-keyword.cert (0.512s) at 15-Oct-2026 21:18:38.429
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/keyword-value-listp.cert (0.542s) at 15-Oct-2026 21:18:38.501
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/misc/stobjsim.cert (1.245s) at 15-Oct-2026 21:18:38.504
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/member-symbol-name.cert (0.382s) at 15-Oct-2026 21:18:38.516
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/defstobj.cert on 15-Oct-2026 21:18:38.504
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/invariant-risk.cert on 15-Oct-2026 21:18:38.525
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/portcullis.cert (2.091s) at 15-Oct-2026 21:18:38.562
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/merge-sort-term-order.cert (0.834s) at 15-Oct-2026 21:18:38.579
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-minimal-2d.cert (4.426s) at 15-Oct-2026 21:18:38.588
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/tables.cert on 15-Oct-2026 21:18:38.605
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/quantification/portcullis.cert (1.914s) at 15-Oct-2026 21:18:38.611
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defun-plus.cert on 15-Oct-2026 21:18:38.634
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/misc/memos.cert (1.368s) at 15-Oct-2026 21:18:38.640
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/basic-arithmetic-helper.cert (5.245s) at 15-Oct-2026 21:18:38.645
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/list-theory.cert on 15-Oct-2026 21:18:38.641
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/list-equality-from-nth.cert on 15-Oct-2026 21:18:38.670
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/chk-length-and-keys.cert (0.384s) at 15-Oct-2026 21:18:38.699
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/nth-update-nth-meta-extract.cert on 15-Oct-2026 21:18:38.689
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/obags/portcullis.cert (1.119s) at 15-Oct-2026 21:18:38.711
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/modeling/nested-stobj-toy-isa.cert on 15-Oct-2026 21:18:38.779
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/all-fnnames.cert (0.487s) at 15-Oct-2026 21:18:38.803
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/proofs/linear.cert on 15-Oct-2026 21:18:38.804
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/find-path/graph/helpers.cert (0.792s) at 15-Oct-2026 21:18:38.820
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/number-list-defuns.cert (0.859s) at 15-Oct-2026 21:18:38.859
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/parallel/matrix-multiplication-setup.cert on 15-Oct-2026 21:18:38.871
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/portcullis.cert (2.615s) at 15-Oct-2026 21:18:38.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/find-subterms.cert (3.614s) at 15-Oct-2026 21:18:38.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defpun/defpun.cert (2.307s) at 15-Oct-2026 21:18:38.978
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/nth-update-nth.cert (1.651s) at 15-Oct-2026 21:18:38.980
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/perm.cert (2.633s) at 15-Oct-2026 21:18:39.015
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/defstobj.cert (0.530s) at 15-Oct-2026 21:18:39.056
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/memories/portcullis.cert (2.401s) at 15-Oct-2026 21:18:39.060
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/perm.cert on 15-Oct-2026 21:18:39.057
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/introductory-challenge-problem-4.cert on 15-Oct-2026 21:18:39.083
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/inline-book.cert (4.039s) at 15-Oct-2026 21:18:39.155
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/portcullis.cert on 15-Oct-2026 21:18:39.146
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert on 15-Oct-2026 21:18:39.151
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/defstruct-parsing.cert (4.079s) at 15-Oct-2026 21:18:39.169
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/embeddable-event-forms.cert on 15-Oct-2026 21:18:39.170
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/stobj-table.cert on 15-Oct-2026 21:18:39.170
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/farray/portcullis.cert on 15-Oct-2026 21:18:39.173
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-definitions.cert (5.232s) at 15-Oct-2026 21:18:39.184
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert on 15-Oct-2026 21:18:39.211
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/tables.cert (0.625s) at 15-Oct-2026 21:18:39.237
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/list-equality-from-nth.cert (0.564s) at 15-Oct-2026 21:18:39.241
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/portcullis.cert on 15-Oct-2026 21:18:39.245
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/merge-sort-symbol-lt.cert (1.473s) at 15-Oct-2026 21:18:39.253
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/stobj-equality-from-fields.cert on 15-Oct-2026 21:18:39.230
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/list-theory.cert (0.614s) at 15-Oct-2026 21:18:39.270
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/proofs/type-prescription.cert on 15-Oct-2026 21:18:39.248
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/invariant-risk.cert (0.751s) at 15-Oct-2026 21:18:39.283
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/register-invariant-risk-support.cert on 15-Oct-2026 21:18:39.268
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/dimacs-reader/portcullis.cert on 15-Oct-2026 21:18:39.269
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/portcullis.cert on 15-Oct-2026 21:18:39.268
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/soft/portcullis.cert on 15-Oct-2026 21:18:39.318
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/irv/portcullis.cert on 15-Oct-2026 21:18:39.339
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/keccak/portcullis.cert on 15-Oct-2026 21:18:39.389
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/acceptable-rewrite-rule-p.cert (3.389s) at 15-Oct-2026 21:18:39.452
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/c/portcullis.cert on 15-Oct-2026 21:18:39.553
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defun-plus.cert (0.934s) at 15-Oct-2026 21:18:39.577
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/java/portcullis.cert on 15-Oct-2026 21:18:39.583
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/records/inline.cert (2.257s) at 15-Oct-2026 21:18:39.618
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/portcullis.cert on 15-Oct-2026 21:18:39.610
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/parallel/matrix-multiplication-setup.cert (0.790s) at 15-Oct-2026 21:18:39.678
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/portcullis.cert on 15-Oct-2026 21:18:39.687
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/symbol-fns-exports.cert (2.725s) at 15-Oct-2026 21:18:39.715
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/json/portcullis.cert on 15-Oct-2026 21:18:39.727
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/solidity/portcullis.cert on 15-Oct-2026 21:18:39.786
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/proofs/linear.cert (1.038s) at 15-Oct-2026 21:18:39.851
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/simpl-imp/portcullis.cert on 15-Oct-2026 21:18:39.853
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/count-up.cert (3.248s) at 15-Oct-2026 21:18:39.947
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2pl/portcullis.cert on 15-Oct-2026 21:18:39.957
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/stobj-equality-from-fields.cert (0.774s) at 15-Oct-2026 21:18:40.040
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/mimc/portcullis.cert on 15-Oct-2026 21:18:40.053
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/term-ordered-perms.cert (3.403s) at 15-Oct-2026 21:18:40.099
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/irv/portcullis.cert (0.757s) at 15-Oct-2026 21:18:40.131
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/perm.cert (1.065s) at 15-Oct-2026 21:18:40.139
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/huet-lang-algorithm.cert on 15-Oct-2026 21:18:40.115
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/map-symbol-name.cert (2.218s) at 15-Oct-2026 21:18:40.217
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/json/portcullis.cert (0.440s) at 15-Oct-2026 21:18:40.224
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/leftist-trees/leftist-tree-defuns.cert on 15-Oct-2026 21:18:40.232
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/portcullis.cert on 15-Oct-2026 21:18:40.250
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-5.cert (2.756s) at 15-Oct-2026 21:18:40.317
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/book-thms.cert (6.901s) at 15-Oct-2026 21:18:40.328
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/java/portcullis.cert (0.808s) at 15-Oct-2026 21:18:40.419
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/theory-tools.cert on 15-Oct-2026 21:18:40.410
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert on 15-Oct-2026 21:18:40.428
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/solidity/portcullis.cert (0.644s) at 15-Oct-2026 21:18:40.442
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert on 15-Oct-2026 21:18:40.463
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/simpl-imp/portcullis.cert (0.606s) at 15-Oct-2026 21:18:40.474
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert on 15-Oct-2026 21:18:40.470
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert on 15-Oct-2026 21:18:40.507
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/introductory-challenge-problem-4.cert (1.396s) at 15-Oct-2026 21:18:40.520
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/portcullis.cert (0.794s) at 15-Oct-2026 21:18:40.523
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert on 15-Oct-2026 21:18:40.527
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert on 15-Oct-2026 21:18:40.523
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/c/portcullis.cert (0.967s) at 15-Oct-2026 21:18:40.546
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert on 15-Oct-2026 21:18:40.610
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2pl/portcullis.cert (0.667s) at 15-Oct-2026 21:18:40.637
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/support/util.cert on 15-Oct-2026 21:18:40.628
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert on 15-Oct-2026 21:18:40.634
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert on 15-Oct-2026 21:18:40.666
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/portcullis.cert (1.387s) at 15-Oct-2026 21:18:40.686
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert on 15-Oct-2026 21:18:40.721
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/portcullis.cert (0.468s) at 15-Oct-2026 21:18:40.731
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert on 15-Oct-2026 21:18:40.764
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/leftist-trees/leftist-tree-defuns.cert (0.570s) at 15-Oct-2026 21:18:40.816
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/portcullis.cert (1.191s) at 15-Oct-2026 21:18:40.818
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/mimc/portcullis.cert (0.693s) at 15-Oct-2026 21:18:40.824
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-3.cert (3.074s) at 15-Oct-2026 21:18:40.828
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/register-invariant-risk-support.cert (1.546s) at 15-Oct-2026 21:18:40.837
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/fmx-cw.cert (2.550s) at 15-Oct-2026 21:18:40.860
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/assoc-keyword.cert (2.928s) at 15-Oct-2026 21:18:40.893
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/apply/definductor.cert (4.212s) at 15-Oct-2026 21:18:40.903
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert on 15-Oct-2026 21:18:40.943
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/len.cert on 15-Oct-2026 21:18:40.948
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/sb60.cert on 15-Oct-2026 21:18:40.933
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/theory-tools.cert (0.568s) at 15-Oct-2026 21:18:40.998
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/digit-to-char.cert on 15-Oct-2026 21:18:41.021
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus-and-minus.cert on 15-Oct-2026 21:18:41.105
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/isar/portcullis.cert on 15-Oct-2026 21:18:41.226
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert (0.868s) at 15-Oct-2026 21:18:41.346
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert (0.740s) at 15-Oct-2026 21:18:41.356
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/complex.cert on 15-Oct-2026 21:18:41.388
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert (0.618s) at 15-Oct-2026 21:18:41.395
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/less-than.cert on 15-Oct-2026 21:18:41.391
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/minus.cert on 15-Oct-2026 21:18:41.418
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert (0.473s) at 15-Oct-2026 21:18:41.430
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/keccak/portcullis.cert (2.023s) at 15-Oct-2026 21:18:41.431
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert (1.008s) at 15-Oct-2026 21:18:41.443
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/equal-of-booleans.cert on 15-Oct-2026 21:18:41.441
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/true-list-fix.cert on 15-Oct-2026 21:18:41.451
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/take.cert on 15-Oct-2026 21:18:41.474
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/ternary.cert on 15-Oct-2026 21:18:41.488
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert on 15-Oct-2026 21:18:41.457
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus.cert on 15-Oct-2026 21:18:41.497
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/cons.cert on 15-Oct-2026 21:18:41.497
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/character-listp.cert on 15-Oct-2026 21:18:41.545
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/len.cert (0.630s) at 15-Oct-2026 21:18:41.600
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus-and-minus.cert (0.489s) at 15-Oct-2026 21:18:41.606
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/cdr.cert on 15-Oct-2026 21:18:41.646
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert (1.139s) at 15-Oct-2026 21:18:41.670
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert (1.196s) at 15-Oct-2026 21:18:41.679
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/dimacs-reader/portcullis.cert (2.399s) at 15-Oct-2026 21:18:41.705
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/support/util.cert (1.074s) at 15-Oct-2026 21:18:41.723
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/strings.cert on 15-Oct-2026 21:18:41.715
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/sb60.cert (0.809s) at 15-Oct-2026 21:18:41.794
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help.cert (7.702s) at 15-Oct-2026 21:18:41.802
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/extend-pathname.cert (4.118s) at 15-Oct-2026 21:18:41.811
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/remove-event-types.cert on 15-Oct-2026 21:18:41.824
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/forms.cert on 15-Oct-2026 21:18:41.901
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert (2.736s) at 15-Oct-2026 21:18:41.911
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/true-list-listp.cert on 15-Oct-2026 21:18:41.930
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/embeddable-event-forms.cert (2.766s) at 15-Oct-2026 21:18:41.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/util.cert (5.192s) at 15-Oct-2026 21:18:42.002
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal.cert on 15-Oct-2026 21:18:41.989
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert (1.265s) at 15-Oct-2026 21:18:42.009
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert (1.490s) at 15-Oct-2026 21:18:42.049
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/less-than.cert (0.642s) at 15-Oct-2026 21:18:42.060
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-forms.cert on 15-Oct-2026 21:18:42.035
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defthm-forms.cert on 15-Oct-2026 21:18:42.053
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/farray/portcullis.cert (2.890s) at 15-Oct-2026 21:18:42.081
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/isar/portcullis.cert (0.747s) at 15-Oct-2026 21:18:42.108
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/wrap-all.cert on 15-Oct-2026 21:18:42.099
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert (2.919s) at 15-Oct-2026 21:18:42.156
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/huet-lang-algorithm.cert (1.934s) at 15-Oct-2026 21:18:42.159
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/equal-of-booleans.cert (0.704s) at 15-Oct-2026 21:18:42.161
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/msgp.cert on 15-Oct-2026 21:18:42.143
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove1-equal.cert on 15-Oct-2026 21:18:42.146
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-cons-nest.cert on 15-Oct-2026 21:18:42.108
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/append-all.cert on 15-Oct-2026 21:18:42.171
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/messages2.cert on 15-Oct-2026 21:18:42.150
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/translate.cert on 15-Oct-2026 21:18:42.210
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/minus.cert (0.768s) at 15-Oct-2026 21:18:42.227
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/assoc-equal.cert on 15-Oct-2026 21:18:42.261
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/logic-termp.cert on 15-Oct-2026 21:18:42.281
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus.cert (0.754s) at 15-Oct-2026 21:18:42.304
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/portcullis.cert (3.064s) at 15-Oct-2026 21:18:42.322
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/alist-defuns.cert (5.224s) at 15-Oct-2026 21:18:42.337
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert (1.694s) at 15-Oct-2026 21:18:42.339
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/digit-to-char.cert (1.310s) at 15-Oct-2026 21:18:42.343
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/legal-variable-listp.cert on 15-Oct-2026 21:18:42.346
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/downcase.cert on 15-Oct-2026 21:18:42.291
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/remove-event-types.cert (0.533s) at 15-Oct-2026 21:18:42.370
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/portcullis.cert (3.215s) at 15-Oct-2026 21:18:42.386
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/union-equal.cert on 15-Oct-2026 21:18:42.389
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/pseudo-term-listp.cert on 15-Oct-2026 21:18:42.400
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/bool-fix.cert on 15-Oct-2026 21:18:42.401
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/true-list-listp.cert (0.476s) at 15-Oct-2026 21:18:42.415
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/arities-okp.cert on 15-Oct-2026 21:18:42.417
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/myif-def.cert on 15-Oct-2026 21:18:42.428
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-function-calls-on-formals.cert on 15-Oct-2026 21:18:42.440
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/subst-var.cert (4.406s) at 15-Oct-2026 21:18:42.468
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert (1.808s) at 15-Oct-2026 21:18:42.485
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-1.cert (5.046s) at 15-Oct-2026 21:18:42.489
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/make-if-term.cert on 15-Oct-2026 21:18:42.490
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/disjoin.cert on 15-Oct-2026 21:18:42.503
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/character-listp.cert (0.978s) at 15-Oct-2026 21:18:42.538
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert (1.063s) at 15-Oct-2026 21:18:42.569
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/symbol-listp.cert on 15-Oct-2026 21:18:42.552
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/strip-cdrs.cert on 15-Oct-2026 21:18:42.569
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/strings.cert (0.894s) at 15-Oct-2026 21:18:42.626
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lets.cert on 15-Oct-2026 21:18:42.630
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/forms.cert (0.725s) at 15-Oct-2026 21:18:42.637
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acl2-defaults-table.cert on 15-Oct-2026 21:18:42.596
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/pseudo-term-list-listp.cert on 15-Oct-2026 21:18:42.688
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acl2-count.cert on 15-Oct-2026 21:18:42.656
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/expr-calls-fn.cert on 15-Oct-2026 21:18:42.736
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/assoc-equal.cert (0.520s) at 15-Oct-2026 21:18:42.785
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/symbol-term-alistp.cert on 15-Oct-2026 21:18:42.726
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/lambda-free-termp.cert on 15-Oct-2026 21:18:42.810
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/add-to-set-equal.cert on 15-Oct-2026 21:18:42.871
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/messages2.cert (0.685s) at 15-Oct-2026 21:18:42.909
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert (2.349s) at 15-Oct-2026 21:18:42.911
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/take.cert (1.417s) at 15-Oct-2026 21:18:42.911
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/member-equal.cert on 15-Oct-2026 21:18:42.849
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/myif-def.cert (0.509s) at 15-Oct-2026 21:18:42.951
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/cons.cert (1.458s) at 15-Oct-2026 21:18:42.970
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/msgp.cert (0.809s) at 15-Oct-2026 21:18:42.986
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/append-all.cert (0.823s) at 15-Oct-2026 21:18:43.020
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/soft/portcullis.cert (3.712s) at 15-Oct-2026 21:18:43.069
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-dollar.cert on 15-Oct-2026 21:18:43.064
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/ternary.cert (1.603s) at 15-Oct-2026 21:18:43.098
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defthm-forms.cert (1.019s) at 15-Oct-2026 21:18:43.104
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-cons-nest.cert (0.889s) at 15-Oct-2026 21:18:43.112
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/complex.cert (1.811s) at 15-Oct-2026 21:18:43.211
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-equal.cert on 15-Oct-2026 21:18:43.208
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/last.cert on 15-Oct-2026 21:18:43.158
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-forms.cert (1.191s) at 15-Oct-2026 21:18:43.262
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/translate.cert (1.058s) at 15-Oct-2026 21:18:43.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/cdr.cert (1.640s) at 15-Oct-2026 21:18:43.299
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-or.cert on 15-Oct-2026 21:18:43.329
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acl2-defaults-table.cert (0.724s) at 15-Oct-2026 21:18:43.374
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove1-equal.cert (1.216s) at 15-Oct-2026 21:18:43.396
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-function-calls-on-formals.cert (0.935s) at 15-Oct-2026 21:18:43.397
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acl2-count.cert (0.668s) at 15-Oct-2026 21:18:43.398
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subrange-def.cert on 15-Oct-2026 21:18:43.426
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/memberp-def.cert on 15-Oct-2026 21:18:43.390
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep-equal-def.cert on 15-Oct-2026 21:18:43.488
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/wrap-all.cert (1.335s) at 15-Oct-2026 21:18:43.509
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/symbol-has-propsp.cert on 15-Oct-2026 21:18:43.527
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/nth.cert on 15-Oct-2026 21:18:43.536
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/add-not-normalized-suffixes.cert on 15-Oct-2026 21:18:43.539
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/stobj-table.cert (4.389s) at 15-Oct-2026 21:18:43.577
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/dont-remove-trivial-equivalences.cert on 15-Oct-2026 21:18:43.593
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/unsigned-byte-listp-def.cert on 15-Oct-2026 21:18:43.653
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/pseudo-term-list-listp.cert (0.896s) at 15-Oct-2026 21:18:43.665
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-executable.cert on 15-Oct-2026 21:18:43.676
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/drop-corresponding-items.cert on 15-Oct-2026 21:18:43.670
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-integerp.cert on 15-Oct-2026 21:18:43.739
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/maybe-verify-guards2.cert on 15-Oct-2026 21:18:43.721
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/expr-calls-fn.cert (1.062s) at 15-Oct-2026 21:18:43.822
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/downcase.cert (1.440s) at 15-Oct-2026 21:18:43.822
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-or.cert (0.511s) at 15-Oct-2026 21:18:43.849
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/logic-termp.cert (1.611s) at 15-Oct-2026 21:18:43.901
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/lambda-free-termp.cert (1.077s) at 15-Oct-2026 21:18:43.904
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/portcullis.cert on 15-Oct-2026 21:18:43.907
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/proofs/type-prescription.cert (4.628s) at 15-Oct-2026 21:18:43.917
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/strip-cdrs.cert (1.321s) at 15-Oct-2026 21:18:43.952
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/memberp-def.cert (0.523s) at 15-Oct-2026 21:18:43.998
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/erp.cert on 15-Oct-2026 21:18:43.999
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/symbol-term-alistp.cert (1.185s) at 15-Oct-2026 21:18:44.012
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mv-nth.cert on 15-Oct-2026 21:18:43.992
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/len-at-least.cert on 15-Oct-2026 21:18:44.012
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/channel-contents.cert on 15-Oct-2026 21:18:44.007
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subrange-def.cert (0.609s) at 15-Oct-2026 21:18:44.047
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus-and-times.cert on 15-Oct-2026 21:18:44.055
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/dont-remove-trivial-equivalences.cert (0.466s) at 15-Oct-2026 21:18:44.082
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/add-to-set-equal.cert (1.209s) at 15-Oct-2026 21:18:44.102
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/read-chars.cert on 15-Oct-2026 21:18:44.087
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-dollar.cert (1.103s) at 15-Oct-2026 21:18:44.178
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/last.cert (0.951s) at 15-Oct-2026 21:18:44.206
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/acons.cert on 15-Oct-2026 21:18:44.199
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/depends-on-table.cert on 15-Oct-2026 21:18:44.266
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acons-fast.cert on 15-Oct-2026 21:18:44.297
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/symbol-listp.cert (1.719s) at 15-Oct-2026 21:18:44.313
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/axe-syntax.cert on 15-Oct-2026 21:18:44.410
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-equal.cert (1.154s) at 15-Oct-2026 21:18:44.422
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/imported-symbols.cert on 15-Oct-2026 21:18:44.378
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/symbol-has-propsp.cert (0.885s) at 15-Oct-2026 21:18:44.453
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/disjoin.cert (1.945s) at 15-Oct-2026 21:18:44.459
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/erp.cert (0.445s) at 15-Oct-2026 21:18:44.470
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-contains-charp.cert on 15-Oct-2026 21:18:44.415
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/portcullis.cert (0.591s) at 15-Oct-2026 21:18:44.503
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mydefconst.cert on 15-Oct-2026 21:18:44.492
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/if.cert on 15-Oct-2026 21:18:44.526
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/firstn-def.cert on 15-Oct-2026 21:18:44.436
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-event-quiet.cert on 15-Oct-2026 21:18:44.625
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/add-not-normalized-suffixes.cert (1.053s) at 15-Oct-2026 21:18:44.635
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/rational-listp.cert on 15-Oct-2026 21:18:44.635
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2-arrays/bounded-nat-alists.cert on 15-Oct-2026 21:18:44.644
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/channel-contents.cert (0.695s) at 15-Oct-2026 21:18:44.727
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/drop-corresponding-items.cert (1.021s) at 15-Oct-2026 21:18:44.732
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/true-list-fix.cert (3.252s) at 15-Oct-2026 21:18:44.742
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-list-fast.cert on 15-Oct-2026 21:18:44.728
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/acons-fast.cert (0.525s) at 15-Oct-2026 21:18:44.826
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/printing.cert on 15-Oct-2026 21:18:44.809
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/acons.cert (0.621s) at 15-Oct-2026 21:18:44.837
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/smaller-termp.cert on 15-Oct-2026 21:18:44.837
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/merge-sort-symbol-less-than.cert on 15-Oct-2026 21:18:44.837
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep-equal-def.cert (1.355s) at 15-Oct-2026 21:18:44.851
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/arities-okp.cert (2.431s) at 15-Oct-2026 21:18:44.853
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/file-existsp.cert on 15-Oct-2026 21:18:44.729
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/unsigned-byte-listp-def.cert (1.206s) at 15-Oct-2026 21:18:44.872
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/depends-on-table.cert (0.653s) at 15-Oct-2026 21:18:44.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/less-than-or-equal.cert on 15-Oct-2026 21:18:44.928
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/len-at-least.cert (0.921s) at 15-Oct-2026 21:18:44.952
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/unsigned-byte-p-forced.cert on 15-Oct-2026 21:18:44.949
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/perm-def.cert on 15-Oct-2026 21:18:44.993
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/remove-duplicates-equal-dollar.cert on 15-Oct-2026 21:18:44.988
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/axe-syntax.cert (0.590s) at 15-Oct-2026 21:18:45.008
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/prefixp-def.cert on 15-Oct-2026 21:18:45.011
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/negate-form.cert on 15-Oct-2026 21:18:45.044
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lets.cert (2.412s) at 15-Oct-2026 21:18:45.080
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-and.cert on 15-Oct-2026 21:18:45.054
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/keep-atoms.cert on 15-Oct-2026 21:18:45.121
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bit-to-bool.cert on 15-Oct-2026 21:18:45.113
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/union-equal.cert (2.744s) at 15-Oct-2026 21:18:45.148
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/read-chars.cert (1.063s) at 15-Oct-2026 21:18:45.178
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/if.cert (0.679s) at 15-Oct-2026 21:18:45.222
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/bind-from-rules.cert on 15-Oct-2026 21:18:45.229
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-event-quiet.cert (0.583s) at 15-Oct-2026 21:18:45.266
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mydefconst.cert (0.743s) at 15-Oct-2026 21:18:45.286
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/keep-pairs.cert on 15-Oct-2026 21:18:45.319
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bytep.cert on 15-Oct-2026 21:18:45.321
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/maybe-verify-guards2.cert (1.550s) at 15-Oct-2026 21:18:45.342
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-true-listp.cert on 15-Oct-2026 21:18:45.216
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/items-have-len.cert on 15-Oct-2026 21:18:45.307
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/finalcdr.cert on 15-Oct-2026 21:18:45.332
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/convert-normalized-term-to-pairs.cert (7.662s) at 15-Oct-2026 21:18:45.368
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/member-equal.cert (2.467s) at 15-Oct-2026 21:18:45.402
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/file-existsp.cert (0.559s) at 15-Oct-2026 21:18:45.449
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/defabsstobj-example-2.cert (8.014s) at 15-Oct-2026 21:18:45.489
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/pseudo-term-listp.cert (3.085s) at 15-Oct-2026 21:18:45.498
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/step-increments.cert on 15-Oct-2026 21:18:45.497
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/smaller-termp.cert (0.674s) at 15-Oct-2026 21:18:45.526
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/first-non-member.cert on 15-Oct-2026 21:18:45.527
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-equal-dollar.cert on 15-Oct-2026 21:18:45.392
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/unsigned-byte-p-forced.cert (0.579s) at 15-Oct-2026 21:18:45.556
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/add-to-end.cert on 15-Oct-2026 21:18:45.554
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/less-than-or-equal.cert (0.625s) at 15-Oct-2026 21:18:45.561
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/imported-symbols.cert (0.969s) at 15-Oct-2026 21:18:45.563
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/count-occs.cert on 15-Oct-2026 21:18:45.552
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/plus-and-times.cert (1.511s) at 15-Oct-2026 21:18:45.586
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/check-boolean.cert on 15-Oct-2026 21:18:45.585
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/types.cert on 15-Oct-2026 21:18:45.452
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/shorter-list.cert on 15-Oct-2026 21:18:45.605
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/firstn-def.cert (0.979s) at 15-Oct-2026 21:18:45.620
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/keep-atoms.cert (0.543s) at 15-Oct-2026 21:18:45.674
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/print-constant.cert on 15-Oct-2026 21:18:45.712
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bytep.cert (0.430s) at 15-Oct-2026 21:18:45.773
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/printing.cert (0.981s) at 15-Oct-2026 21:18:45.823
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/merge-sort-symbol-less-than.cert (0.975s) at 15-Oct-2026 21:18:45.828
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-executable.cert (2.140s) at 15-Oct-2026 21:18:45.834
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-contains-charp.cert (1.395s) at 15-Oct-2026 21:18:45.872
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/natp.cert on 15-Oct-2026 21:18:45.873
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/bind-from-rules.cert (0.610s) at 15-Oct-2026 21:18:45.889
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/safe-unquote.cert on 15-Oct-2026 21:18:45.871
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/nat-listp.cert on 15-Oct-2026 21:18:45.883
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/unguarded-primitives.cert on 15-Oct-2026 21:18:45.892
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2-arrays/bounded-nat-alists.cert (1.266s) at 15-Oct-2026 21:18:45.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/parse-binary-digits.cert on 15-Oct-2026 21:18:45.938
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/sortedp-less-than-or-equal.cert on 15-Oct-2026 21:18:45.959
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/acons-unique.cert on 15-Oct-2026 21:18:45.957
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mv-nth.cert (1.966s) at 15-Oct-2026 21:18:45.998
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/prefixp-def.cert (0.971s) at 15-Oct-2026 21:18:46.004
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/less-than-or-equal-all.cert on 15-Oct-2026 21:18:46.001
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/legal-variable-listp.cert (3.654s) at 15-Oct-2026 21:18:46.020
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/string-listp.cert on 15-Oct-2026 21:18:46.029
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/all-quotep.cert on 15-Oct-2026 21:18:46.027
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-trees.cert on 15-Oct-2026 21:18:46.039
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/tries.cert on 15-Oct-2026 21:18:46.189
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/progn.cert on 15-Oct-2026 21:18:46.222
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/print-constant.cert (0.518s) at 15-Oct-2026 21:18:46.234
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/parse-decimal-digits.cert on 15-Oct-2026 21:18:46.270
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defconst-computed.cert on 15-Oct-2026 21:18:46.352
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal.cert (4.377s) at 15-Oct-2026 21:18:46.388
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-list-fast.cert (1.656s) at 15-Oct-2026 21:18:46.415
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-and.cert (1.327s) at 15-Oct-2026 21:18:46.418
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-file-into-character-list.cert on 15-Oct-2026 21:18:46.411
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/negate-form.cert (1.467s) at 15-Oct-2026 21:18:46.548
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/max.cert on 15-Oct-2026 21:18:46.555
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-ord.cert on 15-Oct-2026 21:18:46.564
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/maybe-replace-var.cert on 15-Oct-2026 21:18:46.570
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/min.cert on 15-Oct-2026 21:18:46.589
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/make-if-term.cert (4.104s) at 15-Oct-2026 21:18:46.610
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/print-levels.cert on 15-Oct-2026 21:18:46.677
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/first-non-member.cert (1.154s) at 15-Oct-2026 21:18:46.711
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/lenconsmeta.cert on 15-Oct-2026 21:18:46.660
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/make-list-ac.cert on 15-Oct-2026 21:18:46.817
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/with-local-stobjs.cert on 15-Oct-2026 21:18:46.808
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/string-listp.cert (0.804s) at 15-Oct-2026 21:18:46.845
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/progn.cert (0.630s) at 15-Oct-2026 21:18:46.858
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-keyword-args.cert on 15-Oct-2026 21:18:46.875
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/find-index.cert on 15-Oct-2026 21:18:46.854
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/w.cert on 15-Oct-2026 21:18:46.964
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/remove-duplicates-equal-dollar.cert (1.934s) at 15-Oct-2026 21:18:46.988
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/subtermp.cert on 15-Oct-2026 21:18:46.934
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/less-than-or-equal-all.cert (1.041s) at 15-Oct-2026 21:18:47.056
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/check-boolean.cert (1.478s) at 15-Oct-2026 21:18:47.073
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-equal-dollar.cert (1.500s) at 15-Oct-2026 21:18:47.089
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defconst-computed.cert (0.716s) at 15-Oct-2026 21:18:47.097
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/max.cert (0.536s) at 15-Oct-2026 21:18:47.116
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/types.cert (1.511s) at 15-Oct-2026 21:18:47.131
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/bind-free-common.cert on 15-Oct-2026 21:18:47.163
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/operations.cert on 15-Oct-2026 21:18:47.184
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/ifix.cert on 15-Oct-2026 21:18:47.188
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-file-into-character-list.cert (0.770s) at 15-Oct-2026 21:18:47.201
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/all-quotep.cert (1.175s) at 15-Oct-2026 21:18:47.236
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/hmac/portcullis.cert on 15-Oct-2026 21:18:47.286
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/kdf/portcullis.cert on 15-Oct-2026 21:18:47.316
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/bool-fix.cert (4.979s) at 15-Oct-2026 21:18:47.394
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pos-fix.cert on 15-Oct-2026 21:18:47.375
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bit-to-bool.cert (2.271s) at 15-Oct-2026 21:18:47.422
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/print-levels.cert (0.717s) at 15-Oct-2026 21:18:47.426
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/w.cert (0.460s) at 15-Oct-2026 21:18:47.439
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/rational-listp.cert (2.790s) at 15-Oct-2026 21:18:47.441
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/rule-lists.cert on 15-Oct-2026 21:18:47.475
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/tries.cert (1.267s) at 15-Oct-2026 21:18:47.494
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/sha-2/portcullis.cert on 15-Oct-2026 21:18:47.484
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-ord.cert (0.974s) at 15-Oct-2026 21:18:47.559
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/with-local-stobjs.cert (0.728s) at 15-Oct-2026 21:18:47.567
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/keep-pairs.cert (2.230s) at 15-Oct-2026 21:18:47.587
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/step-increments.cert (2.092s) at 15-Oct-2026 21:18:47.599
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/blake/portcullis.cert on 15-Oct-2026 21:18:47.582
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/proof-support.cert on 15-Oct-2026 21:18:47.636
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/hex-char-to-val.cert on 15-Oct-2026 21:18:47.692
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/perm-def.cert (2.727s) at 15-Oct-2026 21:18:47.732
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/num-return-values-of-fn.cert on 15-Oct-2026 21:18:47.728
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/make-list-ac.cert (0.912s) at 15-Oct-2026 21:18:47.738
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/hmac/portcullis.cert (0.478s) at 15-Oct-2026 21:18:47.801
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/ifix.cert (0.615s) at 15-Oct-2026 21:18:47.811
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/padding/portcullis.cert on 15-Oct-2026 21:18:47.767
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/lenconsmeta.cert (1.041s) at 15-Oct-2026 21:18:47.832
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/abs.cert on 15-Oct-2026 21:18:47.829
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/limit-expt.cert on 15-Oct-2026 21:18:47.834
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-program.cert on 15-Oct-2026 21:18:47.976
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/rule-lists.cert (0.536s) at 15-Oct-2026 21:18:48.021
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-true-listp.cert (2.665s) at 15-Oct-2026 21:18:48.024
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/bit-listp.cert on 15-Oct-2026 21:18:48.030
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/kdf/portcullis.cert (0.721s) at 15-Oct-2026 21:18:48.070
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/blake/portcullis.cert (0.439s) at 15-Oct-2026 21:18:48.093
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/sha-2/portcullis.cert (0.591s) at 15-Oct-2026 21:18:48.105
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/operations.cert (0.913s) at 15-Oct-2026 21:18:48.108
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/natp.cert (2.246s) at 15-Oct-2026 21:18:48.144
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/nfix.cert on 15-Oct-2026 21:18:48.119
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/dynamic-make-event.cert on 15-Oct-2026 21:18:48.152
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/num-return-values-of-fn.cert (0.492s) at 15-Oct-2026 21:18:48.228
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/proof-support.cert (0.619s) at 15-Oct-2026 21:18:48.265
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/prime-fields/bind-free-common.cert (1.043s) at 15-Oct-2026 21:18:48.266
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/finite-set-theory/total-ordering.cert on 15-Oct-2026 21:18:48.242
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/salsa/portcullis.cert on 15-Oct-2026 21:18:48.226
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-integerp.cert (4.621s) at 15-Oct-2026 21:18:48.382
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/equal.cert on 15-Oct-2026 21:18:48.363
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/finalcdr.cert (3.105s) at 15-Oct-2026 21:18:48.474
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/add-to-end.cert (2.914s) at 15-Oct-2026 21:18:48.477
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/hex-char-to-val.cert (0.777s) at 15-Oct-2026 21:18:48.482
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/make-executable.cert on 15-Oct-2026 21:18:48.487
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-keyword-args.cert (1.544s) at 15-Oct-2026 21:18:48.501
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints.cert on 15-Oct-2026 21:18:48.496
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert on 15-Oct-2026 21:18:48.587
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-list-fast-rules.cert on 15-Oct-2026 21:18:48.575
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/nfix.cert (0.427s) at 15-Oct-2026 21:18:48.596
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/shorter-list.cert (3.002s) at 15-Oct-2026 21:18:48.617
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-duplicates-equal.cert on 15-Oct-2026 21:18:48.617
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/padding/portcullis.cert (0.819s) at 15-Oct-2026 21:18:48.653
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ubi.cert on 15-Oct-2026 21:18:48.694
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/safe-unquote.cert (2.810s) at 15-Oct-2026 21:18:48.722
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal-safe.cert on 15-Oct-2026 21:18:48.741
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/abs.cert (0.896s) at 15-Oct-2026 21:18:48.761
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/bit-listp.cert (0.719s) at 15-Oct-2026 21:18:48.762
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/acons-unique.cert (2.776s) at 15-Oct-2026 21:18:48.795
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/verify-guards-program.cert (0.812s) at 15-Oct-2026 21:18:48.828
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pos-fix.cert (1.430s) at 15-Oct-2026 21:18:48.854
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-required.cert on 15-Oct-2026 21:18:48.801
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/apply-model-2/portcullis.cert on 15-Oct-2026 21:18:48.892
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/rassoc-equal.cert on 15-Oct-2026 21:18:48.907
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/dynamic-make-event.cert (0.709s) at 15-Oct-2026 21:18:48.921
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/if-rules.cert on 15-Oct-2026 21:18:48.921
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/integer-listp.cert on 15-Oct-2026 21:18:48.930
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/library-wrappers/list-defpkg.cert on 15-Oct-2026 21:18:48.908
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ints-in-range.cert on 15-Oct-2026 21:18:48.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-eql-dollar.cert on 15-Oct-2026 21:18:48.953
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/nld.cert on 15-Oct-2026 21:18:48.966
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/min.cert (2.438s) at 15-Oct-2026 21:18:49.046
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/parse-decimal-digits.cert (2.731s) at 15-Oct-2026 21:18:49.047
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/last-elem.cert on 15-Oct-2026 21:18:49.027
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/unguarded-primitives.cert (3.156s) at 15-Oct-2026 21:18:49.082
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/equal.cert (0.672s) at 15-Oct-2026 21:18:49.118
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/count-occs.cert (3.548s) at 15-Oct-2026 21:18:49.118
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/walter-manolios/acl2s-utils/portcullis.cert on 15-Oct-2026 21:18:49.137
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/find-index.cert (2.204s) at 15-Oct-2026 21:18:49.164
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/gamboa-primitive-roots/portcullis.cert on 15-Oct-2026 21:18:49.160
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/algorithm-theories/generic-tail-rec.cert on 15-Oct-2026 21:18:49.189
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/walter-manolios/portcullis.cert on 15-Oct-2026 21:18:49.158
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints.cert (0.714s) at 15-Oct-2026 21:18:49.230
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/use-pkg.cert on 15-Oct-2026 21:18:49.197
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/keccak/keccak-team-test-data.cert on 15-Oct-2026 21:18:49.202
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/fix.cert on 15-Oct-2026 21:18:49.302
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/clear-key.cert on 15-Oct-2026 21:18:49.181
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/limit-expt.cert (1.428s) at 15-Oct-2026 21:18:49.319
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-length-dollar.cert on 15-Oct-2026 21:18:49.318
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/sortedp-less-than-or-equal.cert (3.356s) at 15-Oct-2026 21:18:49.343
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/portcullis.cert on 15-Oct-2026 21:18:49.314
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal-safe.cert (0.624s) at 15-Oct-2026 21:18:49.394
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/stateman/portcullis.cert on 15-Oct-2026 21:18:49.439
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-eql-dollar.cert (0.489s) at 15-Oct-2026 21:18:49.456
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-is-newer-thanp.cert on 15-Oct-2026 21:18:49.437
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-duplicates-equal.cert (0.844s) at 15-Oct-2026 21:18:49.475
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/prettygoals/portcullis.cert on 15-Oct-2026 21:18:49.490
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ubi.cert (0.803s) at 15-Oct-2026 21:18:49.534
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal-lst.cert on 15-Oct-2026 21:18:49.535
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/apply-model-2/portcullis.cert (0.658s) at 15-Oct-2026 21:18:49.564
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/rassoc-equal.cert (0.664s) at 15-Oct-2026 21:18:49.583
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/theory-invariants.cert on 15-Oct-2026 21:18:49.575
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/library-wrappers/list-defpkg.cert (0.637s) at 15-Oct-2026 21:18:49.598
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/non-trivial-formals.cert on 15-Oct-2026 21:18:49.599
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/items-have-len.cert (4.260s) at 15-Oct-2026 21:18:49.617
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/assert-with-stobjs.cert on 15-Oct-2026 21:18:49.636
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-write-date-dollar.cert on 15-Oct-2026 21:18:49.660
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/if-rules.cert (0.805s) at 15-Oct-2026 21:18:49.758
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-trees.cert (3.689s) at 15-Oct-2026 21:18:49.760
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bitp.cert on 15-Oct-2026 21:18:49.754
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/nth.cert (6.258s) at 15-Oct-2026 21:18:49.837
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/finite-set-theory/total-ordering.cert (1.596s) at 15-Oct-2026 21:18:49.904
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/replace-item.cert on 15-Oct-2026 21:18:49.868
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defarbrec-template.cert on 15-Oct-2026 21:18:49.963
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/walter-manolios/acl2s-utils/portcullis.cert (0.784s) at 15-Oct-2026 21:18:49.975
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/nld.cert (0.899s) at 15-Oct-2026 21:18:49.975
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/tailtohead.cert on 15-Oct-2026 21:18:49.954
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/algorithm-theories/generic-tail-rec.cert (0.694s) at 15-Oct-2026 21:18:49.983
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ld-history.cert on 15-Oct-2026 21:18:49.974
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/union-eql-tail.cert on 15-Oct-2026 21:18:50.015
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/string-ends-inp.cert on 15-Oct-2026 21:18:50.016
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-length-dollar.cert (0.687s) at 15-Oct-2026 21:18:50.031
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmapping-templates.cert on 15-Oct-2026 21:18:50.031
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/clear-key.cert (0.718s) at 15-Oct-2026 21:18:50.035
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/upcase.cert on 15-Oct-2026 21:18:50.066
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/length.cert on 15-Oct-2026 21:18:50.024
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep-equal.cert on 15-Oct-2026 21:18:50.040
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/equiv-def.cert on 15-Oct-2026 21:18:50.071
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/last-elem.cert (1.040s) at 15-Oct-2026 21:18:50.111
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/nat-listp.cert (4.284s) at 15-Oct-2026 21:18:50.191
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/count-ifs-in-term.cert on 15-Oct-2026 21:18:50.177
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/stateman/portcullis.cert (0.750s) at 15-Oct-2026 21:18:50.242
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/maybe-replace-var.cert (3.681s) at 15-Oct-2026 21:18:50.265
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/character-list-listp.cert on 15-Oct-2026 21:18:50.264
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert (1.681s) at 15-Oct-2026 21:18:50.278
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-nth.cert on 15-Oct-2026 21:18:50.276
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/walter-manolios/portcullis.cert (1.025s) at 15-Oct-2026 21:18:50.295
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/examples/ams-types.cert on 15-Oct-2026 21:18:50.280
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/count-ifs-in-then-and-else-branches.cert on 15-Oct-2026 21:18:50.381
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/gamboa-primitive-roots/portcullis.cert (1.233s) at 15-Oct-2026 21:18:50.405
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-write-date-dollar.cert (0.743s) at 15-Oct-2026 21:18:50.419
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/cons-listp-dollar.cert on 15-Oct-2026 21:18:50.398
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/non-trivial-bindings.cert on 15-Oct-2026 21:18:50.398
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/parse-binary-digits.cert (4.466s) at 15-Oct-2026 21:18:50.434
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/modeling/nested-stobj-toy-isa.cert (11.632s) at 15-Oct-2026 21:18:50.438
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/replace-item.cert (0.504s) at 15-Oct-2026 21:18:50.459
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/book-of-event.cert on 15-Oct-2026 21:18:50.466
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/disables.cert on 15-Oct-2026 21:18:50.523
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/exit-if-function-not-defined.cert on 15-Oct-2026 21:18:50.540
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/assert-with-stobjs.cert (0.918s) at 15-Oct-2026 21:18:50.590
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/prettygoals/portcullis.cert (1.081s) at 15-Oct-2026 21:18:50.593
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-or-nice.cert on 15-Oct-2026 21:18:50.571
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/keyword-listp.cert on 15-Oct-2026 21:18:50.564
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/theory-invariants.cert (1.018s) at 15-Oct-2026 21:18:50.615
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove1-dollar-def.cert on 15-Oct-2026 21:18:50.620
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/clause-identifiers.cert on 15-Oct-2026 21:18:50.630
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/length.cert (0.595s) at 15-Oct-2026 21:18:50.689
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pack-lists.cert on 15-Oct-2026 21:18:50.679
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-equal-lst.cert (1.168s) at 15-Oct-2026 21:18:50.729
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/character-list-listp.cert (0.463s) at 15-Oct-2026 21:18:50.748
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/equiv-def.cert (0.649s) at 15-Oct-2026 21:18:50.758
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bitp.cert (1.029s) at 15-Oct-2026 21:18:50.811
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/unicode/uchar.cert on 15-Oct-2026 21:18:50.854
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help-test.acl2x on 15-Oct-2026 21:18:50.936
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/suppress-invariant-risk.cert on 15-Oct-2026 21:18:50.759
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/with-local-stobjs-tests.cert on 15-Oct-2026 21:18:50.916
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/non-trivial-bindings.cert (0.513s) at 15-Oct-2026 21:18:50.951
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/examples/ams-types.cert (0.634s) at 15-Oct-2026 21:18:50.955
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/x86/parsers/parse-elf-file.cert on 15-Oct-2026 21:18:50.965
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-pkg-check.cert on 15-Oct-2026 21:18:50.948
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/book-of-event.cert (0.487s) at 15-Oct-2026 21:18:50.988
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/cons-listp-dollar.cert (0.573s) at 15-Oct-2026 21:18:50.999
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/count-ifs-in-term.cert (0.805s) at 15-Oct-2026 21:18:51.010
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-pkg.cert on 15-Oct-2026 21:18:51.048
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defconst-fast-examples.cert on 15-Oct-2026 21:18:51.083
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/salsa/portcullis.cert (2.782s) at 15-Oct-2026 21:18:51.085
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic.cert on 15-Oct-2026 21:18:51.065
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove1-dollar-def.cert (0.460s) at 15-Oct-2026 21:18:51.100
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mydefconst-tests.cert on 15-Oct-2026 21:18:51.094
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/format-strings.cert on 15-Oct-2026 21:18:51.214
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test-1.acl2x on 15-Oct-2026 21:18:51.207
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/keyword-listp.cert (0.664s) at 15-Oct-2026 21:18:51.264
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/preceding-theory.cert on 15-Oct-2026 21:18:51.263
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defarbrec-template.cert (1.338s) at 15-Oct-2026 21:18:51.309
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/exit-if-function-not-defined.cert (0.841s) at 15-Oct-2026 21:18:51.397
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defun.cert on 15-Oct-2026 21:18:51.357
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/integer-listp.cert (2.526s) at 15-Oct-2026 21:18:51.476
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/logical-tangent.cert on 15-Oct-2026 21:18:51.492
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/split-list-fast-rules.cert (2.934s) at 15-Oct-2026 21:18:51.528
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-nth.cert (1.273s) at 15-Oct-2026 21:18:51.555
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/union-eql-tail.cert (1.516s) at 15-Oct-2026 21:18:51.560
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defun-check.cert on 15-Oct-2026 21:18:51.600
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/make-redundant.cert on 15-Oct-2026 21:18:51.663
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-required.cert (2.812s) at 15-Oct-2026 21:18:51.698
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/mydefconst-tests.cert (0.601s) at 15-Oct-2026 21:18:51.717
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/disables.cert (1.250s) at 15-Oct-2026 21:18:51.785
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/dotimes.cert on 15-Oct-2026 21:18:51.758
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/tailtohead.cert (1.759s) at 15-Oct-2026 21:18:51.799
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/with-local-stobjs-tests.cert (0.842s) at 15-Oct-2026 21:18:51.803
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/preceding-theory.cert (0.536s) at 15-Oct-2026 21:18:51.808
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/unicode/uchar.cert (0.906s) at 15-Oct-2026 21:18:51.829
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/upcase.cert (1.766s) at 15-Oct-2026 21:18:51.843
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-check.cert on 15-Oct-2026 21:18:51.805
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/count-ifs-in-then-and-else-branches.cert (1.522s) at 15-Oct-2026 21:18:51.912
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/callers-and-ancestors.cert on 15-Oct-2026 21:18:51.914
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/stobj-test.acl2x on 15-Oct-2026 21:18:51.885
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/book-checks.cert on 15-Oct-2026 21:18:51.933
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test-1.acl2x (0.704s) at 15-Oct-2026 21:18:51.979
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/computed-hint.cert on 15-Oct-2026 21:18:52.023
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.pcert0 on 15-Oct-2026 21:18:52.001
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/make-executable.cert (3.536s) at 15-Oct-2026 21:18:52.034
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-or-nice.cert (1.441s) at 15-Oct-2026 21:18:52.040
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/check-acl2-exports.cert on 15-Oct-2026 21:18:52.058
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/dead-events.cert on 15-Oct-2026 21:18:52.127
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/non-trivial-formals.cert (2.523s) at 15-Oct-2026 21:18:52.135
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/macros-skip-proofs.cert on 15-Oct-2026 21:18:52.105
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/portcullis.cert (2.842s) at 15-Oct-2026 21:18:52.198
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/csort.cert on 15-Oct-2026 21:18:52.163
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/nested.cert on 15-Oct-2026 21:18:52.168
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/search-generation.cert on 15-Oct-2026 21:18:52.204
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/nested-check.cert on 15-Oct-2026 21:18:52.207
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defproxy-test.cert on 15-Oct-2026 21:18:52.230
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/file-is-newer-thanp.cert (2.825s) at 15-Oct-2026 21:18:52.287
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defrule.cert on 15-Oct-2026 21:18:52.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/logical-tangent.cert (0.824s) at 15-Oct-2026 21:18:52.339
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/disassemble.cert on 15-Oct-2026 21:18:52.378
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defun.cert (0.994s) at 15-Oct-2026 21:18:52.412
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/require-book.cert on 15-Oct-2026 21:18:52.455
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic.cert (1.398s) at 15-Oct-2026 21:18:52.492
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ld-history.cert (2.512s) at 15-Oct-2026 21:18:52.509
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/format-strings.cert (1.268s) at 15-Oct-2026 21:18:52.511
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dijkstra-shortest-path.cert on 15-Oct-2026 21:18:52.487
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/character-encoding-test.cert on 15-Oct-2026 21:18:52.565
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hanoi.cert on 15-Oct-2026 21:18:52.576
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/string-ends-inp.cert (2.579s) at 15-Oct-2026 21:18:52.624
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defattach-bang.cert on 15-Oct-2026 21:18:52.546
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/check-fn-inst.cert on 15-Oct-2026 21:18:52.658
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ints-in-range.cert (3.722s) at 15-Oct-2026 21:18:52.686
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defun-check.cert (1.049s) at 15-Oct-2026 21:18:52.694
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/clause-identifiers.cert (2.097s) at 15-Oct-2026 21:18:52.746
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/fix.cert (3.433s) at 15-Oct-2026 21:18:52.749
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defproxy-test.cert (0.516s) at 15-Oct-2026 21:18:52.782
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/eliminate-irrelevance-tests.cert on 15-Oct-2026 21:18:52.782
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/how-to-prove-thms.cert on 15-Oct-2026 21:18:52.799
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/integer-type-set-test.cert on 15-Oct-2026 21:18:52.805
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/nested-check.cert (0.570s) at 15-Oct-2026 21:18:52.834
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/multi-v-uni.cert on 15-Oct-2026 21:18:52.836
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/nested.cert (0.646s) at 15-Oct-2026 21:18:52.864
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/search-generation.cert (0.662s) at 15-Oct-2026 21:18:52.906
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/callers-and-ancestors.cert (1.009s) at 15-Oct-2026 21:18:52.929
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/suppress-invariant-risk.cert (1.983s) at 15-Oct-2026 21:18:52.931
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/priorities.cert on 15-Oct-2026 21:18:52.880
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/character-encoding-test.cert (0.371s) at 15-Oct-2026 21:18:52.953
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/enumerate.cert on 15-Oct-2026 21:18:52.922
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/getprop.cert on 15-Oct-2026 21:18:52.926
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/subtermp.cert (5.978s) at 15-Oct-2026 21:18:53.011
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/redef-pkg.cert on 15-Oct-2026 21:18:53.007
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmapping-templates.cert (2.994s) at 15-Oct-2026 21:18:53.037
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defattach-bang.cert (0.436s) at 15-Oct-2026 21:18:53.067
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defrule.cert (0.748s) at 15-Oct-2026 21:18:53.074
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sticky-disable.cert on 15-Oct-2026 21:18:53.054
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/require-book.cert (0.571s) at 15-Oct-2026 21:18:53.081
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/transfinite.cert on 15-Oct-2026 21:18:53.109
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/pkg1.cert on 15-Oct-2026 21:18:53.098
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/defconst-fast-examples.cert (2.063s) at 15-Oct-2026 21:18:53.150
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep-equal.cert (3.082s) at 15-Oct-2026 21:18:53.177
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/wet.cert on 15-Oct-2026 21:18:53.200
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-check.cert (1.304s) at 15-Oct-2026 21:18:53.228
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/x86/parsers/parse-elf-file.cert (2.251s) at 15-Oct-2026 21:18:53.263
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/save-time.cert on 15-Oct-2026 21:18:53.266
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/oprof.cert on 15-Oct-2026 21:18:53.280
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rewrite-theory.cert on 15-Oct-2026 21:18:53.271
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/check-fn-inst.cert (0.552s) at 15-Oct-2026 21:18:53.298
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/pkg2.cert on 15-Oct-2026 21:18:53.307
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logs.cert on 15-Oct-2026 21:18:53.330
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/book-checks.cert (1.454s) at 15-Oct-2026 21:18:53.400
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logior1-proofs.cert on 15-Oct-2026 21:18:53.413
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/use-pkg.cert (4.145s) at 15-Oct-2026 21:18:53.464
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/all-ones.cert on 15-Oct-2026 21:18:53.492
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-pkg-check.cert (2.520s) at 15-Oct-2026 21:18:53.538
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/profiling.cert on 15-Oct-2026 21:18:53.581
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/package-defs.cert on 15-Oct-2026 21:18:53.628
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/pkg2.cert (0.356s) at 15-Oct-2026 21:18:53.698
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/redef-pkg.cert (0.724s) at 15-Oct-2026 21:18:53.749
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/util.cert on 15-Oct-2026 21:18:53.753
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sort-symbols.cert on 15-Oct-2026 21:18:53.668
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/guard-verified-m1/use-when.cert on 15-Oct-2026 21:18:53.802
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/m5/perm.cert on 15-Oct-2026 21:18:53.808
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/priorities.cert (0.867s) at 15-Oct-2026 21:18:53.826
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert on 15-Oct-2026 21:18:53.840
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/process-book-readme.cert on 15-Oct-2026 21:18:53.738
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/transfinite.cert (0.715s) at 15-Oct-2026 21:18:53.862
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert on 15-Oct-2026 21:18:53.959
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/wet.cert (0.699s) at 15-Oct-2026 21:18:53.975
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sticky-disable.cert (0.941s) at 15-Oct-2026 21:18:54.021
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 15-Oct-2026 21:18:54.049
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/save-time.cert (0.769s) at 15-Oct-2026 21:18:54.069
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert on 15-Oct-2026 21:18:54.065
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rewrite-theory.cert (0.806s) at 15-Oct-2026 21:18:54.113
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/how-to-prove-thms.cert (1.305s) at 15-Oct-2026 21:18:54.123
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-counter-examples.cert on 15-Oct-2026 21:18:54.123
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/proof-of-well-foundedness.cert on 15-Oct-2026 21:18:54.156
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/package-defs.cert (0.540s) at 15-Oct-2026 21:18:54.177
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/enumerate.cert (1.240s) at 15-Oct-2026 21:18:54.204
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/codewalker/if-tracker.cert on 15-Oct-2026 21:18:54.236
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/getprop.cert (1.276s) at 15-Oct-2026 21:18:54.260
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/async/tools/convert-edif.cert on 15-Oct-2026 21:18:54.263
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/bewijs.cert on 15-Oct-2026 21:18:54.272
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rom-helpers.cert on 15-Oct-2026 21:18:54.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/csort.cert (2.041s) at 15-Oct-2026 21:18:54.334
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/general.cert on 15-Oct-2026 21:18:54.328
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/m1-original/problem-set-1-answers.cert on 15-Oct-2026 21:18:54.321
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/stobj-test.acl2x (2.453s) at 15-Oct-2026 21:18:54.403
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/case-match.cert (16.164s) at 15-Oct-2026 21:18:54.433
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/file-system-lemmas.cert on 15-Oct-2026 21:18:54.430
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/openers.cert on 15-Oct-2026 21:18:54.387
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/guard-verified-m1/use-when.cert (0.657s) at 15-Oct-2026 21:18:54.475
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/util.cert (0.734s) at 15-Oct-2026 21:18:54.502
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/utilities/bounded-nat-listp.cert on 15-Oct-2026 21:18:54.513
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert (0.704s) at 15-Oct-2026 21:18:54.564
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/constants.cert on 15-Oct-2026 21:18:54.576
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/cat-def.cert on 15-Oct-2026 21:18:54.546
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-counter-examples.cert (0.549s) at 15-Oct-2026 21:18:54.681
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert (0.633s) at 15-Oct-2026 21:18:54.710
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/basic-pkg.cert (3.638s) at 15-Oct-2026 21:18:54.716
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/make-redundant.cert (3.039s) at 15-Oct-2026 21:18:54.733
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (0.706s) at 15-Oct-2026 21:18:54.766
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/eliminate-irrelevance-tests.cert (1.954s) at 15-Oct-2026 21:18:54.782
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help-test.acl2x (3.843s) at 15-Oct-2026 21:18:54.789
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/pltpa.cert on 15-Oct-2026 21:18:54.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/regex-chartrans.cert on 15-Oct-2026 21:18:54.818
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/incremental/limits.cert on 15-Oct-2026 21:18:54.848
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/bewijs.cert (0.543s) at 15-Oct-2026 21:18:54.863
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/lrat-checker.cert on 15-Oct-2026 21:18:54.860
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/general.cert (0.572s) at 15-Oct-2026 21:18:54.912
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/lrat-checker.cert on 15-Oct-2026 21:18:54.902
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/all-ones.cert (1.418s) at 15-Oct-2026 21:18:54.933
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/process-book-readme.cert (1.020s) at 15-Oct-2026 21:18:54.934
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/old-literal.cert on 15-Oct-2026 21:18:54.951
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logs.cert (1.625s) at 15-Oct-2026 21:18:54.963
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/dpss/Util/except.cert on 15-Oct-2026 21:18:54.956
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/pkg1.cert (1.799s) at 15-Oct-2026 21:18:54.971
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/m1-original/problem-set-1-answers.cert (0.578s) at 15-Oct-2026 21:18:55.085
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/security/jfkr/encryption.cert on 15-Oct-2026 21:18:54.999
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/code/tree-manip/quicksort.cert on 15-Oct-2026 21:18:55.119
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/sets.cert on 15-Oct-2026 21:18:55.081
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert on 15-Oct-2026 21:18:55.144
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/utilities/generate-index-list.cert on 15-Oct-2026 21:18:55.127
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/macros-skip-proofs.cert (2.994s) at 15-Oct-2026 21:18:55.194
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/m5/perm.cert (1.362s) at 15-Oct-2026 21:18:55.219
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/defset-macros.cert on 15-Oct-2026 21:18:55.204
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/wp-gen/shared.cert on 15-Oct-2026 21:18:55.205
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert (1.265s) at 15-Oct-2026 21:18:55.265
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pack-lists.cert (4.620s) at 15-Oct-2026 21:18:55.323
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/cat-def.cert (0.718s) at 15-Oct-2026 21:18:55.365
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/soundness/clock-partial.cert on 15-Oct-2026 21:18:55.366
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/soundness/clock-total.cert on 15-Oct-2026 21:18:55.408
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel1/support/rewrite-theory.cert on 15-Oct-2026 21:18:55.429
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/utilities/bounded-nat-listp.cert (0.900s) at 15-Oct-2026 21:18:55.441
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/integer-type-set-test.cert (2.677s) at 15-Oct-2026 21:18:55.490
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/regex-chartrans.cert (0.666s) at 15-Oct-2026 21:18:55.498
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/disassemble.cert (3.155s) at 15-Oct-2026 21:18:55.540
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert on 15-Oct-2026 21:18:55.541
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/dotimes.cert (3.764s) at 15-Oct-2026 21:18:55.563
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sort-symbols.cert (1.712s) at 15-Oct-2026 21:18:55.583
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert on 15-Oct-2026 21:18:55.580
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert on 15-Oct-2026 21:18:55.587
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert on 15-Oct-2026 21:18:55.638
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/primp-database.cert on 15-Oct-2026 21:18:55.647
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hanoi.cert (3.080s) at 15-Oct-2026 21:18:55.712
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/completeness/generic-partial.cert on 15-Oct-2026 21:18:55.727
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert on 15-Oct-2026 21:18:55.684
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert on 15-Oct-2026 21:18:55.764
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/computed-hint.cert (3.753s) at 15-Oct-2026 21:18:55.795
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert on 15-Oct-2026 21:18:55.788
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/database/db-from-list.cert on 15-Oct-2026 21:18:55.736
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/completeness/generic-total.cert on 15-Oct-2026 21:18:55.821
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/constants.cert (1.189s) at 15-Oct-2026 21:18:55.850
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert on 15-Oct-2026 21:18:55.861
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/wp-gen/shared.cert (0.664s) at 15-Oct-2026 21:18:55.894
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert on 15-Oct-2026 21:18:55.948
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/tree-score/efficient-pscores-help.cert on 15-Oct-2026 21:18:55.976
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/legacy-defrstobj/portcullis.cert on 15-Oct-2026 21:18:55.925
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/openers.cert (1.529s) at 15-Oct-2026 21:18:56.010
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert on 15-Oct-2026 21:18:56.005
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rom-helpers.cert (1.687s) at 15-Oct-2026 21:18:56.048
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/security/jfkr/encryption.cert (0.932s) at 15-Oct-2026 21:18:56.064
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel1/support/rewrite-theory.cert (0.694s) at 15-Oct-2026 21:18:56.132
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/soundness/clock-total.cert (0.797s) at 15-Oct-2026 21:18:56.216
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/oprof.cert (3.003s) at 15-Oct-2026 21:18:56.306
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert (0.758s) at 15-Oct-2026 21:18:56.311
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/log-equal.cert on 15-Oct-2026 21:18:56.319
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/openers.cert on 15-Oct-2026 21:18:56.379
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert (0.791s) at 15-Oct-2026 21:18:56.393
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert on 15-Oct-2026 21:18:56.396
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/package-defs.cert on 15-Oct-2026 21:18:56.425
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/package-defs.cert on 15-Oct-2026 21:18:56.457
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert (0.773s) at 15-Oct-2026 21:18:56.492
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert (0.736s) at 15-Oct-2026 21:18:56.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/rom-helpers.cert on 15-Oct-2026 21:18:56.503
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/rom-helpers.cert on 15-Oct-2026 21:18:56.585
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/fast-and.cert on 15-Oct-2026 21:18:56.582
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/openers.cert on 15-Oct-2026 21:18:56.555
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/check-acl2-exports.cert (4.541s) at 15-Oct-2026 21:18:56.611
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/profiling.cert (2.985s) at 15-Oct-2026 21:18:56.652
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/async/tools/convert-edif.cert (2.391s) at 15-Oct-2026 21:18:56.664
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/fm9001/primp-database.cert (0.968s) at 15-Oct-2026 21:18:56.666
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/legacy-defrstobj/portcullis.cert (0.651s) at 15-Oct-2026 21:18:56.666
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/dead-events.cert (4.563s) at 15-Oct-2026 21:18:56.704
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert (0.842s) at 15-Oct-2026 21:18:56.738
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/rom-helpers.cert on 15-Oct-2026 21:18:56.759
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/openers.cert on 15-Oct-2026 21:18:56.764
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert (0.391s) at 15-Oct-2026 21:18:56.801
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/openers.cert on 15-Oct-2026 21:18:56.703
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/rom-helpers.cert on 15-Oct-2026 21:18:56.861
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/openers.cert (0.540s) at 15-Oct-2026 21:18:56.930
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/package-defs.cert (0.492s) at 15-Oct-2026 21:18:56.941
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/log-equal.cert (0.620s) at 15-Oct-2026 21:18:56.947
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/package-defs.cert on 15-Oct-2026 21:18:56.962
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/proof-of-well-foundedness.cert (2.855s) at 15-Oct-2026 21:18:57.023
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/generate-symbol.cert on 15-Oct-2026 21:18:57.030
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logior1-proofs.cert (3.608s) at 15-Oct-2026 21:18:57.042
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/completeness/generic-total.cert (1.200s) at 15-Oct-2026 21:18:57.053
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/compare-out-files.cert on 15-Oct-2026 21:18:57.070
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/dead-source-code.cert on 15-Oct-2026 21:18:57.112
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/openers.cert (0.535s) at 15-Oct-2026 21:18:57.159
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert on 15-Oct-2026 21:18:57.164
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/bigger-limits.cert on 15-Oct-2026 21:18:57.184
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/rom-helpers.cert (0.671s) at 15-Oct-2026 21:18:57.213
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/log-equal.cert on 15-Oct-2026 21:18:57.210
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/rom-helpers.cert (0.675s) at 15-Oct-2026 21:18:57.274
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/fast-and.cert on 15-Oct-2026 21:18:57.284
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/rom-helpers.cert (0.520s) at 15-Oct-2026 21:18:57.394
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/sets.cert (2.246s) at 15-Oct-2026 21:18:57.412
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert (1.621s) at 15-Oct-2026 21:18:57.425
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/parallel/proofs/ideal-speedup.cert on 15-Oct-2026 21:18:57.429
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/openers.cert (0.678s) at 15-Oct-2026 21:18:57.487
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-2.acl2x on 15-Oct-2026 21:18:57.484
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-1.acl2x on 15-Oct-2026 21:18:57.493
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert (1.706s) at 15-Oct-2026 21:18:57.508
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/lib/package-defs.cert (1.041s) at 15-Oct-2026 21:18:57.524
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-array/supplemental/old-literal.cert (2.590s) at 15-Oct-2026 21:18:57.559
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/package-defs.cert on 15-Oct-2026 21:18:57.585
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/dpss/Util/except.cert (2.626s) at 15-Oct-2026 21:18:57.594
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/openers.cert on 15-Oct-2026 21:18:57.588
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.pcert0 on 15-Oct-2026 21:18:57.608
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/package-defs.cert on 15-Oct-2026 21:18:57.633
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/absstobj-with-arrays.cert on 15-Oct-2026 21:18:57.639
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.pcert0 on 15-Oct-2026 21:18:57.634
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/optimize-check-aux.cert on 15-Oct-2026 21:18:57.629
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/input-signature-mismatch-with-logic-ok.cert on 15-Oct-2026 21:18:57.701
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/pkg-test.cert on 15-Oct-2026 21:18:57.705
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/abs-abs.cert on 15-Oct-2026 21:18:57.724
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/bigger-limits.cert (0.574s) at 15-Oct-2026 21:18:57.768
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/absstobj-with-hash-tables.cert on 15-Oct-2026 21:18:57.852
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/fast-and.cert (0.597s) at 15-Oct-2026 21:18:57.919
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/database/db-from-list.cert (2.142s) at 15-Oct-2026 21:18:57.967
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/rom-helpers.cert (1.213s) at 15-Oct-2026 21:18:57.984
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert (2.088s) at 15-Oct-2026 21:18:58.046
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj-simpler.cert on 15-Oct-2026 21:18:58.069
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/openers.cert (1.311s) at 15-Oct-2026 21:18:58.089
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/package-defs.cert (0.478s) at 15-Oct-2026 21:18:58.125
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/incremental/limits.cert (3.268s) at 15-Oct-2026 21:18:58.131
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/redef.cert on 15-Oct-2026 21:18:58.124
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib3/openers.cert (0.522s) at 15-Oct-2026 21:18:58.138
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/encap.cert on 15-Oct-2026 21:18:58.150
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/sub1.cert on 15-Oct-2026 21:18:58.217
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib1/package-defs.cert (1.262s) at 15-Oct-2026 21:18:58.255
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/verify-termination.cert on 15-Oct-2026 21:18:58.258
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/generate-symbol.cert (1.253s) at 15-Oct-2026 21:18:58.298
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert (2.778s) at 15-Oct-2026 21:18:58.369
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/defun-fast-alist.cert on 15-Oct-2026 21:18:58.373
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-1.acl2x (0.864s) at 15-Oct-2026 21:18:58.382
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-hons-copy-local.cert on 15-Oct-2026 21:18:58.454
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-2.acl2x (0.963s) at 15-Oct-2026 21:18:58.464
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/eq-test.cert on 15-Oct-2026 21:18:58.465
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.pcert0 (0.876s) at 15-Oct-2026 21:18:58.504
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/input-signature-mismatch-with-logic-ok.cert (0.814s) at 15-Oct-2026 21:18:58.525
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/nth-update-nth-meta-extract.cert (19.855s) at 15-Oct-2026 21:18:58.564
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist.cert on 15-Oct-2026 21:18:58.616
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-ordered-nums-stobj.cert on 15-Oct-2026 21:18:58.562
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-local.cert on 15-Oct-2026 21:18:58.619
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/redef.cert (0.496s) at 15-Oct-2026 21:18:58.640
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-acons-bang-local.cert on 15-Oct-2026 21:18:58.663
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-acons-bang.cert on 15-Oct-2026 21:18:58.703
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj.cert on 15-Oct-2026 21:18:58.719
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/fast-and.cert (2.138s) at 15-Oct-2026 21:18:58.772
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.pcert0 (1.151s) at 15-Oct-2026 21:18:58.811
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/verify-termination.cert (0.582s) at 15-Oct-2026 21:18:58.849
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/multi-v-uni.cert (5.997s) at 15-Oct-2026 21:18:58.861
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-const.cert on 15-Oct-2026 21:18:58.748
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-local.cert on 15-Oct-2026 21:18:58.854
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons.cert on 15-Oct-2026 21:18:58.902
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-hons-copy.cert on 15-Oct-2026 21:18:58.884
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test1.cert on 15-Oct-2026 21:18:58.917
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test1-local.cert on 15-Oct-2026 21:18:58.938
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-hons-copy-local.cert (0.483s) at 15-Oct-2026 21:18:58.947
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist.cert (0.342s) at 15-Oct-2026 21:18:58.966
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/codewalker/if-tracker.cert (4.704s) at 15-Oct-2026 21:18:58.969
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/sub1.cert (0.762s) at 15-Oct-2026 21:18:58.988
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-def-hons.cert on 15-Oct-2026 21:18:58.964
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test2-local.cert on 15-Oct-2026 21:18:59.034
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-acons-bang-local.cert (0.391s) at 15-Oct-2026 21:18:59.067
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/log-equal.cert (1.838s) at 15-Oct-2026 21:18:59.069
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-local.cert (0.446s) at 15-Oct-2026 21:18:59.073
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/ttag.cert on 15-Oct-2026 21:18:59.073
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/fmt-to-string-pkg.cert on 15-Oct-2026 21:18:59.095
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/dead-source-code.cert (1.990s) at 15-Oct-2026 21:18:59.121
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/induction-rule-with-disabled-scheme.cert on 15-Oct-2026 21:18:59.169
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert (3.178s) at 15-Oct-2026 21:18:59.196
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/local-port.cert on 15-Oct-2026 21:18:59.194
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-acons-bang.cert (0.502s) at 15-Oct-2026 21:18:59.219
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/fmt-to-string.cert on 15-Oct-2026 21:18:59.205
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-formals.cert on 15-Oct-2026 21:18:59.233
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-two-updates.cert on 15-Oct-2026 21:18:59.300
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons.cert (0.418s) at 15-Oct-2026 21:18:59.330
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/stobj-issues.cert on 15-Oct-2026 21:18:59.427
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test2-local.cert (0.429s) at 15-Oct-2026 21:18:59.486
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-const-hons.cert on 15-Oct-2026 21:18:59.319
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/utilities/generate-index-list.cert (4.417s) at 15-Oct-2026 21:18:59.590
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/eq-test.cert (1.173s) at 15-Oct-2026 21:18:59.650
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test1.cert (0.746s) at 15-Oct-2026 21:18:59.677
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/hons-local.cert (0.783s) at 15-Oct-2026 21:18:59.684
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/fmt-to-string-pkg.cert (0.607s) at 15-Oct-2026 21:18:59.710
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/tree-score/efficient-pscores-help.cert (3.735s) at 15-Oct-2026 21:18:59.743
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/pltpa.cert (4.881s) at 15-Oct-2026 21:18:59.757
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/verify-termination/sub.cert on 15-Oct-2026 21:18:59.697
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj-simpler.cert (1.670s) at 15-Oct-2026 21:18:59.763
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/fast-alist-hons-copy.cert (0.846s) at 15-Oct-2026 21:18:59.765
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.pcert0 (7.757s) at 15-Oct-2026 21:18:59.791
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/ac-example.cert on 15-Oct-2026 21:18:59.827
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-minimal-1d.cert on 15-Oct-2026 21:18:59.825
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/adder.cert on 15-Oct-2026 21:18:59.835
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/compiler.cert on 15-Oct-2026 21:18:59.878
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test2.cert on 15-Oct-2026 21:18:59.853
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/insertion-sort.cert on 15-Oct-2026 21:18:59.887
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/optimize-check-aux.cert (2.214s) at 15-Oct-2026 21:18:59.899
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/induction-rule-with-disabled-scheme.cert (0.761s) at 15-Oct-2026 21:18:59.969
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/compress.cert on 15-Oct-2026 21:19:00.007
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/compare-out-files.cert (2.921s) at 15-Oct-2026 21:19:00.025
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/package-defs.cert (2.443s) at 15-Oct-2026 21:19:00.042
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/fmt-to-string.cert (0.743s) at 15-Oct-2026 21:19:00.059
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/xtr.cert on 15-Oct-2026 21:19:00.117
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/how-many-soln2.cert on 15-Oct-2026 21:19:00.055
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/state-p-in-guard.cert on 15-Oct-2026 21:19:00.177
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap3/programs.cert on 15-Oct-2026 21:19:00.145
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/ttag.cert (1.102s) at 15-Oct-2026 21:19:00.201
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/soundness/clock-partial.cert (4.895s) at 15-Oct-2026 21:19:00.279
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap5/solutions.cert on 15-Oct-2026 21:19:00.297
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/tau-contradiction.cert on 15-Oct-2026 21:19:00.289
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-minimal-1d.cert (0.463s) at 15-Oct-2026 21:19:00.306
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/tree.cert on 15-Oct-2026 21:19:00.310
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/local-port.cert (1.143s) at 15-Oct-2026 21:19:00.367
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-ordered-nums-stobj.cert (1.691s) at 15-Oct-2026 21:19:00.382
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/verify-termination/sub.cert (0.658s) at 15-Oct-2026 21:19:00.435
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/completeness/generic-partial.cert (4.719s) at 15-Oct-2026 21:19:00.462
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/update-state.cert on 15-Oct-2026 21:19:00.448
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/define-keyed-function.cert on 15-Oct-2026 21:19:00.485
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/cws.cert on 15-Oct-2026 21:19:00.622
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap4/solutions-program-mode.cert on 15-Oct-2026 21:19:00.617
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test2.cert (0.717s) at 15-Oct-2026 21:19:00.658
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/encap.cert (2.502s) at 15-Oct-2026 21:19:00.670
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defined-const.cert on 15-Oct-2026 21:19:00.696
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defttag-muffled.cert on 15-Oct-2026 21:19:00.728
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/in-raw-mode.cert on 15-Oct-2026 21:19:00.724
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-eval-real.cert on 15-Oct-2026 21:19:00.743
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/k-induction.cert on 15-Oct-2026 21:19:00.779
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rewrite-with-equality.cert on 15-Oct-2026 21:19:00.776
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-two-updates.cert (1.493s) at 15-Oct-2026 21:19:00.804
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/tau-contradiction.cert (0.560s) at 15-Oct-2026 21:19:00.870
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/saved-errors.cert on 15-Oct-2026 21:19:00.898
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/define-keyed-function.cert (0.492s) at 15-Oct-2026 21:19:00.990
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/defun-fast-alist.cert (2.642s) at 15-Oct-2026 21:19:01.025
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/stobj-issues.cert (1.547s) at 15-Oct-2026 21:19:01.027
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj.cert (2.210s) at 15-Oct-2026 21:19:01.058
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/compiler.cert (1.181s) at 15-Oct-2026 21:19:01.073
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/compress.cert (1.063s) at 15-Oct-2026 21:19:01.090
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/time-dollar-with-gc.cert on 15-Oct-2026 21:19:01.089
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-maximal-1d.cert on 15-Oct-2026 21:19:01.096
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/abs-abs.cert (3.382s) at 15-Oct-2026 21:19:01.119
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/with-supporters-test-sub.cert on 15-Oct-2026 21:19:01.139
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert on 15-Oct-2026 21:19:01.183
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/cws.cert (0.556s) at 15-Oct-2026 21:19:01.196
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/fact.cert on 15-Oct-2026 21:19:01.197
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/xtr.cert (1.107s) at 15-Oct-2026 21:19:01.235
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partition-defuns.cert on 15-Oct-2026 21:19:01.226
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 15-Oct-2026 21:19:01.277
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap5/solutions.cert (1.019s) at 15-Oct-2026 21:19:01.322
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert on 15-Oct-2026 21:19:01.326
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/test1-local.cert (2.399s) at 15-Oct-2026 21:19:01.348
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 12595 Oct 15 21:18 sets.cert
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/records.cert on Thu Oct 15 21:19:01 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/table-replay.cert on 15-Oct-2026 21:19:01.476
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/code/tree-manip/quicksort.cert (6.384s) at 15-Oct-2026 21:19:01.532
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/time-dollar-with-gc.cert (0.449s) at 15-Oct-2026 21:19:01.552
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defttag-muffled.cert (0.835s) at 15-Oct-2026 21:19:01.586
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert on 15-Oct-2026 21:19:01.572
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/graph/helpers.cert on 15-Oct-2026 21:19:01.598
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert on 15-Oct-2026 21:19:01.611
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert on 15-Oct-2026 21:19:01.626
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert on 15-Oct-2026 21:19:01.650
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-eval-real.cert (0.922s) at 15-Oct-2026 21:19:01.676
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defined-const.cert (0.983s) at 15-Oct-2026 21:19:01.725
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise1.cert on 15-Oct-2026 21:19:01.724
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/in-raw-mode.cert (0.979s) at 15-Oct-2026 21:19:01.728
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dijkstra-shortest-path.cert (9.073s) at 15-Oct-2026 21:19:01.736
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/with-supporters-test-sub.cert (0.571s) at 15-Oct-2026 21:19:01.749
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/de-hdl/help-defuns.cert on 15-Oct-2026 21:19:01.742
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/fact.cert (0.551s) at 15-Oct-2026 21:19:01.788
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert on 15-Oct-2026 21:19:01.760
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partition-defuns.cert (0.561s) at 15-Oct-2026 21:19:01.812
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise2.cert on 15-Oct-2026 21:19:01.813
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise7a.cert on 15-Oct-2026 21:19:01.874
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise4b.cert on 15-Oct-2026 21:19:01.820
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise6b.cert on 15-Oct-2026 21:19:01.884
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/pkg-test.cert (4.248s) at 15-Oct-2026 21:19:01.971
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert (4.808s) at 15-Oct-2026 21:19:01.988
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert (0.661s) at 15-Oct-2026 21:19:02.007
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise6a.cert on 15-Oct-2026 21:19:02.001
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise4a.cert on 15-Oct-2026 21:19:02.054
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise5.cert on 15-Oct-2026 21:19:02.097
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert (0.541s) at 15-Oct-2026 21:19:02.154
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (0.851s) at 15-Oct-2026 21:19:02.156
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise7b.cert on 15-Oct-2026 21:19:02.160
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/sets.cert on 15-Oct-2026 21:19:02.138
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/solutions/defung.cert on 15-Oct-2026 21:19:02.174
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/table-replay.cert (0.712s) at 15-Oct-2026 21:19:02.205
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/tree.cert (1.899s) at 15-Oct-2026 21:19:02.251
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/vhdl.cert on 15-Oct-2026 21:19:02.246
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/graph/helpers.cert (0.672s) at 15-Oct-2026 21:19:02.280
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert on 15-Oct-2026 21:19:02.351
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert on 15-Oct-2026 21:19:02.407
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/ac-example.cert (2.667s) at 15-Oct-2026 21:19:02.512
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/lrat-checker.cert (7.706s) at 15-Oct-2026 21:19:02.604
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert on 15-Oct-2026 21:19:02.621
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/pipeline/exercise.cert on 15-Oct-2026 21:19:02.652
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise7a.cert (0.781s) at 15-Oct-2026 21:19:02.662
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert on 15-Oct-2026 21:19:02.695
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert on 15-Oct-2026 21:19:02.821
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise5.cert (0.748s) at 15-Oct-2026 21:19:02.861
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/absstobj-with-hash-tables.cert (5.037s) at 15-Oct-2026 21:19:02.914
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert on 15-Oct-2026 21:19:03.012
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise1.cert (1.362s) at 15-Oct-2026 21:19:03.093
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert on 15-Oct-2026 21:19:03.092
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/insertion-sort.cert (3.249s) at 15-Oct-2026 21:19:03.148
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert (1.984s) at 15-Oct-2026 21:19:03.188
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert on 15-Oct-2026 21:19:03.205
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert (0.799s) at 15-Oct-2026 21:19:03.221
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/term.cert on 15-Oct-2026 21:19:03.246
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise4b.cert (1.380s) at 15-Oct-2026 21:19:03.275
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/absstobj-with-arrays.cert (5.623s) at 15-Oct-2026 21:19:03.277
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/saved-errors.cert (2.376s) at 15-Oct-2026 21:19:03.287
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/sets.cert (1.101s) at 15-Oct-2026 21:19:03.294
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert on 15-Oct-2026 21:19:03.306
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert on 15-Oct-2026 21:19:03.311
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/pipeline/exercise.cert (0.715s) at 15-Oct-2026 21:19:03.373
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert (1.687s) at 15-Oct-2026 21:19:03.378
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-mgr.cert on 15-Oct-2026 21:19:03.380
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat.cert on 15-Oct-2026 21:19:03.384
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/bad-def1.cert on 15-Oct-2026 21:19:03.395
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert (0.568s) at 15-Oct-2026 21:19:03.409
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/bad-def.cert on 15-Oct-2026 21:19:03.408
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/defpr.cert on 15-Oct-2026 21:19:03.468
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert (0.471s) at 15-Oct-2026 21:19:03.498
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/fix.cert on 15-Oct-2026 21:19:03.511
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/keccak/keccak-team-test-data.cert (12.707s) at 15-Oct-2026 21:19:03.596
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/tail.cert on 15-Oct-2026 21:19:03.590
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/primitive.cert on 15-Oct-2026 21:19:03.594
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/de-hdl/help-defuns.cert (1.814s) at 15-Oct-2026 21:19:03.606
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert (0.984s) at 15-Oct-2026 21:19:03.625
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert on 15-Oct-2026 21:19:03.663
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert on 15-Oct-2026 21:19:03.683
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert on 15-Oct-2026 21:19:03.696
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rewrite-with-equality.cert (2.893s) at 15-Oct-2026 21:19:03.706
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert (0.601s) at 15-Oct-2026 21:19:03.709
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-const.cert (4.659s) at 15-Oct-2026 21:19:03.723
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert on 15-Oct-2026 21:19:03.717
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap10/adder.cert (3.854s) at 15-Oct-2026 21:19:03.742
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert on 15-Oct-2026 21:19:03.785
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert (1.094s) at 15-Oct-2026 21:19:03.802
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert on 15-Oct-2026 21:19:03.831
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert (0.633s) at 15-Oct-2026 21:19:03.853
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tau/bounders/find-maximal-1d.cert (2.896s) at 15-Oct-2026 21:19:04.004
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/fix.cert (0.498s) at 15-Oct-2026 21:19:04.017
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise4a.cert (1.977s) at 15-Oct-2026 21:19:04.056
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert on 15-Oct-2026 21:19:04.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert on 15-Oct-2026 21:19:04.124
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert on 15-Oct-2026 21:19:04.186
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert on 15-Oct-2026 21:19:04.178
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert on 15-Oct-2026 21:19:04.208
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/term.cert (1.049s) at 15-Oct-2026 21:19:04.305
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/tail.cert (0.701s) at 15-Oct-2026 21:19:04.306
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert (0.665s) at 15-Oct-2026 21:19:04.341
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/defpr.cert (0.908s) at 15-Oct-2026 21:19:04.398
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert on 15-Oct-2026 21:19:04.315
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert (1.075s) at 15-Oct-2026 21:19:04.422
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/austel/support/abs-type.cert on 15-Oct-2026 21:19:04.441
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert (2.812s) at 15-Oct-2026 21:19:04.450
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert on 15-Oct-2026 21:19:04.441
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert on 15-Oct-2026 21:19:04.489
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/bis.cert on 15-Oct-2026 21:19:04.503
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert (0.813s) at 15-Oct-2026 21:19:04.521
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/solutions/defung.cert (2.378s) at 15-Oct-2026 21:19:04.578
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/state-p-in-guard.cert (4.408s) at 15-Oct-2026 21:19:04.628
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert on 15-Oct-2026 21:19:04.647
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/update-state.cert (4.089s) at 15-Oct-2026 21:19:04.699
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/instance.cert on 15-Oct-2026 21:19:04.719
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/cowles-gamboa/support/WyoM1.cert on 15-Oct-2026 21:19:04.680
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/sumners/support/n2n.cert on 15-Oct-2026 21:19:04.753
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/sumners/support/simple.cert on 15-Oct-2026 21:19:04.802
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/primitives.cert on 15-Oct-2026 21:19:04.809
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert (3.268s) at 15-Oct-2026 21:19:04.896
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/bad-def1.cert (1.506s) at 15-Oct-2026 21:19:04.919
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert (0.880s) at 15-Oct-2026 21:19:04.976
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert (0.759s) at 15-Oct-2026 21:19:05.020
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/legato/support/generic-theories.cert on 15-Oct-2026 21:19:05.026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert (0.569s) at 15-Oct-2026 21:19:05.066
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert (1.759s) at 15-Oct-2026 21:19:05.079
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-formals.cert (5.819s) at 15-Oct-2026 21:19:05.100
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert (0.718s) at 15-Oct-2026 21:19:05.150
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert (1.451s) at 15-Oct-2026 21:19:05.156
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert (1.030s) at 15-Oct-2026 21:19:05.173
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert on 15-Oct-2026 21:19:05.157
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert on 15-Oct-2026 21:19:05.168
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert on 15-Oct-2026 21:19:05.205
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert on 15-Oct-2026 21:19:05.232
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/gameiro-manolios/support/nth-thms.cert on 15-Oct-2026 21:19:05.285
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap3/programs.cert (5.119s) at 15-Oct-2026 21:19:05.321
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/sumners/support/simple.cert (0.509s) at 15-Oct-2026 21:19:05.333
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert on 15-Oct-2026 21:19:05.431
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert on 15-Oct-2026 21:19:05.425
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert on 15-Oct-2026 21:19:05.465
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/lists/list-exports.cert on 15-Oct-2026 21:19:05.472
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/ruiz-et-al/support/lists.cert on 15-Oct-2026 21:19:05.461
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert (1.318s) at 15-Oct-2026 21:19:05.529
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert on 15-Oct-2026 21:19:05.519
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/schmaltz-borrione/support/switch.cert on 15-Oct-2026 21:19:05.547
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/bis.cert (1.099s) at 15-Oct-2026 21:19:05.617
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert on 15-Oct-2026 21:19:05.621
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert (1.445s) at 15-Oct-2026 21:19:05.696
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/k-induction.cert (4.913s) at 15-Oct-2026 21:19:05.719
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/cons.cert on 15-Oct-2026 21:19:05.721
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert on 15-Oct-2026 21:19:05.752
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/bad-def.cert (2.333s) at 15-Oct-2026 21:19:05.766
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert on 15-Oct-2026 21:19:05.807
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/greve/nary/nary.cert on 15-Oct-2026 21:19:05.870
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/lists/list-exports.cert (0.461s) at 15-Oct-2026 21:19:05.948
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/instance.cert (1.232s) at 15-Oct-2026 21:19:05.986
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/greve/nary/nth-rules.cert on 15-Oct-2026 21:19:06.003
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise2.cert (4.244s) at 15-Oct-2026 21:19:06.067
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/acl2.cert on 15-Oct-2026 21:19:06.083
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert (0.722s) at 15-Oct-2026 21:19:06.163
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert (0.942s) at 15-Oct-2026 21:19:06.187
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/austel.cert on 15-Oct-2026 21:19:06.253
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/sat.cert on 15-Oct-2026 21:19:06.257
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert (11.132s) at 15-Oct-2026 21:19:06.291
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise7b.cert (4.182s) at 15-Oct-2026 21:19:06.355
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise6b.cert (5.044s) at 15-Oct-2026 21:19:06.941
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert (1.343s) at 15-Oct-2026 21:19:07.019
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve3.cert on 15-Oct-2026 21:19:07.046
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert (3.303s) at 15-Oct-2026 21:19:07.102
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert on 15-Oct-2026 21:19:07.167
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/gameiro-manolios/support/nth-thms.cert (1.982s) at 15-Oct-2026 21:19:07.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/legato/support/generic-theories.cert (2.314s) at 15-Oct-2026 21:19:07.352
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs1.cert on 15-Oct-2026 21:19:07.382
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/knuth-91/exercise6a.cert (5.408s) at 15-Oct-2026 21:19:07.425
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/defset-macros.cert (12.211s) at 15-Oct-2026 21:19:07.465
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/smith1.cert on 15-Oct-2026 21:19:07.473
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/how-many-soln2.cert (7.326s) at 15-Oct-2026 21:19:07.546
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert on 15-Oct-2026 21:19:07.493
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/sumners1.cert on 15-Oct-2026 21:19:07.555
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat.cert (3.832s) at 15-Oct-2026 21:19:07.598
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/ruiz-et-al/support/lists.cert (2.191s) at 15-Oct-2026 21:19:07.686
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/warnings.cert on 15-Oct-2026 21:19:07.681
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert (0.531s) at 15-Oct-2026 21:19:07.716
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert on 15-Oct-2026 21:19:07.718
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs2.cert on 15-Oct-2026 21:19:07.745
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/bdd.cert on 15-Oct-2026 21:19:07.701
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/rager/support/ptest-fib.cert on 15-Oct-2026 21:19:07.774
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/rager/support/ptest-if-normalization.cert on 15-Oct-2026 21:19:07.827
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve2.cert on 15-Oct-2026 21:19:07.838
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve1.cert on 15-Oct-2026 21:19:07.785
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-def-hons.cert (8.993s) at 15-Oct-2026 21:19:07.988
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs1.cert (0.625s) at 15-Oct-2026 21:19:08.022
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/smith1.cert (0.587s) at 15-Oct-2026 21:19:08.068
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert (6.248s) at 15-Oct-2026 21:19:08.089
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/ray/tail/exists.cert on 15-Oct-2026 21:19:08.087
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert (2.703s) at 15-Oct-2026 21:19:08.158
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert on 15-Oct-2026 21:19:08.179
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert on 15-Oct-2026 21:19:08.186
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/cowles-et-al/support/greve/defpun.cert on 15-Oct-2026 21:19:08.259
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/schmaltz-borrione/support/switch.cert (2.724s) at 15-Oct-2026 21:19:08.302
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/sumners1.cert (0.745s) at 15-Oct-2026 21:19:08.312
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert on 15-Oct-2026 21:19:08.399
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/warnings.cert (0.728s) at 15-Oct-2026 21:19:08.425
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert (4.028s) at 15-Oct-2026 21:19:08.507
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/rager/support/ptest-fib.cert (0.721s) at 15-Oct-2026 21:19:08.515
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/gen.cert on 15-Oct-2026 21:19:08.518
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/ray/tail/forall.cert on 15-Oct-2026 21:19:08.553
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve3.cert (1.519s) at 15-Oct-2026 21:19:08.574
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert (2.728s) at 15-Oct-2026 21:19:08.614
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/rimlinger/support/Rimlinger.cert on 15-Oct-2026 21:19:08.609
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert on 15-Oct-2026 21:19:08.668
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/ray/tail/exists.cert (0.610s) at 15-Oct-2026 21:19:08.706
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert on 15-Oct-2026 21:19:08.732
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert on 15-Oct-2026 21:19:08.734
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/liu/support/mylet.cert on 15-Oct-2026 21:19:08.808
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert (1.297s) at 15-Oct-2026 21:19:08.847
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/sumners/support/kas.cert on 15-Oct-2026 21:19:08.954
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/gen.cert (0.541s) at 15-Oct-2026 21:19:09.071
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/austel.cert (2.734s) at 15-Oct-2026 21:19:09.081
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert (0.893s) at 15-Oct-2026 21:19:09.091
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert (3.924s) at 15-Oct-2026 21:19:09.104
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/bash.cert on 15-Oct-2026 21:19:09.109
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert (0.578s) at 15-Oct-2026 21:19:09.257
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert on 15-Oct-2026 21:19:09.259
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 on 15-Oct-2026 21:19:09.294
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert on 15-Oct-2026 21:19:09.347
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert on 15-Oct-2026 21:19:09.364
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert on 15-Oct-2026 21:19:09.385
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/ray/tail/forall.cert (0.875s) at 15-Oct-2026 21:19:09.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert (4.270s) at 15-Oct-2026 21:19:09.459
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/cowles-et-al/support/greve/defpun.cert (1.189s) at 15-Oct-2026 21:19:09.471
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve1.cert (1.682s) at 15-Oct-2026 21:19:09.547
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/van-gastel-schmaltz/books/perm.cert on 15-Oct-2026 21:19:09.554
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/kaufmann-swords/support/intro.cert on 15-Oct-2026 21:19:09.570
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2018/mehta/bounded-nat-listp.cert on 15-Oct-2026 21:19:09.645
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/liu/support/mylet.cert (0.917s) at 15-Oct-2026 21:19:09.735
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert on 15-Oct-2026 21:19:09.725
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 (0.542s) at 15-Oct-2026 21:19:09.842
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2018/mehta/generate-index-list.cert on 15-Oct-2026 21:19:09.812
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert (0.449s) at 15-Oct-2026 21:19:09.858
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-mgr.cert (6.474s) at 15-Oct-2026 21:19:09.875
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert (0.571s) at 15-Oct-2026 21:19:09.938
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/bash.cert (0.819s) at 15-Oct-2026 21:19:09.944
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/xtopic.cert on 15-Oct-2026 21:19:09.977
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/book-thms-example.cert on 15-Oct-2026 21:19:09.952
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert (0.608s) at 15-Oct-2026 21:19:10.008
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/base.cert on 15-Oct-2026 21:19:10.079
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert (1.671s) at 15-Oct-2026 21:19:10.099
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/full-escape-symbol.cert on 15-Oct-2026 21:19:10.091
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/default-hint.cert on 15-Oct-2026 21:19:10.117
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/stobj-tables/stobj-table-recognizer-issue.cert on 15-Oct-2026 21:19:10.167
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/basic-arithmetic.cert on 15-Oct-2026 21:19:10.174
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert (1.479s) at 15-Oct-2026 21:19:10.222
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/portcullis.cert on 15-Oct-2026 21:19:10.344
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert (1.186s) at 15-Oct-2026 21:19:10.466
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2018/mehta/generate-index-list.cert (0.667s) at 15-Oct-2026 21:19:10.527
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-defthms.cert on 15-Oct-2026 21:19:10.593
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/cons.cert (4.856s) at 15-Oct-2026 21:19:10.619
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-total-order.cert on 15-Oct-2026 21:19:10.624
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2018/mehta/bounded-nat-listp.cert (1.081s) at 15-Oct-2026 21:19:10.766
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/greve2.cert (2.973s) at 15-Oct-2026 21:19:10.829
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/term-lemmas.cert on 15-Oct-2026 21:19:10.900
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/ground-zero.cert on 15-Oct-2026 21:19:10.936
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert (1.216s) at 15-Oct-2026 21:19:10.960
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/cowles-gamboa/support/WyoM1.cert (6.284s) at 15-Oct-2026 21:19:11.026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/remove-weak-inequalities.cert on 15-Oct-2026 21:19:11.036
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/basic-arithmetic.cert on 15-Oct-2026 21:19:11.054
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/kaufmann-swords/support/intro.cert (1.473s) at 15-Oct-2026 21:19:11.064
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/rationalp.cert on 15-Oct-2026 21:19:11.117
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/common-factor-defuns.cert on 15-Oct-2026 21:19:11.135
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/full-escape-symbol.cert (1.053s) at 15-Oct-2026 21:19:11.156
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-primrec/support/primitive.cert (7.574s) at 15-Oct-2026 21:19:11.208
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert (8.858s) at 15-Oct-2026 21:19:11.231
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert (3.101s) at 15-Oct-2026 21:19:11.286
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/xtopic.cert (1.312s) at 15-Oct-2026 21:19:11.303
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/portcullis.cert (0.969s) at 15-Oct-2026 21:19:11.328
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logior1.cert on 15-Oct-2026 21:19:11.374
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/acl2.cert (5.293s) at 15-Oct-2026 21:19:11.411
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/defdata/mv-proof.cert on 15-Oct-2026 21:19:11.420
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/complex-rationalp.cert on 15-Oct-2026 21:19:11.444
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/util.cert on 15-Oct-2026 21:19:11.487
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/portcullis.cert on 15-Oct-2026 21:19:11.562
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap4/solutions-program-mode.cert (10.864s) at 15-Oct-2026 21:19:11.692
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/default-hint.cert (1.594s) at 15-Oct-2026 21:19:11.723
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/ground-zero.cert (0.800s) at 15-Oct-2026 21:19:11.748
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/symbol-fns.cert on 15-Oct-2026 21:19:11.763
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert (6.232s) at 15-Oct-2026 21:19:11.775
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bitops/portcullis.cert on 15-Oct-2026 21:19:11.815
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/list-defuns.cert on 15-Oct-2026 21:19:11.857
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/term-lemmas.cert (0.946s) at 15-Oct-2026 21:19:11.880
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/osets/instance.cert on 15-Oct-2026 21:19:11.874
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/austel/support/abs-type.cert (7.398s) at 15-Oct-2026 21:19:11.886
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/termp.cert on 15-Oct-2026 21:19:11.885
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/basic-arithmetic.cert (0.860s) at 15-Oct-2026 21:19:11.932
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/join-thms.cert on 15-Oct-2026 21:19:11.968
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/bind-free/remove-weak-inequalities.cert (0.986s) at 15-Oct-2026 21:19:12.039
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/defdata/num-list-fns.cert on 15-Oct-2026 21:19:12.060
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/logior1.cert (0.727s) at 15-Oct-2026 21:19:12.121
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/complex-rationalp.cert (0.660s) at 15-Oct-2026 21:19:12.124
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/rationalp.cert (1.025s) at 15-Oct-2026 21:19:12.153
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/hacker.cert on 15-Oct-2026 21:19:12.158
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/meta-extract.cert on 15-Oct-2026 21:19:12.209
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/subsumption.cert on 15-Oct-2026 21:19:12.227
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/raw.cert on 15-Oct-2026 21:19:12.231
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/bridge.cert on 15-Oct-2026 21:19:12.231
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/book-thms-example.cert (2.293s) at 15-Oct-2026 21:19:12.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/primitives.cert (7.452s) at 15-Oct-2026 21:19:12.323
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/portcullis.cert on 15-Oct-2026 21:19:12.319
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/portcullis.cert on 15-Oct-2026 21:19:12.482
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/arithmetic/common-factor-defuns.cert (1.461s) at 15-Oct-2026 21:19:12.615
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/termp.cert (0.801s) at 15-Oct-2026 21:19:12.708
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/join-thms.cert (0.731s) at 15-Oct-2026 21:19:12.711
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert (6.889s) at 15-Oct-2026 21:19:12.713
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bridge/portcullis.cert on 15-Oct-2026 21:19:12.712
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/portcullis.cert (1.147s) at 15-Oct-2026 21:19:12.728
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert (8.874s) at 15-Oct-2026 21:19:12.729
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/portcullis.cert on 15-Oct-2026 21:19:12.730
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/basic-arithmetic.cert (2.552s) at 15-Oct-2026 21:19:12.744
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/omaps/portcullis.cert on 15-Oct-2026 21:19:12.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/xdoc-error.cert on 15-Oct-2026 21:19:12.807
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/verbosep.cert on 15-Oct-2026 21:19:12.807
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/depgraph/portcullis.cert on 15-Oct-2026 21:19:12.836
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/raw.cert (0.601s) at 15-Oct-2026 21:19:12.850
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/acl2-count.cert on 15-Oct-2026 21:19:12.858
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/list-defuns.cert (0.983s) at 15-Oct-2026 21:19:12.864
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/stobj-based/limits.cert on 15-Oct-2026 21:19:12.938
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/lrat-checker.cert on 15-Oct-2026 21:19:12.941
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2022/stobj-tables/stobj-table-recognizer-issue.cert (2.780s) at 15-Oct-2026 21:19:12.995
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/portcullis.cert (0.551s) at 15-Oct-2026 21:19:13.044
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/ordered-perms.cert on 15-Oct-2026 21:19:13.048
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/portcullis.cert (0.757s) at 15-Oct-2026 21:19:13.122
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/convert-perm-to-how-many.cert on 15-Oct-2026 21:19:13.143
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/sat.cert (6.903s) at 15-Oct-2026 21:19:13.175
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/lib/util.cert (1.628s) at 15-Oct-2026 21:19:13.187
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/basic-arithmetic.cert on 15-Oct-2026 21:19:13.185
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/subsumption.cert (1.047s) at 15-Oct-2026 21:19:13.283
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/rationalp.cert on 15-Oct-2026 21:19:13.285
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/common-factor-defuns.cert on 15-Oct-2026 21:19:13.313
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/defdata/mv-proof.cert (1.906s) at 15-Oct-2026 21:19:13.353
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/symbol-fns/symbol-fns.cert (1.584s) at 15-Oct-2026 21:19:13.368
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/omaps/portcullis.cert (0.590s) at 15-Oct-2026 21:19:13.400
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/elim-hint.cert on 15-Oct-2026 21:19:13.461
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/depgraph/portcullis.cert (0.620s) at 15-Oct-2026 21:19:13.480
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/complex-rationalp.cert on 15-Oct-2026 21:19:13.475
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/bridge.cert (1.238s) at 15-Oct-2026 21:19:13.505
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert (4.767s) at 15-Oct-2026 21:19:13.514
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/cbf.cert on 15-Oct-2026 21:19:13.532
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/alu.cert on 15-Oct-2026 21:19:13.537
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/acl2-count.cert (0.682s) at 15-Oct-2026 21:19:13.551
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/verbosep.cert (0.773s) at 15-Oct-2026 21:19:13.597
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bridge/portcullis.cert (0.870s) at 15-Oct-2026 21:19:13.598
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/ifdef.cert on 15-Oct-2026 21:19:13.608
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/pg-theory.cert on 15-Oct-2026 21:19:13.619
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/top.cert on 15-Oct-2026 21:19:13.632
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/perm-append.cert on 15-Oct-2026 21:19:13.644
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/portcullis.cert (0.921s) at 15-Oct-2026 21:19:13.669
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/rationalp.cert (0.386s) at 15-Oct-2026 21:19:13.686
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/ordered-perms.cert (0.644s) at 15-Oct-2026 21:19:13.716
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/osets/instance.cert (1.843s) at 15-Oct-2026 21:19:13.738
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/null-fail-hints.cert on 15-Oct-2026 21:19:13.730
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/hacker.cert (1.576s) at 15-Oct-2026 21:19:13.756
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/nrev/portcullis.cert on 15-Oct-2026 21:19:13.718
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/defevaluator.cert on 15-Oct-2026 21:19:13.777
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/convert-perm-to-how-many.cert (0.634s) at 15-Oct-2026 21:19:13.783
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/auxilary.cert on 15-Oct-2026 21:19:13.808
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/rhs2.cert (6.030s) at 15-Oct-2026 21:19:13.810
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/adviser/portcullis.cert on 15-Oct-2026 21:19:13.817
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/meta-extract.cert (1.592s) at 15-Oct-2026 21:19:13.843
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defung/map-ec-call.cert on 15-Oct-2026 21:19:13.841
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/complex-rationalp.cert (0.372s) at 15-Oct-2026 21:19:13.860
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/ground-zero.cert on 15-Oct-2026 21:19:13.878
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/rewrite-equal-hint.cert on 15-Oct-2026 21:19:13.900
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/stobj-based/limits.cert (0.973s) at 15-Oct-2026 21:19:13.931
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/skip-rewrite.cert on 15-Oct-2026 21:19:13.935
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/defbinding.cert on 15-Oct-2026 21:19:13.959
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/basic-arithmetic.cert (0.856s) at 15-Oct-2026 21:19:14.055
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/arithmetic/common-factor-defuns.cert (0.792s) at 15-Oct-2026 21:19:14.120
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/hamming.cert on 15-Oct-2026 21:19:14.114
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/intermediate-program.cert on 15-Oct-2026 21:19:14.152
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/syn-pkg.cert on 15-Oct-2026 21:19:14.112
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert (6.416s) at 15-Oct-2026 21:19:14.160
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/subst-expr.cert on 15-Oct-2026 21:19:14.196
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/keyword-value-lists2.cert on 15-Oct-2026 21:19:14.252
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/nth-rules.cert on 15-Oct-2026 21:19:14.270
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/greve/nary/nth-rules.cert (8.305s) at 15-Oct-2026 21:19:14.376
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/perm-append.cert (0.710s) at 15-Oct-2026 21:19:14.377
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/top.cert (0.824s) at 15-Oct-2026 21:19:14.470
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/ifdef.cert (0.885s) at 15-Oct-2026 21:19:14.511
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/intern-in-package-of-symbol.cert on 15-Oct-2026 21:19:14.474
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/base.cert (4.434s) at 15-Oct-2026 21:19:14.531
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/number-theory/portcullis.cert on 15-Oct-2026 21:19:14.566
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/isort.cert on 15-Oct-2026 21:19:14.601
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/portcullis.cert on 15-Oct-2026 21:19:14.604
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/register-invariant-risk.cert on 15-Oct-2026 21:19:14.673
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/null-fail-hints.cert (0.951s) at 15-Oct-2026 21:19:14.697
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/syn-pkg.cert (0.566s) at 15-Oct-2026 21:19:14.734
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/pfcs/portcullis.cert on 15-Oct-2026 21:19:14.798
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/adviser/portcullis.cert (0.698s) at 15-Oct-2026 21:19:14.830
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/van-gastel-schmaltz/books/perm.cert (5.268s) at 15-Oct-2026 21:19:14.832
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/vhdl.cert (12.604s) at 15-Oct-2026 21:19:14.873
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/rewrite-equal-hint.cert (0.919s) at 15-Oct-2026 21:19:14.876
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/xdoc-error.cert (2.112s) at 15-Oct-2026 21:19:14.933
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert on 15-Oct-2026 21:19:14.929
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert on 15-Oct-2026 21:19:14.959
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/auxilary.cert (1.175s) at 15-Oct-2026 21:19:14.987
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/cbf.cert (1.523s) at 15-Oct-2026 21:19:15.068
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert on 15-Oct-2026 21:19:15.080
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/other-apps/qsort/intermediate-program.cert (0.970s) at 15-Oct-2026 21:19:15.134
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/defbinding.cert (1.245s) at 15-Oct-2026 21:19:15.211
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert on 15-Oct-2026 21:19:15.210
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/keyword-value-lists2.cert (0.979s) at 15-Oct-2026 21:19:15.256
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/ground-zero.cert (1.388s) at 15-Oct-2026 21:19:15.284
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/lib/basic-ops/elim-hint.cert (1.822s) at 15-Oct-2026 21:19:15.303
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/nrev/portcullis.cert (1.501s) at 15-Oct-2026 21:19:15.323
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert on 15-Oct-2026 21:19:15.320
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ordinals/ordinal-total-order.cert (4.699s) at 15-Oct-2026 21:19:15.341
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/portcullis.cert (0.717s) at 15-Oct-2026 21:19:15.344
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/coerce.cert on 15-Oct-2026 21:19:15.348
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/types-misc.cert on 15-Oct-2026 21:19:15.342
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert on 15-Oct-2026 21:19:15.354
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/pfcs/portcullis.cert (0.600s) at 15-Oct-2026 21:19:15.414
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/isort.cert (0.792s) at 15-Oct-2026 21:19:15.416
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/function-renamingp.cert on 15-Oct-2026 21:19:15.416
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/hamming.cert (1.115s) at 15-Oct-2026 21:19:15.469
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/quote.cert on 15-Oct-2026 21:19:15.433
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert on 15-Oct-2026 21:19:15.480
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/skip-rewrite.cert (1.554s) at 15-Oct-2026 21:19:15.520
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert on 15-Oct-2026 21:19:15.494
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/number-theory/portcullis.cert (0.984s) at 15-Oct-2026 21:19:15.560
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/literal.cert on 15-Oct-2026 21:19:15.562
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/nthcdr.cert on 15-Oct-2026 21:19:15.690
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/imagpart.cert on 15-Oct-2026 21:19:15.810
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert (0.696s) at 15-Oct-2026 21:19:15.933
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert (0.569s) at 15-Oct-2026 21:19:15.964
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert (1.020s) at 15-Oct-2026 21:19:15.971
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/defdata/num-list-fns.cert (3.899s) at 15-Oct-2026 21:19:16.014
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/intersection-equal.cert on 15-Oct-2026 21:19:16.037
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/world.cert on 15-Oct-2026 21:19:16.057
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq.cert on 15-Oct-2026 21:19:16.038
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/extract-non-local-events.cert on 15-Oct-2026 21:19:16.011
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/alistp.cert on 15-Oct-2026 21:19:16.074
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsetp-equal.cert on 15-Oct-2026 21:19:16.173
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/greve/nary/nary.cert (10.298s) at 15-Oct-2026 21:19:16.216
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/pg-theory.cert (2.630s) at 15-Oct-2026 21:19:16.266
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/untranslated-terms/add-conjunct-to-uterm.cert on 15-Oct-2026 21:19:16.230
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert (0.800s) at 15-Oct-2026 21:19:16.292
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/intern-in-package-of-symbol.cert (1.773s) at 15-Oct-2026 21:19:16.315
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/butlast.cert on 15-Oct-2026 21:19:16.327
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/imagpart.cert (0.520s) at 15-Oct-2026 21:19:16.366
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/pairlis-dollar.cert on 15-Oct-2026 21:19:16.358
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booland.cert on 15-Oct-2026 21:19:16.368
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/register-invariant-risk.cert (1.705s) at 15-Oct-2026 21:19:16.413
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/subst-expr.cert (2.219s) at 15-Oct-2026 21:19:16.426
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/function-renamingp.cert (1.019s) at 15-Oct-2026 21:19:16.454
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolor.cert on 15-Oct-2026 21:19:16.475
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolif.cert on 15-Oct-2026 21:19:16.508
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/defevaluator.cert (2.723s) at 15-Oct-2026 21:19:16.518
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/negate-term.cert on 15-Oct-2026 21:19:16.522
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/myif.cert on 15-Oct-2026 21:19:16.522
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/untranslated-terms/helpers.cert on 15-Oct-2026 21:19:16.566
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lambdas.cert on 15-Oct-2026 21:19:16.613
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/coerce.cert (1.259s) at 15-Oct-2026 21:19:16.625
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-safe.cert on 15-Oct-2026 21:19:16.620
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq.cert (0.592s) at 15-Oct-2026 21:19:16.672
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup.cert on 15-Oct-2026 21:19:16.675
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pseudo-termp.cert on 15-Oct-2026 21:19:16.674
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/conjunctions-and-disjunctions.cert on 15-Oct-2026 21:19:16.722
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/imported-symbols-theorems.cert on 15-Oct-2026 21:19:16.762
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/intersection-equal.cert (0.712s) at 15-Oct-2026 21:19:16.783
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/types-misc.cert (1.424s) at 15-Oct-2026 21:19:16.796
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert (1.861s) at 15-Oct-2026 21:19:16.837
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/set-difference-equal.cert on 15-Oct-2026 21:19:16.831
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/literal.cert (1.259s) at 15-Oct-2026 21:19:16.860
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-and-nice.cert on 15-Oct-2026 21:19:16.928
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/memberp.cert on 15-Oct-2026 21:19:16.925
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 9898 Oct 15 21:19 records.cert
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/untranslated-terms/add-conjunct-to-uterm.cert (0.640s) at 15-Oct-2026 21:19:16.969
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/mesi.cert on Thu Oct 15 21:19:16 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/conjunctions.cert on 15-Oct-2026 21:19:16.986
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert (1.470s) at 15-Oct-2026 21:19:17.002
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/alistp.cert (0.878s) at 15-Oct-2026 21:19:17.025
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/alu.cert (3.493s) at 15-Oct-2026 21:19:17.048
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/lambdas.cert (0.433s) at 15-Oct-2026 21:19:17.061
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/channels.cert on 15-Oct-2026 21:19:17.055
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolor.cert (0.614s) at 15-Oct-2026 21:19:17.097
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-safe.cert on 15-Oct-2026 21:19:17.151
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-utilities.cert on 15-Oct-2026 21:19:17.171
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/uniquify-alist-eq.cert on 15-Oct-2026 21:19:17.169
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/list-sets.cert on 15-Oct-2026 21:19:17.180
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/types.cert on 15-Oct-2026 21:19:17.188
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/pairlis-dollar.cert (0.820s) at 15-Oct-2026 21:19:17.198
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/imported-symbols-theorems.cert (0.449s) at 15-Oct-2026 21:19:17.224
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-safe.cert (0.617s) at 15-Oct-2026 21:19:17.262
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/negate-term.cert (0.784s) at 15-Oct-2026 21:19:17.326
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/pseudo-termp.cert (0.649s) at 15-Oct-2026 21:19:17.345
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/untranslated-terms/helpers.cert (0.779s) at 15-Oct-2026 21:19:17.357
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/iff.cert on 15-Oct-2026 21:19:17.386
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/byte-listp.cert on 15-Oct-2026 21:19:17.400
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-same.cert on 15-Oct-2026 21:19:17.437
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/not.cert on 15-Oct-2026 21:19:17.454
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/set-difference-equal.cert (0.664s) at 15-Oct-2026 21:19:17.506
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsetp-equal.cert (1.355s) at 15-Oct-2026 21:19:17.553
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/conjunctions.cert (0.573s) at 15-Oct-2026 21:19:17.572
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-safe.cert (0.459s) at 15-Oct-2026 21:19:17.620
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/unguarded-built-ins.cert on 15-Oct-2026 21:19:17.619
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/basic-rules.cert on 15-Oct-2026 21:19:17.609
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-lst.cert on 15-Oct-2026 21:19:17.644
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/equivs.cert on 15-Oct-2026 21:19:17.649
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup.cert (1.000s) at 15-Oct-2026 21:19:17.685
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booland.cert (1.311s) at 15-Oct-2026 21:19:17.698
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/consecutivep.cert on 15-Oct-2026 21:19:17.718
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolxor.cert on 15-Oct-2026 21:19:17.780
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/merge-and-remove-dups.cert on 15-Oct-2026 21:19:17.802
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert (2.497s) at 15-Oct-2026 21:19:17.827
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/resize-list.cert on 15-Oct-2026 21:19:17.821
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/not.cert (0.379s) at 15-Oct-2026 21:19:17.848
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-same.cert (0.435s) at 15-Oct-2026 21:19:17.879
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/butlast.cert (1.513s) at 15-Oct-2026 21:19:17.900
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/byte-listp.cert (0.472s) at 15-Oct-2026 21:19:17.911
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert on 15-Oct-2026 21:19:17.920
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/sparse/rule-lists.cert on 15-Oct-2026 21:19:17.968
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/tools/filter-and-combine-symbol-alists.cert on 15-Oct-2026 21:19:17.987
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2-arrays/doc.cert on 15-Oct-2026 21:19:18.013
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert (13.365s) at 15-Oct-2026 21:19:18.112
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/channels.cert (1.107s) at 15-Oct-2026 21:19:18.178
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/alists-equiv-on.cert on 15-Oct-2026 21:19:18.260
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/lookup-eq-lst.cert (0.630s) at 15-Oct-2026 21:19:18.285
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/conjunctions-and-disjunctions.cert (1.493s) at 15-Oct-2026 21:19:18.296
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/merge-and-remove-dups.cert (0.538s) at 15-Oct-2026 21:19:18.343
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/resize-list.cert (0.534s) at 15-Oct-2026 21:19:18.374
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-same-eql.cert on 15-Oct-2026 21:19:18.383
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep.cert on 15-Oct-2026 21:19:18.396
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/consecutivep.cert (0.707s) at 15-Oct-2026 21:19:18.441
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/equivs.cert (0.772s) at 15-Oct-2026 21:19:18.449
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/length.cert on 15-Oct-2026 21:19:18.468
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/myif.cert (1.959s) at 15-Oct-2026 21:19:18.495
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/list-sets.cert (1.339s) at 15-Oct-2026 21:19:18.525
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/reconstruct-lets-in-term.cert on 15-Oct-2026 21:19:18.503
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 15199 Oct 15 21:19 mesi.cert
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/map-code-char.cert on 15-Oct-2026 21:19:18.539
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/extract-non-local-events.cert (2.494s) at 15-Oct-2026 21:19:18.582
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/algorithm-theories/top.cert on 15-Oct-2026 21:19:18.546
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolxor.cert (0.778s) at 15-Oct-2026 21:19:18.604
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test-1.cert on 15-Oct-2026 21:19:18.600
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help-test.cert on 15-Oct-2026 21:19:18.552
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support/success.txt on Thu Oct 15 21:19:18 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/stobj-test.cert on 15-Oct-2026 21:19:18.698
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/unguarded-built-ins.cert (1.068s) at 15-Oct-2026 21:19:18.712
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-and-nice.cert (1.777s) at 15-Oct-2026 21:19:18.712
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/boolif.cert (2.196s) at 15-Oct-2026 21:19:18.714
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.pcert1 on 15-Oct-2026 21:19:18.702
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/tools/filter-and-combine-symbol-alists.cert (0.807s) at 15-Oct-2026 21:19:18.834
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/sub2.cert on 15-Oct-2026 21:19:18.846
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bitops/portcullis.cert (7.029s) at 15-Oct-2026 21:19:18.860
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/sub1.cert on 15-Oct-2026 21:19:18.799
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/subgoalp.cert on 15-Oct-2026 21:19:18.921
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/algorithm-theories/top.cert (0.370s) at 15-Oct-2026 21:19:18.958
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-defthms.cert (8.349s) at 15-Oct-2026 21:19:18.960
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/rom-helpers.cert on 15-Oct-2026 21:19:18.955
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subsequencep.cert (0.536s) at 15-Oct-2026 21:19:18.961
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/alists-equiv-on.cert (0.707s) at 15-Oct-2026 21:19:18.974
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert on 15-Oct-2026 21:19:19.010
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/length.cert (0.547s) at 15-Oct-2026 21:19:19.028
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logior1.cert on 15-Oct-2026 21:19:18.881
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert on 15-Oct-2026 21:19:19.040
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 15-Oct-2026 21:19:19.047
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/codewalker/simplify-under-hyps.cert on 15-Oct-2026 21:19:19.065
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/string-utilities.cert (1.920s) at 15-Oct-2026 21:19:19.101
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-same-eql.cert (0.680s) at 15-Oct-2026 21:19:19.104
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/iff.cert (1.722s) at 15-Oct-2026 21:19:19.121
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/unification.cert on 15-Oct-2026 21:19:19.127
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/memberp.cert (2.190s) at 15-Oct-2026 21:19:19.134
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/reconstruct-lets-in-term.cert (0.614s) at 15-Oct-2026 21:19:19.150
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test-1.cert (0.588s) at 15-Oct-2026 21:19:19.204
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort2.cert on 15-Oct-2026 21:19:19.196
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/chk-jacm-proveall.cert on 15-Oct-2026 21:19:19.228
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/chk-standard-proveall.cert on 15-Oct-2026 21:19:19.285
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/sub2.cert (0.509s) at 15-Oct-2026 21:19:19.366
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.pcert1 (0.654s) at 15-Oct-2026 21:19:19.374
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/stobj-test.cert (0.693s) at 15-Oct-2026 21:19:19.404
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/map-code-char.cert (0.844s) at 15-Oct-2026 21:19:19.413
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/lib2/rom-helpers.cert (0.483s) at 15-Oct-2026 21:19:19.447
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert (0.441s) at 15-Oct-2026 21:19:19.466
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/truth-monotone.cert on 15-Oct-2026 21:19:19.483
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/defset-encapsulates.cert on 15-Oct-2026 21:19:19.479
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/quote.cert (4.011s) at 15-Oct-2026 21:19:19.491
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert on 15-Oct-2026 21:19:19.488
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort.cert on 15-Oct-2026 21:19:19.523
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/omerge-good-order.cert on 15-Oct-2026 21:19:19.533
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert (0.491s) at 15-Oct-2026 21:19:19.537
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/basic-rules.cert (1.908s) at 15-Oct-2026 21:19:19.554
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/user/logior1.cert on 15-Oct-2026 21:19:19.546
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/optimize-check.cert on 15-Oct-2026 21:19:19.589
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (0.544s) at 15-Oct-2026 21:19:19.606
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-1.cert on 15-Oct-2026 21:19:19.618
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort3.cert on 15-Oct-2026 21:19:19.595
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dead-events.cert on 15-Oct-2026 21:19:19.575
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-2.cert on 15-Oct-2026 21:19:19.649
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.pcert1 on 15-Oct-2026 21:19:19.686
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/types.cert (2.489s) at 15-Oct-2026 21:19:19.708
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/bsort.cert on 15-Oct-2026 21:19:19.783
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort2.cert (0.590s) at 15-Oct-2026 21:19:19.799
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.pcert1 on 15-Oct-2026 21:19:19.806
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/legacy-defrstobj/array-lemmas.cert on 15-Oct-2026 21:19:19.815
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/swap-stobjs-test.cert on 15-Oct-2026 21:19:19.850
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/subgoalp.cert (0.930s) at 15-Oct-2026 21:19:19.927
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/r1cs/sparse/rule-lists.cert (1.912s) at 15-Oct-2026 21:19:19.927
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/unification.cert (0.847s) at 15-Oct-2026 21:19:19.986
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top1.cert on 15-Oct-2026 21:19:20.020
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top1a.cert on 15-Oct-2026 21:19:20.044
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/local-port-include.cert on 15-Oct-2026 21:19:20.072
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/user/logior1.cert (0.541s) at 15-Oct-2026 21:19:20.105
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/verify-termination/top.cert on 15-Oct-2026 21:19:20.165
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort.cert (0.753s) at 15-Oct-2026 21:19:20.292
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/bsort.cert (0.497s) at 15-Oct-2026 21:19:20.294
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/truth-monotone.cert (0.807s) at 15-Oct-2026 21:19:20.301
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/encap.cert on 15-Oct-2026 21:19:20.389
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.pcert1 (0.585s) at 15-Oct-2026 21:19:20.397
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/mergesort.cert on 15-Oct-2026 21:19:20.402
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-1.cert (0.784s) at 15-Oct-2026 21:19:20.421
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/local-port-include.cert (0.347s) at 15-Oct-2026 21:19:20.429
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/qsort.cert on 15-Oct-2026 21:19:20.431
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/acl2-arrays/doc.cert (2.453s) at 15-Oct-2026 21:19:20.484
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dead-events.cert (0.837s) at 15-Oct-2026 21:19:20.489
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/summations.cert on 15-Oct-2026 21:19:20.502
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert (5.415s) at 15-Oct-2026 21:19:20.507
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/codewalker/simplify-under-hyps.cert (1.223s) at 15-Oct-2026 21:19:20.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/mesh-append.cert on 15-Oct-2026 21:19:20.515
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/mesh-make-partition.cert on 15-Oct-2026 21:19:20.521
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top1.cert (0.537s) at 15-Oct-2026 21:19:20.575
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 15-Oct-2026 21:19:20.572
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert on 15-Oct-2026 21:19:20.600
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/fast-sets.cert on 15-Oct-2026 21:19:20.647
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/verify-termination/top.cert (0.480s) at 15-Oct-2026 21:19:20.659
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert on 15-Oct-2026 21:19:20.658
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/fixpoints.cert on 15-Oct-2026 21:19:20.629
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/swap-stobjs-test.cert (0.808s) at 15-Oct-2026 21:19:20.673
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/guard-verified-m1/good-statep.cert on 15-Oct-2026 21:19:20.556
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/solutions/perm.cert on 15-Oct-2026 21:19:20.760
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/alists-light/uniquify-alist-eq.cert (3.618s) at 15-Oct-2026 21:19:20.802
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert on 15-Oct-2026 21:19:20.888
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.pcert1 (1.203s) at 15-Oct-2026 21:19:20.903
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/encap.cert (0.604s) at 15-Oct-2026 21:19:21.004
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/chk-standard-proveall.cert (1.709s) at 15-Oct-2026 21:19:21.005
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert on 15-Oct-2026 21:19:21.044
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (0.492s) at 15-Oct-2026 21:19:21.082
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/mesh-make-partition.cert (0.543s) at 15-Oct-2026 21:19:21.084
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert (0.563s) at 15-Oct-2026 21:19:21.175
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert on 15-Oct-2026 21:19:21.177
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert on 15-Oct-2026 21:19:21.172
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top1a.cert (1.156s) at 15-Oct-2026 21:19:21.213
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert on 15-Oct-2026 21:19:21.191
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert on 15-Oct-2026 21:19:21.213
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/fact.cert on 15-Oct-2026 21:19:21.223
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert on 15-Oct-2026 21:19:21.277
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert on 15-Oct-2026 21:19:21.316
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/qsort.cert (0.897s) at 15-Oct-2026 21:19:21.349
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/acl2x-help-test.cert (2.741s) at 15-Oct-2026 21:19:21.398
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/nthcdr.cert (5.695s) at 15-Oct-2026 21:19:21.440
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/monomial.cert on 15-Oct-2026 21:19:21.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/acl2x-pcert-test-2.cert (1.815s) at 15-Oct-2026 21:19:21.482
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/summations.cert (1.000s) at 15-Oct-2026 21:19:21.514
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-spec.cert on 15-Oct-2026 21:19:21.538
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/hidden-defpkg-checks/sub1.cert (2.655s) at 15-Oct-2026 21:19:21.583
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/textbook/chap11/mergesort.cert (1.174s) at 15-Oct-2026 21:19:21.589
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/examples.cert on 15-Oct-2026 21:19:21.583
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/optimize-check.cert (2.013s) at 15-Oct-2026 21:19:21.611
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-nested.cert on 15-Oct-2026 21:19:21.605
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/solutions/perm.cert (0.859s) at 15-Oct-2026 21:19:21.627
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/mesh-append.cert (1.109s) at 15-Oct-2026 21:19:21.633
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-primitive.cert on 15-Oct-2026 21:19:21.671
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-ackermann.cert on 15-Oct-2026 21:19:21.683
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-reverse.cert on 15-Oct-2026 21:19:21.682
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-tail.cert on 15-Oct-2026 21:19:21.703
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert on 15-Oct-2026 21:19:21.708
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-z.cert on 15-Oct-2026 21:19:21.725
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/legacy-defrstobj/array-lemmas.cert (1.850s) at 15-Oct-2026 21:19:21.826
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert (0.790s) at 15-Oct-2026 21:19:21.847
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert (0.607s) at 15-Oct-2026 21:19:21.899
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert on 15-Oct-2026 21:19:21.917
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert on 15-Oct-2026 21:19:21.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert (0.692s) at 15-Oct-2026 21:19:21.967
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert (1.076s) at 15-Oct-2026 21:19:21.974
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert on 15-Oct-2026 21:19:21.993
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/sumners/support/n2n.cert (17.247s) at 15-Oct-2026 21:19:22.031
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/defung/map-ec-call.cert (8.170s) at 15-Oct-2026 21:19:22.041
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert on 15-Oct-2026 21:19:22.067
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert (0.890s) at 15-Oct-2026 21:19:22.123
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/computed-hints.cert on 15-Oct-2026 21:19:22.147
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert (0.877s) at 15-Oct-2026 21:19:22.207
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert on 15-Oct-2026 21:19:22.139
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert on 15-Oct-2026 21:19:22.225
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/fact.cert (0.950s) at 15-Oct-2026 21:19:22.238
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert on 15-Oct-2026 21:19:22.262
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert on 15-Oct-2026 21:19:22.334
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert on 15-Oct-2026 21:19:22.306
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/fixpoints.cert (1.904s) at 15-Oct-2026 21:19:22.582
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-tail.cert (0.942s) at 15-Oct-2026 21:19:22.657
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/equisort3.cert (3.031s) at 15-Oct-2026 21:19:22.678
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-primitive.cert (0.987s) at 15-Oct-2026 21:19:22.679
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert (1.547s) at 15-Oct-2026 21:19:22.738
acl2-8.5> cd bdd ; /nix/store/4xw8n979xpivdc46a9ndcvyhwgif00hz-bash-5.1-p16/bin/bash -c "(echo '(ld \"create-benchmarks.lsp\")' | /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2)"
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert (0.539s) at 15-Oct-2026 21:19:22.760
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/pltpa/chk-jacm-proveall.cert (3.533s) at 15-Oct-2026 21:19:22.776
acl2-8.5> This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5> More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5> 
acl2-8.5> SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5> It is mostly in the public domain; some portions are provided under
acl2-8.5> BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5> distribution for more information.
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert on 15-Oct-2026 21:19:22.769
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert on 15-Oct-2026 21:19:22.767
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 on 15-Oct-2026 21:19:22.777
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert (0.915s) at 15-Oct-2026 21:19:22.867
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/refute.cert on 15-Oct-2026 21:19:22.879
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/top.cert on 15-Oct-2026 21:19:22.884
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/inequalities.cert on 15-Oct-2026 21:19:22.883
acl2-8.5> 
acl2-8.5>  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
acl2-8.5>  + ACL2 Version 8.5                                                     +
acl2-8.5>  +   built October 15, 2026  21:07:10.                                  +
acl2-8.5>  + Copyright (C) 2022, Regents of the University of Texas.              +
acl2-8.5>  + ACL2 comes with ABSOLUTELY NO WARRANTY.  This is free software and   +
acl2-8.5>  + you are welcome to redistribute it under certain conditions.  For    +
acl2-8.5>  + details, see the LICENSE file distributed with ACL2.                 +
acl2-8.5>  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/bstar.cert on 15-Oct-2026 21:19:22.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/logior1.cert (3.914s) at 15-Oct-2026 21:19:22.967
acl2-8.5> 
acl2-8.5> System books directory 
acl2-8.5> "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/".
acl2-8.5> Type :help for help.
acl2-8.5> Type (quit) to quit completely out of ACL2.
acl2-8.5> 
acl2-8.5> ACL2 !>
acl2-8.5> System books directory 
acl2-8.5> "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/".
acl2-8.5> Type :help for help.
acl2-8.5> Type (quit) to quit completely out of ACL2.
acl2-8.5> 
acl2-8.5> ACL2 !>> "ACL2"
acl2-8.5> ACL2 !>> :NEVER
acl2-8.5> ACL2 !>> (PROVE PROOF-TREE WARNING OBSERVATION)
acl2-8.5> ACL2 !>>
acl2-8.5> Summary
acl2-8.5> Form:  ( INCLUDE-BOOK "cbf" ...)
acl2-8.5> Rules: NIL
acl2-8.5> Time:  0.01 seconds (prove: 0.00, print: 0.00, other: 0.01)
acl2-8.5>  "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/cbf.lisp"
acl2-8.5> ACL2 !>>Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-theory.cert on 15-Oct-2026 21:19:23.041
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert (2.031s) at 15-Oct-2026 21:19:23.249
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert (3.763s) at 15-Oct-2026 21:19:23.265
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert (1.076s) at 15-Oct-2026 21:19:23.312
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/mfc-utils.cert on 15-Oct-2026 21:19:23.361
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/meta-plus-equal.cert on 15-Oct-2026 21:19:23.369
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 (0.628s) at 15-Oct-2026 21:19:23.411
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/meta-plus-lessp.cert on 15-Oct-2026 21:19:23.407
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/inequalities.cert on 15-Oct-2026 21:19:23.503
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/inequalities.cert (0.626s) at 15-Oct-2026 21:19:23.520
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/set-theory.cert (0.499s) at 15-Oct-2026 21:19:23.566
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/portcullis.cert on 15-Oct-2026 21:19:23.570
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/fty/portcullis.cert on 15-Oct-2026 21:19:23.610
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert (1.707s) at 15-Oct-2026 21:19:23.670
acl2-8.5> ACL2 !>>Bye.
acl2-8.5>  :EOF
acl2-8.5> ACL2 !>Bye.
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/refute.cert (0.824s) at 15-Oct-2026 21:19:23.719
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/osets/computed-hints.cert on 15-Oct-2026 21:19:23.733
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert (0.956s) at 15-Oct-2026 21:19:23.739
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/ev-theoremp.cert on 15-Oct-2026 21:19:23.787
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert (1.091s) at 15-Oct-2026 21:19:23.874
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/portcullis.cert on 15-Oct-2026 21:19:23.912
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert (3.254s) at 15-Oct-2026 21:19:23.945
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/world.cert (7.885s) at 15-Oct-2026 21:19:23.961
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/defcode.cert on 15-Oct-2026 21:19:24.015
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/getopt/portcullis.cert on 15-Oct-2026 21:19:24.051
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert (1.743s) at 15-Oct-2026 21:19:24.092
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/inequalities.cert (0.592s) at 15-Oct-2026 21:19:24.108
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/read-acl2-oracle.cert on 15-Oct-2026 21:19:24.108
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/satlink/portcullis.cert on 15-Oct-2026 21:19:24.121
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/fast-sets.cert (3.532s) at 15-Oct-2026 21:19:24.198
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/truth/portcullis.cert on 15-Oct-2026 21:19:24.197
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/top.cert (1.340s) at 15-Oct-2026 21:19:24.251
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/inequalities.cert on 15-Oct-2026 21:19:24.268
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/alu-proofs.cert on 15-Oct-2026 21:19:24.334
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-z.cert (2.604s) at 15-Oct-2026 21:19:24.339
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/meta-plus-equal.cert (0.962s) at 15-Oct-2026 21:19:24.348
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/computed-hints.cert (2.197s) at 15-Oct-2026 21:19:24.357
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/portcullis.cert (0.814s) at 15-Oct-2026 21:19:24.410
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/doc.cert on 15-Oct-2026 21:19:24.436
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/def-bound-theorems.cert on 15-Oct-2026 21:19:24.442
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/defs.cert on 15-Oct-2026 21:19:24.441
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert (2.413s) at 15-Oct-2026 21:19:24.471
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/msort.cert on 15-Oct-2026 21:19:24.488
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert (2.489s) at 15-Oct-2026 21:19:24.615
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/osets/computed-hints.cert (0.928s) at 15-Oct-2026 21:19:24.675
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/meta/meta-plus-lessp.cert (1.254s) at 15-Oct-2026 21:19:24.675
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/signed-byte-listp.cert on 15-Oct-2026 21:19:24.755
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/satlink/portcullis.cert (0.651s) at 15-Oct-2026 21:19:24.790
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/truth/portcullis.cert (0.586s) at 15-Oct-2026 21:19:24.802
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert (3.084s) at 15-Oct-2026 21:19:24.818
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/array1.cert on 15-Oct-2026 21:19:24.815
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/plev.cert on 15-Oct-2026 21:19:24.804
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/in-conclusion.cert on 15-Oct-2026 21:19:24.822
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert (2.514s) at 15-Oct-2026 21:19:24.854
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/inequalities.cert (0.598s) at 15-Oct-2026 21:19:24.877
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/oslib/read-acl2-oracle.cert (0.743s) at 15-Oct-2026 21:19:24.881
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ith.cert on 15-Oct-2026 21:19:24.902
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/adviser/adviser-pkg.cert on 15-Oct-2026 21:19:24.948
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/beta-reduce.cert on 15-Oct-2026 21:19:24.960
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/portcullis.cert on 15-Oct-2026 21:19:24.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/mv-nth.cert on 15-Oct-2026 21:19:24.998
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/merge-sort-term-order.cert on 15-Oct-2026 21:19:25.018
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/doc.cert (0.579s) at 15-Oct-2026 21:19:25.039
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/portcullis.cert (1.120s) at 15-Oct-2026 21:19:25.049
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/monomial.cert (3.592s) at 15-Oct-2026 21:19:25.055
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/defs.cert (0.702s) at 15-Oct-2026 21:19:25.167
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/iff.cert on 15-Oct-2026 21:19:25.159
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/getopt/portcullis.cert (1.109s) at 15-Oct-2026 21:19:25.177
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/defbinding.cert on 15-Oct-2026 21:19:25.256
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defpun.cert on 15-Oct-2026 21:19:25.260
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/intern-in-package-of-symbol.cert on 15-Oct-2026 21:19:25.240
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/signed-byte-listp.cert (0.550s) at 15-Oct-2026 21:19:25.330
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/fty/portcullis.cert (1.718s) at 15-Oct-2026 21:19:25.358
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/omerge-good-order.cert (5.846s) at 15-Oct-2026 21:19:25.402
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/table.cert on 15-Oct-2026 21:19:25.413
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/adviser/adviser-pkg.cert (0.478s) at 15-Oct-2026 21:19:25.439
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/clause-processor.cert on 15-Oct-2026 21:19:25.434
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/msort.cert (0.922s) at 15-Oct-2026 21:19:25.464
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/maps/portcullis.cert on 15-Oct-2026 21:19:25.455
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/mfc-utils.cert (2.121s) at 15-Oct-2026 21:19:25.491
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/deffix.cert on 15-Oct-2026 21:19:25.549
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/memories/private.cert on 15-Oct-2026 21:19:25.581
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/plev.cert (0.767s) at 15-Oct-2026 21:19:25.588
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/rule-sets-support.cert on 15-Oct-2026 21:19:25.666
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/defdoc.cert on 15-Oct-2026 21:19:25.670
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/syntaxp.cert on 15-Oct-2026 21:19:25.655
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/iff.cert (0.560s) at 15-Oct-2026 21:19:25.732
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/alu-proofs.cert (1.394s) at 15-Oct-2026 21:19:25.743
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/in-conclusion.cert (0.923s) at 15-Oct-2026 21:19:25.770
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/bstar.cert (2.758s) at 15-Oct-2026 21:19:25.778
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/defbinding.cert (0.531s) at 15-Oct-2026 21:19:25.794
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/intern-in-package-of-symbol.cert (0.572s) at 15-Oct-2026 21:19:25.849
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/linear-xdoc.cert on 15-Oct-2026 21:19:25.846
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/portcullis.cert (0.908s) at 15-Oct-2026 21:19:25.885
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/ecurve/portcullis.cert on 15-Oct-2026 21:19:25.938
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/symbol-alistp.cert on 15-Oct-2026 21:19:26.014
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-bang-stobj.cert on 15-Oct-2026 21:19:26.028
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/irrelevant-formals.cert on 15-Oct-2026 21:19:26.035
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/run-script.cert on 15-Oct-2026 21:19:26.051
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/sorting/merge-sort-term-order.cert (1.059s) at 15-Oct-2026 21:19:26.092
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/abnf/portcullis.cert on 15-Oct-2026 21:19:26.093
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/execloader/portcullis.cert on 15-Oct-2026 21:19:26.208
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/maps/portcullis.cert (0.732s) at 15-Oct-2026 21:19:26.226
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/table.cert (0.847s) at 15-Oct-2026 21:19:26.271
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/clause-processor.cert (0.886s) at 15-Oct-2026 21:19:26.351
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/yul/portcullis.cert on 15-Oct-2026 21:19:26.339
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/origin.cert on 15-Oct-2026 21:19:26.364
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/fixequiv.cert on 15-Oct-2026 21:19:26.366
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/syntaxp.cert (0.664s) at 15-Oct-2026 21:19:26.385
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defpun.cert (1.173s) at 15-Oct-2026 21:19:26.456
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/hint-wrapper.cert on 15-Oct-2026 21:19:26.451
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-bang-stobj.cert (0.467s) at 15-Oct-2026 21:19:26.510
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/memories/private.cert (0.936s) at 15-Oct-2026 21:19:26.528
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/removable-runes.cert on 15-Oct-2026 21:19:26.552
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rewrite-dollar.cert on 15-Oct-2026 21:19:26.576
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/prove-dollar.cert on 15-Oct-2026 21:19:26.582
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/open-trace-file-bang.cert on 15-Oct-2026 21:19:26.617
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/defdoc.cert (0.999s) at 15-Oct-2026 21:19:26.734
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/deffix.cert (1.181s) at 15-Oct-2026 21:19:26.743
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/run-script.cert (0.686s) at 15-Oct-2026 21:19:26.749
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/symbol-alistp.cert (0.742s) at 15-Oct-2026 21:19:26.775
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/mv-nth.cert (1.770s) at 15-Oct-2026 21:19:26.782
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/origin.cert (0.428s) at 15-Oct-2026 21:19:26.798
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/er-soft-logic.cert on 15-Oct-2026 21:19:26.833
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/event-names.cert on 15-Oct-2026 21:19:26.828
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/memoize-prover-fns.cert on 15-Oct-2026 21:19:26.833
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/abnf/portcullis.cert (0.796s) at 15-Oct-2026 21:19:26.908
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/ecurve/portcullis.cert (0.970s) at 15-Oct-2026 21:19:26.929
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/yul/portcullis.cert (0.596s) at 15-Oct-2026 21:19:26.960
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/find-lemmas.cert on 15-Oct-2026 21:19:26.987
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dump-events.cert on 15-Oct-2026 21:19:27.006
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/defcode.cert (2.979s) at 15-Oct-2026 21:19:27.023
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/install-not-normalized.cert on 15-Oct-2026 21:19:27.053
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/acl2-system-exports.cert on 15-Oct-2026 21:19:26.884
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/open-trace-file-bang.cert (0.455s) at 15-Oct-2026 21:19:27.078
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defmac.cert on 15-Oct-2026 21:19:27.069
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dft.cert on 15-Oct-2026 21:19:27.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/seq.cert on 15-Oct-2026 21:19:27.122
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/irrelevant-formals.cert (1.074s) at 15-Oct-2026 21:19:27.136
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/ev-theoremp.cert (3.391s) at 15-Oct-2026 21:19:27.193
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/execloader/portcullis.cert (0.969s) at 15-Oct-2026 21:19:27.207
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/with-waterfall-parallelism.cert on 15-Oct-2026 21:19:27.210
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/leftist-trees/leftist-trees-xdoc.cert on 15-Oct-2026 21:19:27.279
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sin-cos.cert on 15-Oct-2026 21:19:27.279
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/doc.cert on 15-Oct-2026 21:19:27.292
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/array1.cert (2.483s) at 15-Oct-2026 21:19:27.331
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/fixequiv.cert (0.979s) at 15-Oct-2026 21:19:27.435
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert on 15-Oct-2026 21:19:27.427
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/lib/doc.cert on 15-Oct-2026 21:19:27.495
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/event-names.cert (0.662s) at 15-Oct-2026 21:19:27.503
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hints/hint-wrapper.cert (1.045s) at 15-Oct-2026 21:19:27.507
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/rule-sets-support.cert (1.834s) at 15-Oct-2026 21:19:27.555
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/realpart.cert on 15-Oct-2026 21:19:27.561
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/acl2-system-exports.cert (0.517s) at 15-Oct-2026 21:19:27.589
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/er-soft-logic.cert (0.754s) at 15-Oct-2026 21:19:27.591
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/sets.cert on 15-Oct-2026 21:19:27.625
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/append.cert on 15-Oct-2026 21:19:27.629
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/macro-args.cert on 15-Oct-2026 21:19:27.654
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/find-lemmas.cert (0.673s) at 15-Oct-2026 21:19:27.666
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/declares0.cert on 15-Oct-2026 21:19:27.707
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/no-duplicatesp-equal.cert on 15-Oct-2026 21:19:27.745
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/with-waterfall-parallelism.cert (0.611s) at 15-Oct-2026 21:19:27.825
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-nested.cert (6.232s) at 15-Oct-2026 21:19:27.852
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/removable-runes.cert (1.322s) at 15-Oct-2026 21:19:27.900
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/leftist-trees/leftist-trees-xdoc.cert (0.627s) at 15-Oct-2026 21:19:27.917
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/repeat.cert on 15-Oct-2026 21:19:27.925
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/negate-terms.cert on 15-Oct-2026 21:19:27.926
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/pattern-matching.cert on 15-Oct-2026 21:19:27.992
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/my-get-event.cert on 15-Oct-2026 21:19:27.993
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/seq.cert (0.860s) at 15-Oct-2026 21:19:28.006
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/milawa/doc.cert (0.736s) at 15-Oct-2026 21:19:28.048
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/conjoin.cert on 15-Oct-2026 21:19:28.092
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/prove-dollar.cert (1.511s) at 15-Oct-2026 21:19:28.137
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dump-events.cert (1.133s) at 15-Oct-2026 21:19:28.150
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/realpart.cert (0.649s) at 15-Oct-2026 21:19:28.219
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defthmr.cert on 15-Oct-2026 21:19:28.220
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/directed-untranslate.cert on 15-Oct-2026 21:19:28.250
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/sin-cos.cert (1.004s) at 15-Oct-2026 21:19:28.311
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/legal-variablep.cert on 15-Oct-2026 21:19:28.297
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/linear-xdoc.cert (2.490s) at 15-Oct-2026 21:19:28.344
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/lib/doc.cert (0.848s) at 15-Oct-2026 21:19:28.359
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/function-symbolp.cert on 15-Oct-2026 21:19:28.396
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/perm.cert on 15-Oct-2026 21:19:28.405
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/apply-fn-if-known.cert on 15-Oct-2026 21:19:28.454
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/no-duplicatesp-equal.cert (0.750s) at 15-Oct-2026 21:19:28.504
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/examples.cert (6.936s) at 15-Oct-2026 21:19:28.586
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-defun-doc.cert on 15-Oct-2026 21:19:28.594
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/trans-eval-error-triple.cert on 15-Oct-2026 21:19:28.610
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/negate-terms.cert (0.727s) at 15-Oct-2026 21:19:28.663
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/def-bound-theorems.cert (4.261s) at 15-Oct-2026 21:19:28.720
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-defun-sk-doc.cert on 15-Oct-2026 21:19:28.715
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/my-get-event.cert (0.753s) at 15-Oct-2026 21:19:28.755
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/append.cert (1.154s) at 15-Oct-2026 21:19:28.792
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-doc.cert on 15-Oct-2026 21:19:28.762
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/hunt-reeber/support/bdd.cert (20.854s) at 15-Oct-2026 21:19:28.804
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/macro-args.cert (1.159s) at 15-Oct-2026 21:19:28.821
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-term-doc.cert on 15-Oct-2026 21:19:28.820
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/sets.cert (1.192s) at 15-Oct-2026 21:19:28.829
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/repeat.cert (0.896s) at 15-Oct-2026 21:19:28.829
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/fields.cert on 15-Oct-2026 21:19:28.911
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/descriptors.cert on 15-Oct-2026 21:19:28.891
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/maxelem.cert on 15-Oct-2026 21:19:28.918
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/dargp.cert on 15-Oct-2026 21:19:28.929
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/conjoin.cert (0.853s) at 15-Oct-2026 21:19:28.958
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defmac.cert (2.084s) at 15-Oct-2026 21:19:29.167
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/state.cert on 15-Oct-2026 21:19:29.144
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/apply-fn-if-known.cert (0.717s) at 15-Oct-2026 21:19:29.203
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/install-not-normalized.cert (2.145s) at 15-Oct-2026 21:19:29.218
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defthmr.cert (0.978s) at 15-Oct-2026 21:19:29.234
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/axe-types.cert on 15-Oct-2026 21:19:29.267
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/prefixp.cert on 15-Oct-2026 21:19:29.303
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/pattern-matching.cert (1.319s) at 15-Oct-2026 21:19:29.319
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-nth.cert on 15-Oct-2026 21:19:29.313
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert (23.813s) at 15-Oct-2026 21:19:29.344
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/lrat-checker.cert (16.452s) at 15-Oct-2026 21:19:29.425
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/beta-reduce.cert (4.470s) at 15-Oct-2026 21:19:29.453
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/take2.cert on 15-Oct-2026 21:19:29.463
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/repeat-tail.cert on 15-Oct-2026 21:19:29.438
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/dargp.cert (0.557s) at 15-Oct-2026 21:19:29.501
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-term-doc.cert (0.666s) at 15-Oct-2026 21:19:29.501
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/strip-stars-from-name.cert on 15-Oct-2026 21:19:29.524
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/supporting-functions.cert on 15-Oct-2026 21:19:29.543
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/fields.cert (0.667s) at 15-Oct-2026 21:19:29.588
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/doc.cert on 15-Oct-2026 21:19:29.568
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/get-username.cert on 15-Oct-2026 21:19:29.606
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bv-syntax.cert on 15-Oct-2026 21:19:29.555
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-defun-sk-doc.cert (0.743s) at 15-Oct-2026 21:19:29.630
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/termination-database-utilities.cert on 15-Oct-2026 21:19:29.681
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-doc.cert (0.858s) at 15-Oct-2026 21:19:29.736
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booleans.cert on 15-Oct-2026 21:19:29.745
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/fms-bang-list.cert on 15-Oct-2026 21:19:29.828
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/legal-variablep.cert (1.572s) at 15-Oct-2026 21:19:29.915
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/repeat-tail.cert (0.484s) at 15-Oct-2026 21:19:29.973
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-equal-dollar2.cert on 15-Oct-2026 21:19:30.002
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/strict-merge-sort.cert on 15-Oct-2026 21:19:30.025
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/strip-stars-from-name.cert (0.533s) at 15-Oct-2026 21:19:30.068
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/subsetp-eq-linear.cert on 15-Oct-2026 21:19:30.073
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/w.cert on 15-Oct-2026 21:19:30.114
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/defset-encapsulates.cert (10.644s) at 15-Oct-2026 21:19:30.147
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/doc.cert (0.664s) at 15-Oct-2026 21:19:30.268
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/supporting-functions.cert (0.727s) at 15-Oct-2026 21:19:30.283
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-integerp-of-repeat.cert on 15-Oct-2026 21:19:30.336
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/take2.cert (0.932s) at 15-Oct-2026 21:19:30.405
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-nth.cert (1.133s) at 15-Oct-2026 21:19:30.484
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/bit-listp-rules.cert on 15-Oct-2026 21:19:30.516
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/r1cs/lift-r1cs-rule-lists.cert on 15-Oct-2026 21:19:30.512
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert (8.183s) at 15-Oct-2026 21:19:30.585
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/trans-eval-error-triple.cert (1.959s) at 15-Oct-2026 21:19:30.589
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/arglistp.cert on 15-Oct-2026 21:19:30.590
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/choose-rules.cert on 15-Oct-2026 21:19:30.623
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/arity.cert on 15-Oct-2026 21:19:30.688
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/getprops.cert on 15-Oct-2026 21:19:30.690
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/axe-types.cert (1.481s) at 15-Oct-2026 21:19:30.783
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/plist-worldp-with-formals.cert on 15-Oct-2026 21:19:30.837
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/strict-merge-sort.cert (1.196s) at 15-Oct-2026 21:19:31.236
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ith.cert (6.363s) at 15-Oct-2026 21:19:31.281
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/portcullis.cert on 15-Oct-2026 21:19:31.386
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/rimlinger/support/Rimlinger.cert (22.736s) at 15-Oct-2026 21:19:31.396
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert (3.937s) at 15-Oct-2026 21:19:31.397
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv-lists/bit-listp-rules.cert (0.880s) at 15-Oct-2026 21:19:31.437
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/syntactic-lists.cert on 15-Oct-2026 21:19:31.508
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/auto-instance.cert on 15-Oct-2026 21:19:31.551
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/declares0.cert (3.882s) at 15-Oct-2026 21:19:31.617
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/memoize-prover-fns.cert (4.773s) at 15-Oct-2026 21:19:31.630
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/book-runes-alist.cert on 15-Oct-2026 21:19:31.676
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rewrite-dollar.cert (5.126s) at 15-Oct-2026 21:19:31.722
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/skip-in-book.cert on 15-Oct-2026 21:19:31.768
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/functions-in-world.cert on 15-Oct-2026 21:19:31.771
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/maxelem.cert (2.895s) at 15-Oct-2026 21:19:31.830
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ubi-doc.cert on 15-Oct-2026 21:19:31.952
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/nary/nth-rules.cert (17.601s) at 15-Oct-2026 21:19:31.986
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/include-book-paths.cert on 15-Oct-2026 21:19:31.982
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/plist-worldp-with-formals.cert (1.088s) at 15-Oct-2026 21:19:32.040
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/r1cs/lift-r1cs-rule-lists.cert (1.496s) at 15-Oct-2026 21:19:32.050
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/fms-bang-list.cert (2.234s) at 15-Oct-2026 21:19:32.071
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmacro-plus-doc.cert on 15-Oct-2026 21:19:32.028
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/portcullis.cert (0.700s) at 15-Oct-2026 21:19:32.098
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/getprops.cert (1.313s) at 15-Oct-2026 21:19:32.108
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/dynamic-make-event-test.cert on 15-Oct-2026 21:19:32.168
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/pattern-matching.cert on 15-Oct-2026 21:19:32.187
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints-doc.cert on 15-Oct-2026 21:19:32.194
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/equivalence-checker-helpers.cert on 15-Oct-2026 21:19:32.266
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/function-symbolp.cert (3.863s) at 15-Oct-2026 21:19:32.279
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/w.cert (2.195s) at 15-Oct-2026 21:19:32.332
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/directed-untranslate.cert on 15-Oct-2026 21:19:32.353
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/minelem.cert on 15-Oct-2026 21:19:32.375
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/yul/library-extensions/lists.cert on 15-Oct-2026 21:19:32.378
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/dft.cert (5.201s) at 15-Oct-2026 21:19:32.390
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/x86/parsers/pe-tools.cert on 15-Oct-2026 21:19:32.489
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-tuple.cert on 15-Oct-2026 21:19:32.488
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/injections.cert on 15-Oct-2026 21:19:32.467
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmacro-plus-doc.cert (0.575s) at 15-Oct-2026 21:19:32.664
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/all-equal-dollar2.cert (2.635s) at 15-Oct-2026 21:19:32.670
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/syntactic-lists.cert (1.110s) at 15-Oct-2026 21:19:32.746
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/helpers/helper-old.cert on 15-Oct-2026 21:19:32.760
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/ubi-doc.cert (0.804s) at 15-Oct-2026 21:19:32.768
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/auto-instance.cert (1.182s) at 15-Oct-2026 21:19:32.787
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/prove-dollar-nice.cert on 15-Oct-2026 21:19:32.801
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/state.cert (3.715s) at 15-Oct-2026 21:19:32.933
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test.cert on 15-Oct-2026 21:19:32.886
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/skip-in-book.cert (1.179s) at 15-Oct-2026 21:19:32.954
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints-doc.cert (0.833s) at 15-Oct-2026 21:19:33.043
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/lrat-checker.cert (38.180s) at 15-Oct-2026 21:19:33.130
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/x86/parsers/pe-tools.cert (0.649s) at 15-Oct-2026 21:19:33.147
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints-tests-book.cert on 15-Oct-2026 21:19:33.128
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/all-integerp-of-repeat.cert (2.781s) at 15-Oct-2026 21:19:33.159
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/simplify-defun-doc.cert (4.519s) at 15-Oct-2026 21:19:33.161
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-legal-var-in-acl2-package.cert on 15-Oct-2026 21:19:33.147
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-spec.cert (11.649s) at 15-Oct-2026 21:19:33.209
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 15-Oct-2026 21:19:33.179
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booleans.cert (3.422s) at 15-Oct-2026 21:19:33.270
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/rager/support/ptest-if-normalization.cert (25.352s) at 15-Oct-2026 21:19:33.271
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/include-book-paths.cert (1.285s) at 15-Oct-2026 21:19:33.280
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/lrat-parser.cert on 15-Oct-2026 21:19:33.248
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/lrat-parser.cert on 15-Oct-2026 21:19:33.368
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/book-runes-alist.cert (1.773s) at 15-Oct-2026 21:19:33.471
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/prefixp.cert (4.198s) at 15-Oct-2026 21:19:33.512
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/dynamic-make-event-test.cert (1.333s) at 15-Oct-2026 21:19:33.522
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/descriptors.cert (4.589s) at 15-Oct-2026 21:19:33.550
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/pattern-matching.cert (1.354s) at 15-Oct-2026 21:19:33.560
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/arity.cert (2.801s) at 15-Oct-2026 21:19:33.562
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/taspi-xdoc.cert on 15-Oct-2026 21:19:33.578
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/pigeonhole.cert on 15-Oct-2026 21:19:33.566
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/halt-flg.cert on 15-Oct-2026 21:19:33.616
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proof-builder/extras.cert on 15-Oct-2026 21:19:33.625
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/double-cert-test.cert (0.761s) at 15-Oct-2026 21:19:33.726
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/functions-in-world.cert (1.984s) at 15-Oct-2026 21:19:33.774
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/injections.cert (1.253s) at 15-Oct-2026 21:19:33.789
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/same-lengthp.cert on 15-Oct-2026 21:19:33.828
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/tests/bstar.cert on 15-Oct-2026 21:19:33.853
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/yul/library-extensions/lists.cert (1.614s) at 15-Oct-2026 21:19:34.020
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert (28.836s) at 15-Oct-2026 21:19:34.084
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/convert-legacy-doc/import-acl2doc.cert on 15-Oct-2026 21:19:34.118
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert on 15-Oct-2026 21:19:34.126
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/misc/intern-in-package-of-symbol.cert on 15-Oct-2026 21:19:34.140
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert (16.229s) at 15-Oct-2026 21:19:34.173
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/irrelevant-formals-book.cert on 15-Oct-2026 21:19:34.234
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.cert on 15-Oct-2026 21:19:34.265
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.cert on 15-Oct-2026 21:19:34.259
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/minelem.cert (2.026s) at 15-Oct-2026 21:19:34.413
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/aliasing-tests-book.cert on 15-Oct-2026 21:19:34.534
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proof-builder/extras.cert (0.942s) at 15-Oct-2026 21:19:34.583
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/choose-rules.cert (3.939s) at 15-Oct-2026 21:19:34.618
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/equal-based-set.cert on 15-Oct-2026 21:19:34.610
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/weighting.cert on 15-Oct-2026 21:19:34.631
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/same-lengthp.cert (0.835s) at 15-Oct-2026 21:19:34.683
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert on 15-Oct-2026 21:19:34.503
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/truth-monotone.cert on 15-Oct-2026 21:19:34.437
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.cert on 15-Oct-2026 21:19:34.724
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/lrat-parser.cert on 15-Oct-2026 21:19:34.732
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/nested-abstract-stobjs-book.cert on 15-Oct-2026 21:19:34.767
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top.cert on 15-Oct-2026 21:19:34.858
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/misc/intern-in-package-of-symbol.cert (0.771s) at 15-Oct-2026 21:19:34.951
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/taspi-xdoc.cert (1.385s) at 15-Oct-2026 21:19:35.004
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/equivalence-checker-helpers.cert (2.822s) at 15-Oct-2026 21:19:35.100
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/memory-clearing.cert on 15-Oct-2026 21:19:34.970
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/fringes-taspi.cert on 15-Oct-2026 21:19:35.165
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/checkpoints-tests-book.cert (2.120s) at 15-Oct-2026 21:19:35.283
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-tuple.cert (2.861s) at 15-Oct-2026 21:19:35.363
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/deftuple.cert on 15-Oct-2026 21:19:35.371
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/big-const-hons.cert (35.847s) at 15-Oct-2026 21:19:35.404
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/fake-event.cert on 15-Oct-2026 21:19:35.494
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/sub.cert (1.526s) at 15-Oct-2026 21:19:35.811
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/local-elided.cert (1.467s) at 15-Oct-2026 21:19:35.857
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-eval.cert on 15-Oct-2026 21:19:35.949
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/last-theory-change.cert on 15-Oct-2026 21:19:35.929
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-errors-book.cert on 15-Oct-2026 21:19:35.922
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/tests/bstar.cert (2.127s) at 15-Oct-2026 21:19:36.024
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/truth-monotone.cert (1.414s) at 15-Oct-2026 21:19:36.156
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/helpers/helper-old.cert (3.413s) at 15-Oct-2026 21:19:36.179
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 15-Oct-2026 21:19:36.188
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/directed-untranslate.cert (7.870s) at 15-Oct-2026 21:19:36.215
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/elide-test.cert (1.490s) at 15-Oct-2026 21:19:36.232
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/subsetp-eq-linear.cert (6.201s) at 15-Oct-2026 21:19:36.284
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/exercises.cert on 15-Oct-2026 21:19:36.271
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/weighting.cert (1.661s) at 15-Oct-2026 21:19:36.304
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/relations.cert on 15-Oct-2026 21:19:36.331
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/with-global-stobj-book.cert on 15-Oct-2026 21:19:36.306
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert on 15-Oct-2026 21:19:36.332
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/irrelevant-formals-book.cert (2.104s) at 15-Oct-2026 21:19:36.387
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert on 15-Oct-2026 21:19:36.379
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/regex/equal-based-set.cert (1.749s) at 15-Oct-2026 21:19:36.444
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/system/arglistp.cert (5.790s) at 15-Oct-2026 21:19:36.465
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/get-username.cert (6.867s) at 15-Oct-2026 21:19:36.483
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/defpun.cert on 15-Oct-2026 21:19:36.510
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/lrat-parser.cert (1.626s) at 15-Oct-2026 21:19:36.527
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/deftuple.cert (1.050s) at 15-Oct-2026 21:19:36.547
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/polynomial.cert on 15-Oct-2026 21:19:36.524
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/last-theory-change.cert (0.596s) at 15-Oct-2026 21:19:36.600
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert on 15-Oct-2026 21:19:36.627
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/fake-event.cert (1.173s) at 15-Oct-2026 21:19:36.686
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert on 15-Oct-2026 21:19:36.753
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/prove-dollar-nice.cert (4.022s) at 15-Oct-2026 21:19:36.833
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert on 15-Oct-2026 21:19:36.820
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert on 15-Oct-2026 21:19:36.711
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/bstar.cert on 15-Oct-2026 21:19:36.787
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/records.cert on 15-Oct-2026 21:19:36.935
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/case-splitting-rules.cert on 15-Oct-2026 21:19:36.970
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert on 15-Oct-2026 21:19:37.007
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-prf.cert on 15-Oct-2026 21:19:37.033
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/cert-data/top.cert (2.229s) at 15-Oct-2026 21:19:37.102
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/equality-with-hons-copy.cert on 15-Oct-2026 21:19:37.127
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/vhdl/exercises.cert (0.880s) at 15-Oct-2026 21:19:37.186
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert on 15-Oct-2026 21:19:37.218
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/aliasing-tests-book.cert (2.682s) at 15-Oct-2026 21:19:37.244
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/membership.cert on 15-Oct-2026 21:19:37.250
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/cowles-gamboa/support/tail-rec.cert on 15-Oct-2026 21:19:37.237
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/ray/support/defpun-exec.cert on 15-Oct-2026 21:19:37.378
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/bstar.cert (0.516s) at 15-Oct-2026 21:19:37.444
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/defpun.cert (0.913s) at 15-Oct-2026 21:19:37.455
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert on 15-Oct-2026 21:19:37.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert on 15-Oct-2026 21:19:37.550
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/medina/polynomials/polynomial.cert (0.999s) at 15-Oct-2026 21:19:37.596
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert on 15-Oct-2026 21:19:37.633
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert (1.462s) at 15-Oct-2026 21:19:37.667
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/relations.cert (1.341s) at 15-Oct-2026 21:19:37.697
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert on 15-Oct-2026 21:19:37.721
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/lrat-parser.cert (4.218s) at 15-Oct-2026 21:19:37.740
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/swords-cook/lcsoundness/pattern-match.cert on 15-Oct-2026 21:19:37.759
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/pigeonhole.cert (4.057s) at 15-Oct-2026 21:19:37.785
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/case-splitting-rules.cert (0.643s) at 15-Oct-2026 21:19:37.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/hacker.cert on 15-Oct-2026 21:19:37.792
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-eval.cert (1.865s) at 15-Oct-2026 21:19:37.823
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/dillinger-et-al-xdoc.cert on 15-Oct-2026 21:19:37.881
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/defstruct-parsing.cert on 15-Oct-2026 21:19:37.849
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.cert on 15-Oct-2026 21:19:37.887
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-legal-var-in-acl2-package.cert (4.849s) at 15-Oct-2026 21:19:38.037
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/lemgen.cert on 15-Oct-2026 21:19:38.033
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/abstract-stobj-nesting/nested-abstract-stobjs-book.cert (3.345s) at 15-Oct-2026 21:19:38.145
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/cowles-gamboa/support/tail-rec.cert (0.857s) at 15-Oct-2026 21:19:38.178
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/goel-hunt-kaufmann/support/defabsstobj-example.cert on 15-Oct-2026 21:19:38.169
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/equality-with-hons-copy.cert (1.067s) at 15-Oct-2026 21:19:38.211
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert (0.625s) at 15-Oct-2026 21:19:38.280
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/expander.cert on 15-Oct-2026 21:19:38.281
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/prefer-times.cert on 15-Oct-2026 21:19:38.310
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/nested-stobj-errors-book.cert (2.263s) at 15-Oct-2026 21:19:38.317
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/records.cert (1.348s) at 15-Oct-2026 21:19:38.372
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/benchmarks.cert on 15-Oct-2026 21:19:38.396
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert (1.199s) at 15-Oct-2026 21:19:38.438
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/utilities.cert on 15-Oct-2026 21:19:38.454
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bv/bv-syntax.cert (8.866s) at 15-Oct-2026 21:19:38.495
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert (1.463s) at 15-Oct-2026 21:19:38.542
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/acl2-asg.cert on 15-Oct-2026 21:19:38.525
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/rational-listp.cert on 15-Oct-2026 21:19:38.538
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/support.cert on 15-Oct-2026 21:19:38.642
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/halt-flg.cert (5.059s) at 15-Oct-2026 21:19:38.696
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/nat-listp.cert on 15-Oct-2026 21:19:38.687
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/dillinger-et-al-xdoc.cert (0.850s) at 15-Oct-2026 21:19:38.739
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/verbeek-schmaltz/sources/perm.cert (0.672s) at 15-Oct-2026 21:19:38.748
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ihs/ihs-doc-topic.cert on 15-Oct-2026 21:19:38.738
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/cons.cert on 15-Oct-2026 21:19:38.861
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/defstruct-parsing.cert (1.004s) at 15-Oct-2026 21:19:38.960
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert (2.158s) at 15-Oct-2026 21:19:39.023
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert (1.495s) at 15-Oct-2026 21:19:39.061
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fmt-to-str-orig.cert on 15-Oct-2026 21:19:39.068
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defmacroq.cert on 15-Oct-2026 21:19:39.098
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/prefer-times.cert (0.794s) at 15-Oct-2026 21:19:39.124
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/defs.cert on 15-Oct-2026 21:19:39.140
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/file-io.cert on 15-Oct-2026 21:19:39.156
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/deps.cert on 15-Oct-2026 21:19:39.208
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/termination-database-utilities.cert (9.540s) at 15-Oct-2026 21:19:39.236
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rulesets.cert on 15-Oct-2026 21:19:39.250
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/rational-listp.cert (0.734s) at 15-Oct-2026 21:19:39.312
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert (5.191s) at 15-Oct-2026 21:19:39.346
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/memory-clearing.cert (4.248s) at 15-Oct-2026 21:19:39.356
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert (1.620s) at 15-Oct-2026 21:19:39.357
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/abstract.cert on 15-Oct-2026 21:19:39.339
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert (2.320s) at 15-Oct-2026 21:19:39.376
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/hacker.cert (1.645s) at 15-Oct-2026 21:19:39.466
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-be-redundant.cert on 15-Oct-2026 21:19:39.519
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/prefer-times.cert on 15-Oct-2026 21:19:39.516
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/total-order.cert on 15-Oct-2026 21:19:39.531
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/inductions.cert on 15-Oct-2026 21:19:39.504
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/proof-builder-macros.cert on 15-Oct-2026 21:19:39.645
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/deps.cert (0.527s) at 15-Oct-2026 21:19:39.744
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defmacroq.cert (0.643s) at 15-Oct-2026 21:19:39.750
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/pseudo-translate.cert on 15-Oct-2026 21:19:39.845
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/convert-legacy-doc/import-acl2doc.cert (5.782s) at 15-Oct-2026 21:19:39.930
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert (6.727s) at 15-Oct-2026 21:19:39.965
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert (3.243s) at 15-Oct-2026 21:19:40.014
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/pos-fix.cert on 15-Oct-2026 21:19:40.044
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-eval-to.cert on 15-Oct-2026 21:19:40.046
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert (3.419s) at 15-Oct-2026 21:19:40.080
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/index-of.cert on 15-Oct-2026 21:19:40.069
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/non-parallel-book.cert on 15-Oct-2026 21:19:40.111
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/membership.cert (2.965s) at 15-Oct-2026 21:19:40.246
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/defs.cert (1.148s) at 15-Oct-2026 21:19:40.305
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/remove1-equal.cert on 15-Oct-2026 21:19:40.312
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/alist-keys.cert on 15-Oct-2026 21:19:40.323
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/utilities.cert (1.796s) at 15-Oct-2026 21:19:40.367
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-be-redundant.cert (0.842s) at 15-Oct-2026 21:19:40.374
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/true-listp.cert on 15-Oct-2026 21:19:40.417
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/inductions.cert (0.849s) at 15-Oct-2026 21:19:40.446
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/alist-fix.cert on 15-Oct-2026 21:19:40.489
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/suffixp.cert on 15-Oct-2026 21:19:40.485
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ihs/ihs-doc-topic.cert (1.734s) at 15-Oct-2026 21:19:40.507
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/append-alist-keys.cert on 15-Oct-2026 21:19:40.551
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/append-alist-vals.cert on 15-Oct-2026 21:19:40.605
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/pos-fix.cert (0.585s) at 15-Oct-2026 21:19:40.639
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/union.cert on 15-Oct-2026 21:19:40.715
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/remove-assoc-equal.cert on 15-Oct-2026 21:19:40.736
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/proof-builder-macros.cert (1.092s) at 15-Oct-2026 21:19:40.750
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-eval-to.cert (0.740s) at 15-Oct-2026 21:19:40.800
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/system/non-parallel-book.cert (0.727s) at 15-Oct-2026 21:19:40.858
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/assoc.cert on 15-Oct-2026 21:19:40.845
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/without-waterfall-parallelism.cert on 15-Oct-2026 21:19:40.961
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/directed-untranslate.cert (8.463s) at 15-Oct-2026 21:19:41.079
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/rulesets.cert (1.760s) at 15-Oct-2026 21:19:41.127
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/total-order.cert (1.581s) at 15-Oct-2026 21:19:41.133
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/fmt-to-str-orig.cert (2.074s) at 15-Oct-2026 21:19:41.178
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/maybe-defthm.cert on 15-Oct-2026 21:19:41.176
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/digit-to-char.cert on 15-Oct-2026 21:19:41.226
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/use-by-hint.cert on 15-Oct-2026 21:19:41.254
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/def-functional-instance.cert on 15-Oct-2026 21:19:41.258
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/ray/support/defpun-exec.cert (3.861s) at 15-Oct-2026 21:19:41.293
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/magic-ev.cert on 15-Oct-2026 21:19:41.414
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/alist-keys.cert (1.418s) at 15-Oct-2026 21:19:41.760
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/cat-base.cert on 15-Oct-2026 21:19:41.636
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/true-listp.cert (1.439s) at 15-Oct-2026 21:19:41.868
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/union.cert (1.277s) at 15-Oct-2026 21:19:42.023
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/easy-simplify.cert on 15-Oct-2026 21:19:42.050
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/prefer-times.cert (2.538s) at 15-Oct-2026 21:19:42.083
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/alist-fix.cert (1.741s) at 15-Oct-2026 21:19:42.241
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/meta-lemmas.cert on 15-Oct-2026 21:19:42.247
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/abstract.cert (2.856s) at 15-Oct-2026 21:19:42.299
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/remove-assoc-equal.cert (1.596s) at 15-Oct-2026 21:19:42.341
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/cgen/with-timeout.cert on 15-Oct-2026 21:19:42.302
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/index-of.cert (2.258s) at 15-Oct-2026 21:19:42.350
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 49 Oct 15 21:19 success.txt
acl2-8.5> make[2]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support'
acl2-8.5> make[1]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/sumners-ray/support'
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/bash.cert on 15-Oct-2026 21:19:42.382
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert (6.014s) at 15-Oct-2026 21:19:42.406
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/acl2-asg.cert (3.867s) at 15-Oct-2026 21:19:42.433
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/keyword-to-keyword-value-list-alistp.cert on 15-Oct-2026 21:19:42.436
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-event-formp.cert on 15-Oct-2026 21:19:42.475
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/string-or-symbol-listp.cert on 15-Oct-2026 21:19:42.445
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-tests-and-callsp.cert on 15-Oct-2026 21:19:42.515
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/match-tree.cert on 15-Oct-2026 21:19:42.520
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/table-guard.cert on 15-Oct-2026 21:19:42.533
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/cons.cert (3.746s) at 15-Oct-2026 21:19:42.618
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/remove1-equal.cert (2.376s) at 15-Oct-2026 21:19:42.700
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/append-alist-keys.cert (2.176s) at 15-Oct-2026 21:19:42.766
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/check-equal.cert on 15-Oct-2026 21:19:42.807
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic/nat-listp.cert (4.193s) at 15-Oct-2026 21:19:42.902
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/developers-guide.cert on 15-Oct-2026 21:19:42.883
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/support.cert (4.283s) at 15-Oct-2026 21:19:42.946
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/suffixp.cert (2.441s) at 15-Oct-2026 21:19:42.946
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/hacking-xdoc.cert on 15-Oct-2026 21:19:42.981
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/easy-simplify.cert (0.984s) at 15-Oct-2026 21:19:43.055
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/fty/fty-sum-casemacro.cert on 15-Oct-2026 21:19:43.074
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-bang.cert on 15-Oct-2026 21:19:43.191
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-command-formp.cert on 15-Oct-2026 21:19:43.210
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/def-functional-instance.cert (1.955s) at 15-Oct-2026 21:19:43.243
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-event-formp.cert (0.752s) at 15-Oct-2026 21:19:43.246
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/defs-aux.cert on 15-Oct-2026 21:19:43.230
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/append-alist-vals.cert (2.674s) at 15-Oct-2026 21:19:43.291
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/pattern-match.cert on 15-Oct-2026 21:19:43.387
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/cat-base.cert (1.446s) at 15-Oct-2026 21:19:43.408
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert (5.883s) at 15-Oct-2026 21:19:43.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-lists/string-or-symbol-listp.cert (0.990s) at 15-Oct-2026 21:19:43.519
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/ipasir/portcullis.cert on 15-Oct-2026 21:19:43.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/include-raw.cert on 15-Oct-2026 21:19:43.490
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/hacking-xdoc.cert (0.568s) at 15-Oct-2026 21:19:43.565
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/starlogic.cert on 15-Oct-2026 21:19:43.630
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-tests-and-callsp.cert (1.155s) at 15-Oct-2026 21:19:43.686
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/pretty-defs-aux.cert on 15-Oct-2026 21:19:43.709
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/hons-extra.cert on 15-Oct-2026 21:19:43.730
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/file-io.cert (4.621s) at 15-Oct-2026 21:19:43.800
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/keyword-to-keyword-value-list-alistp.cert (1.373s) at 15-Oct-2026 21:19:43.828
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pseudo-command-formp.cert (0.562s) at 15-Oct-2026 21:19:43.846
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defmvtypes.cert on 15-Oct-2026 21:19:43.862
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defevaluator-fast.cert on 15-Oct-2026 21:19:43.916
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/maybe-defthm.cert (2.782s) at 15-Oct-2026 21:19:43.986
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/absstobjs.cert on 15-Oct-2026 21:19:43.986
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-bang.cert (0.796s) at 15-Oct-2026 21:19:44.011
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/memory-mgmt-logic.cert on 15-Oct-2026 21:19:44.041
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/use-by-hint.cert (2.846s) at 15-Oct-2026 21:19:44.121
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/defs-aux.cert (0.902s) at 15-Oct-2026 21:19:44.197
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/with-quoted-forms.cert on 15-Oct-2026 21:19:44.132
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/outer-local.cert on 15-Oct-2026 21:19:44.220
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/include-raw.cert (0.734s) at 15-Oct-2026 21:19:44.282
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/cgen/with-timeout.cert (1.903s) at 15-Oct-2026 21:19:44.293
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/bash.cert (1.847s) at 15-Oct-2026 21:19:44.324
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/decomp-hint.cert on 15-Oct-2026 21:19:44.379
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/trivial-ancestors-check.cert on 15-Oct-2026 21:19:44.398
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmacro-plus.cert on 15-Oct-2026 21:19:44.439
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/safe-case.cert on 15-Oct-2026 21:19:44.627
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/two-nats-measure.cert on 15-Oct-2026 21:19:44.690
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/table-guard.cert (2.119s) at 15-Oct-2026 21:19:44.704
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/prev-stobj-binding.cert on 15-Oct-2026 21:19:44.767
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/termhints.cert on 15-Oct-2026 21:19:44.727
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/file-measure.cert on 15-Oct-2026 21:19:44.862
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/fty/fty-sum-casemacro.cert (1.889s) at 15-Oct-2026 21:19:44.989
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/absstobjs.cert (1.068s) at 15-Oct-2026 21:19:45.070
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/digit-to-char.cert (3.842s) at 15-Oct-2026 21:19:45.092
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/pretty-defs-aux.cert (1.422s) at 15-Oct-2026 21:19:45.158
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/pattern-match.cert (1.761s) at 15-Oct-2026 21:19:45.190
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/do-not.cert on 15-Oct-2026 21:19:45.316
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/starlogic.cert (1.820s) at 15-Oct-2026 21:19:45.475
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/without-waterfall-parallelism.cert (4.508s) at 15-Oct-2026 21:19:45.497
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/trace-star.cert on 15-Oct-2026 21:19:45.543
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert on 15-Oct-2026 21:19:45.555
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/acl2-doc.cert on 15-Oct-2026 21:19:45.571
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/with-quoted-forms.cert (1.349s) at 15-Oct-2026 21:19:45.589
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/prefer-times.cert on 15-Oct-2026 21:19:45.654
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/truth-monotone.cert on 15-Oct-2026 21:19:45.831
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/alists/assoc.cert (4.957s) at 15-Oct-2026 21:19:45.865
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/safe-case.cert (1.230s) at 15-Oct-2026 21:19:45.897
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/outer-local.cert (1.667s) at 15-Oct-2026 21:19:45.927
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/thms.cert on 15-Oct-2026 21:19:45.944
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/with-global-stobj-book.cert (9.603s) at 15-Oct-2026 21:19:45.987
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/tuplep.cert on 15-Oct-2026 21:19:45.997
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/meta-lemmas.cert (3.762s) at 15-Oct-2026 21:19:46.030
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs.cert on 15-Oct-2026 21:19:46.036
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defconsts.cert on 15-Oct-2026 21:19:46.078
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/decomp-hint.cert (1.658s) at 15-Oct-2026 21:19:46.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/quicklisp/base.cert on 15-Oct-2026 21:19:46.141
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/acre/portcullis.cert on 15-Oct-2026 21:19:46.165
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/meta/portcullis.cert on 15-Oct-2026 21:19:46.187
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/file-measure.cert (1.457s) at 15-Oct-2026 21:19:46.341
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/hons-extra.cert (2.670s) at 15-Oct-2026 21:19:46.432
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/do-not.cert (1.152s) at 15-Oct-2026 21:19:46.509
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/nested-stobjs.cert on 15-Oct-2026 21:19:46.524
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/test/ifdeftest/thms.cert (0.663s) at 15-Oct-2026 21:19:46.618
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/symlet.cert on 15-Oct-2026 21:19:46.612
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/random.cert on 15-Oct-2026 21:19:46.688
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bigmem/portcullis.cert on 15-Oct-2026 21:19:46.691
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-2/pass1/prefer-times.cert (1.140s) at 15-Oct-2026 21:19:46.812
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/records.cert on 15-Oct-2026 21:19:46.864
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/ipasir/portcullis.cert (3.407s) at 15-Oct-2026 21:19:46.952
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/alter.cert on 15-Oct-2026 21:19:47.069
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/acre/portcullis.cert (1.080s) at 15-Oct-2026 21:19:47.268
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/evalable-ld-printing.cert on 15-Oct-2026 21:19:47.212
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/perm.cert (18.857s) at 15-Oct-2026 21:19:47.302
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/termhints.cert (2.507s) at 15-Oct-2026 21:19:47.340
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/memory-mgmt-logic.cert (3.142s) at 15-Oct-2026 21:19:47.363
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/plev-ccl.cert on 15-Oct-2026 21:19:47.379
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/fast-alist-pop.cert on 15-Oct-2026 21:19:47.408
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/some-events.cert on 15-Oct-2026 21:19:47.431
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/meta/portcullis.cert (1.209s) at 15-Oct-2026 21:19:47.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/pseudo-translate.cert (7.624s) at 15-Oct-2026 21:19:47.483
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert (12.650s) at 15-Oct-2026 21:19:47.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/implies.cert on 15-Oct-2026 21:19:47.535
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/lispfloat/portcullis.cert on 15-Oct-2026 21:19:47.582
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/truth-monotone.cert (1.778s) at 15-Oct-2026 21:19:47.620
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/old/profile.cert on 15-Oct-2026 21:19:47.716
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/open-channels.cert on 15-Oct-2026 21:19:47.749
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/old/case.cert on 15-Oct-2026 21:19:47.756
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/xdoc/alter.cert (0.747s) at 15-Oct-2026 21:19:47.839
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/random.cert (1.279s) at 15-Oct-2026 21:19:48.006
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/trace-star.cert (2.485s) at 15-Oct-2026 21:19:48.039
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defevaluator-fast.cert (4.155s) at 15-Oct-2026 21:19:48.102
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/absstobjs.cert on 15-Oct-2026 21:19:48.099
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/lrat-parser.cert (14.874s) at 15-Oct-2026 21:19:48.179
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/top.cert on 15-Oct-2026 21:19:47.970
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/fal-graphs.cert on 15-Oct-2026 21:19:48.202
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/outer-local-tests.cert on 15-Oct-2026 21:19:48.357
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/iffstar.cert on 15-Oct-2026 21:19:48.440
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/trivial-ancestors-check.cert (4.055s) at 15-Oct-2026 21:19:48.465
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/nested-stobjs.cert (2.010s) at 15-Oct-2026 21:19:48.550
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/suffixp.cert on 15-Oct-2026 21:19:48.574
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/developers-guide.cert (5.092s) at 15-Oct-2026 21:19:48.589
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs.cert (2.567s) at 15-Oct-2026 21:19:48.618
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/unsound-read.cert on 15-Oct-2026 21:19:48.648
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/open-channels.cert (0.947s) at 15-Oct-2026 21:19:48.712
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/magic-ev.cert (7.342s) at 15-Oct-2026 21:19:48.795
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/alists/portcullis.cert on 15-Oct-2026 21:19:48.824
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/lemgen.cert (10.764s) at 15-Oct-2026 21:19:48.918
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/good-rewrite-order.cert on 15-Oct-2026 21:19:48.889
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/acl2-count.cert on 15-Oct-2026 21:19:49.157
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/top.cert (0.953s) at 15-Oct-2026 21:19:49.190
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/outer-local-tests.cert (0.839s) at 15-Oct-2026 21:19:49.208
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/plev-ccl.cert (1.914s) at 15-Oct-2026 21:19:49.310
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/syntax-extensions.cert on 15-Oct-2026 21:19:49.290
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/suffixp.cert (0.825s) at 15-Oct-2026 21:19:49.412
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/dtrees/portcullis.cert on 15-Oct-2026 21:19:49.417
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/bdd/benchmarks.cert (10.813s) at 15-Oct-2026 21:19:49.539
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/mv-nth.cert on 15-Oct-2026 21:19:49.511
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/bags/portcullis.cert on 15-Oct-2026 21:19:49.553
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defmvtypes.cert (5.732s) at 15-Oct-2026 21:19:49.622
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/debug.cert on 15-Oct-2026 21:19:49.566
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/bigmem/portcullis.cert (2.962s) at 15-Oct-2026 21:19:49.675
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/nth-meta.cert on 15-Oct-2026 21:19:49.655
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/nth-meta2.cert on 15-Oct-2026 21:19:49.766
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/lispfloat/portcullis.cert (2.194s) at 15-Oct-2026 21:19:49.795
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint.cert on 15-Oct-2026 21:19:49.850
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/good-rewrite-order.cert (1.107s) at 15-Oct-2026 21:19:50.030
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/tuplep.cert (4.022s) at 15-Oct-2026 21:19:50.031
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/records/fast/private.cert on 15-Oct-2026 21:19:50.123
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/skip-rewrite.cert on 15-Oct-2026 21:19:50.207
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/old/case.cert (2.513s) at 15-Oct-2026 21:19:50.299
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/types/pick-a-point.cert on 15-Oct-2026 21:19:50.412
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/symlet.cert (3.793s) at 15-Oct-2026 21:19:50.441
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint2.cert on 15-Oct-2026 21:19:50.590
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/extra-info.cert on 15-Oct-2026 21:19:50.599
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/rule-sets-documentation.cert on 15-Oct-2026 21:19:50.632
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/debug.cert (1.019s) at 15-Oct-2026 21:19:50.669
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/acl2s/check-equal.cert (7.831s) at 15-Oct-2026 21:19:50.677
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/mv-nth.cert (1.107s) at 15-Oct-2026 21:19:50.695
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/swords-cook/lcsoundness/pattern-match.cert (12.962s) at 15-Oct-2026 21:19:50.749
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ifdef.cert on 15-Oct-2026 21:19:50.784
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/dtrees/portcullis.cert (1.416s) at 15-Oct-2026 21:19:50.850
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/linear.cert on 15-Oct-2026 21:19:50.866
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/defalist.cert on 15-Oct-2026 21:19:50.921
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/structures.cert on 15-Oct-2026 21:19:50.945
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/records/fast/private.cert (0.816s) at 15-Oct-2026 21:19:51.050
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/acl2-count.cert (1.878s) at 15-Oct-2026 21:19:51.059
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/brr-free-variables-book.cert on 15-Oct-2026 21:19:51.155
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/defpun-exec/defpun-exec.cert on 15-Oct-2026 21:19:51.153
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/extra-info.cert (0.643s) at 15-Oct-2026 21:19:51.290
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/implies.cert (3.729s) at 15-Oct-2026 21:19:51.291
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-ackermann.cert (29.684s) at 15-Oct-2026 21:19:51.399
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ifdef.cert (0.639s) at 15-Oct-2026 21:19:51.440
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/basic/two-nats-measure.cert (6.727s) at 15-Oct-2026 21:19:51.444
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-equal.cert on 15-Oct-2026 21:19:51.435
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-not-be-table-key.cert on 15-Oct-2026 21:19:51.447
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ifixequiv.cert on 15-Oct-2026 21:19:51.582
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.cert on 15-Oct-2026 21:19:51.620
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/ld-history-book.cert on 15-Oct-2026 21:19:51.632
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/syntax/syntax-extensions.cert (2.324s) at 15-Oct-2026 21:19:51.694
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/types/pick-a-point.cert (1.327s) at 15-Oct-2026 21:19:51.790
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defp.cert on 15-Oct-2026 21:19:51.825
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-be-table-key.cert on 15-Oct-2026 21:19:51.856
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmacro-plus.cert (7.461s) at 15-Oct-2026 21:19:51.923
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/fal-graphs.cert (3.734s) at 15-Oct-2026 21:19:51.979
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/mini-proveall-book.cert on 15-Oct-2026 21:19:51.982
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/parallel/matrix-multiplication-serial.cert on 15-Oct-2026 21:19:52.057
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert-equal.cert (0.621s) at 15-Oct-2026 21:19:52.072
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/fast-alist-pop.cert (4.643s) at 15-Oct-2026 21:19:52.072
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/defexec/defpun-exec/defpun-exec.cert (0.938s) at 15-Oct-2026 21:19:52.120
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert (48.386s) at 15-Oct-2026 21:19:52.125
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/partial-encapsulate-support.cert on 15-Oct-2026 21:19:52.215
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/zcash/portcullis.cert on 15-Oct-2026 21:19:52.224
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/ecdsa/portcullis.cert on 15-Oct-2026 21:19:52.222
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bitcoin/portcullis.cert on 15-Oct-2026 21:19:52.306
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/absstobjs.cert (4.293s) at 15-Oct-2026 21:19:52.420
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-not-be-table-key.cert (1.028s) at 15-Oct-2026 21:19:52.482
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/match-tree.cert (9.901s) at 15-Oct-2026 21:19:52.483
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-time.cert on 15-Oct-2026 21:19:52.512
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/unsound-read.cert (3.861s) at 15-Oct-2026 21:19:52.518
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defopener.cert on 15-Oct-2026 21:19:52.616
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/bags/portcullis.cert (3.105s) at 15-Oct-2026 21:19:52.703
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defthmg.cert on 15-Oct-2026 21:19:52.769
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/seqw.cert on 15-Oct-2026 21:19:52.788
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert.cert on 15-Oct-2026 21:19:52.789
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/prev-stobj-binding.cert (8.016s) at 15-Oct-2026 21:19:52.813
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/rule-sets-documentation.cert (2.186s) at 15-Oct-2026 21:19:52.830
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/memoize-invoke-book.cert on 15-Oct-2026 21:19:52.848
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/crypto/ecdsa/portcullis.cert (0.742s) at 15-Oct-2026 21:19:52.995
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defsum.cert on 15-Oct-2026 21:19:52.971
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/linear.cert (2.174s) at 15-Oct-2026 21:19:53.057
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/partial-encapsulate-support.cert (0.833s) at 15-Oct-2026 21:19:53.058
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/must-be-table-key.cert (1.193s) at 15-Oct-2026 21:19:53.092
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/unique.cert on 15-Oct-2026 21:19:53.106
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/times.cert on 15-Oct-2026 21:19:53.132
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simp.cert on 15-Oct-2026 21:19:53.326
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defmacrodoc.cert on 15-Oct-2026 21:19:53.682
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2013/goel-hunt-kaufmann/support/defabsstobj-example.cert (15.640s) at 15-Oct-2026 21:19:53.826
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defun-forms.cert on 15-Oct-2026 21:19:53.893
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/seqw.cert (1.149s) at 15-Oct-2026 21:19:53.944
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-time.cert (1.510s) at 15-Oct-2026 21:19:54.034
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/revappend.cert on 15-Oct-2026 21:19:54.057
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/expander.cert (15.733s) at 15-Oct-2026 21:19:54.100
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/bitcoin/portcullis.cert (1.794s) at 15-Oct-2026 21:19:54.130
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/testing/assert.cert (1.329s) at 15-Oct-2026 21:19:54.131
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/set-stobjs-in-declares-to-match.cert on 15-Oct-2026 21:19:54.140
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/alists/portcullis.cert (5.320s) at 15-Oct-2026 21:19:54.180
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/transformation-prologue.cert on 15-Oct-2026 21:19:54.203
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/reverse-list.cert on 15-Oct-2026 21:19:54.236
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/firstn.cert on 15-Oct-2026 21:19:54.238
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/er-soft-plus.cert on 15-Oct-2026 21:19:54.191
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/hacking/evalable-ld-printing.cert (6.978s) at 15-Oct-2026 21:19:54.309
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subrange.cert on 15-Oct-2026 21:19:54.322
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-byte-dollar.cert on 15-Oct-2026 21:19:54.416
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/revappend.cert (0.623s) at 15-Oct-2026 21:19:54.694
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/method-descriptors.cert on 15-Oct-2026 21:19:54.785
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/proof-checker-itp13/supplemental/unique.cert (1.644s) at 15-Oct-2026 21:19:54.826
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/transformation-prologue.cert (0.673s) at 15-Oct-2026 21:19:54.894
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/first-n-ac.cert on 15-Oct-2026 21:19:54.929
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simp.cert (1.489s) at 15-Oct-2026 21:19:54.940
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/reverse.cert on 15-Oct-2026 21:19:54.985
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/include-book-dir-dollar.cert on 15-Oct-2026 21:19:55.046
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint2.cert (4.049s) at 15-Oct-2026 21:19:55.106
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defp.cert (3.309s) at 15-Oct-2026 21:19:55.168
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defthmg.cert (2.421s) at 15-Oct-2026 21:19:55.210
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/dargp-less-than.cert on 15-Oct-2026 21:19:55.270
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-nth2.cert on 15-Oct-2026 21:19:55.271
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-subrange.cert on 15-Oct-2026 21:19:55.311
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/first-n-ac.cert (0.469s) at 15-Oct-2026 21:19:55.410
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/submit-events.cert on 15-Oct-2026 21:19:55.510
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-byte-dollar.cert (1.091s) at 15-Oct-2026 21:19:55.520
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defconsts.cert (9.446s) at 15-Oct-2026 21:19:55.539
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/reverse-list.cert (1.347s) at 15-Oct-2026 21:19:55.594
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/er-soft-plus.cert (1.272s) at 15-Oct-2026 21:19:55.605
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/call-script.cert on 15-Oct-2026 21:19:55.634
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/defunt.cert on 15-Oct-2026 21:19:55.642
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/meta-rules.cert on 15-Oct-2026 21:19:55.673
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/mini-proveall-book.cert (3.770s) at 15-Oct-2026 21:19:55.761
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/include-book-dir-dollar.cert (0.718s) at 15-Oct-2026 21:19:55.778
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/arithmetic-light/times.cert (2.688s) at 15-Oct-2026 21:19:55.900
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/directed-untranslate-dollar.cert on 15-Oct-2026 21:19:55.911
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/dargp-less-than.cert (0.699s) at 15-Oct-2026 21:19:55.996
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/restore-mv-in-branches.cert on 15-Oct-2026 21:19:56.068
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-object.cert on 15-Oct-2026 21:19:56.124
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners2/bdds/bdd-prf.cert (18.976s) at 15-Oct-2026 21:19:56.171
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/brr-free-variables-book.cert (5.076s) at 15-Oct-2026 21:19:56.247
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/misc/iffstar.cert (7.774s) at 15-Oct-2026 21:19:56.252
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/advise.cert on 15-Oct-2026 21:19:56.260
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/jvm/method-descriptors.cert (1.471s) at 15-Oct-2026 21:19:56.274
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/integer-arithmetic/meta-rules.cert (0.618s) at 15-Oct-2026 21:19:56.303
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/reverse.cert (1.313s) at 15-Oct-2026 21:19:56.310
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/lists-axe.cert on 15-Oct-2026 21:19:56.331
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/termination-database.cert on 15-Oct-2026 21:19:56.350
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booleans2.cert on 15-Oct-2026 21:19:56.361
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/print-object-dollar.cert on 15-Oct-2026 21:19:56.369
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-char-dollar.cert on 15-Oct-2026 21:19:56.394
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/defsum.cert (3.641s) at 15-Oct-2026 21:19:56.739
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/call-script.cert (1.106s) at 15-Oct-2026 21:19:56.750
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/shallow/last1.cert on 15-Oct-2026 21:19:56.811
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/defunt.cert (1.189s) at 15-Oct-2026 21:19:56.852
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/prove-dollar-plus.cert on 15-Oct-2026 21:19:56.842
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/index-of-subseq.cert on 15-Oct-2026 21:19:56.852
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-object.cert (0.763s) at 15-Oct-2026 21:19:56.903
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-nth-tests.cert on 15-Oct-2026 21:19:56.953
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/defalist.cert (6.011s) at 15-Oct-2026 21:19:56.967
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/print-object-dollar.cert (0.614s) at 15-Oct-2026 21:19:56.989
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/axe/lists-axe.cert (0.646s) at 15-Oct-2026 21:19:56.999
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmax-nat-template.cert on 15-Oct-2026 21:19:56.998
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/firstn.cert (2.786s) at 15-Oct-2026 21:19:57.037
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/split-chars.cert on 15-Oct-2026 21:19:57.080
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/maxelem2.cert on 15-Oct-2026 21:19:57.099
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/zcash/portcullis.cert (4.963s) at 15-Oct-2026 21:19:57.205
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmin-int-template.cert on 15-Oct-2026 21:19:57.223
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defconst-computed-tests.cert on 15-Oct-2026 21:19:57.277
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/directed-untranslate-dollar.cert (1.452s) at 15-Oct-2026 21:19:57.374
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/non-ascii-pathnames.cert on 15-Oct-2026 21:19:57.498
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/apt/utilities/set-stobjs-in-declares-to-match.cert (3.417s) at 15-Oct-2026 21:19:57.578
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-nth2.cert (2.347s) at 15-Oct-2026 21:19:57.632
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/file-io-light/read-char-dollar.cert (1.279s) at 15-Oct-2026 21:19:57.684
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defthm-check.cert on 15-Oct-2026 21:19:57.685
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/submit-events.cert (2.176s) at 15-Oct-2026 21:19:57.697
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/booleans/booleans2.cert (1.356s) at 15-Oct-2026 21:19:57.724
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defthm.cert on 15-Oct-2026 21:19:57.750
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/read-from-file.cert on 15-Oct-2026 21:19:57.773
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/bash-bsd.cert on 15-Oct-2026 21:19:57.776
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/syntheto/shallow/last1.cert (1.015s) at 15-Oct-2026 21:19:57.847
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/expander-tests.cert on 15-Oct-2026 21:19:57.831
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/reverse.cert on 15-Oct-2026 21:19:57.918
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/index-of-subseq.cert (1.066s) at 15-Oct-2026 21:19:57.953
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/split-chars.cert (0.891s) at 15-Oct-2026 21:19:58.005
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/defopener.cert (5.373s) at 15-Oct-2026 21:19:58.012
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/symbol-listp2.cert on 15-Oct-2026 21:19:58.020
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/invariants.cert on 15-Oct-2026 21:19:58.019
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simplify-defuns.cert on 15-Oct-2026 21:19:58.167
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/nth-meta2.cert (8.418s) at 15-Oct-2026 21:19:58.203
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/parallel/matrix-multiplication-serial.cert (6.162s) at 15-Oct-2026 21:19:58.236
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/records0.cert on 15-Oct-2026 21:19:58.285
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/total-order-bsd.cert on 15-Oct-2026 21:19:58.322
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rtlarr.cert on 15-Oct-2026 21:19:58.327
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/non-ascii-pathnames.cert (0.842s) at 15-Oct-2026 21:19:58.348
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/ifixequiv.cert (6.845s) at 15-Oct-2026 21:19:58.449
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defthm-check.cert (0.838s) at 15-Oct-2026 21:19:58.540
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/paramod.cert on 15-Oct-2026 21:19:58.550
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/concurrent-programs/bakery/apply-total-order.cert on 15-Oct-2026 21:19:58.720
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/bash-bsd.cert (1.009s) at 15-Oct-2026 21:19:58.792
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simplify-thm.cert on 15-Oct-2026 21:19:58.912
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/expander-tests.cert (1.125s) at 15-Oct-2026 21:19:58.980
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/gen-defthm.cert (1.276s) at 15-Oct-2026 21:19:59.048
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/total-order-bsd.cert (0.822s) at 15-Oct-2026 21:19:59.155
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defconst-computed-tests.cert (1.891s) at 15-Oct-2026 21:19:59.180
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/update-subrange.cert (3.895s) at 15-Oct-2026 21:19:59.222
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/run.cert on 15-Oct-2026 21:19:59.224
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/rac/lisp/translate.cert on 15-Oct-2026 21:19:59.245
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/records.cert (12.405s) at 15-Oct-2026 21:19:59.319
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/strings-light/reverse.cert (1.310s) at 15-Oct-2026 21:19:59.341
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert on 15-Oct-2026 21:19:59.405
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/test-driver.cert on 15-Oct-2026 21:19:59.428
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/test-driver.cert on 15-Oct-2026 21:19:59.432
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmax-nat-template.cert (2.497s) at 15-Oct-2026 21:19:59.507
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/advise.cert (3.278s) at 15-Oct-2026 21:19:59.555
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/test-driver.cert on 15-Oct-2026 21:19:59.659
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/run.cert on 15-Oct-2026 21:19:59.673
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/util/skip-rewrite.cert (9.468s) at 15-Oct-2026 21:19:59.717
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/oracle/stv-decomp-theory-expander.cert on 15-Oct-2026 21:19:59.728
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/run.cert on 15-Oct-2026 21:19:59.759
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/realistic.cert on 15-Oct-2026 21:19:59.816
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/ld-history-book.cert (8.375s) at 15-Oct-2026 21:20:00.021
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/concurrent-programs/bakery/apply-total-order.cert (1.231s) at 15-Oct-2026 21:20:00.033
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/misc/two-nats-measure.cert on 15-Oct-2026 21:20:00.118
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/serialize-tests.cert on 15-Oct-2026 21:20:00.124
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert on 15-Oct-2026 21:20:00.164
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simplify-thm.cert (1.285s) at 15-Oct-2026 21:20:00.252
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert (0.978s) at 15-Oct-2026 21:20:00.395
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/stobjtab.cert on 15-Oct-2026 21:20:00.379
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defun-forms.cert (6.499s) at 15-Oct-2026 21:20:00.410
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/test-driver.cert (0.770s) at 15-Oct-2026 21:20:00.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/run.cert (1.263s) at 15-Oct-2026 21:20:00.510
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/stringless.cert on 15-Oct-2026 21:20:00.505
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/run.cert (0.854s) at 15-Oct-2026 21:20:00.535
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/std/util/defmin-int-template.cert (3.325s) at 15-Oct-2026 21:20:00.574
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/oracle/stv-decomp-theory-expander.cert (0.830s) at 15-Oct-2026 21:20:00.599
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub-2.cert on 15-Oct-2026 21:20:00.607
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub.cert on 15-Oct-2026 21:20:00.645
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defmvtypes-tests.cert on 15-Oct-2026 21:20:00.656
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/test-driver.cert (1.237s) at 15-Oct-2026 21:20:00.679
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/terms-light/restore-mv-in-branches.cert (4.638s) at 15-Oct-2026 21:20:00.730
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/fancy-string-reader-test.cert on 15-Oct-2026 21:20:00.803
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/hons-check/hons-check.cert on 15-Oct-2026 21:20:00.825
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev2/run.cert (1.096s) at 15-Oct-2026 21:20:00.866
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/resolution.cert on 15-Oct-2026 21:20:00.744
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/rac/lisp/translate.cert (1.662s) at 15-Oct-2026 21:20:00.941
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/misc/two-nats-measure.cert (0.834s) at 15-Oct-2026 21:20:00.975
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/parallel/stress-tests.cert on 15-Oct-2026 21:20:00.969
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/symbol-listp2.cert (2.974s) at 15-Oct-2026 21:20:01.032
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/prove-dollar-plus.cert (4.217s) at 15-Oct-2026 21:20:01.088
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/top.cert on 15-Oct-2026 21:20:01.083
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-time-tests.cert on 15-Oct-2026 21:20:01.196
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/untranslate.cert on 15-Oct-2026 21:20:01.223
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/defmacrodoc.cert (7.787s) at 15-Oct-2026 21:20:01.585
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/models.cert on 15-Oct-2026 21:20:01.633
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub.cert (1.054s) at 15-Oct-2026 21:20:01.715
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/pipeline/utils.cert on 15-Oct-2026 21:20:01.770
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/untranslate.cert (0.614s) at 15-Oct-2026 21:20:01.864
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub-2.cert (1.246s) at 15-Oct-2026 21:20:01.876
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/stobjs/stobjtab.cert (1.490s) at 15-Oct-2026 21:20:01.900
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/invariants.cert (3.835s) at 15-Oct-2026 21:20:01.916
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/trivial/sawada-model/utils.cert on 15-Oct-2026 21:20:01.933
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/trivial/utils.cert on 15-Oct-2026 21:20:01.950
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners1/cdeq/records.cert on 15-Oct-2026 21:20:01.978
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/strings/stringless.cert (1.464s) at 15-Oct-2026 21:20:02.001
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/tjvm-examples.cert on 15-Oct-2026 21:20:02.032
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/records.cert on 15-Oct-2026 21:20:02.103
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/keyword-to-keyword-value-list-alistp-tests.cert on 15-Oct-2026 21:20:02.132
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub-1.cert on 15-Oct-2026 21:20:02.124
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert (1.917s) at 15-Oct-2026 21:20:02.146
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defmvtypes-tests.cert (1.512s) at 15-Oct-2026 21:20:02.182
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/records0.cert on 15-Oct-2026 21:20:02.241
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/maybe-defthm-tests.cert on 15-Oct-2026 21:20:02.308
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/sets.cert on 15-Oct-2026 21:20:02.337
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/auto-termination/termination-database.cert (6.005s) at 15-Oct-2026 21:20:02.385
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/records/total-order.cert on 15-Oct-2026 21:20:02.477
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/mu-calculus/book/models.cert (0.903s) at 15-Oct-2026 21:20:02.552
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/parallel/stress-tests.cert (1.624s) at 15-Oct-2026 21:20:02.646
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/sorting/total-order.cert on 15-Oct-2026 21:20:02.651
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/proofstyles/counterexamples/realistic.cert (2.868s) at 15-Oct-2026 21:20:02.709
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/resolution.cert (1.771s) at 15-Oct-2026 21:20:02.735
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding_defrecord/support/defrecord.cert on 15-Oct-2026 21:20:02.751
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/sets.cert on 15-Oct-2026 21:20:02.812
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/1999/pipeline/utils.cert (1.018s) at 15-Oct-2026 21:20:02.835
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/trivial/sawada-model/utils.cert (0.968s) at 15-Oct-2026 21:20:02.918
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/fast.cert on 15-Oct-2026 21:20:02.919
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/schmaltz-al-sammane-et-al/support/consistency.cert on 15-Oct-2026 21:20:02.959
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/equational/paramod.cert (4.361s) at 15-Oct-2026 21:20:03.015
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/maybe-defthm-tests.cert (0.696s) at 15-Oct-2026 21:20:03.091
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert on 15-Oct-2026 21:20:03.117
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/greve/support/defrecord.cert on 15-Oct-2026 21:20:03.109
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/moore-manolios/partial-functions/tjvm-examples.cert (1.081s) at 15-Oct-2026 21:20:03.131
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/records.cert (1.029s) at 15-Oct-2026 21:20:03.144
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/defcode-macro.cert on 15-Oct-2026 21:20:03.237
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/exdefs.cert on 15-Oct-2026 21:20:03.253
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/remove-nth-tests.cert (6.320s) at 15-Oct-2026 21:20:03.283
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/swords-cook/lcsoundness/defsum.cert on 15-Oct-2026 21:20:03.267
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/io/serialize-tests.cert (3.202s) at 15-Oct-2026 21:20:03.341
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Utilities/total-order.cert on 15-Oct-2026 21:20:03.399
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/records/total-order.cert (1.002s) at 15-Oct-2026 21:20:03.487
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/manolios-kaufmann/support/sorting/total-order.cert (0.832s) at 15-Oct-2026 21:20:03.493
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/sumners1/cdeq/records.cert (1.562s) at 15-Oct-2026 21:20:03.560
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/typed-alists/keyword-to-keyword-value-list-alistp-tests.cert (1.406s) at 15-Oct-2026 21:20:03.562
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/testing.cert on 15-Oct-2026 21:20:03.583
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/mid.cert on 15-Oct-2026 21:20:03.574
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/fancy-string-reader-test.cert (2.791s) at 15-Oct-2026 21:20:03.617
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/add-io-pairs-tests-sub-1.cert (1.401s) at 15-Oct-2026 21:20:03.664
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ihs/ihs-init.cert on 15-Oct-2026 21:20:03.707
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding_defrecord/support/defrecord.cert (0.964s) at 15-Oct-2026 21:20:03.724
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/sumners/support/sets.cert on 15-Oct-2026 21:20:03.739
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/deps-SULFA.cert on 15-Oct-2026 21:20:03.791
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Utilities/records.cert on 15-Oct-2026 21:20:03.804
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defrule.cert on 15-Oct-2026 21:20:03.804
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/acl2-agp.cert on 15-Oct-2026 21:20:03.843
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/ray-matthews-tuttle/support/sets.cert (1.094s) at 15-Oct-2026 21:20:03.920
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/early/rev1/test-driver.cert (4.483s) at 15-Oct-2026 21:20:03.979
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/look-up.cert on 15-Oct-2026 21:20:04.073
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/schmaltz-al-sammane-et-al/support/consistency.cert (1.099s) at 15-Oct-2026 21:20:04.080
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/expt-helper.cert on 15-Oct-2026 21:20:04.101
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/da-base.cert on 15-Oct-2026 21:20:04.182
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Utilities/total-order.cert (0.788s) at 15-Oct-2026 21:20:04.197
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-termination-theorem.cert on 15-Oct-2026 21:20:04.292
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/lists/nth-meta.cert (14.584s) at 15-Oct-2026 21:20:04.303
acl2-8.5> make[1]: Entering directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support'
acl2-8.5> make -s -f Makefile \
acl2-8.5>    firewallworks.cert INHIBIT='(set-inhibit-output-lst (list (quote prove) (quote proof-tree) (quote warning) (quote observation) (quote event) (quote history)))' ACL2='/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2'
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defval.cert on 15-Oct-2026 21:20:04.362
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support/separation.cert on Thu Oct 15 21:20:04 UTC 2026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/lists-light/subrange.cert (10.090s) at 15-Oct-2026 21:20:04.431
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/manolios/pipeline/trivial/utils.cert (2.482s) at 15-Oct-2026 21:20:04.443
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/simplify-defuns.cert (6.241s) at 15-Oct-2026 21:20:04.447
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/make-event/read-from-file.cert (6.825s) at 15-Oct-2026 21:20:04.609
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rtlarr.cert on 15-Oct-2026 21:20:04.796
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/list-fix.cert on 15-Oct-2026 21:20:04.810
acl2-8.5> ls: cannot access 'lecture1-book.cert': No such file or directory
acl2-8.5> 
acl2-8.5> **CERTIFICATION FAILED** for /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.lisp
acl2-8.5> 
acl2-8.5>    | "-*- Mode: auto-revert -*-"
acl2-8.5>    | /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08
acl2-8.5>    | HOST: localhost
acl2-8.5>    | 
acl2-8.5>    | Environment variables:
acl2-8.5>    | ACL2_CUSTOMIZATION=NONE
acl2-8.5>    | ACL2_SYSTEM_BOOKS=/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books
acl2-8.5>    | ACL2=/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/saved_acl2
acl2-8.5>    | ACL2_USELESS_RUNES=-25
acl2-8.5>    | 
acl2-8.5>    | Temp lisp file:
acl2-8.5>    | (acl2::value :q)
acl2-8.5>    | (acl2::in-package "ACL2")
acl2-8.5>    | ; see github issue #638 (waterfall-parallelism and profiling): 
acl2-8.5>    | #+(and hons (not acl2-par)) (profile-fn 'prove)
acl2-8.5>    | #+(and hons (not acl2-par)) (profile-fn 'certify-book-fn)
acl2-8.5>    | #+(and hons (not acl2-par)) (profile-fn 'include-book-fn)
acl2-8.5>    | (acl2::lp)
acl2-8.5>    | (set-debugger-enable :bt)
acl2-8.5>    | (acl2::in-package "ACL2")
acl2-8.5>    | 
acl2-8.5>    | (set-ld-error-action (quote (:exit 1)) state)
acl2-8.5>    | (set-inhibit-output-lst (list (quote prove) (quote proof-tree) (quote warning) (quote observation) (quote event) (quote history)))
acl2-8.5>    | 
acl2-8.5>    | (acl2::assign acl2::get-internal-time-as-realtime acl2::t)
acl2-8.5>    | #-cmucl (acl2::gc-verbose t)
acl2-8.5>    | ; instructions from .acl2 file lecture1-book.acl2:
acl2-8.5>    | ; See :DOC run-script.
acl2-8.5>    | 
acl2-8.5>    | (include-book "tools/run-script" :dir :system)
acl2-8.5>    | (run-script "lecture1")
acl2-8.5>    | 
acl2-8.5>    | ; Help dependency scanner.
acl2-8.5>    | #||
acl2-8.5>    | (depends-on "lecture1-log.txt")
acl2-8.5>    | (include-book "perm")
acl2-8.5>    | ||#
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | ; Prevent reset-prehistory while loading .port files
acl2-8.5>    | (acl2::assign acl2::skip-reset-prehistory acl2::t)
acl2-8.5>    | ; portculli for included books:
acl2-8.5>    | #!ACL2 (set-ld-error-action (quote :continue) state)
acl2-8.5>    | 
acl2-8.5>    | ; certify-book command flags: ? t
acl2-8.5>    | #!ACL2 (er-progn (time$ (certify-book "lecture1-book" ? t  ))
acl2-8.5>    |                                  (value (prog2$ #+hons (memsum)
acl2-8.5>    |                                                  #-hons nil
acl2-8.5>    |                                                  (exit 43))))
acl2-8.5>    | --- End temp lisp file ---
acl2-8.5>    | 
acl2-8.5>    | TARGET: demos/marktoberdorf-08/lecture1-book
acl2-8.5>    | STEP: certify
acl2-8.5>    | Start of output:
acl2-8.5>    | 
acl2-8.5>    | This is SBCL 2.3.0.nixos, an implementation of ANSI Common Lisp.
acl2-8.5>    | More information about SBCL is available at <http://www.sbcl.org/>.
acl2-8.5>    | 
acl2-8.5>    | SBCL is free software, provided as is, with absolutely no warranty.
acl2-8.5>    | It is mostly in the public domain; some portions are provided under
acl2-8.5>    | BSD-style licenses.  See the CREDITS and COPYING files in the
acl2-8.5>    | distribution for more information.
acl2-8.5>    | 
acl2-8.5>    |  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
acl2-8.5>    |  + ACL2 Version 8.5                                                     +
acl2-8.5>    |  +   built October 15, 2026  21:07:10.                                  +
acl2-8.5>    |  + Copyright (C) 2022, Regents of the University of Texas.              +
acl2-8.5>    |  + ACL2 comes with ABSOLUTELY NO WARRANTY.  This is free software and   +
acl2-8.5>    |  + you are welcome to redistribute it under certain conditions.  For    +
acl2-8.5>    |  + details, see the LICENSE file distributed with ACL2.                 +
acl2-8.5>    |  ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++
acl2-8.5>    | 
acl2-8.5>    | System books directory 
acl2-8.5>    | "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/".
acl2-8.5>    | Type :help for help.
acl2-8.5>    | Type (quit) to quit completely out of ACL2.
acl2-8.5>    | 
acl2-8.5>    | ACL2 !>
acl2-8.5>    | Exiting the ACL2 read-eval-print loop.  To re-enter, execute (LP).
acl2-8.5>    | * #<PACKAGE "ACL2">
acl2-8.5>    | * PROVE
acl2-8.5>    | * CERTIFY-BOOK-FN
acl2-8.5>    | * INCLUDE-BOOK-FN
acl2-8.5>    | * 
acl2-8.5>    | System books directory 
acl2-8.5>    | "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/".
acl2-8.5>    | Type :help for help.
acl2-8.5>    | Type (quit) to quit completely out of ACL2.
acl2-8.5>    | 
acl2-8.5>    | ACL2 !><state>
acl2-8.5>    | ACL2 !> "ACL2"
acl2-8.5>    | ACL2 !> (:EXIT 1)
acl2-8.5>    | ACL2 !> (PROVE PROOF-TREE
acl2-8.5>    |         WARNING OBSERVATION EVENT HISTORY)
acl2-8.5>    | ACL2 !> T
acl2-8.5>    | ACL2 !>GC-VERBOSE is not supported in this Common Lisp.
acl2-8.5>    | Contact the ACL2 developers if you would like to help add such support.NIL
acl2-8.5>    | ACL2 !>
acl2-8.5>    | Summary
acl2-8.5>    | Form:  ( INCLUDE-BOOK "tools/run-script" ...)
acl2-8.5>    | Rules: NIL
acl2-8.5>    | Time:  1.14 seconds (prove: 0.00, print: 0.00, other: 1.14)
acl2-8.5>    |  "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/run-script.lisp"
acl2-8.5>    | ACL2 !> :EOF
acl2-8.5>    | ACL2 > T
acl2-8.5>    | ACL2 > :CONTINUE
acl2-8.5>    | ACL2 >
acl2-8.5>    | ; Note: Consulting useless-runes file,
acl2-8.5>    | ; /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/.sys/lecture1-book@useless-runes.lsp.
acl2-8.5>    | Note: Writing .port file, /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.port.
acl2-8.5>    | 
acl2-8.5>    | CERTIFICATION ATTEMPT FOR 
acl2-8.5>    | "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.lisp"
acl2-8.5>    | 
acl2-8.5>    | ACL2 Version 8.5
acl2-8.5>    | 
acl2-8.5>    | * Step 1:  Read 
acl2-8.5>    | "/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.lisp"
acl2-8.5>    | and compute its book-hash.
acl2-8.5>    | 
acl2-8.5>    | * Step 2:  There were two forms in the file.  We now attempt to establish
acl2-8.5>    | that each form, whether local or non-local, is indeed an admissible
acl2-8.5>    | embedded event form in the context of the previously admitted ones.
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | ACL2 !>>(ASSERT-EVENT
acl2-8.5>    |              (IDENTICAL-FILES-P "lecture1-log.txt" "lecture1-log.out"))
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | HARD ACL2 ERROR in IDENTICAL-FILES-P:  Files "lecture1-log.txt" and
acl2-8.5>    | "lecture1-log.out" differ.
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | ACL2 Error in ASSERT-EVENT:  Evaluation aborted.  To debug see :DOC
acl2-8.5>    | print-gv, see :DOC trace, and see :DOC wet.
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | ACL2 Warning in CERTIFY-BOOK:  The attempted CERTIFY-BOOK has failed
acl2-8.5>    | while trying to establish the admissibility of one of the (local or
acl2-8.5>    | non-local) forms in the book to be certified.
acl2-8.5>    | 
acl2-8.5>    | 
acl2-8.5>    | Summary
acl2-8.5>    | Form:  (CERTIFY-BOOK "lecture1-book" ...)
acl2-8.5>    | Rules: NIL
acl2-8.5>    | 
acl2-8.5>    | ACL2 Error [Failure] in (CERTIFY-BOOK "lecture1-book" ...):  See :DOC
acl2-8.5>    | failure.
acl2-8.5>    | *NOTE*: Useless-runes may have contributed to proof failure.  See :DOC
acl2-8.5>    | useless-runes-failures.
acl2-8.5>    | 
acl2-8.5>    | ******** FAILED ********
acl2-8.5>    | ; (EV-REC *RETURN-LAST-ARG3* ...) took 
acl2-8.5>    | ; 0.05 seconds realtime, 0.01 seconds runtime
acl2-8.5>    | ; (5,642,160 bytes allocated).
acl2-8.5>    | ACL2 >Bye.
acl2-8.5>    | Exit code from ACL2 is 0
acl2-8.5>    | lecture1-book.cert seems to be missing
acl2-8.5> 
acl2-8.5> **CERTIFICATION FAILED** for /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/marktoberdorf-08/lecture1-book.lisp
acl2-8.5> 
acl2-8.5> make: *** [/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/build/make_cert:116: demos/marktoberdorf-08/lecture1-book.cert] Error 1
acl2-8.5> make: *** Waiting for unfinished jobs....
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/coglio-kaufmann-smith/support/testing.cert (1.442s) at 15-Oct-2026 21:20:05.050
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/expt-helper.cert on 15-Oct-2026 21:20:05.051
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-5/support/expt-helper.cert (0.932s) at 15-Oct-2026 21:20:05.072
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 2499 Oct 15 21:20 separation.cert
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support/firewallspec.cert on Thu Oct 15 21:20:05 UTC 2026
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support/compatible.cert on Thu Oct 15 21:20:05 UTC 2026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2011/krug-et-al/support/Utilities/records.cert (1.429s) at 15-Oct-2026 21:20:05.272
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/dillinger-et-al/code/defcode-macro.cert (2.024s) at 15-Oct-2026 21:20:05.274
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/look-up.cert (1.199s) at 15-Oct-2026 21:20:05.281
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defval.cert (1.060s) at 15-Oct-2026 21:20:05.453
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 3062 Oct 15 21:20 compatible.cert
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 2590 Oct 15 21:20 firewallspec.cert
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/cowles/acl2-agp.cert (1.920s) at 15-Oct-2026 21:20:05.809
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/hons-check/hons-check.cert (4.988s) at 15-Oct-2026 21:20:05.827
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/swords-cook/lcsoundness/defsum.cert (2.655s) at 15-Oct-2026 21:20:05.977
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/records0.cert (3.739s) at 15-Oct-2026 21:20:06.044
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/defrule.cert (2.601s) at 15-Oct-2026 21:20:06.446
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/davis/support/fast.cert (3.542s) at 15-Oct-2026 21:20:06.484
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/ihs/ihs-init.cert (2.817s) at 15-Oct-2026 21:20:06.547
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/clause-processors/deps-SULFA.cert (2.853s) at 15-Oct-2026 21:20:06.681
acl2-8.5> Making /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support/firewallworks.cert on Thu Oct 15 21:20:06 UTC 2026
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/pcert/mid.cert (3.031s) at 15-Oct-2026 21:20:06.704
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/misc/records0.cert (8.666s) at 15-Oct-2026 21:20:06.994
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/arithmetic-3/pass1/expt-helper.cert (1.953s) at 15-Oct-2026 21:20:07.044
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/centaur/memoize/old/profile.cert (19.591s) at 15-Oct-2026 21:20:07.329
acl2-8.5> -rw-r--r-- 1 nixbld nixbld 8502 Oct 15 21:20 firewallworks.cert
acl2-8.5> make[1]: Leaving directory '/nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2003/greve-wilding-vanfleet/support'
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/some-events.cert (20.097s) at 15-Oct-2026 21:20:07.545
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel9/support/support/rtlarr.cert (9.575s) at 15-Oct-2026 21:20:07.929
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-termination-theorem.cert (4.276s) at 15-Oct-2026 21:20:08.585
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/list-fix.cert (4.245s) at 15-Oct-2026 21:20:09.107
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/structures.cert (19.475s) at 15-Oct-2026 21:20:10.470
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/exdefs.cert (7.445s) at 15-Oct-2026 21:20:10.709
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert (26.067s) at 15-Oct-2026 21:20:11.637
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rtlarr.cert (6.875s) at 15-Oct-2026 21:20:11.730
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/sets.cert (11.078s) at 15-Oct-2026 21:20:13.434
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/memoize-invoke-book.cert (20.851s) at 15-Oct-2026 21:20:13.765
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/maxelem2.cert (17.199s) at 15-Oct-2026 21:20:14.319
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/top.cert (13.603s) at 15-Oct-2026 21:20:14.705
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint.cert (25.547s) at 15-Oct-2026 21:20:15.629
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert (40.270s) at 15-Oct-2026 21:20:16.791
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert (16.708s) at 15-Oct-2026 21:20:19.847
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/acl2-doc.cert (32.239s) at 15-Oct-2026 21:20:20.484
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/da-base.cert (20.294s) at 15-Oct-2026 21:20:24.523
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/sumners/support/sets.cert (22.398s) at 15-Oct-2026 21:20:26.265
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/greve/support/defrecord.cert (27.316s) at 15-Oct-2026 21:20:30.469
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/fringes-taspi.cert (68.765s) at 15-Oct-2026 21:20:44.370
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-time-tests.cert (53.401s) at 15-Oct-2026 21:20:54.612
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/file-system-lemmas.cert (179.759s) at 15-Oct-2026 21:21:54.261
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/guard-verified-m1/good-statep.cert (207.093s) at 15-Oct-2026 21:22:47.888
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/quicklisp/base.cert (185.454s) at 15-Oct-2026 21:22:51.696
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/sumners/support/kas.cert (381.979s) at 15-Oct-2026 21:25:31.074
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-reverse.cert (373.042s) at 15-Oct-2026 21:25:34.753
acl2-8.5> Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/parallel/proofs/ideal-speedup.cert (462.668s) at 15-Oct-2026 21:26:40.120
error: Cannot build '/nix/store/ax7kw0yaadgx98alhxw51ab6fgvcfhm4-acl2-8.5.drv'.
       Reason: builder failed with exit code 2.
       Output paths:
         /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5
       Last 25 log lines:
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/utilities/make-termination-theorem.cert (4.276s) at 15-Oct-2026 21:20:08.585
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/lists/list-fix.cert (4.245s) at 15-Oct-2026 21:20:09.107
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/data-structures/structures.cert (19.475s) at 15-Oct-2026 21:20:10.470
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2007/erickson/bprove/exdefs.cert (7.445s) at 15-Oct-2026 21:20:10.709
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert (26.067s) at 15-Oct-2026 21:20:11.637
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/rtl/rel4/support/rtlarr.cert (6.875s) at 15-Oct-2026 21:20:11.730
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/kaufmann-sumners/support/sets.cert (11.078s) at 15-Oct-2026 21:20:13.434
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/demos/memoize-invoke-book.cert (20.851s) at 15-Oct-2026 21:20:13.765
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/kestrel/typed-lists-light/maxelem2.cert (17.199s) at 15-Oct-2026 21:20:14.319
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/tests/early-load-of-compiled/top.cert (13.603s) at 15-Oct-2026 21:20:14.705
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/coi/pattern-hint/pattern-hint.cert (25.547s) at 15-Oct-2026 21:20:15.629
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert (40.270s) at 15-Oct-2026 21:20:16.791
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert (16.708s) at 15-Oct-2026 21:20:19.847
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/doc/acl2-doc.cert (32.239s) at 15-Oct-2026 21:20:20.484
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/std/util/da-base.cert (20.294s) at 15-Oct-2026 21:20:24.523
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2017/sumners/support/sets.cert (22.398s) at 15-Oct-2026 21:20:26.265
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2004/greve/support/defrecord.cert (27.316s) at 15-Oct-2026 21:20:30.469
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/taspi/proofs/fringes-taspi.cert (68.765s) at 15-Oct-2026 21:20:44.370
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/tools/oracle-time-tests.cert (53.401s) at 15-Oct-2026 21:20:54.612
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/projects/filesystems/file-system-lemmas.cert (179.759s) at 15-Oct-2026 21:21:54.261
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/models/jvm/guard-verified-m1/good-statep.cert (207.093s) at 15-Oct-2026 21:22:47.888
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/quicklisp/base.cert (185.454s) at 15-Oct-2026 21:22:51.696
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2009/sumners/support/kas.cert (381.979s) at 15-Oct-2026 21:25:31.074
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/workshops/2002/cowles-flat/support/flat-reverse.cert (373.042s) at 15-Oct-2026 21:25:34.753
       > Built /nix/store/wjbikkd093g98x0g6rxcsgiqm3ib6ybq-acl2-8.5/share/acl2/books/system/parallel/proofs/ideal-speedup.cert (462.668s) at 15-Oct-2026 21:26:40.120
       For full logs, run:
         nix log /nix/store/ax7kw0yaadgx98alhxw51ab6fgvcfhm4-acl2-8.5.drv