acl2 →
8.3dfsg-1 →
armhf → 2020-08-29 08:58:08
sbuild (Debian sbuild) 0.72.0 (25 Oct 2016) on mb-lxc-02
+==============================================================================+
| acl2 8.3dfsg-1 (armhf) Sat, 29 Aug 2020 06:57:10 +0000 |
+==============================================================================+
Package: acl2
Version: 8.3dfsg-1
Source Version: 8.3dfsg-1
Distribution: bullseye-staging
Machine Architecture: armhf
Host Architecture: armhf
Build Architecture: armhf
I: NOTICE: Log filtering will replace 'var/lib/schroot/mount/bullseye-staging-armhf-sbuild-695a25ef-3536-48a7-92f5-183be5327070' with '<<CHROOT>>'
+------------------------------------------------------------------------------+
| Update chroot |
+------------------------------------------------------------------------------+
Get:1 http://172.17.0.1/private bullseye-staging InRelease [11.3 kB]
Get:2 http://172.17.0.1/private bullseye-staging/main Sources [11.8 MB]
Get:3 http://172.17.0.1/private bullseye-staging/main armhf Packages [12.9 MB]
Fetched 24.8 MB in 9s (2792 kB/s)
Reading package lists...
W: No sandbox user '_apt' on the system, can not drop privileges
+------------------------------------------------------------------------------+
| Fetch source files |
+------------------------------------------------------------------------------+
Check APT
---------
Checking available source versions...
Download source files with APT
------------------------------
Reading package lists...
Need to get 117 MB of source archives.
Get:1 http://172.17.0.1/private bullseye-staging/main acl2 8.3dfsg-1 (dsc) [2250 B]
Get:2 http://172.17.0.1/private bullseye-staging/main acl2 8.3dfsg-1 (tar) [117 MB]
Get:3 http://172.17.0.1/private bullseye-staging/main acl2 8.3dfsg-1 (diff) [206 kB]
Fetched 117 MB in 22s (5438 kB/s)
Download complete and in download only mode
I: NOTICE: Log filtering will replace 'build/acl2-2pNnNZ/acl2-8.3dfsg' with '<<PKGBUILDDIR>>'
I: NOTICE: Log filtering will replace 'build/acl2-2pNnNZ' with '<<BUILDDIR>>'
+------------------------------------------------------------------------------+
| Install build-essential |
+------------------------------------------------------------------------------+
Setup apt archive
-----------------
Merged Build-Depends: build-essential, fakeroot
Filtered Build-Depends: build-essential, fakeroot
dpkg-deb: building package 'sbuild-build-depends-core-dummy' in '/<<BUILDDIR>>/resolver-AtGljx/apt_archive/sbuild-build-depends-core-dummy.deb'.
dpkg-scanpackages: warning: Packages in archive but missing from override file:
dpkg-scanpackages: warning: sbuild-build-depends-core-dummy
dpkg-scanpackages: info: Wrote 1 entries to output Packages file.
gpg: keybox '/<<BUILDDIR>>/resolver-AtGljx/gpg/pubring.kbx' created
gpg: /<<BUILDDIR>>/resolver-AtGljx/gpg/trustdb.gpg: trustdb created
gpg: key 37145E60F90AF620: public key "Sbuild Signer (Sbuild Build Dependency Archive Key) <buildd-tools-devel@lists.alioth.debian.org>" imported
gpg: Total number processed: 1
gpg: imported: 1
gpg: key 37145E60F90AF620: "Sbuild Signer (Sbuild Build Dependency Archive Key) <buildd-tools-devel@lists.alioth.debian.org>" not changed
gpg: key 37145E60F90AF620: secret key imported
gpg: Total number processed: 1
gpg: unchanged: 1
gpg: secret keys read: 1
gpg: secret keys imported: 1
gpg: using "Sbuild Signer" as default secret key for signing
Ign:1 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ InRelease
Get:2 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Release [957 B]
Get:3 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Release.gpg [370 B]
Get:4 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Sources [349 B]
Get:5 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Packages [432 B]
Fetched 2108 B in 0s (9249 B/s)
Reading package lists...
W: No sandbox user '_apt' on the system, can not drop privileges
Reading package lists...
Install core build dependencies (apt-based resolver)
----------------------------------------------------
Installing build dependencies
Reading package lists...
Building dependency tree...
Reading state information...
The following packages were automatically installed and are no longer required:
bsdextrautils libpam-cap netbase sensible-utils
Use 'apt autoremove' to remove them.
The following NEW packages will be installed:
sbuild-build-depends-core-dummy
0 upgraded, 1 newly installed, 0 to remove and 35 not upgraded.
Need to get 848 B of archives.
After this operation, 0 B of additional disk space will be used.
Get:1 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ sbuild-build-depends-core-dummy 0.invalid.0 [848 B]
debconf: delaying package configuration, since apt-utils is not installed
Fetched 848 B in 0s (61.7 kB/s)
Selecting previously unselected package sbuild-build-depends-core-dummy.
(Reading database ... 12502 files and directories currently installed.)
Preparing to unpack .../sbuild-build-depends-core-dummy_0.invalid.0_armhf.deb ...
Unpacking sbuild-build-depends-core-dummy (0.invalid.0) ...
Setting up sbuild-build-depends-core-dummy (0.invalid.0) ...
W: No sandbox user '_apt' on the system, can not drop privileges
+------------------------------------------------------------------------------+
| Check architectures |
+------------------------------------------------------------------------------+
Arch check ok (armhf included in any all)
+------------------------------------------------------------------------------+
| Install package build dependencies |
+------------------------------------------------------------------------------+
Setup apt archive
-----------------
Merged Build-Depends: gcl (>= 2.6.12-92), libgmp3-dev, libreadline-dev, emacs-gtk | emacsen, debhelper (>= 5), texlive-latex-recommended, libxmu-dev, libxaw7-dev, time, tex-common, texinfo
Filtered Build-Depends: gcl (>= 2.6.12-92), libgmp3-dev, libreadline-dev, emacs-gtk, debhelper (>= 5), texlive-latex-recommended, libxmu-dev, libxaw7-dev, time, tex-common, texinfo
dpkg-deb: building package 'sbuild-build-depends-acl2-dummy' in '/<<BUILDDIR>>/resolver-AtGljx/apt_archive/sbuild-build-depends-acl2-dummy.deb'.
dpkg-scanpackages: warning: Packages in archive but missing from override file:
dpkg-scanpackages: warning: sbuild-build-depends-acl2-dummy sbuild-build-depends-core-dummy
dpkg-scanpackages: info: Wrote 2 entries to output Packages file.
gpg: using "Sbuild Signer" as default secret key for signing
Ign:1 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ InRelease
Get:2 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Release [963 B]
Get:3 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Release.gpg [370 B]
Get:4 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Sources [568 B]
Get:5 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ Packages [642 B]
Fetched 2543 B in 0s (11.1 kB/s)
Reading package lists...
W: No sandbox user '_apt' on the system, can not drop privileges
Reading package lists...
Install acl2 build dependencies (apt-based resolver)
----------------------------------------------------
Installing build dependencies
Reading package lists...
Building dependency tree...
Reading state information...
The following packages were automatically installed and are no longer required:
libpam-cap netbase
Use 'apt autoremove' to remove them.
The following additional packages will be installed:
adwaita-icon-theme autoconf automake autopoint autotools-dev dbus
dbus-user-session dconf-gsettings-backend dconf-service debhelper
dh-autoreconf dh-strip-nondeterminism dmsetup dwz emacs-bin-common
emacs-common emacs-gtk emacsen-common file fontconfig fontconfig-config
fonts-dejavu-core fonts-lmodern gcl gettext gettext-base glib-networking
glib-networking-common glib-networking-services groff-base
gsettings-desktop-schemas gtk-update-icon-cache hicolor-icon-theme
imagemagick-6-common install-info intltool-debian libapparmor1
libarchive-zip-perl libargon2-1 libasound2 libasound2-data
libatk-bridge2.0-0 libatk1.0-0 libatk1.0-data libatspi2.0-0 libavahi-client3
libavahi-common-data libavahi-common3 libbrotli1 libbsd0 libcairo-gobject2
libcairo2 libcanna1g libcolord2 libcompfaceg1 libcroco3 libcryptsetup12
libcups2 libdatrie1 libdbus-1-3 libdconf1 libde265-0 libdebhelper-perl
libdevmapper1.02.1 libelf1 libepoxy0 libexpat1 libfftw3-double3
libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfribidi0
libgd3 libgdk-pixbuf2.0-0 libgdk-pixbuf2.0-common libgif7 libglib2.0-0
libgmp-dev libgmp3-dev libgmpxx4ldbl libgpm2 libgraphite2-3 libgssapi-krb5-2
libgtk-3-0 libgtk-3-common libharfbuzz0b libheif1 libice-dev libice6
libicu67 libip4tc2 libjbig0 libjpeg62-turbo libjson-c5 libjson-glib-1.0-0
libjson-glib-1.0-common libk5crypto3 libkeyutils1 libkmod2 libkpathsea6
libkrb5-3 libkrb5support0 liblcms2-2 liblqr-1-0 libltdl7 libm17n-0
libmagic-mgc libmagic1 libmagickcore-6.q16-6 libmagickwand-6.q16-6
libncurses-dev libncurses6 libopenjp2-7 libotf0 libpam-systemd
libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0 libpaper-utils
libpaper1 libpipeline1 libpixman-1-0 libpng16-16 libproxy1v5 libpsl5
libptexenc1 libpthread-stubs0-dev libreadline-dev librest-0.7-0 librsvg2-2
libsigsegv2 libsm-dev libsm6 libsoup-gnome2.4-1 libsoup2.4-1 libssl1.1
libsub-override-perl libsynctex2 libsystemd0 libtcl8.6 libteckit0
libtexlua53 libtexluajit2 libtext-unidecode-perl libthai-data libthai0
libtiff5 libtk8.6 libtool libuchardet0 libwayland-client0 libwayland-cursor0
libwayland-egl1 libwebp6 libwebpdemux2 libwebpmux3 libx11-6 libx11-data
libx11-dev libx265-192 libxau-dev libxau6 libxaw7 libxaw7-dev libxcb-render0
libxcb-shm0 libxcb1 libxcb1-dev libxcomposite1 libxcursor1 libxdamage1
libxdmcp-dev libxdmcp6 libxext-dev libxext6 libxfixes3 libxft2 libxi6
libxinerama1 libxkbcommon0 libxml-libxml-perl libxml-namespacesupport-perl
libxml-sax-base-perl libxml-sax-perl libxml2 libxmu-dev libxmu-headers
libxmu6 libxpm-dev libxpm4 libxrandr2 libxrender1 libxss1 libxt-dev libxt6
libzzip-0-13 m17n-db m4 man-db po-debconf shared-mime-info systemd
systemd-sysv systemd-timesyncd t1utils tex-common texinfo texlive-base
texlive-binaries texlive-latex-base texlive-latex-recommended time ucf
x11-common x11proto-core-dev x11proto-dev x11proto-xext-dev xdg-utils
xemacs21-basesupport xemacs21-bin xemacs21-mule-canna-wnn
xemacs21-mulesupport xemacs21-support xkb-data xorg-sgml-doctools xtrans-dev
Suggested packages:
autoconf-archive gnu-standards autoconf-doc dh-make emacs-common-non-dfsg
ncurses-term gcl-doc gettext-doc libasprintf-dev libgettextpo-dev groff
libasound2-plugins alsa-utils colord cups-common libfftw3-bin libfftw3-dev
libgd-tools gmp-doc libgmp10-doc libmpfr-dev gpm krb5-doc krb5-user gvfs
librsvg2-common libice-doc liblcms2-utils m17n-docs
libmagickcore-6.q16-6-extra ncurses-doc readline-doc librsvg2-bin libsm-doc
tcl8.6 tk8.6 libtool-doc gfortran | fortran95-compiler gcj-jdk libx11-doc
libxaw-doc libxcb-doc libxext-doc libxt-doc gawk m4-doc apparmor less
libmail-box-perl systemd-container policykit-1 texlive-plain-generic
texlive-fonts-recommended ghostscript gv | postscript-viewer perl-tk xpdf
| pdf-viewer xzdec texlive-latex-base-doc texlive-latex-recommended-doc
texlive-luatex texlive-pstricks xfonts-cjk xemacs21-supportel
Recommended packages:
librsvg2-common mailutils emacs-el curl | wget | lynx alsa-ucm-conf
alsa-topology-conf at-spi2-core libarchive-cpio-perl libgdk-pixbuf2.0-bin
libglib2.0-data xdg-user-dirs libgtk-3-bin krb5-locales ghostscript gsfonts
publicsuffix libltdl-dev libwww-perl libxml-sax-expat-perl
libmail-sendmail-perl libnss-systemd lmodern dvisvgm libfile-mimeinfo-perl
libnet-dbus-perl libx11-protocol-perl x11-utils x11-xserver-utils
The following NEW packages will be installed:
adwaita-icon-theme autoconf automake autopoint autotools-dev dbus
dbus-user-session dconf-gsettings-backend dconf-service debhelper
dh-autoreconf dh-strip-nondeterminism dmsetup dwz emacs-bin-common
emacs-common emacs-gtk emacsen-common file fontconfig fontconfig-config
fonts-dejavu-core fonts-lmodern gcl gettext gettext-base glib-networking
glib-networking-common glib-networking-services groff-base
gsettings-desktop-schemas gtk-update-icon-cache hicolor-icon-theme
imagemagick-6-common install-info intltool-debian libapparmor1
libarchive-zip-perl libargon2-1 libasound2 libasound2-data
libatk-bridge2.0-0 libatk1.0-0 libatk1.0-data libatspi2.0-0 libavahi-client3
libavahi-common-data libavahi-common3 libbrotli1 libbsd0 libcairo-gobject2
libcairo2 libcanna1g libcolord2 libcompfaceg1 libcroco3 libcryptsetup12
libcups2 libdatrie1 libdbus-1-3 libdconf1 libde265-0 libdebhelper-perl
libdevmapper1.02.1 libelf1 libepoxy0 libexpat1 libfftw3-double3
libfile-stripnondeterminism-perl libfontconfig1 libfreetype6 libfribidi0
libgd3 libgdk-pixbuf2.0-0 libgdk-pixbuf2.0-common libgif7 libglib2.0-0
libgmp-dev libgmp3-dev libgmpxx4ldbl libgpm2 libgraphite2-3 libgssapi-krb5-2
libgtk-3-0 libgtk-3-common libharfbuzz0b libheif1 libice-dev libice6
libicu67 libip4tc2 libjbig0 libjpeg62-turbo libjson-c5 libjson-glib-1.0-0
libjson-glib-1.0-common libk5crypto3 libkeyutils1 libkmod2 libkpathsea6
libkrb5-3 libkrb5support0 liblcms2-2 liblqr-1-0 libltdl7 libm17n-0
libmagic-mgc libmagic1 libmagickcore-6.q16-6 libmagickwand-6.q16-6
libncurses-dev libncurses6 libopenjp2-7 libotf0 libpam-systemd
libpango-1.0-0 libpangocairo-1.0-0 libpangoft2-1.0-0 libpaper-utils
libpaper1 libpipeline1 libpixman-1-0 libpng16-16 libproxy1v5 libpsl5
libptexenc1 libpthread-stubs0-dev libreadline-dev librest-0.7-0 librsvg2-2
libsigsegv2 libsm-dev libsm6 libsoup-gnome2.4-1 libsoup2.4-1 libssl1.1
libsub-override-perl libsynctex2 libtcl8.6 libteckit0 libtexlua53
libtexluajit2 libtext-unidecode-perl libthai-data libthai0 libtiff5 libtk8.6
libtool libuchardet0 libwayland-client0 libwayland-cursor0 libwayland-egl1
libwebp6 libwebpdemux2 libwebpmux3 libx11-6 libx11-data libx11-dev
libx265-192 libxau-dev libxau6 libxaw7 libxaw7-dev libxcb-render0
libxcb-shm0 libxcb1 libxcb1-dev libxcomposite1 libxcursor1 libxdamage1
libxdmcp-dev libxdmcp6 libxext-dev libxext6 libxfixes3 libxft2 libxi6
libxinerama1 libxkbcommon0 libxml-libxml-perl libxml-namespacesupport-perl
libxml-sax-base-perl libxml-sax-perl libxml2 libxmu-dev libxmu-headers
libxmu6 libxpm-dev libxpm4 libxrandr2 libxrender1 libxss1 libxt-dev libxt6
libzzip-0-13 m17n-db m4 man-db po-debconf sbuild-build-depends-acl2-dummy
shared-mime-info systemd systemd-sysv systemd-timesyncd t1utils tex-common
texinfo texlive-base texlive-binaries texlive-latex-base
texlive-latex-recommended time ucf x11-common x11proto-core-dev x11proto-dev
x11proto-xext-dev xdg-utils xemacs21-basesupport xemacs21-bin
xemacs21-mule-canna-wnn xemacs21-mulesupport xemacs21-support xkb-data
xorg-sgml-doctools xtrans-dev
The following packages will be upgraded:
libsystemd0
1 upgraded, 226 newly installed, 0 to remove and 34 not upgraded.
Need to get 191 MB/192 MB of archives.
After this operation, 784 MB of additional disk space will be used.
Get:1 copy:/<<BUILDDIR>>/resolver-AtGljx/apt_archive ./ sbuild-build-depends-acl2-dummy 0.invalid.0 [932 B]
Get:2 http://172.17.0.1/private bullseye-staging/main armhf install-info armhf 6.7.0.dfsg.2-5 [140 kB]
Get:3 http://172.17.0.1/private bullseye-staging/main armhf libsystemd0 armhf 246.2-1+rpi1 [340 kB]
Get:4 http://172.17.0.1/private bullseye-staging/main armhf libuchardet0 armhf 0.0.7-1 [65.0 kB]
Get:5 http://172.17.0.1/private bullseye-staging/main armhf groff-base armhf 1.22.4-5 [783 kB]
Get:6 http://172.17.0.1/private bullseye-staging/main armhf libpipeline1 armhf 1.5.3-1 [29.9 kB]
Get:7 http://172.17.0.1/private bullseye-staging/main armhf man-db armhf 2.9.3-2 [1269 kB]
Get:8 http://172.17.0.1/private bullseye-staging/main armhf libapparmor1 armhf 2.13.4-3+b1 [92.8 kB]
Get:9 http://172.17.0.1/private bullseye-staging/main armhf dmsetup armhf 2:1.02.171-3 [90.7 kB]
Get:10 http://172.17.0.1/private bullseye-staging/main armhf libdevmapper1.02.1 armhf 2:1.02.171-3 [133 kB]
Get:11 http://172.17.0.1/private bullseye-staging/main armhf libjson-c5 armhf 0.15-1 [38.5 kB]
Get:12 http://172.17.0.1/private bullseye-staging/main armhf libcryptsetup12 armhf 2:2.3.3-2 [216 kB]
Get:13 http://172.17.0.1/private bullseye-staging/main armhf libip4tc2 armhf 1.8.5-3 [32.6 kB]
Get:14 http://172.17.0.1/private bullseye-staging/main armhf libkmod2 armhf 27+20200310-2 [48.8 kB]
Get:15 http://172.17.0.1/private bullseye-staging/main armhf systemd-timesyncd armhf 246.2-1+rpi1 [127 kB]
Get:16 http://172.17.0.1/private bullseye-staging/main armhf systemd armhf 246.2-1+rpi1 [4070 kB]
Get:17 http://172.17.0.1/private bullseye-staging/main armhf systemd-sysv armhf 246.2-1+rpi1 [109 kB]
Get:18 http://172.17.0.1/private bullseye-staging/main armhf libdbus-1-3 armhf 1.12.20-1+b3 [192 kB]
Get:19 http://172.17.0.1/private bullseye-staging/main armhf libexpat1 armhf 2.2.9-1 [71.5 kB]
Get:20 http://172.17.0.1/private bullseye-staging/main armhf dbus armhf 1.12.20-1+b3 [215 kB]
Get:21 http://172.17.0.1/private bullseye-staging/main armhf libfftw3-double3 armhf 3.3.8-2 [429 kB]
Get:22 http://172.17.0.1/private bullseye-staging/main armhf libbrotli1 armhf 1.0.7-7 [258 kB]
Get:23 http://172.17.0.1/private bullseye-staging/main armhf libpng16-16 armhf 1.6.37-2 [274 kB]
Get:24 http://172.17.0.1/private bullseye-staging/main armhf libfreetype6 armhf 2.10.2+dfsg-3 [347 kB]
Get:25 http://172.17.0.1/private bullseye-staging/main armhf ucf all 3.0043 [74.0 kB]
Get:26 http://172.17.0.1/private bullseye-staging/main armhf fonts-dejavu-core all 2.37-2 [1069 kB]
Get:27 http://172.17.0.1/private bullseye-staging/main armhf fontconfig-config all 2.13.1-4.2 [281 kB]
Get:28 http://172.17.0.1/private bullseye-staging/main armhf libfontconfig1 armhf 2.13.1-4.2 [328 kB]
Get:29 http://172.17.0.1/private bullseye-staging/main armhf libde265-0 armhf 1.0.4-1+rpi1 [183 kB]
Get:30 http://172.17.0.1/private bullseye-staging/main armhf libx265-192 armhf 3.4-2 [560 kB]
Get:31 http://172.17.0.1/private bullseye-staging/main armhf libheif1 armhf 1.6.1-1+b1 [138 kB]
Get:32 http://172.17.0.1/private bullseye-staging/main armhf libjbig0 armhf 2.1-3.1+b2 [27.6 kB]
Get:33 http://172.17.0.1/private bullseye-staging/main armhf libjpeg62-turbo armhf 1:2.0.5-1.1 [121 kB]
Get:34 http://172.17.0.1/private bullseye-staging/main armhf liblcms2-2 armhf 2.9-4 [119 kB]
Get:35 http://172.17.0.1/private bullseye-staging/main armhf libglib2.0-0 armhf 2.64.4-1 [1159 kB]
Get:36 http://172.17.0.1/private bullseye-staging/main armhf liblqr-1-0 armhf 0.4.2-2.1 [23.1 kB]
Get:37 http://172.17.0.1/private bullseye-staging/main armhf libltdl7 armhf 2.4.6-14 [388 kB]
Get:38 http://172.17.0.1/private bullseye-staging/main armhf libopenjp2-7 armhf 2.3.1-1 [140 kB]
Get:39 http://172.17.0.1/private bullseye-staging/main armhf libwebp6 armhf 0.6.1-2 [228 kB]
Get:40 http://172.17.0.1/private bullseye-staging/main armhf libtiff5 armhf 4.1.0+git191117-2 [250 kB]
Get:41 http://172.17.0.1/private bullseye-staging/main armhf libwebpdemux2 armhf 0.6.1-2 [86.7 kB]
Get:42 http://172.17.0.1/private bullseye-staging/main armhf libwebpmux3 armhf 0.6.1-2 [94.2 kB]
Get:43 http://172.17.0.1/private bullseye-staging/main armhf libxau6 armhf 1:1.0.8-1+b2 [19.1 kB]
Get:44 http://172.17.0.1/private bullseye-staging/main armhf libbsd0 armhf 0.10.0-1 [112 kB]
Get:45 http://172.17.0.1/private bullseye-staging/main armhf libxdmcp6 armhf 1:1.1.2-3 [25.0 kB]
Get:46 http://172.17.0.1/private bullseye-staging/main armhf libxcb1 armhf 1.14-2 [135 kB]
Get:47 http://172.17.0.1/private bullseye-staging/main armhf libx11-data all 2:1.6.10-3 [311 kB]
Get:48 http://172.17.0.1/private bullseye-staging/main armhf libx11-6 armhf 2:1.6.10-3 [704 kB]
Get:49 http://172.17.0.1/private bullseye-staging/main armhf libxext6 armhf 2:1.3.3-1+b2 [47.8 kB]
Get:50 http://172.17.0.1/private bullseye-staging/main armhf libicu67 armhf 67.1-4 [8289 kB]
Get:51 http://172.17.0.1/private bullseye-staging/main armhf libxml2 armhf 2.9.10+dfsg-5+b1 [593 kB]
Get:52 http://172.17.0.1/private bullseye-staging/main armhf imagemagick-6-common all 8:6.9.11.24+dfsg-1 [208 kB]
Get:53 http://172.17.0.1/private bullseye-staging/main armhf libmagickcore-6.q16-6 armhf 8:6.9.11.24+dfsg-1+b1 [1631 kB]
Get:54 http://172.17.0.1/private bullseye-staging/main armhf libmagickwand-6.q16-6 armhf 8:6.9.11.24+dfsg-1+b1 [430 kB]
Get:55 http://172.17.0.1/private bullseye-staging/main armhf tex-common all 6.15 [53.5 kB]
Get:56 http://172.17.0.1/private bullseye-staging/main armhf libmagic-mgc armhf 1:5.38-5 [262 kB]
Get:57 http://172.17.0.1/private bullseye-staging/main armhf libmagic1 armhf 1:5.38-5 [113 kB]
Get:58 http://172.17.0.1/private bullseye-staging/main armhf file armhf 1:5.38-5 [67.0 kB]
Get:59 http://172.17.0.1/private bullseye-staging/main armhf gettext-base armhf 0.19.8.1-10 [117 kB]
Get:60 http://172.17.0.1/private bullseye-staging/main armhf libpam-systemd armhf 246.2-1+rpi1 [254 kB]
Get:61 http://172.17.0.1/private bullseye-staging/main armhf time armhf 1.7-25.1 [30.8 kB]
Get:62 http://172.17.0.1/private bullseye-staging/main armhf hicolor-icon-theme all 0.17-2 [11.4 kB]
Get:63 http://172.17.0.1/private bullseye-staging/main armhf libgdk-pixbuf2.0-common all 2.40.0+dfsg-5 [317 kB]
Get:64 http://172.17.0.1/private bullseye-staging/main armhf shared-mime-info armhf 1.15-1 [785 kB]
Get:65 http://172.17.0.1/private bullseye-staging/main armhf libgdk-pixbuf2.0-0 armhf 2.40.0+dfsg-5 [158 kB]
Get:66 http://172.17.0.1/private bullseye-staging/main armhf gtk-update-icon-cache armhf 3.24.22-1 [84.8 kB]
Get:67 http://172.17.0.1/private bullseye-staging/main armhf adwaita-icon-theme all 3.36.1-2 [10.9 MB]
Get:68 http://172.17.0.1/private bullseye-staging/main armhf libsigsegv2 armhf 2.12-2 [32.3 kB]
Get:69 http://172.17.0.1/private bullseye-staging/main armhf m4 armhf 1.4.18-4 [185 kB]
Get:70 http://172.17.0.1/private bullseye-staging/main armhf autoconf all 2.69-11.1 [341 kB]
Get:71 http://172.17.0.1/private bullseye-staging/main armhf autotools-dev all 20180224.1 [77.0 kB]
Get:72 http://172.17.0.1/private bullseye-staging/main armhf automake all 1:1.16.2-3 [801 kB]
Get:73 http://172.17.0.1/private bullseye-staging/main armhf autopoint all 0.19.8.1-10 [435 kB]
Get:74 http://172.17.0.1/private bullseye-staging/main armhf dbus-user-session armhf 1.12.20-1+b3 [96.2 kB]
Get:75 http://172.17.0.1/private bullseye-staging/main armhf libdconf1 armhf 0.36.0-1 [38.7 kB]
Get:76 http://172.17.0.1/private bullseye-staging/main armhf dconf-service armhf 0.36.0-1 [34.4 kB]
Get:77 http://172.17.0.1/private bullseye-staging/main armhf dconf-gsettings-backend armhf 0.36.0-1 [26.0 kB]
Get:78 http://172.17.0.1/private bullseye-staging/main armhf libtool all 2.4.6-14 [513 kB]
Get:79 http://172.17.0.1/private bullseye-staging/main armhf dh-autoreconf all 19 [16.9 kB]
Get:80 http://172.17.0.1/private bullseye-staging/main armhf libdebhelper-perl all 13.2 [187 kB]
Get:81 http://172.17.0.1/private bullseye-staging/main armhf libarchive-zip-perl all 1.68-1 [104 kB]
Get:82 http://172.17.0.1/private bullseye-staging/main armhf libsub-override-perl all 0.09-2 [10.2 kB]
Get:83 http://172.17.0.1/private bullseye-staging/main armhf libfile-stripnondeterminism-perl all 1.9.0-1 [25.5 kB]
Get:84 http://172.17.0.1/private bullseye-staging/main armhf dh-strip-nondeterminism all 1.9.0-1 [15.2 kB]
Get:85 http://172.17.0.1/private bullseye-staging/main armhf libelf1 armhf 0.180-1 [162 kB]
Get:86 http://172.17.0.1/private bullseye-staging/main armhf dwz armhf 0.13-5 [142 kB]
Get:87 http://172.17.0.1/private bullseye-staging/main armhf libcroco3 armhf 0.6.13-1 [133 kB]
Get:88 http://172.17.0.1/private bullseye-staging/main armhf gettext armhf 0.19.8.1-10 [1219 kB]
Get:89 http://172.17.0.1/private bullseye-staging/main armhf intltool-debian all 0.35.0+20060710.5 [26.8 kB]
Get:90 http://172.17.0.1/private bullseye-staging/main armhf po-debconf all 1.0.21 [248 kB]
Get:91 http://172.17.0.1/private bullseye-staging/main armhf debhelper all 13.2 [1007 kB]
Get:92 http://172.17.0.1/private bullseye-staging/main armhf emacsen-common all 3.0.4 [19.3 kB]
Get:93 http://172.17.0.1/private bullseye-staging/main armhf emacs-common all 1:26.3+1-2 [13.4 MB]
Get:94 http://172.17.0.1/private bullseye-staging/main armhf emacs-bin-common armhf 1:26.3+1-2 [120 kB]
Get:95 http://172.17.0.1/private bullseye-staging/main armhf libasound2-data all 1.2.3.2-1 [38.1 kB]
Get:96 http://172.17.0.1/private bullseye-staging/main armhf libasound2 armhf 1.2.3.2-1 [301 kB]
Get:97 http://172.17.0.1/private bullseye-staging/main armhf libpixman-1-0 armhf 0.36.0-1 [458 kB]
Get:98 http://172.17.0.1/private bullseye-staging/main armhf libxcb-render0 armhf 1.14-2 [110 kB]
Get:99 http://172.17.0.1/private bullseye-staging/main armhf libxcb-shm0 armhf 1.14-2 [101 kB]
Get:100 http://172.17.0.1/private bullseye-staging/main armhf libxrender1 armhf 1:0.9.10-1 [29.9 kB]
Get:101 http://172.17.0.1/private bullseye-staging/main armhf libcairo2 armhf 1.16.0-4 [599 kB]
Get:102 http://172.17.0.1/private bullseye-staging/main armhf libgif7 armhf 5.1.9-1 [42.5 kB]
Get:103 http://172.17.0.1/private bullseye-staging/main armhf libgpm2 armhf 1.20.7-6 [34.7 kB]
Get:104 http://172.17.0.1/private bullseye-staging/main armhf libatk1.0-data all 2.36.0-2 [149 kB]
Get:105 http://172.17.0.1/private bullseye-staging/main armhf libatk1.0-0 armhf 2.36.0-2 [44.2 kB]
Get:106 http://172.17.0.1/private bullseye-staging/main armhf libatspi2.0-0 armhf 2.36.0-3 [60.3 kB]
Get:107 http://172.17.0.1/private bullseye-staging/main armhf libatk-bridge2.0-0 armhf 2.34.1-3 [54.6 kB]
Get:108 http://172.17.0.1/private bullseye-staging/main armhf libcairo-gobject2 armhf 1.16.0-4 [123 kB]
Get:109 http://172.17.0.1/private bullseye-staging/main armhf libcolord2 armhf 1.4.4-2 [121 kB]
Get:110 http://172.17.0.1/private bullseye-staging/main armhf libavahi-common-data armhf 0.8-3+b2 [127 kB]
Get:111 http://172.17.0.1/private bullseye-staging/main armhf libavahi-common3 armhf 0.8-3+b2 [55.3 kB]
Get:112 http://172.17.0.1/private bullseye-staging/main armhf libavahi-client3 armhf 0.8-3+b2 [58.0 kB]
Get:113 http://172.17.0.1/private bullseye-staging/main armhf libkrb5support0 armhf 1.17-10+b3 [62.0 kB]
Get:114 http://172.17.0.1/private bullseye-staging/main armhf libk5crypto3 armhf 1.17-10+b3 [112 kB]
Get:115 http://172.17.0.1/private bullseye-staging/main armhf libkeyutils1 armhf 1.6.1-2 [14.5 kB]
Get:116 http://172.17.0.1/private bullseye-staging/main armhf libkrb5-3 armhf 1.17-10+b3 [318 kB]
Get:117 http://172.17.0.1/private bullseye-staging/main armhf libgssapi-krb5-2 armhf 1.17-10+b3 [135 kB]
Get:118 http://172.17.0.1/private bullseye-staging/main armhf libcups2 armhf 2.3.3-2 [309 kB]
Get:119 http://172.17.0.1/private bullseye-staging/main armhf libepoxy0 armhf 1.5.4-1 [172 kB]
Get:120 http://172.17.0.1/private bullseye-staging/main armhf libfribidi0 armhf 1.0.8-2 [63.5 kB]
Get:121 http://172.17.0.1/private bullseye-staging/main armhf libgraphite2-3 armhf 1.3.14-1 [70.3 kB]
Get:122 http://172.17.0.1/private bullseye-staging/main armhf libharfbuzz0b armhf 2.6.7-1 [1366 kB]
Get:123 http://172.17.0.1/private bullseye-staging/main armhf libjson-glib-1.0-common all 1.4.4-2 [52.3 kB]
Get:124 http://172.17.0.1/private bullseye-staging/main armhf libjson-glib-1.0-0 armhf 1.4.4-2 [52.7 kB]
Get:125 http://172.17.0.1/private bullseye-staging/main armhf fontconfig armhf 2.13.1-4.2 [416 kB]
Get:126 http://172.17.0.1/private bullseye-staging/main armhf libthai-data all 0.1.28-3 [170 kB]
Get:127 http://172.17.0.1/private bullseye-staging/main armhf libdatrie1 armhf 0.2.12-3+b3 [36.4 kB]
Get:128 http://172.17.0.1/private bullseye-staging/main armhf libthai0 armhf 0.1.28-3 [51.0 kB]
Get:129 http://172.17.0.1/private bullseye-staging/main armhf libpango-1.0-0 armhf 1.46.0-2 [170 kB]
Get:130 http://172.17.0.1/private bullseye-staging/main armhf libpangoft2-1.0-0 armhf 1.46.0-2 [54.6 kB]
Get:131 http://172.17.0.1/private bullseye-staging/main armhf libpangocairo-1.0-0 armhf 1.46.0-2 [45.8 kB]
Get:132 http://172.17.0.1/private bullseye-staging/main armhf libproxy1v5 armhf 0.4.15-13 [51.4 kB]
Get:133 http://172.17.0.1/private bullseye-staging/main armhf glib-networking-common all 2.64.3-2 [65.9 kB]
Get:134 http://172.17.0.1/private bullseye-staging/main armhf glib-networking-services armhf 2.64.3-2 [16.7 kB]
Get:135 http://172.17.0.1/private bullseye-staging/main armhf gsettings-desktop-schemas all 3.36.1-1 [580 kB]
Get:136 http://172.17.0.1/private bullseye-staging/main armhf glib-networking armhf 2.64.3-2 [60.0 kB]
Get:137 http://172.17.0.1/private bullseye-staging/main armhf libpsl5 armhf 0.21.0-1.1 [54.2 kB]
Get:138 http://172.17.0.1/private bullseye-staging/main armhf libsoup2.4-1 armhf 2.70.0-1 [236 kB]
Get:139 http://172.17.0.1/private bullseye-staging/main armhf libsoup-gnome2.4-1 armhf 2.70.0-1 [21.2 kB]
Get:140 http://172.17.0.1/private bullseye-staging/main armhf librest-0.7-0 armhf 0.8.1-1 [27.8 kB]
Get:141 http://172.17.0.1/private bullseye-staging/main armhf libwayland-client0 armhf 1.18.0-2~exp1 [22.1 kB]
Get:142 http://172.17.0.1/private bullseye-staging/main armhf libwayland-cursor0 armhf 1.18.0-2~exp1 [13.4 kB]
Get:143 http://172.17.0.1/private bullseye-staging/main armhf libwayland-egl1 armhf 1.18.0-2~exp1 [8152 B]
Get:144 http://172.17.0.1/private bullseye-staging/main armhf libxcomposite1 armhf 1:0.4.5-1 [16.2 kB]
Get:145 http://172.17.0.1/private bullseye-staging/main armhf libxfixes3 armhf 1:5.0.3-2 [20.7 kB]
Get:146 http://172.17.0.1/private bullseye-staging/main armhf libxcursor1 armhf 1:1.2.0-2 [34.2 kB]
Get:147 http://172.17.0.1/private bullseye-staging/main armhf libxdamage1 armhf 1:1.1.5-2 [15.2 kB]
Get:148 http://172.17.0.1/private bullseye-staging/main armhf libxi6 armhf 2:1.7.10-1 [77.9 kB]
Get:149 http://172.17.0.1/private bullseye-staging/main armhf libxinerama1 armhf 2:1.1.4-2 [17.3 kB]
Get:150 http://172.17.0.1/private bullseye-staging/main armhf xkb-data all 2.29-2 [655 kB]
Get:151 http://172.17.0.1/private bullseye-staging/main armhf libxkbcommon0 armhf 0.10.0-1 [111 kB]
Get:152 http://172.17.0.1/private bullseye-staging/main armhf libxrandr2 armhf 2:1.5.1-1 [34.5 kB]
Get:153 http://172.17.0.1/private bullseye-staging/main armhf libgtk-3-common all 3.24.22-1 [3724 kB]
Get:154 http://172.17.0.1/private bullseye-staging/main armhf libgtk-3-0 armhf 3.24.22-1 [2272 kB]
Get:155 http://172.17.0.1/private bullseye-staging/main armhf x11-common all 1:7.7+20 [252 kB]
Get:156 http://172.17.0.1/private bullseye-staging/main armhf libice6 armhf 2:1.0.9-2 [51.6 kB]
Get:157 http://172.17.0.1/private bullseye-staging/main armhf m17n-db all 1.8.0-3 [1289 kB]
Get:158 http://172.17.0.1/private bullseye-staging/main armhf libxpm4 armhf 1:3.5.12-1 [43.6 kB]
Get:159 http://172.17.0.1/private bullseye-staging/main armhf libgd3 armhf 2.3.0-2 [116 kB]
Get:160 http://172.17.0.1/private bullseye-staging/main armhf libotf0 armhf 0.9.13-7 [47.6 kB]
Get:161 http://172.17.0.1/private bullseye-staging/main armhf libsm6 armhf 2:1.2.3-1 [32.9 kB]
Get:162 http://172.17.0.1/private bullseye-staging/main armhf libxft2 armhf 2.3.2-2 [49.3 kB]
Get:163 http://172.17.0.1/private bullseye-staging/main armhf libxt6 armhf 1:1.2.0-1 [159 kB]
Get:164 http://172.17.0.1/private bullseye-staging/main armhf libm17n-0 armhf 1.8.0-2 [212 kB]
Get:165 http://172.17.0.1/private bullseye-staging/main armhf librsvg2-2 armhf 2.48.7-1 [1839 kB]
Get:166 http://172.17.0.1/private bullseye-staging/main armhf emacs-gtk armhf 1:26.3+1-2 [3186 kB]
Get:167 http://172.17.0.1/private bullseye-staging/main armhf fonts-lmodern all 2.004.5-6 [4539 kB]
Get:168 http://172.17.0.1/private bullseye-staging/main armhf libtcl8.6 armhf 8.6.10+dfsg-1 [886 kB]
Get:169 http://172.17.0.1/private bullseye-staging/main armhf libxss1 armhf 1:1.2.3-1 [17.3 kB]
Get:170 http://172.17.0.1/private bullseye-staging/main armhf libtk8.6 armhf 8.6.10-1 [678 kB]
Get:171 http://172.17.0.1/private bullseye-staging/main armhf xemacs21-support all 21.4.24-9 [4181 kB]
Get:172 http://172.17.0.1/private bullseye-staging/main armhf xemacs21-bin armhf 21.4.24-9 [381 kB]
Get:173 http://172.17.0.1/private bullseye-staging/main armhf libcanna1g armhf 3.7p3-15 [310 kB]
Get:174 http://172.17.0.1/private bullseye-staging/main armhf libcompfaceg1 armhf 1:1.5.2-5 [14.1 kB]
Get:175 http://172.17.0.1/private bullseye-staging/main armhf libxmu6 armhf 2:1.1.2-2+b3 [52.1 kB]
Get:176 http://172.17.0.1/private bullseye-staging/main armhf libxaw7 armhf 2:1.0.13-1+b2 [163 kB]
Get:177 http://172.17.0.1/private bullseye-staging/main armhf xemacs21-mulesupport all 2009.02.17.dfsg.2-5 [3130 kB]
Get:178 http://172.17.0.1/private bullseye-staging/main armhf xemacs21-basesupport all 2009.02.17.dfsg.2-5 [15.9 MB]
Get:179 http://172.17.0.1/private bullseye-staging/main armhf xemacs21-mule-canna-wnn armhf 21.4.24-9 [1513 kB]
Get:180 http://172.17.0.1/private bullseye-staging/main armhf gcl armhf 2.6.12-95+rpi1 [26.9 MB]
Get:181 http://172.17.0.1/private bullseye-staging/main armhf libgmpxx4ldbl armhf 2:6.2.0+dfsg-6 [22.1 kB]
Get:182 http://172.17.0.1/private bullseye-staging/main armhf libgmp-dev armhf 2:6.2.0+dfsg-6 [587 kB]
Get:183 http://172.17.0.1/private bullseye-staging/main armhf libgmp3-dev armhf 2:6.2.0+dfsg-6 [16.0 kB]
Get:184 http://172.17.0.1/private bullseye-staging/main armhf xorg-sgml-doctools all 1:1.11-1 [21.9 kB]
Get:185 http://172.17.0.1/private bullseye-staging/main armhf x11proto-dev all 2020.1-1 [594 kB]
Get:186 http://172.17.0.1/private bullseye-staging/main armhf x11proto-core-dev all 2020.1-1 [3404 B]
Get:187 http://172.17.0.1/private bullseye-staging/main armhf libice-dev armhf 2:1.0.9-2 [58.8 kB]
Get:188 http://172.17.0.1/private bullseye-staging/main armhf libkpathsea6 armhf 2020.20200327.54578-4+b1 [163 kB]
Get:189 http://172.17.0.1/private bullseye-staging/main armhf libncurses6 armhf 6.2-1 [79.5 kB]
Get:190 http://172.17.0.1/private bullseye-staging/main armhf libncurses-dev armhf 6.2-1 [284 kB]
Get:191 http://172.17.0.1/private bullseye-staging/main armhf libpaper1 armhf 1.1.28 [20.5 kB]
Get:192 http://172.17.0.1/private bullseye-staging/main armhf libpaper-utils armhf 1.1.28 [17.7 kB]
Get:193 http://172.17.0.1/private bullseye-staging/main armhf libptexenc1 armhf 2020.20200327.54578-4+b1 [60.9 kB]
Get:194 http://172.17.0.1/private bullseye-staging/main armhf libpthread-stubs0-dev armhf 0.4-1 [5344 B]
Get:195 http://172.17.0.1/private bullseye-staging/main armhf libreadline-dev armhf 8.0-4 [116 kB]
Get:196 http://172.17.0.1/private bullseye-staging/main armhf libsm-dev armhf 2:1.2.3-1 [35.4 kB]
Get:197 http://172.17.0.1/private bullseye-staging/main armhf libsynctex2 armhf 2020.20200327.54578-4+b1 [69.8 kB]
Get:198 http://172.17.0.1/private bullseye-staging/main armhf libteckit0 armhf 2.5.8+ds2-5 [245 kB]
Get:199 http://172.17.0.1/private bullseye-staging/main armhf libtexlua53 armhf 2020.20200327.54578-4+b1 [101 kB]
Get:200 http://172.17.0.1/private bullseye-staging/main armhf libtexluajit2 armhf 2020.20200327.54578-4+b1 [207 kB]
Get:201 http://172.17.0.1/private bullseye-staging/main armhf libtext-unidecode-perl all 1.30-1 [103 kB]
Get:202 http://172.17.0.1/private bullseye-staging/main armhf libxau-dev armhf 1:1.0.8-1+b2 [22.4 kB]
Get:203 http://172.17.0.1/private bullseye-staging/main armhf libxdmcp-dev armhf 1:1.1.2-3 [40.9 kB]
Get:204 http://172.17.0.1/private bullseye-staging/main armhf xtrans-dev all 1.4.0-1 [98.7 kB]
Get:205 http://172.17.0.1/private bullseye-staging/main armhf libxcb1-dev armhf 1.14-2 [173 kB]
Get:206 http://172.17.0.1/private bullseye-staging/main armhf libx11-dev armhf 2:1.6.10-3 [779 kB]
Get:207 http://172.17.0.1/private bullseye-staging/main armhf x11proto-xext-dev all 2020.1-1 [3404 B]
Get:208 http://172.17.0.1/private bullseye-staging/main armhf libxext-dev armhf 2:1.3.3-1+b2 [102 kB]
Get:209 http://172.17.0.1/private bullseye-staging/main armhf libxt-dev armhf 1:1.2.0-1 [372 kB]
Get:210 http://172.17.0.1/private bullseye-staging/main armhf libxmu-headers all 2:1.1.2-2 [51.9 kB]
Get:211 http://172.17.0.1/private bullseye-staging/main armhf libxmu-dev armhf 2:1.1.2-2+b3 [56.5 kB]
Get:212 http://172.17.0.1/private bullseye-staging/main armhf libxpm-dev armhf 1:3.5.12-1 [98.1 kB]
Get:213 http://172.17.0.1/private bullseye-staging/main armhf libxaw7-dev armhf 2:1.0.13-1+b2 [221 kB]
Get:214 http://172.17.0.1/private bullseye-staging/main armhf libxml-namespacesupport-perl all 1.12-1 [14.8 kB]
Get:215 http://172.17.0.1/private bullseye-staging/main armhf libxml-sax-base-perl all 1.09-1 [20.4 kB]
Get:216 http://172.17.0.1/private bullseye-staging/main armhf libxml-sax-perl all 1.02+dfsg-1 [59.0 kB]
Get:217 http://172.17.0.1/private bullseye-staging/main armhf libxml-libxml-perl armhf 2.0134+dfsg-2 [326 kB]
Get:218 http://172.17.0.1/private bullseye-staging/main armhf libzzip-0-13 armhf 0.13.62-3.2 [51.6 kB]
Get:219 http://172.17.0.1/private bullseye-staging/main armhf t1utils armhf 1.41-4 [52.3 kB]
Get:220 http://172.17.0.1/private bullseye-staging/main armhf texinfo armhf 6.7.0.dfsg.2-5 [1745 kB]
Get:221 http://172.17.0.1/private bullseye-staging/main armhf texlive-binaries armhf 2020.20200327.54578-4+b1 [6860 kB]
Get:222 http://172.17.0.1/private bullseye-staging/main armhf xdg-utils all 1.1.3-2 [74.6 kB]
Get:223 http://172.17.0.1/private bullseye-staging/main armhf texlive-base all 2020.20200804-2 [21.5 MB]
Get:224 http://172.17.0.1/private bullseye-staging/main armhf texlive-latex-base all 2020.20200804-2 [1066 kB]
Get:225 http://172.17.0.1/private bullseye-staging/main armhf texlive-latex-recommended all 2020.20200804-2 [14.5 MB]
debconf: delaying package configuration, since apt-utils is not installed
Fetched 191 MB in 36s (5324 kB/s)
Selecting previously unselected package install-info.
(Reading database ... 12502 files and directories currently installed.)
Preparing to unpack .../install-info_6.7.0.dfsg.2-5_armhf.deb ...
Unpacking install-info (6.7.0.dfsg.2-5) ...
Setting up install-info (6.7.0.dfsg.2-5) ...
(Reading database ... 12516 files and directories currently installed.)
Preparing to unpack .../libsystemd0_246.2-1+rpi1_armhf.deb ...
Unpacking libsystemd0:armhf (246.2-1+rpi1) over (245.6-2+rpi1+b1) ...
Setting up libsystemd0:armhf (246.2-1+rpi1) ...
Selecting previously unselected package libuchardet0:armhf.
(Reading database ... 12515 files and directories currently installed.)
Preparing to unpack .../00-libuchardet0_0.0.7-1_armhf.deb ...
Unpacking libuchardet0:armhf (0.0.7-1) ...
Selecting previously unselected package groff-base.
Preparing to unpack .../01-groff-base_1.22.4-5_armhf.deb ...
Unpacking groff-base (1.22.4-5) ...
Selecting previously unselected package libpipeline1:armhf.
Preparing to unpack .../02-libpipeline1_1.5.3-1_armhf.deb ...
Unpacking libpipeline1:armhf (1.5.3-1) ...
Selecting previously unselected package man-db.
Preparing to unpack .../03-man-db_2.9.3-2_armhf.deb ...
Unpacking man-db (2.9.3-2) ...
Selecting previously unselected package libapparmor1:armhf.
Preparing to unpack .../04-libapparmor1_2.13.4-3+b1_armhf.deb ...
Unpacking libapparmor1:armhf (2.13.4-3+b1) ...
Selecting previously unselected package libargon2-1:armhf.
Preparing to unpack .../05-libargon2-1_0~20171227-0.2_armhf.deb ...
Unpacking libargon2-1:armhf (0~20171227-0.2) ...
Selecting previously unselected package dmsetup.
Preparing to unpack .../06-dmsetup_2%3a1.02.171-3_armhf.deb ...
Unpacking dmsetup (2:1.02.171-3) ...
Selecting previously unselected package libdevmapper1.02.1:armhf.
Preparing to unpack .../07-libdevmapper1.02.1_2%3a1.02.171-3_armhf.deb ...
Unpacking libdevmapper1.02.1:armhf (2:1.02.171-3) ...
Selecting previously unselected package libjson-c5:armhf.
Preparing to unpack .../08-libjson-c5_0.15-1_armhf.deb ...
Unpacking libjson-c5:armhf (0.15-1) ...
Selecting previously unselected package libssl1.1:armhf.
Preparing to unpack .../09-libssl1.1_1.1.1g-1_armhf.deb ...
Unpacking libssl1.1:armhf (1.1.1g-1) ...
Selecting previously unselected package libcryptsetup12:armhf.
Preparing to unpack .../10-libcryptsetup12_2%3a2.3.3-2_armhf.deb ...
Unpacking libcryptsetup12:armhf (2:2.3.3-2) ...
Selecting previously unselected package libip4tc2:armhf.
Preparing to unpack .../11-libip4tc2_1.8.5-3_armhf.deb ...
Unpacking libip4tc2:armhf (1.8.5-3) ...
Selecting previously unselected package libkmod2:armhf.
Preparing to unpack .../12-libkmod2_27+20200310-2_armhf.deb ...
Unpacking libkmod2:armhf (27+20200310-2) ...
Selecting previously unselected package systemd-timesyncd.
Preparing to unpack .../13-systemd-timesyncd_246.2-1+rpi1_armhf.deb ...
Unpacking systemd-timesyncd (246.2-1+rpi1) ...
Selecting previously unselected package systemd.
Preparing to unpack .../14-systemd_246.2-1+rpi1_armhf.deb ...
Unpacking systemd (246.2-1+rpi1) ...
Setting up libapparmor1:armhf (2.13.4-3+b1) ...
Setting up libargon2-1:armhf (0~20171227-0.2) ...
Setting up libjson-c5:armhf (0.15-1) ...
Setting up libssl1.1:armhf (1.1.1g-1) ...
Setting up libip4tc2:armhf (1.8.5-3) ...
Setting up libkmod2:armhf (27+20200310-2) ...
Setting up libdevmapper1.02.1:armhf (2:1.02.171-3) ...
Setting up libcryptsetup12:armhf (2:2.3.3-2) ...
Setting up systemd-timesyncd (246.2-1+rpi1) ...
Created symlink /etc/systemd/system/dbus-org.freedesktop.timesync1.service -> /lib/systemd/system/systemd-timesyncd.service.
Created symlink /etc/systemd/system/sysinit.target.wants/systemd-timesyncd.service -> /lib/systemd/system/systemd-timesyncd.service.
Setting up systemd (246.2-1+rpi1) ...
Created symlink /etc/systemd/system/getty.target.wants/getty@tty1.service -> /lib/systemd/system/getty@.service.
Created symlink /etc/systemd/system/multi-user.target.wants/remote-fs.target -> /lib/systemd/system/remote-fs.target.
Created symlink /etc/systemd/system/sysinit.target.wants/systemd-pstore.service -> /lib/systemd/system/systemd-pstore.service.
Initializing machine ID from random generator.
Setting up dmsetup (2:1.02.171-3) ...
Selecting previously unselected package systemd-sysv.
(Reading database ... 13905 files and directories currently installed.)
Preparing to unpack .../000-systemd-sysv_246.2-1+rpi1_armhf.deb ...
Unpacking systemd-sysv (246.2-1+rpi1) ...
Selecting previously unselected package libdbus-1-3:armhf.
Preparing to unpack .../001-libdbus-1-3_1.12.20-1+b3_armhf.deb ...
Unpacking libdbus-1-3:armhf (1.12.20-1+b3) ...
Selecting previously unselected package libexpat1:armhf.
Preparing to unpack .../002-libexpat1_2.2.9-1_armhf.deb ...
Unpacking libexpat1:armhf (2.2.9-1) ...
Selecting previously unselected package dbus.
Preparing to unpack .../003-dbus_1.12.20-1+b3_armhf.deb ...
Unpacking dbus (1.12.20-1+b3) ...
Selecting previously unselected package libfftw3-double3:armhf.
Preparing to unpack .../004-libfftw3-double3_3.3.8-2_armhf.deb ...
Unpacking libfftw3-double3:armhf (3.3.8-2) ...
Selecting previously unselected package libbrotli1:armhf.
Preparing to unpack .../005-libbrotli1_1.0.7-7_armhf.deb ...
Unpacking libbrotli1:armhf (1.0.7-7) ...
Selecting previously unselected package libpng16-16:armhf.
Preparing to unpack .../006-libpng16-16_1.6.37-2_armhf.deb ...
Unpacking libpng16-16:armhf (1.6.37-2) ...
Selecting previously unselected package libfreetype6:armhf.
Preparing to unpack .../007-libfreetype6_2.10.2+dfsg-3_armhf.deb ...
Unpacking libfreetype6:armhf (2.10.2+dfsg-3) ...
Selecting previously unselected package ucf.
Preparing to unpack .../008-ucf_3.0043_all.deb ...
Moving old data out of the way
Unpacking ucf (3.0043) ...
Selecting previously unselected package fonts-dejavu-core.
Preparing to unpack .../009-fonts-dejavu-core_2.37-2_all.deb ...
Unpacking fonts-dejavu-core (2.37-2) ...
Selecting previously unselected package fontconfig-config.
Preparing to unpack .../010-fontconfig-config_2.13.1-4.2_all.deb ...
Unpacking fontconfig-config (2.13.1-4.2) ...
Selecting previously unselected package libfontconfig1:armhf.
Preparing to unpack .../011-libfontconfig1_2.13.1-4.2_armhf.deb ...
Unpacking libfontconfig1:armhf (2.13.1-4.2) ...
Selecting previously unselected package libde265-0:armhf.
Preparing to unpack .../012-libde265-0_1.0.4-1+rpi1_armhf.deb ...
Unpacking libde265-0:armhf (1.0.4-1+rpi1) ...
Selecting previously unselected package libx265-192:armhf.
Preparing to unpack .../013-libx265-192_3.4-2_armhf.deb ...
Unpacking libx265-192:armhf (3.4-2) ...
Selecting previously unselected package libheif1:armhf.
Preparing to unpack .../014-libheif1_1.6.1-1+b1_armhf.deb ...
Unpacking libheif1:armhf (1.6.1-1+b1) ...
Selecting previously unselected package libjbig0:armhf.
Preparing to unpack .../015-libjbig0_2.1-3.1+b2_armhf.deb ...
Unpacking libjbig0:armhf (2.1-3.1+b2) ...
Selecting previously unselected package libjpeg62-turbo:armhf.
Preparing to unpack .../016-libjpeg62-turbo_1%3a2.0.5-1.1_armhf.deb ...
Unpacking libjpeg62-turbo:armhf (1:2.0.5-1.1) ...
Selecting previously unselected package liblcms2-2:armhf.
Preparing to unpack .../017-liblcms2-2_2.9-4_armhf.deb ...
Unpacking liblcms2-2:armhf (2.9-4) ...
Selecting previously unselected package libglib2.0-0:armhf.
Preparing to unpack .../018-libglib2.0-0_2.64.4-1_armhf.deb ...
Unpacking libglib2.0-0:armhf (2.64.4-1) ...
Selecting previously unselected package liblqr-1-0:armhf.
Preparing to unpack .../019-liblqr-1-0_0.4.2-2.1_armhf.deb ...
Unpacking liblqr-1-0:armhf (0.4.2-2.1) ...
Selecting previously unselected package libltdl7:armhf.
Preparing to unpack .../020-libltdl7_2.4.6-14_armhf.deb ...
Unpacking libltdl7:armhf (2.4.6-14) ...
Selecting previously unselected package libopenjp2-7:armhf.
Preparing to unpack .../021-libopenjp2-7_2.3.1-1_armhf.deb ...
Unpacking libopenjp2-7:armhf (2.3.1-1) ...
Selecting previously unselected package libwebp6:armhf.
Preparing to unpack .../022-libwebp6_0.6.1-2_armhf.deb ...
Unpacking libwebp6:armhf (0.6.1-2) ...
Selecting previously unselected package libtiff5:armhf.
Preparing to unpack .../023-libtiff5_4.1.0+git191117-2_armhf.deb ...
Unpacking libtiff5:armhf (4.1.0+git191117-2) ...
Selecting previously unselected package libwebpdemux2:armhf.
Preparing to unpack .../024-libwebpdemux2_0.6.1-2_armhf.deb ...
Unpacking libwebpdemux2:armhf (0.6.1-2) ...
Selecting previously unselected package libwebpmux3:armhf.
Preparing to unpack .../025-libwebpmux3_0.6.1-2_armhf.deb ...
Unpacking libwebpmux3:armhf (0.6.1-2) ...
Selecting previously unselected package libxau6:armhf.
Preparing to unpack .../026-libxau6_1%3a1.0.8-1+b2_armhf.deb ...
Unpacking libxau6:armhf (1:1.0.8-1+b2) ...
Selecting previously unselected package libbsd0:armhf.
Preparing to unpack .../027-libbsd0_0.10.0-1_armhf.deb ...
Unpacking libbsd0:armhf (0.10.0-1) ...
Selecting previously unselected package libxdmcp6:armhf.
Preparing to unpack .../028-libxdmcp6_1%3a1.1.2-3_armhf.deb ...
Unpacking libxdmcp6:armhf (1:1.1.2-3) ...
Selecting previously unselected package libxcb1:armhf.
Preparing to unpack .../029-libxcb1_1.14-2_armhf.deb ...
Unpacking libxcb1:armhf (1.14-2) ...
Selecting previously unselected package libx11-data.
Preparing to unpack .../030-libx11-data_2%3a1.6.10-3_all.deb ...
Unpacking libx11-data (2:1.6.10-3) ...
Selecting previously unselected package libx11-6:armhf.
Preparing to unpack .../031-libx11-6_2%3a1.6.10-3_armhf.deb ...
Unpacking libx11-6:armhf (2:1.6.10-3) ...
Selecting previously unselected package libxext6:armhf.
Preparing to unpack .../032-libxext6_2%3a1.3.3-1+b2_armhf.deb ...
Unpacking libxext6:armhf (2:1.3.3-1+b2) ...
Selecting previously unselected package libicu67:armhf.
Preparing to unpack .../033-libicu67_67.1-4_armhf.deb ...
Unpacking libicu67:armhf (67.1-4) ...
Selecting previously unselected package libxml2:armhf.
Preparing to unpack .../034-libxml2_2.9.10+dfsg-5+b1_armhf.deb ...
Unpacking libxml2:armhf (2.9.10+dfsg-5+b1) ...
Selecting previously unselected package imagemagick-6-common.
Preparing to unpack .../035-imagemagick-6-common_8%3a6.9.11.24+dfsg-1_all.deb ...
Unpacking imagemagick-6-common (8:6.9.11.24+dfsg-1) ...
Selecting previously unselected package libmagickcore-6.q16-6:armhf.
Preparing to unpack .../036-libmagickcore-6.q16-6_8%3a6.9.11.24+dfsg-1+b1_armhf.deb ...
Unpacking libmagickcore-6.q16-6:armhf (8:6.9.11.24+dfsg-1+b1) ...
Selecting previously unselected package libmagickwand-6.q16-6:armhf.
Preparing to unpack .../037-libmagickwand-6.q16-6_8%3a6.9.11.24+dfsg-1+b1_armhf.deb ...
Unpacking libmagickwand-6.q16-6:armhf (8:6.9.11.24+dfsg-1+b1) ...
Selecting previously unselected package tex-common.
Preparing to unpack .../038-tex-common_6.15_all.deb ...
Unpacking tex-common (6.15) ...
Selecting previously unselected package libmagic-mgc.
Preparing to unpack .../039-libmagic-mgc_1%3a5.38-5_armhf.deb ...
Unpacking libmagic-mgc (1:5.38-5) ...
Selecting previously unselected package libmagic1:armhf.
Preparing to unpack .../040-libmagic1_1%3a5.38-5_armhf.deb ...
Unpacking libmagic1:armhf (1:5.38-5) ...
Selecting previously unselected package file.
Preparing to unpack .../041-file_1%3a5.38-5_armhf.deb ...
Unpacking file (1:5.38-5) ...
Selecting previously unselected package gettext-base.
Preparing to unpack .../042-gettext-base_0.19.8.1-10_armhf.deb ...
Unpacking gettext-base (0.19.8.1-10) ...
Selecting previously unselected package libpam-systemd:armhf.
Preparing to unpack .../043-libpam-systemd_246.2-1+rpi1_armhf.deb ...
Unpacking libpam-systemd:armhf (246.2-1+rpi1) ...
Selecting previously unselected package time.
Preparing to unpack .../044-time_1.7-25.1_armhf.deb ...
Unpacking time (1.7-25.1) ...
Selecting previously unselected package hicolor-icon-theme.
Preparing to unpack .../045-hicolor-icon-theme_0.17-2_all.deb ...
Unpacking hicolor-icon-theme (0.17-2) ...
Selecting previously unselected package libgdk-pixbuf2.0-common.
Preparing to unpack .../046-libgdk-pixbuf2.0-common_2.40.0+dfsg-5_all.deb ...
Unpacking libgdk-pixbuf2.0-common (2.40.0+dfsg-5) ...
Selecting previously unselected package shared-mime-info.
Preparing to unpack .../047-shared-mime-info_1.15-1_armhf.deb ...
Unpacking shared-mime-info (1.15-1) ...
Selecting previously unselected package libgdk-pixbuf2.0-0:armhf.
Preparing to unpack .../048-libgdk-pixbuf2.0-0_2.40.0+dfsg-5_armhf.deb ...
Unpacking libgdk-pixbuf2.0-0:armhf (2.40.0+dfsg-5) ...
Selecting previously unselected package gtk-update-icon-cache.
Preparing to unpack .../049-gtk-update-icon-cache_3.24.22-1_armhf.deb ...
No diversion 'diversion of /usr/sbin/update-icon-caches to /usr/sbin/update-icon-caches.gtk2 by libgtk-3-bin', none removed.
No diversion 'diversion of /usr/share/man/man8/update-icon-caches.8.gz to /usr/share/man/man8/update-icon-caches.gtk2.8.gz by libgtk-3-bin', none removed.
Unpacking gtk-update-icon-cache (3.24.22-1) ...
Selecting previously unselected package adwaita-icon-theme.
Preparing to unpack .../050-adwaita-icon-theme_3.36.1-2_all.deb ...
Unpacking adwaita-icon-theme (3.36.1-2) ...
Selecting previously unselected package libsigsegv2:armhf.
Preparing to unpack .../051-libsigsegv2_2.12-2_armhf.deb ...
Unpacking libsigsegv2:armhf (2.12-2) ...
Selecting previously unselected package m4.
Preparing to unpack .../052-m4_1.4.18-4_armhf.deb ...
Unpacking m4 (1.4.18-4) ...
Selecting previously unselected package autoconf.
Preparing to unpack .../053-autoconf_2.69-11.1_all.deb ...
Unpacking autoconf (2.69-11.1) ...
Selecting previously unselected package autotools-dev.
Preparing to unpack .../054-autotools-dev_20180224.1_all.deb ...
Unpacking autotools-dev (20180224.1) ...
Selecting previously unselected package automake.
Preparing to unpack .../055-automake_1%3a1.16.2-3_all.deb ...
Unpacking automake (1:1.16.2-3) ...
Selecting previously unselected package autopoint.
Preparing to unpack .../056-autopoint_0.19.8.1-10_all.deb ...
Unpacking autopoint (0.19.8.1-10) ...
Selecting previously unselected package dbus-user-session.
Preparing to unpack .../057-dbus-user-session_1.12.20-1+b3_armhf.deb ...
Unpacking dbus-user-session (1.12.20-1+b3) ...
Selecting previously unselected package libdconf1:armhf.
Preparing to unpack .../058-libdconf1_0.36.0-1_armhf.deb ...
Unpacking libdconf1:armhf (0.36.0-1) ...
Selecting previously unselected package dconf-service.
Preparing to unpack .../059-dconf-service_0.36.0-1_armhf.deb ...
Unpacking dconf-service (0.36.0-1) ...
Selecting previously unselected package dconf-gsettings-backend:armhf.
Preparing to unpack .../060-dconf-gsettings-backend_0.36.0-1_armhf.deb ...
Unpacking dconf-gsettings-backend:armhf (0.36.0-1) ...
Selecting previously unselected package libtool.
Preparing to unpack .../061-libtool_2.4.6-14_all.deb ...
Unpacking libtool (2.4.6-14) ...
Selecting previously unselected package dh-autoreconf.
Preparing to unpack .../062-dh-autoreconf_19_all.deb ...
Unpacking dh-autoreconf (19) ...
Selecting previously unselected package libdebhelper-perl.
Preparing to unpack .../063-libdebhelper-perl_13.2_all.deb ...
Unpacking libdebhelper-perl (13.2) ...
Selecting previously unselected package libarchive-zip-perl.
Preparing to unpack .../064-libarchive-zip-perl_1.68-1_all.deb ...
Unpacking libarchive-zip-perl (1.68-1) ...
Selecting previously unselected package libsub-override-perl.
Preparing to unpack .../065-libsub-override-perl_0.09-2_all.deb ...
Unpacking libsub-override-perl (0.09-2) ...
Selecting previously unselected package libfile-stripnondeterminism-perl.
Preparing to unpack .../066-libfile-stripnondeterminism-perl_1.9.0-1_all.deb ...
Unpacking libfile-stripnondeterminism-perl (1.9.0-1) ...
Selecting previously unselected package dh-strip-nondeterminism.
Preparing to unpack .../067-dh-strip-nondeterminism_1.9.0-1_all.deb ...
Unpacking dh-strip-nondeterminism (1.9.0-1) ...
Selecting previously unselected package libelf1:armhf.
Preparing to unpack .../068-libelf1_0.180-1_armhf.deb ...
Unpacking libelf1:armhf (0.180-1) ...
Selecting previously unselected package dwz.
Preparing to unpack .../069-dwz_0.13-5_armhf.deb ...
Unpacking dwz (0.13-5) ...
Selecting previously unselected package libcroco3:armhf.
Preparing to unpack .../070-libcroco3_0.6.13-1_armhf.deb ...
Unpacking libcroco3:armhf (0.6.13-1) ...
Selecting previously unselected package gettext.
Preparing to unpack .../071-gettext_0.19.8.1-10_armhf.deb ...
Unpacking gettext (0.19.8.1-10) ...
Selecting previously unselected package intltool-debian.
Preparing to unpack .../072-intltool-debian_0.35.0+20060710.5_all.deb ...
Unpacking intltool-debian (0.35.0+20060710.5) ...
Selecting previously unselected package po-debconf.
Preparing to unpack .../073-po-debconf_1.0.21_all.deb ...
Unpacking po-debconf (1.0.21) ...
Selecting previously unselected package debhelper.
Preparing to unpack .../074-debhelper_13.2_all.deb ...
Unpacking debhelper (13.2) ...
Selecting previously unselected package emacsen-common.
Preparing to unpack .../075-emacsen-common_3.0.4_all.deb ...
Unpacking emacsen-common (3.0.4) ...
Selecting previously unselected package emacs-common.
Preparing to unpack .../076-emacs-common_1%3a26.3+1-2_all.deb ...
Unpacking emacs-common (1:26.3+1-2) ...
Selecting previously unselected package emacs-bin-common.
Preparing to unpack .../077-emacs-bin-common_1%3a26.3+1-2_armhf.deb ...
Unpacking emacs-bin-common (1:26.3+1-2) ...
Selecting previously unselected package libasound2-data.
Preparing to unpack .../078-libasound2-data_1.2.3.2-1_all.deb ...
Unpacking libasound2-data (1.2.3.2-1) ...
Selecting previously unselected package libasound2:armhf.
Preparing to unpack .../079-libasound2_1.2.3.2-1_armhf.deb ...
Unpacking libasound2:armhf (1.2.3.2-1) ...
Selecting previously unselected package libpixman-1-0:armhf.
Preparing to unpack .../080-libpixman-1-0_0.36.0-1_armhf.deb ...
Unpacking libpixman-1-0:armhf (0.36.0-1) ...
Selecting previously unselected package libxcb-render0:armhf.
Preparing to unpack .../081-libxcb-render0_1.14-2_armhf.deb ...
Unpacking libxcb-render0:armhf (1.14-2) ...
Selecting previously unselected package libxcb-shm0:armhf.
Preparing to unpack .../082-libxcb-shm0_1.14-2_armhf.deb ...
Unpacking libxcb-shm0:armhf (1.14-2) ...
Selecting previously unselected package libxrender1:armhf.
Preparing to unpack .../083-libxrender1_1%3a0.9.10-1_armhf.deb ...
Unpacking libxrender1:armhf (1:0.9.10-1) ...
Selecting previously unselected package libcairo2:armhf.
Preparing to unpack .../084-libcairo2_1.16.0-4_armhf.deb ...
Unpacking libcairo2:armhf (1.16.0-4) ...
Selecting previously unselected package libgif7:armhf.
Preparing to unpack .../085-libgif7_5.1.9-1_armhf.deb ...
Unpacking libgif7:armhf (5.1.9-1) ...
Selecting previously unselected package libgpm2:armhf.
Preparing to unpack .../086-libgpm2_1.20.7-6_armhf.deb ...
Unpacking libgpm2:armhf (1.20.7-6) ...
Selecting previously unselected package libatk1.0-data.
Preparing to unpack .../087-libatk1.0-data_2.36.0-2_all.deb ...
Unpacking libatk1.0-data (2.36.0-2) ...
Selecting previously unselected package libatk1.0-0:armhf.
Preparing to unpack .../088-libatk1.0-0_2.36.0-2_armhf.deb ...
Unpacking libatk1.0-0:armhf (2.36.0-2) ...
Selecting previously unselected package libatspi2.0-0:armhf.
Preparing to unpack .../089-libatspi2.0-0_2.36.0-3_armhf.deb ...
Unpacking libatspi2.0-0:armhf (2.36.0-3) ...
Selecting previously unselected package libatk-bridge2.0-0:armhf.
Preparing to unpack .../090-libatk-bridge2.0-0_2.34.1-3_armhf.deb ...
Unpacking libatk-bridge2.0-0:armhf (2.34.1-3) ...
Selecting previously unselected package libcairo-gobject2:armhf.
Preparing to unpack .../091-libcairo-gobject2_1.16.0-4_armhf.deb ...
Unpacking libcairo-gobject2:armhf (1.16.0-4) ...
Selecting previously unselected package libcolord2:armhf.
Preparing to unpack .../092-libcolord2_1.4.4-2_armhf.deb ...
Unpacking libcolord2:armhf (1.4.4-2) ...
Selecting previously unselected package libavahi-common-data:armhf.
Preparing to unpack .../093-libavahi-common-data_0.8-3+b2_armhf.deb ...
Unpacking libavahi-common-data:armhf (0.8-3+b2) ...
Selecting previously unselected package libavahi-common3:armhf.
Preparing to unpack .../094-libavahi-common3_0.8-3+b2_armhf.deb ...
Unpacking libavahi-common3:armhf (0.8-3+b2) ...
Selecting previously unselected package libavahi-client3:armhf.
Preparing to unpack .../095-libavahi-client3_0.8-3+b2_armhf.deb ...
Unpacking libavahi-client3:armhf (0.8-3+b2) ...
Selecting previously unselected package libkrb5support0:armhf.
Preparing to unpack .../096-libkrb5support0_1.17-10+b3_armhf.deb ...
Unpacking libkrb5support0:armhf (1.17-10+b3) ...
Selecting previously unselected package libk5crypto3:armhf.
Preparing to unpack .../097-libk5crypto3_1.17-10+b3_armhf.deb ...
Unpacking libk5crypto3:armhf (1.17-10+b3) ...
Selecting previously unselected package libkeyutils1:armhf.
Preparing to unpack .../098-libkeyutils1_1.6.1-2_armhf.deb ...
Unpacking libkeyutils1:armhf (1.6.1-2) ...
Selecting previously unselected package libkrb5-3:armhf.
Preparing to unpack .../099-libkrb5-3_1.17-10+b3_armhf.deb ...
Unpacking libkrb5-3:armhf (1.17-10+b3) ...
Selecting previously unselected package libgssapi-krb5-2:armhf.
Preparing to unpack .../100-libgssapi-krb5-2_1.17-10+b3_armhf.deb ...
Unpacking libgssapi-krb5-2:armhf (1.17-10+b3) ...
Selecting previously unselected package libcups2:armhf.
Preparing to unpack .../101-libcups2_2.3.3-2_armhf.deb ...
Unpacking libcups2:armhf (2.3.3-2) ...
Selecting previously unselected package libepoxy0:armhf.
Preparing to unpack .../102-libepoxy0_1.5.4-1_armhf.deb ...
Unpacking libepoxy0:armhf (1.5.4-1) ...
Selecting previously unselected package libfribidi0:armhf.
Preparing to unpack .../103-libfribidi0_1.0.8-2_armhf.deb ...
Unpacking libfribidi0:armhf (1.0.8-2) ...
Selecting previously unselected package libgraphite2-3:armhf.
Preparing to unpack .../104-libgraphite2-3_1.3.14-1_armhf.deb ...
Unpacking libgraphite2-3:armhf (1.3.14-1) ...
Selecting previously unselected package libharfbuzz0b:armhf.
Preparing to unpack .../105-libharfbuzz0b_2.6.7-1_armhf.deb ...
Unpacking libharfbuzz0b:armhf (2.6.7-1) ...
Selecting previously unselected package libjson-glib-1.0-common.
Preparing to unpack .../106-libjson-glib-1.0-common_1.4.4-2_all.deb ...
Unpacking libjson-glib-1.0-common (1.4.4-2) ...
Selecting previously unselected package libjson-glib-1.0-0:armhf.
Preparing to unpack .../107-libjson-glib-1.0-0_1.4.4-2_armhf.deb ...
Unpacking libjson-glib-1.0-0:armhf (1.4.4-2) ...
Selecting previously unselected package fontconfig.
Preparing to unpack .../108-fontconfig_2.13.1-4.2_armhf.deb ...
Unpacking fontconfig (2.13.1-4.2) ...
Selecting previously unselected package libthai-data.
Preparing to unpack .../109-libthai-data_0.1.28-3_all.deb ...
Unpacking libthai-data (0.1.28-3) ...
Selecting previously unselected package libdatrie1:armhf.
Preparing to unpack .../110-libdatrie1_0.2.12-3+b3_armhf.deb ...
Unpacking libdatrie1:armhf (0.2.12-3+b3) ...
Selecting previously unselected package libthai0:armhf.
Preparing to unpack .../111-libthai0_0.1.28-3_armhf.deb ...
Unpacking libthai0:armhf (0.1.28-3) ...
Selecting previously unselected package libpango-1.0-0:armhf.
Preparing to unpack .../112-libpango-1.0-0_1.46.0-2_armhf.deb ...
Unpacking libpango-1.0-0:armhf (1.46.0-2) ...
Selecting previously unselected package libpangoft2-1.0-0:armhf.
Preparing to unpack .../113-libpangoft2-1.0-0_1.46.0-2_armhf.deb ...
Unpacking libpangoft2-1.0-0:armhf (1.46.0-2) ...
Selecting previously unselected package libpangocairo-1.0-0:armhf.
Preparing to unpack .../114-libpangocairo-1.0-0_1.46.0-2_armhf.deb ...
Unpacking libpangocairo-1.0-0:armhf (1.46.0-2) ...
Selecting previously unselected package libproxy1v5:armhf.
Preparing to unpack .../115-libproxy1v5_0.4.15-13_armhf.deb ...
Unpacking libproxy1v5:armhf (0.4.15-13) ...
Selecting previously unselected package glib-networking-common.
Preparing to unpack .../116-glib-networking-common_2.64.3-2_all.deb ...
Unpacking glib-networking-common (2.64.3-2) ...
Selecting previously unselected package glib-networking-services.
Preparing to unpack .../117-glib-networking-services_2.64.3-2_armhf.deb ...
Unpacking glib-networking-services (2.64.3-2) ...
Selecting previously unselected package gsettings-desktop-schemas.
Preparing to unpack .../118-gsettings-desktop-schemas_3.36.1-1_all.deb ...
Unpacking gsettings-desktop-schemas (3.36.1-1) ...
Selecting previously unselected package glib-networking:armhf.
Preparing to unpack .../119-glib-networking_2.64.3-2_armhf.deb ...
Unpacking glib-networking:armhf (2.64.3-2) ...
Selecting previously unselected package libpsl5:armhf.
Preparing to unpack .../120-libpsl5_0.21.0-1.1_armhf.deb ...
Unpacking libpsl5:armhf (0.21.0-1.1) ...
Selecting previously unselected package libsoup2.4-1:armhf.
Preparing to unpack .../121-libsoup2.4-1_2.70.0-1_armhf.deb ...
Unpacking libsoup2.4-1:armhf (2.70.0-1) ...
Selecting previously unselected package libsoup-gnome2.4-1:armhf.
Preparing to unpack .../122-libsoup-gnome2.4-1_2.70.0-1_armhf.deb ...
Unpacking libsoup-gnome2.4-1:armhf (2.70.0-1) ...
Selecting previously unselected package librest-0.7-0:armhf.
Preparing to unpack .../123-librest-0.7-0_0.8.1-1_armhf.deb ...
Unpacking librest-0.7-0:armhf (0.8.1-1) ...
Selecting previously unselected package libwayland-client0:armhf.
Preparing to unpack .../124-libwayland-client0_1.18.0-2~exp1_armhf.deb ...
Unpacking libwayland-client0:armhf (1.18.0-2~exp1) ...
Selecting previously unselected package libwayland-cursor0:armhf.
Preparing to unpack .../125-libwayland-cursor0_1.18.0-2~exp1_armhf.deb ...
Unpacking libwayland-cursor0:armhf (1.18.0-2~exp1) ...
Selecting previously unselected package libwayland-egl1:armhf.
Preparing to unpack .../126-libwayland-egl1_1.18.0-2~exp1_armhf.deb ...
Unpacking libwayland-egl1:armhf (1.18.0-2~exp1) ...
Selecting previously unselected package libxcomposite1:armhf.
Preparing to unpack .../127-libxcomposite1_1%3a0.4.5-1_armhf.deb ...
Unpacking libxcomposite1:armhf (1:0.4.5-1) ...
Selecting previously unselected package libxfixes3:armhf.
Preparing to unpack .../128-libxfixes3_1%3a5.0.3-2_armhf.deb ...
Unpacking libxfixes3:armhf (1:5.0.3-2) ...
Selecting previously unselected package libxcursor1:armhf.
Preparing to unpack .../129-libxcursor1_1%3a1.2.0-2_armhf.deb ...
Unpacking libxcursor1:armhf (1:1.2.0-2) ...
Selecting previously unselected package libxdamage1:armhf.
Preparing to unpack .../130-libxdamage1_1%3a1.1.5-2_armhf.deb ...
Unpacking libxdamage1:armhf (1:1.1.5-2) ...
Selecting previously unselected package libxi6:armhf.
Preparing to unpack .../131-libxi6_2%3a1.7.10-1_armhf.deb ...
Unpacking libxi6:armhf (2:1.7.10-1) ...
Selecting previously unselected package libxinerama1:armhf.
Preparing to unpack .../132-libxinerama1_2%3a1.1.4-2_armhf.deb ...
Unpacking libxinerama1:armhf (2:1.1.4-2) ...
Selecting previously unselected package xkb-data.
Preparing to unpack .../133-xkb-data_2.29-2_all.deb ...
Unpacking xkb-data (2.29-2) ...
Selecting previously unselected package libxkbcommon0:armhf.
Preparing to unpack .../134-libxkbcommon0_0.10.0-1_armhf.deb ...
Unpacking libxkbcommon0:armhf (0.10.0-1) ...
Selecting previously unselected package libxrandr2:armhf.
Preparing to unpack .../135-libxrandr2_2%3a1.5.1-1_armhf.deb ...
Unpacking libxrandr2:armhf (2:1.5.1-1) ...
Selecting previously unselected package libgtk-3-common.
Preparing to unpack .../136-libgtk-3-common_3.24.22-1_all.deb ...
Unpacking libgtk-3-common (3.24.22-1) ...
Selecting previously unselected package libgtk-3-0:armhf.
Preparing to unpack .../137-libgtk-3-0_3.24.22-1_armhf.deb ...
Unpacking libgtk-3-0:armhf (3.24.22-1) ...
Selecting previously unselected package x11-common.
Preparing to unpack .../138-x11-common_1%3a7.7+20_all.deb ...
Unpacking x11-common (1:7.7+20) ...
Selecting previously unselected package libice6:armhf.
Preparing to unpack .../139-libice6_2%3a1.0.9-2_armhf.deb ...
Unpacking libice6:armhf (2:1.0.9-2) ...
Selecting previously unselected package m17n-db.
Preparing to unpack .../140-m17n-db_1.8.0-3_all.deb ...
Unpacking m17n-db (1.8.0-3) ...
Selecting previously unselected package libxpm4:armhf.
Preparing to unpack .../141-libxpm4_1%3a3.5.12-1_armhf.deb ...
Unpacking libxpm4:armhf (1:3.5.12-1) ...
Selecting previously unselected package libgd3:armhf.
Preparing to unpack .../142-libgd3_2.3.0-2_armhf.deb ...
Unpacking libgd3:armhf (2.3.0-2) ...
Selecting previously unselected package libotf0:armhf.
Preparing to unpack .../143-libotf0_0.9.13-7_armhf.deb ...
Unpacking libotf0:armhf (0.9.13-7) ...
Selecting previously unselected package libsm6:armhf.
Preparing to unpack .../144-libsm6_2%3a1.2.3-1_armhf.deb ...
Unpacking libsm6:armhf (2:1.2.3-1) ...
Selecting previously unselected package libxft2:armhf.
Preparing to unpack .../145-libxft2_2.3.2-2_armhf.deb ...
Unpacking libxft2:armhf (2.3.2-2) ...
Selecting previously unselected package libxt6:armhf.
Preparing to unpack .../146-libxt6_1%3a1.2.0-1_armhf.deb ...
Unpacking libxt6:armhf (1:1.2.0-1) ...
Selecting previously unselected package libm17n-0:armhf.
Preparing to unpack .../147-libm17n-0_1.8.0-2_armhf.deb ...
Unpacking libm17n-0:armhf (1.8.0-2) ...
Selecting previously unselected package librsvg2-2:armhf.
Preparing to unpack .../148-librsvg2-2_2.48.7-1_armhf.deb ...
Unpacking librsvg2-2:armhf (2.48.7-1) ...
Selecting previously unselected package emacs-gtk.
Preparing to unpack .../149-emacs-gtk_1%3a26.3+1-2_armhf.deb ...
Unpacking emacs-gtk (1:26.3+1-2) ...
Selecting previously unselected package fonts-lmodern.
Preparing to unpack .../150-fonts-lmodern_2.004.5-6_all.deb ...
Unpacking fonts-lmodern (2.004.5-6) ...
Selecting previously unselected package libtcl8.6:armhf.
Preparing to unpack .../151-libtcl8.6_8.6.10+dfsg-1_armhf.deb ...
Unpacking libtcl8.6:armhf (8.6.10+dfsg-1) ...
Selecting previously unselected package libxss1:armhf.
Preparing to unpack .../152-libxss1_1%3a1.2.3-1_armhf.deb ...
Unpacking libxss1:armhf (1:1.2.3-1) ...
Selecting previously unselected package libtk8.6:armhf.
Preparing to unpack .../153-libtk8.6_8.6.10-1_armhf.deb ...
Unpacking libtk8.6:armhf (8.6.10-1) ...
Selecting previously unselected package xemacs21-support.
Preparing to unpack .../154-xemacs21-support_21.4.24-9_all.deb ...
Unpacking xemacs21-support (21.4.24-9) ...
Selecting previously unselected package xemacs21-bin.
Preparing to unpack .../155-xemacs21-bin_21.4.24-9_armhf.deb ...
Unpacking xemacs21-bin (21.4.24-9) ...
Selecting previously unselected package libcanna1g.
Preparing to unpack .../156-libcanna1g_3.7p3-15_armhf.deb ...
Unpacking libcanna1g (3.7p3-15) ...
Selecting previously unselected package libcompfaceg1.
Preparing to unpack .../157-libcompfaceg1_1%3a1.5.2-5_armhf.deb ...
Unpacking libcompfaceg1 (1:1.5.2-5) ...
Selecting previously unselected package libxmu6:armhf.
Preparing to unpack .../158-libxmu6_2%3a1.1.2-2+b3_armhf.deb ...
Unpacking libxmu6:armhf (2:1.1.2-2+b3) ...
Selecting previously unselected package libxaw7:armhf.
Preparing to unpack .../159-libxaw7_2%3a1.0.13-1+b2_armhf.deb ...
Unpacking libxaw7:armhf (2:1.0.13-1+b2) ...
Selecting previously unselected package xemacs21-mulesupport.
Preparing to unpack .../160-xemacs21-mulesupport_2009.02.17.dfsg.2-5_all.deb ...
Unpacking xemacs21-mulesupport (2009.02.17.dfsg.2-5) ...
Selecting previously unselected package xemacs21-basesupport.
Preparing to unpack .../161-xemacs21-basesupport_2009.02.17.dfsg.2-5_all.deb ...
Unpacking xemacs21-basesupport (2009.02.17.dfsg.2-5) ...
Selecting previously unselected package xemacs21-mule-canna-wnn.
Preparing to unpack .../162-xemacs21-mule-canna-wnn_21.4.24-9_armhf.deb ...
Unpacking xemacs21-mule-canna-wnn (21.4.24-9) ...
Selecting previously unselected package gcl.
Preparing to unpack .../163-gcl_2.6.12-95+rpi1_armhf.deb ...
Unpacking gcl (2.6.12-95+rpi1) ...
Selecting previously unselected package libgmpxx4ldbl:armhf.
Preparing to unpack .../164-libgmpxx4ldbl_2%3a6.2.0+dfsg-6_armhf.deb ...
Unpacking libgmpxx4ldbl:armhf (2:6.2.0+dfsg-6) ...
Selecting previously unselected package libgmp-dev:armhf.
Preparing to unpack .../165-libgmp-dev_2%3a6.2.0+dfsg-6_armhf.deb ...
Unpacking libgmp-dev:armhf (2:6.2.0+dfsg-6) ...
Selecting previously unselected package libgmp3-dev:armhf.
Preparing to unpack .../166-libgmp3-dev_2%3a6.2.0+dfsg-6_armhf.deb ...
Unpacking libgmp3-dev:armhf (2:6.2.0+dfsg-6) ...
Selecting previously unselected package xorg-sgml-doctools.
Preparing to unpack .../167-xorg-sgml-doctools_1%3a1.11-1_all.deb ...
Unpacking xorg-sgml-doctools (1:1.11-1) ...
Selecting previously unselected package x11proto-dev.
Preparing to unpack .../168-x11proto-dev_2020.1-1_all.deb ...
Unpacking x11proto-dev (2020.1-1) ...
Selecting previously unselected package x11proto-core-dev.
Preparing to unpack .../169-x11proto-core-dev_2020.1-1_all.deb ...
Unpacking x11proto-core-dev (2020.1-1) ...
Selecting previously unselected package libice-dev:armhf.
Preparing to unpack .../170-libice-dev_2%3a1.0.9-2_armhf.deb ...
Unpacking libice-dev:armhf (2:1.0.9-2) ...
Selecting previously unselected package libkpathsea6:armhf.
Preparing to unpack .../171-libkpathsea6_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking libkpathsea6:armhf (2020.20200327.54578-4+b1) ...
Selecting previously unselected package libncurses6:armhf.
Preparing to unpack .../172-libncurses6_6.2-1_armhf.deb ...
Unpacking libncurses6:armhf (6.2-1) ...
Selecting previously unselected package libncurses-dev:armhf.
Preparing to unpack .../173-libncurses-dev_6.2-1_armhf.deb ...
Unpacking libncurses-dev:armhf (6.2-1) ...
Selecting previously unselected package libpaper1:armhf.
Preparing to unpack .../174-libpaper1_1.1.28_armhf.deb ...
Unpacking libpaper1:armhf (1.1.28) ...
Selecting previously unselected package libpaper-utils.
Preparing to unpack .../175-libpaper-utils_1.1.28_armhf.deb ...
Unpacking libpaper-utils (1.1.28) ...
Selecting previously unselected package libptexenc1:armhf.
Preparing to unpack .../176-libptexenc1_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking libptexenc1:armhf (2020.20200327.54578-4+b1) ...
Selecting previously unselected package libpthread-stubs0-dev:armhf.
Preparing to unpack .../177-libpthread-stubs0-dev_0.4-1_armhf.deb ...
Unpacking libpthread-stubs0-dev:armhf (0.4-1) ...
Selecting previously unselected package libreadline-dev:armhf.
Preparing to unpack .../178-libreadline-dev_8.0-4_armhf.deb ...
Unpacking libreadline-dev:armhf (8.0-4) ...
Selecting previously unselected package libsm-dev:armhf.
Preparing to unpack .../179-libsm-dev_2%3a1.2.3-1_armhf.deb ...
Unpacking libsm-dev:armhf (2:1.2.3-1) ...
Selecting previously unselected package libsynctex2:armhf.
Preparing to unpack .../180-libsynctex2_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking libsynctex2:armhf (2020.20200327.54578-4+b1) ...
Selecting previously unselected package libteckit0:armhf.
Preparing to unpack .../181-libteckit0_2.5.8+ds2-5_armhf.deb ...
Unpacking libteckit0:armhf (2.5.8+ds2-5) ...
Selecting previously unselected package libtexlua53:armhf.
Preparing to unpack .../182-libtexlua53_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking libtexlua53:armhf (2020.20200327.54578-4+b1) ...
Selecting previously unselected package libtexluajit2:armhf.
Preparing to unpack .../183-libtexluajit2_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking libtexluajit2:armhf (2020.20200327.54578-4+b1) ...
Selecting previously unselected package libtext-unidecode-perl.
Preparing to unpack .../184-libtext-unidecode-perl_1.30-1_all.deb ...
Unpacking libtext-unidecode-perl (1.30-1) ...
Selecting previously unselected package libxau-dev:armhf.
Preparing to unpack .../185-libxau-dev_1%3a1.0.8-1+b2_armhf.deb ...
Unpacking libxau-dev:armhf (1:1.0.8-1+b2) ...
Selecting previously unselected package libxdmcp-dev:armhf.
Preparing to unpack .../186-libxdmcp-dev_1%3a1.1.2-3_armhf.deb ...
Unpacking libxdmcp-dev:armhf (1:1.1.2-3) ...
Selecting previously unselected package xtrans-dev.
Preparing to unpack .../187-xtrans-dev_1.4.0-1_all.deb ...
Unpacking xtrans-dev (1.4.0-1) ...
Selecting previously unselected package libxcb1-dev:armhf.
Preparing to unpack .../188-libxcb1-dev_1.14-2_armhf.deb ...
Unpacking libxcb1-dev:armhf (1.14-2) ...
Selecting previously unselected package libx11-dev:armhf.
Preparing to unpack .../189-libx11-dev_2%3a1.6.10-3_armhf.deb ...
Unpacking libx11-dev:armhf (2:1.6.10-3) ...
Selecting previously unselected package x11proto-xext-dev.
Preparing to unpack .../190-x11proto-xext-dev_2020.1-1_all.deb ...
Unpacking x11proto-xext-dev (2020.1-1) ...
Selecting previously unselected package libxext-dev:armhf.
Preparing to unpack .../191-libxext-dev_2%3a1.3.3-1+b2_armhf.deb ...
Unpacking libxext-dev:armhf (2:1.3.3-1+b2) ...
Selecting previously unselected package libxt-dev:armhf.
Preparing to unpack .../192-libxt-dev_1%3a1.2.0-1_armhf.deb ...
Unpacking libxt-dev:armhf (1:1.2.0-1) ...
Selecting previously unselected package libxmu-headers.
Preparing to unpack .../193-libxmu-headers_2%3a1.1.2-2_all.deb ...
Unpacking libxmu-headers (2:1.1.2-2) ...
Selecting previously unselected package libxmu-dev:armhf.
Preparing to unpack .../194-libxmu-dev_2%3a1.1.2-2+b3_armhf.deb ...
Unpacking libxmu-dev:armhf (2:1.1.2-2+b3) ...
Selecting previously unselected package libxpm-dev:armhf.
Preparing to unpack .../195-libxpm-dev_1%3a3.5.12-1_armhf.deb ...
Unpacking libxpm-dev:armhf (1:3.5.12-1) ...
Selecting previously unselected package libxaw7-dev:armhf.
Preparing to unpack .../196-libxaw7-dev_2%3a1.0.13-1+b2_armhf.deb ...
Unpacking libxaw7-dev:armhf (2:1.0.13-1+b2) ...
Selecting previously unselected package libxml-namespacesupport-perl.
Preparing to unpack .../197-libxml-namespacesupport-perl_1.12-1_all.deb ...
Unpacking libxml-namespacesupport-perl (1.12-1) ...
Selecting previously unselected package libxml-sax-base-perl.
Preparing to unpack .../198-libxml-sax-base-perl_1.09-1_all.deb ...
Unpacking libxml-sax-base-perl (1.09-1) ...
Selecting previously unselected package libxml-sax-perl.
Preparing to unpack .../199-libxml-sax-perl_1.02+dfsg-1_all.deb ...
Unpacking libxml-sax-perl (1.02+dfsg-1) ...
Selecting previously unselected package libxml-libxml-perl.
Preparing to unpack .../200-libxml-libxml-perl_2.0134+dfsg-2_armhf.deb ...
Unpacking libxml-libxml-perl (2.0134+dfsg-2) ...
Selecting previously unselected package libzzip-0-13:armhf.
Preparing to unpack .../201-libzzip-0-13_0.13.62-3.2_armhf.deb ...
Unpacking libzzip-0-13:armhf (0.13.62-3.2) ...
Selecting previously unselected package t1utils.
Preparing to unpack .../202-t1utils_1.41-4_armhf.deb ...
Unpacking t1utils (1.41-4) ...
Selecting previously unselected package texinfo.
Preparing to unpack .../203-texinfo_6.7.0.dfsg.2-5_armhf.deb ...
Unpacking texinfo (6.7.0.dfsg.2-5) ...
Selecting previously unselected package texlive-binaries.
Preparing to unpack .../204-texlive-binaries_2020.20200327.54578-4+b1_armhf.deb ...
Unpacking texlive-binaries (2020.20200327.54578-4+b1) ...
Selecting previously unselected package xdg-utils.
Preparing to unpack .../205-xdg-utils_1.1.3-2_all.deb ...
Unpacking xdg-utils (1.1.3-2) ...
Selecting previously unselected package texlive-base.
Preparing to unpack .../206-texlive-base_2020.20200804-2_all.deb ...
Unpacking texlive-base (2020.20200804-2) ...
Selecting previously unselected package texlive-latex-base.
Preparing to unpack .../207-texlive-latex-base_2020.20200804-2_all.deb ...
Unpacking texlive-latex-base (2020.20200804-2) ...
Selecting previously unselected package texlive-latex-recommended.
Preparing to unpack .../208-texlive-latex-recommended_2020.20200804-2_all.deb ...
Unpacking texlive-latex-recommended (2020.20200804-2) ...
Selecting previously unselected package sbuild-build-depends-acl2-dummy.
Preparing to unpack .../209-sbuild-build-depends-acl2-dummy_0.invalid.0_armhf.deb ...
Unpacking sbuild-build-depends-acl2-dummy (0.invalid.0) ...
Setting up libexpat1:armhf (2.2.9-1) ...
Setting up libpipeline1:armhf (1.5.3-1) ...
Setting up xemacs21-basesupport (2009.02.17.dfsg.2-5) ...
Setting up libgraphite2-3:armhf (1.3.14-1) ...
Setting up liblcms2-2:armhf (2.9-4) ...
Setting up libpixman-1-0:armhf (0.36.0-1) ...
Setting up libcanna1g (3.7p3-15) ...
Setting up systemd-sysv (246.2-1+rpi1) ...
Setting up libxau6:armhf (1:1.0.8-1+b2) ...
Setting up imagemagick-6-common (8:6.9.11.24+dfsg-1) ...
Setting up time (1.7-25.1) ...
Setting up libkeyutils1:armhf (1.6.1-2) ...
Setting up libproxy1v5:armhf (0.4.15-13) ...
Setting up libpsl5:armhf (0.21.0-1.1) ...
Setting up libgpm2:armhf (1.20.7-6) ...
Setting up hicolor-icon-theme (0.17-2) ...
Setting up libicu67:armhf (67.1-4) ...
Setting up libdatrie1:armhf (0.2.12-3+b3) ...
Setting up libmagic-mgc (1:5.38-5) ...
Setting up libtexlua53:armhf (2020.20200327.54578-4+b1) ...
Setting up libarchive-zip-perl (1.68-1) ...
Setting up libglib2.0-0:armhf (2.64.4-1) ...
Setting up libtexluajit2:armhf (2020.20200327.54578-4+b1) ...
Setting up libdebhelper-perl (13.2) ...
Setting up libbrotli1:armhf (1.0.7-7) ...
Setting up libgdk-pixbuf2.0-common (2.40.0+dfsg-5) ...
Setting up x11-common (1:7.7+20) ...
update-rc.d: warning: start and stop actions are no longer supported; falling back to defaults
Running in chroot, ignoring request.
invoke-rc.d: policy-rc.d denied execution of start.
Setting up libmagic1:armhf (1:5.38-5) ...
Setting up libx265-192:armhf (3.4-2) ...
Setting up m17n-db (1.8.0-3) ...
Setting up libxml-namespacesupport-perl (1.12-1) ...
Setting up gettext-base (0.19.8.1-10) ...
Setting up xkb-data (2.29-2) ...
Setting up libcompfaceg1 (1:1.5.2-5) ...
Setting up libzzip-0-13:armhf (0.13.62-3.2) ...
Setting up file (1:5.38-5) ...
Setting up libpthread-stubs0-dev:armhf (0.4-1) ...
Setting up libjbig0:armhf (2.1-3.1+b2) ...
Setting up libcolord2:armhf (1.4.4-2) ...
Setting up libkrb5support0:armhf (1.17-10+b3) ...
Setting up libdconf1:armhf (0.36.0-1) ...
Setting up libasound2-data (1.2.3.2-1) ...
Setting up libxml-sax-base-perl (1.09-1) ...
Setting up xtrans-dev (1.4.0-1) ...
Setting up autotools-dev (20180224.1) ...
Setting up libgmpxx4ldbl:armhf (2:6.2.0+dfsg-6) ...
Setting up libjpeg62-turbo:armhf (1:2.0.5-1.1) ...
Setting up emacsen-common (3.0.4) ...
Setting up libx11-data (2:1.6.10-3) ...
Setting up libepoxy0:armhf (1.5.4-1) ...
Setting up libteckit0:armhf (2.5.8+ds2-5) ...
Setting up libavahi-common-data:armhf (0.8-3+b2) ...
Setting up libncurses6:armhf (6.2-1) ...
Setting up libdbus-1-3:armhf (1.12.20-1+b3) ...
Setting up dbus (1.12.20-1+b3) ...
Running in chroot, ignoring request.
invoke-rc.d: policy-rc.d denied execution of start.
Setting up libsigsegv2:armhf (2.12-2) ...
Setting up libfribidi0:armhf (1.0.8-2) ...
Setting up t1utils (1.41-4) ...
Setting up libpng16-16:armhf (1.6.37-2) ...
Setting up libtcl8.6:armhf (8.6.10+dfsg-1) ...
Setting up autopoint (0.19.8.1-10) ...
Setting up libwebp6:armhf (0.6.1-2) ...
Setting up fonts-dejavu-core (2.37-2) ...
Setting up ucf (3.0043) ...
Setting up libk5crypto3:armhf (1.17-10+b3) ...
Setting up libltdl7:armhf (2.4.6-14) ...
Setting up libfftw3-double3:armhf (3.3.8-2) ...
Setting up libkpathsea6:armhf (2020.20200327.54578-4+b1) ...
Setting up libgif7:armhf (5.1.9-1) ...
Setting up libatk1.0-data (2.36.0-2) ...
Setting up liblqr-1-0:armhf (0.4.2-2.1) ...
Setting up libuchardet0:armhf (0.0.7-1) ...
Setting up libasound2:armhf (1.2.3.2-1) ...
Setting up libpam-systemd:armhf (246.2-1+rpi1) ...
Setting up fonts-lmodern (2.004.5-6) ...
Setting up libopenjp2-7:armhf (2.3.1-1) ...
Setting up libsub-override-perl (0.09-2) ...
Setting up libthai-data (0.1.28-3) ...
Setting up xorg-sgml-doctools (1:1.11-1) ...
Setting up libjson-glib-1.0-common (1.4.4-2) ...
Setting up libatk1.0-0:armhf (2.36.0-2) ...
Setting up libkrb5-3:armhf (1.17-10+b3) ...
Setting up libtiff5:armhf (4.1.0+git191117-2) ...
Setting up libwayland-egl1:armhf (1.18.0-2~exp1) ...
Setting up glib-networking-common (2.64.3-2) ...
Setting up xemacs21-support (21.4.24-9) ...
Setting up emacs-common (1:26.3+1-2) ...
Setting up libtext-unidecode-perl (1.30-1) ...
Setting up libde265-0:armhf (1.0.4-1+rpi1) ...
Setting up xemacs21-mulesupport (2009.02.17.dfsg.2-5) ...
Setting up libwebpmux3:armhf (0.6.1-2) ...
Setting up libbsd0:armhf (0.10.0-1) ...
Setting up libelf1:armhf (0.180-1) ...
Setting up libxml2:armhf (2.9.10+dfsg-5+b1) ...
Setting up xdg-utils (1.1.3-2) ...
Setting up libsynctex2:armhf (2020.20200327.54578-4+b1) ...
Setting up libxkbcommon0:armhf (0.10.0-1) ...
Setting up libwayland-client0:armhf (1.18.0-2~exp1) ...
Setting up x11proto-dev (2020.1-1) ...
Setting up libfile-stripnondeterminism-perl (1.9.0-1) ...
Setting up glib-networking-services (2.64.3-2) ...
Setting up libpaper1:armhf (1.1.28) ...
Creating config file /etc/papersize with new version
Setting up libice6:armhf (2:1.0.9-2) ...
Setting up libxdmcp6:armhf (1:1.1.2-3) ...
Setting up libncurses-dev:armhf (6.2-1) ...
Setting up libxcb1:armhf (1.14-2) ...
Setting up libgmp-dev:armhf (2:6.2.0+dfsg-6) ...
Setting up libxau-dev:armhf (1:1.0.8-1+b2) ...
Setting up libice-dev:armhf (2:1.0.9-2) ...
Setting up libtool (2.4.6-14) ...
Setting up libxcb-render0:armhf (1.14-2) ...
Setting up fontconfig-config (2.13.1-4.2) ...
Setting up libwebpdemux2:armhf (0.6.1-2) ...
Setting up libheif1:armhf (1.6.1-1+b1) ...
Setting up libavahi-common3:armhf (0.8-3+b2) ...
Setting up m4 (1.4.18-4) ...
Setting up libxcb-shm0:armhf (1.14-2) ...
Setting up libpaper-utils (1.1.28) ...
Setting up libreadline-dev:armhf (8.0-4) ...
Setting up libxml-sax-perl (1.02+dfsg-1) ...
update-perl-sax-parsers: Registering Perl SAX parser XML::SAX::PurePerl with priority 10...
update-perl-sax-parsers: Updating overall Perl SAX parser modules info file...
Creating config file /etc/perl/XML/SAX/ParserDetails.ini with new version
Setting up libjson-glib-1.0-0:armhf (1.4.4-2) ...
Setting up tex-common (6.15) ...
update-language: texlive-base not installed and configured, doing nothing!
Setting up libthai0:armhf (0.1.28-3) ...
Setting up dbus-user-session (1.12.20-1+b3) ...
Setting up libxdmcp-dev:armhf (1:1.1.2-3) ...
Setting up libptexenc1:armhf (2020.20200327.54578-4+b1) ...
Setting up libfreetype6:armhf (2.10.2+dfsg-3) ...
Setting up xemacs21-bin (21.4.24-9) ...
update-alternatives: using /usr/lib/xemacs-21.4.24/arm-linux-gnueabihf/movemail to provide /usr/bin/movemail (movemail) in auto mode
update-alternatives: using /usr/lib/xemacs-21.4.24/arm-linux-gnueabihf/mmencode to provide /usr/bin/mmencode (mmencode) in auto mode
update-alternatives: using /usr/bin/b2m.xemacs21 to provide /usr/bin/b2m (b2m) in auto mode
update-alternatives: using /usr/bin/etags.xemacs21 to provide /usr/bin/etags (etags) in auto mode
update-alternatives: using /usr/bin/gnuclient.xemacs21 to provide /usr/bin/gnuclient (gnuclient) in auto mode
update-alternatives: using /usr/bin/gnuattach.xemacs21 to provide /usr/bin/gnuattach (gnuattach) in auto mode
update-alternatives: using /usr/bin/gnudoit.xemacs21 to provide /usr/bin/gnudoit (gnudoit) in auto mode
update-alternatives: using /usr/bin/rcs-checkin.xemacs21 to provide /usr/bin/rcs-checkin (rcs-checkin) in auto mode
update-alternatives: using /usr/bin/ellcc.xemacs21 to provide /usr/bin/ellcc (ellcc) in auto mode
Setting up x11proto-core-dev (2020.1-1) ...
Setting up shared-mime-info (1.15-1) ...
Setting up libgssapi-krb5-2:armhf (1.17-10+b3) ...
Setting up libcroco3:armhf (0.6.13-1) ...
Setting up autoconf (2.69-11.1) ...
Setting up libxml-libxml-perl (2.0134+dfsg-2) ...
update-perl-sax-parsers: Registering Perl SAX parser XML::LibXML::SAX::Parser with priority 50...
update-perl-sax-parsers: Registering Perl SAX parser XML::LibXML::SAX with priority 50...
update-perl-sax-parsers: Updating overall Perl SAX parser modules info file...
Replacing config file /etc/perl/XML/SAX/ParserDetails.ini with new version
Setting up dh-strip-nondeterminism (1.9.0-1) ...
Setting up x11proto-xext-dev (2020.1-1) ...
Setting up dwz (0.13-5) ...
Setting up groff-base (1.22.4-5) ...
Setting up libwayland-cursor0:armhf (1.18.0-2~exp1) ...
Setting up libgmp3-dev:armhf (2:6.2.0+dfsg-6) ...
Setting up emacs-bin-common (1:26.3+1-2) ...
update-alternatives: using /usr/bin/ctags.emacs to provide /usr/bin/ctags (ctags) in auto mode
update-alternatives: using /usr/bin/ebrowse.emacs to provide /usr/bin/ebrowse (ebrowse) in auto mode
update-alternatives: using /usr/bin/emacsclient.emacs to provide /usr/bin/emacsclient (emacsclient) in auto mode
Setting up libx11-6:armhf (2:1.6.10-3) ...
Setting up libharfbuzz0b:armhf (2.6.7-1) ...
Setting up libfontconfig1:armhf (2.13.1-4.2) ...
Setting up libxcomposite1:armhf (1:0.4.5-1) ...
Setting up libsm6:armhf (2:1.2.3-1) ...
Setting up libavahi-client3:armhf (0.8-3+b2) ...
Setting up automake (1:1.16.2-3) ...
update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode
Setting up fontconfig (2.13.1-4.2) ...
Regenerating fonts cache... done.
Setting up libotf0:armhf (0.9.13-7) ...
Setting up gettext (0.19.8.1-10) ...
Setting up libxdamage1:armhf (1:1.1.5-2) ...
Setting up libxcb1-dev:armhf (1.14-2) ...
Setting up libxpm4:armhf (1:3.5.12-1) ...
Setting up libxrender1:armhf (1:0.9.10-1) ...
Setting up libsm-dev:armhf (2:1.2.3-1) ...
Setting up libpango-1.0-0:armhf (1.46.0-2) ...
Setting up libx11-dev:armhf (2:1.6.10-3) ...
Setting up libxext6:armhf (2:1.3.3-1+b2) ...
Setting up dconf-service (0.36.0-1) ...
Setting up libatspi2.0-0:armhf (2.36.0-3) ...
Setting up man-db (2.9.3-2) ...
Not building database; man-db/auto-update is not 'true'.
Created symlink /etc/systemd/system/timers.target.wants/man-db.timer -> /lib/systemd/system/man-db.timer.
Setting up libcairo2:armhf (1.16.0-4) ...
Setting up intltool-debian (0.35.0+20060710.5) ...
Setting up libatk-bridge2.0-0:armhf (2.34.1-3) ...
Setting up libmagickcore-6.q16-6:armhf (8:6.9.11.24+dfsg-1+b1) ...
Setting up libxfixes3:armhf (1:5.0.3-2) ...
Setting up libgdk-pixbuf2.0-0:armhf (2.40.0+dfsg-5) ...
Setting up libxinerama1:armhf (2:1.1.4-2) ...
Setting up libxpm-dev:armhf (1:3.5.12-1) ...
Setting up libgd3:armhf (2.3.0-2) ...
Setting up libxrandr2:armhf (2:1.5.1-1) ...
Setting up libxt6:armhf (1:1.2.0-1) ...
Setting up texinfo (6.7.0.dfsg.2-5) ...
Running mktexlsr. This may take some time. ... done.
Setting up libxext-dev:armhf (2:1.3.3-1+b2) ...
Setting up libcups2:armhf (2.3.3-2) ...
Setting up libmagickwand-6.q16-6:armhf (8:6.9.11.24+dfsg-1+b1) ...
Setting up libcairo-gobject2:armhf (1.16.0-4) ...
Setting up libxss1:armhf (1:1.2.3-1) ...
Setting up libpangoft2-1.0-0:armhf (1.46.0-2) ...
Setting up libpangocairo-1.0-0:armhf (1.46.0-2) ...
Setting up gtk-update-icon-cache (3.24.22-1) ...
Setting up libxft2:armhf (2.3.2-2) ...
Setting up libxmu-headers (2:1.1.2-2) ...
Setting up libxmu6:armhf (2:1.1.2-2+b3) ...
Setting up libxi6:armhf (2:1.7.10-1) ...
Setting up dconf-gsettings-backend:armhf (0.36.0-1) ...
Setting up po-debconf (1.0.21) ...
Setting up libtk8.6:armhf (8.6.10-1) ...
Setting up libxcursor1:armhf (1:1.2.0-2) ...
Setting up libm17n-0:armhf (1.8.0-2) ...
Setting up libxaw7:armhf (2:1.0.13-1+b2) ...
Setting up librsvg2-2:armhf (2.48.7-1) ...
Setting up adwaita-icon-theme (3.36.1-2) ...
update-alternatives: using /usr/share/icons/Adwaita/cursor.theme to provide /usr/share/icons/default/index.theme (x-cursor-theme) in auto mode
Setting up libxt-dev:armhf (1:1.2.0-1) ...
Setting up texlive-binaries (2020.20200327.54578-4+b1) ...
update-alternatives: using /usr/bin/xdvi-xaw to provide /usr/bin/xdvi.bin (xdvi.bin) in auto mode
update-alternatives: using /usr/bin/bibtex.original to provide /usr/bin/bibtex (bibtex) in auto mode
Setting up texlive-base (2020.20200804-2) ...
tl-paper: setting paper size for dvips to a4: /var/lib/texmf/dvips/config/config-paper.ps
tl-paper: setting paper size for dvipdfmx to a4: /var/lib/texmf/dvipdfmx/dvipdfmx-paper.cfg
tl-paper: setting paper size for xdvi to a4: /var/lib/texmf/xdvi/XDvi-paper
tl-paper: setting paper size for pdftex to a4: /var/lib/texmf/tex/generic/config/pdftexconfig.tex
Setting up libgtk-3-common (3.24.22-1) ...
Setting up gsettings-desktop-schemas (3.36.1-1) ...
Setting up xemacs21-mule-canna-wnn (21.4.24-9) ...
update-alternatives: using /usr/bin/xemacs21-mule-canna-wnn to provide /usr/bin/xemacs21 (xemacs21) in auto mode
Install emacsen-common for xemacs21
emacsen-common: Handling install of emacsen flavor xemacs21
Loading /usr/share/emacsen-common/debian-startup...
Loading 00debian...
Compiling /usr/share/xemacs21/site-lisp/debian-startup.el...
Wrote /usr/share/xemacs21/site-lisp/debian-startup.elc
Done
Setting up libxmu-dev:armhf (2:1.1.2-2+b3) ...
Setting up texlive-latex-base (2020.20200804-2) ...
Setting up texlive-latex-recommended (2020.20200804-2) ...
Setting up libxaw7-dev:armhf (2:1.0.13-1+b2) ...
Setting up gcl (2.6.12-95+rpi1) ...
Creating config file /etc/default/gcl with new version
Install gcl for xemacs21
install/gcl: Handling install for emacsen flavor xemacs21
Loading /usr/share/emacsen-common/debian-startup...
Loading 00debian...
Compiling /usr/share/xemacs21/site-lisp/gcl/add-default.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/add-default.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/ansi-doc.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/ansi-doc.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/dbl.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/dbl.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/default.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/default.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/doc-to-texi.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/doc-to-texi.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/gcl.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/gcl.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/man1-to-texi.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/man1-to-texi.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/smart-complete.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/smart-complete.elc
Compiling /usr/share/xemacs21/site-lisp/gcl/sshell.el...
Wrote /usr/share/xemacs21/site-lisp/gcl/sshell.elc
Done
Setting up glib-networking:armhf (2.64.3-2) ...
Setting up libsoup2.4-1:armhf (2.70.0-1) ...
Setting up libsoup-gnome2.4-1:armhf (2.70.0-1) ...
Setting up librest-0.7-0:armhf (0.8.1-1) ...
Setting up libgtk-3-0:armhf (3.24.22-1) ...
Setting up emacs-gtk (1:26.3+1-2) ...
update-alternatives: using /usr/bin/emacs-gtk to provide /usr/bin/emacs (emacs) in auto mode
update-alternatives: using /usr/bin/emacs to provide /usr/bin/editor (editor) in auto mode
Install emacsen-common for emacs
emacsen-common: Handling install of emacsen flavor emacs
Install gcl for emacs
Setting up debhelper (13.2) ...
Setting up sbuild-build-depends-acl2-dummy (0.invalid.0) ...
Setting up dh-autoreconf (19) ...
Processing triggers for install-info (6.7.0.dfsg.2-5) ...
install-info: warning: no info dir entry in `/usr/share/info/automake-history.info.gz'
Processing triggers for libc-bin (2.31-3+rpi1) ...
Processing triggers for systemd (246.2-1+rpi1) ...
Processing triggers for tex-common (6.15) ...
Running updmap-sys. This may take some time... done.
Running mktexlsr /var/lib/texmf ... done.
Building format(s) --all.
This may take some time... done.
W: No sandbox user '_apt' on the system, can not drop privileges
+------------------------------------------------------------------------------+
| Build environment |
+------------------------------------------------------------------------------+
Kernel: Linux 4.15.0-76-generic armhf (armv8l)
Toolchain package versions: binutils_2.35-1+rpi1 dpkg-dev_1.20.5+rpi1 g++-10_10.1.0-6+rpi1 gcc-10_10.1.0-6+rpi1 libc6-dev_2.31-3+rpi1 libstdc++-10-dev_10.1.0-6+rpi1 libstdc++6_10.1.0-6+rpi1 linux-libc-dev_5.7.10-1+rpi1
Package versions: adduser_3.118 adwaita-icon-theme_3.36.1-2 apt_2.1.10 aptitude_0.8.13-1+b1 aptitude-common_0.8.13-1 autoconf_2.69-11.1 automake_1:1.16.2-3 autopoint_0.19.8.1-10 autotools-dev_20180224.1 base-files_11+rpi1 base-passwd_3.5.47 bash_5.0-7 binutils_2.35-1+rpi1 binutils-arm-linux-gnueabihf_2.35-1+rpi1 binutils-common_2.35-1+rpi1 bsdextrautils_2.36-2 bsdutils_1:2.36-2 build-essential_12.8 bzip2_1.0.8-4 coreutils_8.30-3 cpp_4:10.1.0-1+rpi1 cpp-10_10.1.0-6+rpi1 dash_0.5.10.2-7 dbus_1.12.20-1+b3 dbus-user-session_1.12.20-1+b3 dconf-gsettings-backend_0.36.0-1 dconf-service_0.36.0-1 debconf_1.5.74 debhelper_13.2 debianutils_4.9.1 dh-autoreconf_19 dh-strip-nondeterminism_1.9.0-1 diffutils_1:3.7-3 dirmngr_2.2.20-1 dmsetup_2:1.02.171-3 dpkg_1.20.5+rpi1 dpkg-dev_1.20.5+rpi1 dwz_0.13-5 e2fsprogs_1.45.6-1 emacs-bin-common_1:26.3+1-2 emacs-common_1:26.3+1-2 emacs-gtk_1:26.3+1-2 emacsen-common_3.0.4 fakeroot_1.24-1 fdisk_2.36-2 file_1:5.38-5 findutils_4.7.0-1 fontconfig_2.13.1-4.2 fontconfig-config_2.13.1-4.2 fonts-dejavu-core_2.37-2 fonts-lmodern_2.004.5-6 g++_4:10.1.0-1+rpi1 g++-10_10.1.0-6+rpi1 gcc_4:10.1.0-1+rpi1 gcc-10_10.1.0-6+rpi1 gcc-10-base_10.1.0-6+rpi1 gcl_2.6.12-95+rpi1 gettext_0.19.8.1-10 gettext-base_0.19.8.1-10 glib-networking_2.64.3-2 glib-networking-common_2.64.3-2 glib-networking-services_2.64.3-2 gnupg_2.2.20-1 gnupg-l10n_2.2.20-1 gnupg-utils_2.2.20-1 gpg_2.2.20-1 gpg-agent_2.2.20-1 gpg-wks-client_2.2.20-1 gpg-wks-server_2.2.20-1 gpgconf_2.2.20-1 gpgsm_2.2.20-1 gpgv_2.2.20-1 grep_3.4-1 groff-base_1.22.4-5 gsettings-desktop-schemas_3.36.1-1 gtk-update-icon-cache_3.24.22-1 gzip_1.10-2 hicolor-icon-theme_0.17-2 hostname_3.23 imagemagick-6-common_8:6.9.11.24+dfsg-1 init-system-helpers_1.58 install-info_6.7.0.dfsg.2-5 intltool-debian_0.35.0+20060710.5 iputils-ping_3:20190709-3 libacl1_2.2.53-8 libapparmor1_2.13.4-3+b1 libapt-pkg6.0_2.1.10 libarchive-zip-perl_1.68-1 libargon2-1_0~20171227-0.2 libasan6_10.1.0-6+rpi1 libasound2_1.2.3.2-1 libasound2-data_1.2.3.2-1 libassuan0_2.5.3-7.1 libatk-bridge2.0-0_2.34.1-3 libatk1.0-0_2.36.0-2 libatk1.0-data_2.36.0-2 libatomic1_10.1.0-6+rpi1 libatspi2.0-0_2.36.0-3 libattr1_1:2.4.48-5 libaudit-common_1:2.8.5-3 libaudit1_1:2.8.5-3 libavahi-client3_0.8-3+b2 libavahi-common-data_0.8-3+b2 libavahi-common3_0.8-3+b2 libbinutils_2.35-1+rpi1 libblkid1_2.36-2 libboost-iostreams1.71.0_1.71.0-6+b1 libbrotli1_1.0.7-7 libbsd0_0.10.0-1 libbz2-1.0_1.0.8-4 libc-bin_2.31-3+rpi1 libc-dev-bin_2.31-3+rpi1 libc6_2.31-3+rpi1 libc6-dev_2.31-3+rpi1 libcairo-gobject2_1.16.0-4 libcairo2_1.16.0-4 libcanna1g_3.7p3-15 libcap-ng0_0.7.9-2.2 libcap2_1:2.42-2 libcap2-bin_1:2.42-2 libcc1-0_10.1.0-6+rpi1 libcolord2_1.4.4-2 libcom-err2_1.45.6-1 libcompfaceg1_1:1.5.2-5 libcroco3_0.6.13-1 libcrypt-dev_1:4.4.16-1 libcrypt1_1:4.4.16-1 libcryptsetup12_2:2.3.3-2 libctf-nobfd0_2.35-1+rpi1 libctf0_2.35-1+rpi1 libcups2_2.3.3-2 libcwidget4_0.5.18-5 libdatrie1_0.2.12-3+b3 libdb5.3_5.3.28+dfsg1-0.6 libdbus-1-3_1.12.20-1+b3 libdconf1_0.36.0-1 libde265-0_1.0.4-1+rpi1 libdebconfclient0_0.253 libdebhelper-perl_13.2 libdevmapper1.02.1_2:1.02.171-3 libdpkg-perl_1.20.5+rpi1 libelf1_0.180-1 libepoxy0_1.5.4-1 libexpat1_2.2.9-1 libext2fs2_1.45.6-1 libfakeroot_1.24-1 libfdisk1_2.36-2 libffi7_3.3-4 libfftw3-double3_3.3.8-2 libfile-stripnondeterminism-perl_1.9.0-1 libfontconfig1_2.13.1-4.2 libfreetype6_2.10.2+dfsg-3 libfribidi0_1.0.8-2 libgcc-10-dev_10.1.0-6+rpi1 libgcc-s1_10.1.0-6+rpi1 libgcrypt20_1.8.6-2 libgd3_2.3.0-2 libgdbm-compat4_1.18.1-5 libgdbm6_1.18.1-5 libgdk-pixbuf2.0-0_2.40.0+dfsg-5 libgdk-pixbuf2.0-common_2.40.0+dfsg-5 libgif7_5.1.9-1 libglib2.0-0_2.64.4-1 libgmp-dev_2:6.2.0+dfsg-6 libgmp10_2:6.2.0+dfsg-6 libgmp3-dev_2:6.2.0+dfsg-6 libgmpxx4ldbl_2:6.2.0+dfsg-6 libgnutls30_3.6.14-2+b1 libgomp1_10.1.0-6+rpi1 libgpg-error0_1.38-2 libgpm2_1.20.7-6 libgraphite2-3_1.3.14-1 libgssapi-krb5-2_1.17-10+b3 libgtk-3-0_3.24.22-1 libgtk-3-common_3.24.22-1 libharfbuzz0b_2.6.7-1 libheif1_1.6.1-1+b1 libhogweed6_3.6-2 libice-dev_2:1.0.9-2 libice6_2:1.0.9-2 libicu67_67.1-4 libidn2-0_2.3.0-1 libip4tc2_1.8.5-3 libisl22_0.22.1-1 libjbig0_2.1-3.1+b2 libjpeg62-turbo_1:2.0.5-1.1 libjson-c5_0.15-1 libjson-glib-1.0-0_1.4.4-2 libjson-glib-1.0-common_1.4.4-2 libk5crypto3_1.17-10+b3 libkeyutils1_1.6.1-2 libkmod2_27+20200310-2 libkpathsea6_2020.20200327.54578-4+b1 libkrb5-3_1.17-10+b3 libkrb5support0_1.17-10+b3 libksba8_1.4.0-2 liblcms2-2_2.9-4 libldap-2.4-2_2.4.50+dfsg-1+b1 libldap-common_2.4.50+dfsg-1 liblqr-1-0_0.4.2-2.1 libltdl7_2.4.6-14 liblz4-1_1.9.2-2 liblzma5_5.2.4-1 libm17n-0_1.8.0-2 libmagic-mgc_1:5.38-5 libmagic1_1:5.38-5 libmagickcore-6.q16-6_8:6.9.11.24+dfsg-1+b1 libmagickwand-6.q16-6_8:6.9.11.24+dfsg-1+b1 libmount1_2.36-2 libmpc3_1.1.0-1 libmpfr6_4.0.2-1 libncurses-dev_6.2-1 libncurses6_6.2-1 libncursesw6_6.2-1 libnettle8_3.6-2 libnpth0_1.6-2 libopenjp2-7_2.3.1-1 libotf0_0.9.13-7 libp11-kit0_0.23.20-1 libpam-cap_1:2.42-2 libpam-modules_1.3.1-5 libpam-modules-bin_1.3.1-5 libpam-runtime_1.3.1-5 libpam-systemd_246.2-1+rpi1 libpam0g_1.3.1-5 libpango-1.0-0_1.46.0-2 libpangocairo-1.0-0_1.46.0-2 libpangoft2-1.0-0_1.46.0-2 libpaper-utils_1.1.28 libpaper1_1.1.28 libpcre2-8-0_10.34-7 libpcre3_2:8.39-13 libperl5.30_5.30.3-4 libpipeline1_1.5.3-1 libpixman-1-0_0.36.0-1 libpng16-16_1.6.37-2 libproxy1v5_0.4.15-13 libpsl5_0.21.0-1.1 libptexenc1_2020.20200327.54578-4+b1 libpthread-stubs0-dev_0.4-1 libreadline-dev_8.0-4 libreadline8_8.0-4 librest-0.7-0_0.8.1-1 librsvg2-2_2.48.7-1 libsasl2-2_2.1.27+dfsg-2 libsasl2-modules-db_2.1.27+dfsg-2 libseccomp2_2.4.3-1+rpi1 libselinux1_3.1-2 libsemanage-common_3.1-1 libsemanage1_3.1-1 libsepol1_3.1-1 libsigc++-2.0-0v5_2.10.2-1 libsigsegv2_2.12-2 libsm-dev_2:1.2.3-1 libsm6_2:1.2.3-1 libsmartcols1_2.36-2 libsoup-gnome2.4-1_2.70.0-1 libsoup2.4-1_2.70.0-1 libsqlite3-0_3.32.3-1 libss2_1.45.6-1 libssl1.1_1.1.1g-1 libstdc++-10-dev_10.1.0-6+rpi1 libstdc++6_10.1.0-6+rpi1 libsub-override-perl_0.09-2 libsynctex2_2020.20200327.54578-4+b1 libsystemd0_246.2-1+rpi1 libtasn1-6_4.16.0-2 libtcl8.6_8.6.10+dfsg-1 libteckit0_2.5.8+ds2-5 libtexlua53_2020.20200327.54578-4+b1 libtexluajit2_2020.20200327.54578-4+b1 libtext-unidecode-perl_1.30-1 libthai-data_0.1.28-3 libthai0_0.1.28-3 libtiff5_4.1.0+git191117-2 libtinfo6_6.2-1 libtk8.6_8.6.10-1 libtool_2.4.6-14 libubsan1_10.1.0-6+rpi1 libuchardet0_0.0.7-1 libudev1_245.6-2+rpi1+b1 libunistring2_0.9.10-4 libuuid1_2.36-2 libwayland-client0_1.18.0-2~exp1 libwayland-cursor0_1.18.0-2~exp1 libwayland-egl1_1.18.0-2~exp1 libwebp6_0.6.1-2 libwebpdemux2_0.6.1-2 libwebpmux3_0.6.1-2 libx11-6_2:1.6.10-3 libx11-data_2:1.6.10-3 libx11-dev_2:1.6.10-3 libx265-192_3.4-2 libxapian30_1.4.15-1 libxau-dev_1:1.0.8-1+b2 libxau6_1:1.0.8-1+b2 libxaw7_2:1.0.13-1+b2 libxaw7-dev_2:1.0.13-1+b2 libxcb-render0_1.14-2 libxcb-shm0_1.14-2 libxcb1_1.14-2 libxcb1-dev_1.14-2 libxcomposite1_1:0.4.5-1 libxcursor1_1:1.2.0-2 libxdamage1_1:1.1.5-2 libxdmcp-dev_1:1.1.2-3 libxdmcp6_1:1.1.2-3 libxext-dev_2:1.3.3-1+b2 libxext6_2:1.3.3-1+b2 libxfixes3_1:5.0.3-2 libxft2_2.3.2-2 libxi6_2:1.7.10-1 libxinerama1_2:1.1.4-2 libxkbcommon0_0.10.0-1 libxml-libxml-perl_2.0134+dfsg-2 libxml-namespacesupport-perl_1.12-1 libxml-sax-base-perl_1.09-1 libxml-sax-perl_1.02+dfsg-1 libxml2_2.9.10+dfsg-5+b1 libxmu-dev_2:1.1.2-2+b3 libxmu-headers_2:1.1.2-2 libxmu6_2:1.1.2-2+b3 libxpm-dev_1:3.5.12-1 libxpm4_1:3.5.12-1 libxrandr2_2:1.5.1-1 libxrender1_1:0.9.10-1 libxss1_1:1.2.3-1 libxt-dev_1:1.2.0-1 libxt6_1:1.2.0-1 libzstd1_1.4.5+dfsg-4+rpi1 libzzip-0-13_0.13.62-3.2 linux-libc-dev_5.7.10-1+rpi1 login_1:4.8.1-1 logsave_1.45.6-1 lsb-base_11.1.0+rpi1 m17n-db_1.8.0-3 m4_1.4.18-4 make_4.3-4 man-db_2.9.3-2 mawk_1.3.4.20200120-2 mount_2.36-2 ncurses-base_6.2-1 ncurses-bin_6.2-1 netbase_6.1 passwd_1:4.8.1-1 patch_2.7.6-6 perl_5.30.3-4 perl-base_5.30.3-4 perl-modules-5.30_5.30.3-4 pinentry-curses_1.1.0-4 po-debconf_1.0.21 raspbian-archive-keyring_20120528.2 readline-common_8.0-4 sbuild-build-depends-acl2-dummy_0.invalid.0 sbuild-build-depends-core-dummy_0.invalid.0 sed_4.7-1 sensible-utils_0.0.12+nmu1 shared-mime-info_1.15-1 systemd_246.2-1+rpi1 systemd-sysv_246.2-1+rpi1 systemd-timesyncd_246.2-1+rpi1 sysvinit-utils_2.96-3 t1utils_1.41-4 tar_1.30+dfsg-7 tex-common_6.15 texinfo_6.7.0.dfsg.2-5 texlive-base_2020.20200804-2 texlive-binaries_2020.20200327.54578-4+b1 texlive-latex-base_2020.20200804-2 texlive-latex-recommended_2020.20200804-2 time_1.7-25.1 tzdata_2020a-1 ucf_3.0043 util-linux_2.36-2 x11-common_1:7.7+20 x11proto-core-dev_2020.1-1 x11proto-dev_2020.1-1 x11proto-xext-dev_2020.1-1 xdg-utils_1.1.3-2 xemacs21-basesupport_2009.02.17.dfsg.2-5 xemacs21-bin_21.4.24-9 xemacs21-mule-canna-wnn_21.4.24-9 xemacs21-mulesupport_2009.02.17.dfsg.2-5 xemacs21-support_21.4.24-9 xkb-data_2.29-2 xorg-sgml-doctools_1:1.11-1 xtrans-dev_1.4.0-1 xz-utils_5.2.4-1 zlib1g_1:1.2.11.dfsg-2
+------------------------------------------------------------------------------+
| Build |
+------------------------------------------------------------------------------+
Unpack source
-------------
gpgv: unknown type of key resource 'trustedkeys.kbx'
gpgv: keyblock resource '/tmp/dpkg-verify-sig.aI2duQd2/trustedkeys.kbx': General error
gpgv: Signature made Sun Aug 23 18:05:57 2020 UTC
gpgv: using RSA key FE214F363697773242E816ECB845CE510F9B714D
gpgv: Can't check signature: No public key
dpkg-source: warning: failed to verify signature on ./acl2_8.3dfsg-1.dsc
dpkg-source: info: extracting acl2 in /<<PKGBUILDDIR>>
dpkg-source: info: unpacking acl2_8.3dfsg.orig.tar.gz
dpkg-source: info: unpacking acl2_8.3dfsg-1.debian.tar.xz
dpkg-source: info: using patch list from debian/patches/series
dpkg-source: info: applying remove-pcert-elementary-bounders-for-final-file
dpkg-source: info: applying remove-pcert-local-elided-for-final-file
dpkg-source: info: applying do-not-pre-allocate-contiguous-blocks1-in-acl2.lisp
dpkg-source: info: applying compile_with_split_files
Check disk space
----------------
Sufficient free space for build
User Environment
----------------
APT_CONFIG=/var/lib/sbuild/apt.conf
DEB_BUILD_OPTIONS=parallel=4
HOME=/sbuild-nonexistent
LC_ALL=POSIX
LOGNAME=buildd
PATH=/usr/local/sbin:/usr/local/bin:/usr/sbin:/usr/bin:/sbin:/bin:/usr/games
SCHROOT_ALIAS_NAME=bullseye-staging-armhf-sbuild
SCHROOT_CHROOT_NAME=bullseye-staging-armhf-sbuild
SCHROOT_COMMAND=env
SCHROOT_GID=112
SCHROOT_GROUP=buildd
SCHROOT_SESSION_ID=bullseye-staging-armhf-sbuild-695a25ef-3536-48a7-92f5-183be5327070
SCHROOT_UID=107
SCHROOT_USER=buildd
SHELL=/bin/sh
USER=buildd
dpkg-buildpackage
-----------------
dpkg-buildpackage: info: source package acl2
dpkg-buildpackage: info: source version 8.3dfsg-1
dpkg-buildpackage: info: source distribution unstable
dpkg-source --before-build .
dpkg-buildpackage: info: host architecture armhf
fakeroot debian/rules clean
sed -e "s,^DIR = .*,DIR = $(pwd)/books/interface/infix,1" \
-e "s,^LISP = .*,LISP = $(pwd)/saved_acl2,1" books/interface/infix/makefile > books/interface/infix/Makefile
rm -f infix-stamp
cd books/interface/infix && make -f Makefile clean
make[1]: Entering directory '/<<PKGBUILDDIR>>/books/interface/infix'
rm -f /<<PKGBUILDDIR>>/books/interface/infix/*.otl /<<PKGBUILDDIR>>/books/interface/infix/*.err /<<PKGBUILDDIR>>/books/interface/infix/*.ps /<<PKGBUILDDIR>>/books/interface/infix/*.aux
rm -f /<<PKGBUILDDIR>>/books/interface/infix/*.dvi /<<PKGBUILDDIR>>/books/interface/infix/*.aux /<<PKGBUILDDIR>>/books/interface/infix/*.log /<<PKGBUILDDIR>>/books/interface/infix/*.idx /<<PKGBUILDDIR>>/books/interface/infix/.log
rm -f *~* *#* workxxx *.o *.tex *.nqtex TAGS *.dvi *.ps *.err *.aux *.log *.idx
make[1]: Leaving directory '/<<PKGBUILDDIR>>/books/interface/infix'
rm -f books/interface/infix/Makefile
dh_testdir
dh_testroot
rm -f build-stamp
/usr/bin/make clean-all
make[1]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f *.o *#* *.c *.h *.data gazonk.* workxxx* workyyy* *.lib \
*.fasl *.fas *.sparcf *.ufsl *.64ufasl *.ufasl *.dfsl *.dxl \
*.d64fsl *.dx64fsl *.lx64fsl \
*.lx32fsl *.x86f *.sse2f *.o *.fn \
TAGS TAGS-acl2-doc acl2-status.txt acl2r.lisp acl2-proclaims.lisp \
.acl2rc *osaved_acl2* *.log devel-check.out TMP*
rm -rf saved
rm -f doc/*.o doc/*#* doc/*.c doc/*.h doc/*.data doc/gazonk.* \
doc/workxxx doc/workyyy doc/*.lib \
doc/*.fasl doc/*.fas doc/*.sparcf doc/*.ufsl doc/*.64ufasl doc/*.ufasl doc/*.dfsl \
doc/*.dxl doc/*.d64fsl doc/*.dx64fsl doc/*.lx64fsl \
doc/*.lx32fsl doc/*.x86f doc/*.sse2f doc/*.o doc/*.fn \
doc/*.cert doc/*.port doc/*.out \
doc/*.log doc/TMP*
rm -rf doc/TEX doc/HTML doc/EMACS
rm -f *saved_acl2* doc.lisp.backup
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
/usr/bin/make clean-books
make[1]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
cd books ; /usr/bin/make -k ACL2=/<<PKGBUILDDIR>>/saved_acl2 moreclean
make[2]: Entering directory '/<<PKGBUILDDIR>>/books'
ACL2_SYSTEM_BOOKS is /<<PKGBUILDDIR>>/books
Determining ACL2 features (for ACL2 = /<<PKGBUILDDIR>>/saved_acl2)
*** Failed to run ACL2! ***
Determining whether Glucose is installed
Determining whether an ipasir shared library is installed
Determining whether ABC is installed
Determining whether Z3 is installed, for use by SMTLink
ACL2_HAS_HONS :=
ACL2_HAS_ANSI :=
ACL2_HAS_PARALLEL :=
ACL2_HAS_REALS :=
ACL2_COMP_EXT :=
ACL2_HOST_LISP :=
OS_HAS_ABC :=
OS_HAS_GLUCOSE :=
OS_HAS_IPASIR :=
OS_HAS_SMTLINK :=
USE_QUICKLISP :=
Done with features.
Scanning for books...
real 0m0.253s
user 0m0.082s
sys 0m0.172s
Scanning for dependencies...
real 2m32.127s
user 2m28.858s
sys 0m2.760s
Done scanning.
Reading book deps Makefile-deps created on Sat Aug 29 07:14:02 UTC 2020
Excluding books that need ACL2(h) [...]
Excluding books that are CCL-only: []
Excluding books that need ANSI Common Lisp [...]
Excluding books that need ABC: [centaur/glmc/counter.cert centaur/glmc/glmc-test.cert ]
Excluding books that need Glucose: [centaur/aig/aig-sat-tests.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/tutorial/boothmul.cert centaur/fgl/tests.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert workshops/2017/swords/support/demos.cert ]
Excluding books that need Ipasir: [centaur/fgl/tests.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/sv/tutorial/sums.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/top.cert ]
Excluding books that need SMTLINK: [projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/ringosc.cert ]
Excluding ACL2(r)-only books: [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/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/sqrt/no-sqrt.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 ]
Excluding books that depend on Quicklisp: [acl2s/cgen/fixers-gl-backend.cert centaur/4v-sexpr/sexpr-purebool-p.cert centaur/4v-sexpr/top.cert centaur/aig/aig-sat-tests.cert centaur/aig/aig-sat.cert centaur/aig/faig-purebool-p.cert centaur/aig/top-doc.cert centaur/aig/top.cert centaur/aignet/abc-wrappers.cert centaur/aignet/abc.cert centaur/aignet/cube-sat.cert centaur/aignet/top-doc.cert centaur/aignet/top.cert centaur/aignet/transforms.cert centaur/esim/stv/stv-debug.cert centaur/esim/stv/stv2c/top.cert centaur/esim/tests/add.cert centaur/esim/tests/common.cert centaur/esim/tests/divide.cert centaur/esim/tests/idiv.cert centaur/esim/tests/multiply.cert centaur/esim/tests/regs.cert centaur/esim/tests/subtract.cert centaur/esim/top-doc.cert centaur/esim/tutorial/alu16-book.cert centaur/esim/tutorial/boothmul.cert centaur/esim/tutorial/counter.cert centaur/esim/tutorial/intro.cert centaur/esim/vcd/vcd-impl.cert centaur/esim/vcd/vcd.cert centaur/fgl/equivcheck.cert centaur/fgl/sat-default.cert centaur/fgl/satlink-sat.cert centaur/fgl/tests.cert centaur/fgl/top-bare.cert centaur/fgl/top-doc.cert centaur/fgl/top.cert centaur/gl/bfr-fraig-satlink.cert centaur/gl/bfr-satlink.cert centaur/gl/gl-ttags.cert centaur/gl/top-doc.cert centaur/glmc/bfr-mcheck-abc.cert centaur/glmc/counter.cert centaur/glmc/glmc-test.cert centaur/ipasir/ipasir-backend-extra.cert centaur/ipasir/ipasir-backend.cert centaur/ipasir/ipasir-tests.cert centaur/ipasir/soundness-bug-fixed.cert centaur/ipasir/soundness-bug2-fixed.cert centaur/misc/sharedlibtest/app.cert centaur/misc/tshell-tests.cert centaur/misc/tshell.cert centaur/quicklisp/base.cert centaur/quicklisp/bordeaux.cert centaur/quicklisp/bt-semaphore.cert centaur/quicklisp/cffi.cert centaur/quicklisp/cl-fad.cert centaur/quicklisp/fastnumio.cert centaur/quicklisp/html-template.cert centaur/quicklisp/hunchentoot.cert centaur/quicklisp/osicat.cert centaur/quicklisp/shellpool.cert centaur/quicklisp/top.cert centaur/quicklisp/uiop.cert centaur/satlink/benchmarks.cert centaur/satlink/check-config.cert centaur/satlink/top.cert centaur/sv/cosims/cosims.cert centaur/sv/tutorial/alu.cert centaur/sv/tutorial/boothpipe.cert centaur/sv/tutorial/counter.cert centaur/sv/tutorial/sums.cert centaur/vl/kit/server.cert centaur/vl/kit/top.cert centaur/vl/loader/preprocessor/tests.cert centaur/vl/server/top.cert centaur/vl/top-doc.cert centaur/vl2014/kit/gather.cert centaur/vl2014/kit/json.cert centaur/vl2014/kit/lint.cert centaur/vl2014/kit/model.cert centaur/vl2014/kit/pp.cert centaur/vl2014/kit/progutils.cert centaur/vl2014/kit/server.cert centaur/vl2014/kit/shell.cert centaur/vl2014/kit/top.cert centaur/vl2014/server/file-layout.cert centaur/vl2014/server/server.cert centaur/vl2014/top-doc.cert doc/top-slow.cert doc/top.cert kestrel/hdwallet/top.cert kestrel/hdwallet/wallet-executable.cert kestrel/hdwallet/wallet-tests.cert kestrel/java/atj/implementation.cert kestrel/java/atj/input-processing.cert kestrel/java/atj/tests/abnf-deep-guarded.cert kestrel/java/atj/tests/abnf-deep-unguarded.cert kestrel/java/atj/tests/abnf-shallow-guarded.cert kestrel/java/atj/tests/abnf-shallow-unguarded.cert kestrel/java/atj/tests/abnf.cert kestrel/java/atj/tests/acl2-times.cert kestrel/java/atj/tests/factorial-deep-guarded.cert kestrel/java/atj/tests/factorial-deep-unguarded.cert kestrel/java/atj/tests/factorial-shallow-guarded.cert kestrel/java/atj/tests/factorial-shallow-unguarded.cert kestrel/java/atj/tests/factorial.cert kestrel/java/atj/tests/fibonacci-deep-guarded.cert kestrel/java/atj/tests/fibonacci-deep-unguarded.cert kestrel/java/atj/tests/fibonacci-shallow-guarded.cert kestrel/java/atj/tests/fibonacci-shallow-unguarded.cert kestrel/java/atj/tests/fibonacci.cert kestrel/java/atj/tests/multivalue-deep-guarded.cert kestrel/java/atj/tests/multivalue-deep-unguarded.cert kestrel/java/atj/tests/multivalue-shallow-guarded.cert kestrel/java/atj/tests/multivalue-shallow-unguarded.cert kestrel/java/atj/tests/multivalue.cert kestrel/java/atj/tests/natives-deep-guarded.cert kestrel/java/atj/tests/natives-deep-unguarded.cert kestrel/java/atj/tests/natives-shallow-guarded.cert kestrel/java/atj/tests/natives-shallow-unguarded.cert kestrel/java/atj/tests/natives.cert kestrel/java/atj/tests/primarrays-shallow-guarded.cert kestrel/java/atj/tests/primarrays.cert kestrel/java/atj/tests/primitives-deep-guarded.cert kestrel/java/atj/tests/primitives-deep-unguarded.cert kestrel/java/atj/tests/primitives-shallow-guarded.cert kestrel/java/atj/tests/primitives-shallow-unguarded.cert kestrel/java/atj/tests/primitives.cert kestrel/java/atj/top.cert kestrel/java/top.cert kestrel/top-doc.cert kestrel/top.cert oslib/copy.cert oslib/dirname.cert oslib/file-types.cert oslib/ls.cert oslib/mkdir.cert oslib/rmtree.cert oslib/tests/copy.cert oslib/tests/dirname.cert oslib/tests/file-types.cert oslib/tests/ls.cert oslib/tests/mkdir.cert oslib/tests/top.cert oslib/top.cert projects/doc.cert projects/include-doc.cert projects/rp-rewriter/lib/mult/demo.cert projects/rp-rewriter/lib/mult2/demo.cert projects/sidekick/eventdata.cert projects/sidekick/explore.cert projects/sidekick/lint.cert projects/sidekick/lock.cert projects/sidekick/lookup.cert projects/sidekick/server.cert projects/sidekick/session.cert projects/sidekick/top.cert projects/sidekick/webcommand.cert projects/smtlink/config.cert projects/smtlink/doc.cert projects/smtlink/examples/examples.cert projects/smtlink/examples/inverter.cert projects/smtlink/examples/ringosc.cert projects/smtlink/examples/util.cert projects/smtlink/top.cert projects/smtlink/trusted/prove.cert projects/smtlink/trusted/run.cert projects/smtlink/trusted/trusted-cp.cert projects/smtlink/trusted/write.cert projects/smtlink/trusted/z3-py/header.cert projects/smtlink/trusted/z3-py/recover-type-hyp.cert projects/smtlink/trusted/z3-py/translate-type.cert projects/smtlink/trusted/z3-py/translator.cert projects/smtlink/verified/Smtlink.cert projects/smtlink/verified/add-hypo-cp.cert projects/smtlink/verified/computed-hints.cert projects/smtlink/verified/expand-cp.cert projects/smtlink/verified/extractor.cert projects/smtlink/verified/hint-interface.cert projects/smtlink/verified/hint-please.cert projects/smtlink/verified/type-extract-cp.cert projects/smtlink/verified/type-hyp.cert projects/smtlink/verified/uninterpreted-fn-cp.cert projects/top-doc.cert quicklisp/base.cert quicklisp/bordeaux.cert quicklisp/bt-semaphore.cert quicklisp/cffi.cert quicklisp/cl-fad.cert quicklisp/fastnumio.cert quicklisp/html-template.cert quicklisp/hunchentoot.cert quicklisp/osicat.cert quicklisp/shellpool.cert quicklisp/top.cert quicklisp/uiop.cert system/doc/acl2-manual.cert tools/oracle-timelimit-tests.cert tools/oracle-timelimit.cert workshops/2017/swords/support/demos.cert workshops/2018/sumners/exa.cert workshops/2018/sumners/exbase.cert workshops/2018/sumners/exloop.cert workshops/2018/sumners/exsim.cert workshops/2018/sumners/extra.cert workshops/2018/sumners/readme.cert workshops/2018/sumners/svcnf.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2020/sswords-rewriter/support.cert workshops/2020/sumners/bake-models.cert workshops/2020/sumners/bake-proofs.cert workshops/2020/sumners/gen-models.cert workshops/2020/sumners/gl-fin-set.cert workshops/2020/sumners/gl-setup.cert workshops/2020/sumners/top.cert xdoc/all.cert xdoc/save-fancy.cert xdoc/save-rendered.cert xdoc/save.cert ]
Using clean.pl to remove certificates, etc.
/<<PKGBUILDDIR>>/books/build/clean.pl
clean.pl: scanning for generated files
clean.pl: found 3 targets (1 seconds)
clean.pl: deleted 3 files (0 seconds)
Cleaning up Quicklisp files
cd quicklisp; ./clean.sh
Cleaning quicklisp/bundle (only compiled files 'bundle.*', since outside git repository)
Cleaning asdf-home/cache/common-lisp
Cleaning quicklisp books
clean.pl: scanning for generated files
clean.pl: found 0 targets (0 seconds)
clean.pl: deleted 0 files (0 seconds)
if [ -d projects/milawa/ACL2 ] ; then \
cd projects/milawa/ACL2; /usr/bin/make clean ; \
fi
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/projects/milawa/ACL2'
Calculating cert dependencies...
Calculating pcert dependencies...
Done with dependencies.
Cleaning ACL2 directory (certificates, ACL2 images, etc.)
clean.pl: scanning for generated files
clean.pl: found 1 targets (0 seconds)
clean.pl: deleted 1 files (0 seconds)
Cleaning ../Proofs directory.
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/milawa/ACL2'
Cleaning centaur/vl/bin directory
Cleaning centaur/vl2014/bin directory
Removing extra, explicitly temporary files.
rm -rf /<<PKGBUILDDIR>>/books/build/Makefile-comp /<<PKGBUILDDIR>>/books/build/Makefile-comp-pre /<<PKGBUILDDIR>>/books/build/Makefile-deps /<<PKGBUILDDIR>>/books/build/Makefile-books /<<PKGBUILDDIR>>/books/build/Makefile-features /<<PKGBUILDDIR>>/books/build/Makefile-cache serialize/test.sao bdd/benchmarks.lisp nonstd/workshops/1999/calculus/book/tree.lisp centaur/getopt/demo2.core centaur/getopt/demo2.gcl centaur/getopt/demo2.lw centaur/getopt/demo2.lx86cl64 centaur/getopt/demo2.dx86cl64 centaur/getopt/demo2.ccl nonstd/workshops/1999/calculus/book/outline/ projects/sat/lrat/incremental/lrat-check projects/sat/lrat/incremental/lrat-check.* projects/sat/lrat/cube/cube-check projects/sat/lrat/cube/cube-check.* projects/apply-model/ex1/evaluation-apply.lisp projects/apply-model/ex1/evaluation-user-defs.lisp projects/apply-model/ex2/evaluation-apply.lisp projects/apply-model/ex2/evaluation-user-defs.lisp projects/apply-model-2/ex1/evaluation-apply.lisp projects/apply-model-2/ex1/evaluation-user-defs.lisp projects/apply-model-2/ex2/evaluation-apply.lisp projects/apply-model-2/ex2/evaluation-user-defs.lisp
for dir in system/toothbrush/ clause-processors/SULFA/ projects/translators/l3-to-acl2/ workshops/1999/multiplier/ workshops/2003/greve-wilding-vanfleet/support/ workshops/2003/kaufmann/support/input/ workshops/2004/sumners-ray/support/ projects/apply-model/ projects/apply-model-2/ \
workshops/2003/kaufmann/support/rtl ; \
do \
if [ -f $dir/Makefile ] ; then \
(cd $dir ; /usr/bin/make clean) ; \
fi ; \
done
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush'
Updating dependencies in /<<PKGBUILDDIR>>/books/system/toothbrush
Note: For toothbrush, ACL2_DIR = /<<PKGBUILDDIR>>/.
rm -f defined-syms.lsp
rm -f success.txt
cd tests ; /usr/bin/make clean
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test1'
Updating dependencies in /<<PKGBUILDDIR>>/books/system/toothbrush/tests/test1
rm -f output.lsp success.txt tb-exec*
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test1'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test2'
Updating dependencies in /<<PKGBUILDDIR>>/books/system/toothbrush/tests/test2
rm -f output.lsp success.txt tb-exec*
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test2'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test-par'
Updating dependencies in /<<PKGBUILDDIR>>/books/system/toothbrush/tests/test-par
rm -f output.lsp success.txt tb-exec*
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/test-par'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/dag-unification'
Updating dependencies in /<<PKGBUILDDIR>>/books/system/toothbrush/tests/dag-unification
rm -f output.lsp success.txt tb-exec*
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests/dag-unification'
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush/tests'
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/system/toothbrush'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA'
rm -f \#*\# *~
rm -f scripts/interpret_sulfa_file
/usr/bin/make PERL=perl SAT_SOLVER=/<<PKGBUILDDIR>>/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean-subdirs
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA'
for dir in scripts c-files books; do \
/usr/bin/make PERL=perl SAT_SOLVER=/<<PKGBUILDDIR>>/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean -C $dir; \
done
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/scripts'
rm -f sexpr-sat-solver *~ \#*\#
rm -f *acl2_with_smt* temp_command_file.lisp
rm -fr sat-temp-files
rm -fr sulfa_smt_temp
rm -f sulfa-smt
rm -f interpret_sulfa_file
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/scripts'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/c-files'
rm -f sat-input-formater smt-prep zchaff-output-formater minisat-output-formater *~ #*#
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/c-files'
make[5]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books'
make[6]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/sat'
rm -f \#*\# *.cert *~ *.sexpr *.d *.sot sulfa-dir-const.lisp sat-setup.data
rm -f -r sat-temp-files
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[6]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/sat'
make[6]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/clause-processors'
Updating dependencies in /<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/clause-processors
rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\#
rm -f -r sat-temp-files
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[6]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/clause-processors'
make[6]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/sat-tests'
rm -f *.cert *~ *.sexpr *.d *.sot
rm -f -r sat-temp-files
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[6]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/sat-tests'
make[6]: Entering directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/bv-smt-solver'
Updating dependencies in /<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/bv-smt-solver
rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# *.smt *.prepped
rm -fr sat-temp-files
rm -f *.bak
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[6]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books/bv-smt-solver'
make[5]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA/books'
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA'
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/clause-processors/SULFA'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2'
Makefile:22: ACL2_DIR is /<<PKGBUILDDIR>>
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/translator'
Updating dependencies in /<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/translator
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/translator'
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/examples/thacker'
Makefile:35: L3_TO_ACL2_DIR is /<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/translator
rm -f tiny.lisp tiny-logic.lisp run-check.txt
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2/examples/thacker'
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/translators/l3-to-acl2'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/workshops/1999/multiplier'
rm -f fmul.lisp fmul-star.lisp
rm -f *.tem
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/workshops/1999/multiplier'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/workshops/2003/greve-wilding-vanfleet/support'
rm -f consistency-test.lisp make.lisp consistency-test-passed.lisp
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/workshops/2003/greve-wilding-vanfleet/support'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/workshops/2003/kaufmann/support/input'
rm -f defs-out.lisp defs-eq.lisp lemmas-out.lisp check.txt
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/workshops/2003/kaufmann/support/input'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/workshops/2004/sumners-ray/support'
Updating dependencies in /<<PKGBUILDDIR>>/books/workshops/2004/sumners-ray/support
rm -f *.rpt
rm -f success.txt
rm -f run.date run.log run.err
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/workshops/2004/sumners-ray/support'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model'
cd ex1 ; /usr/bin/make clean
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model/ex1'
System books directory is /<<PKGBUILDDIR>>/books
rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model/ex1'
cd ex2 ; /usr/bin/make clean
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model/ex2'
System books directory is /<<PKGBUILDDIR>>/books
rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model/ex2'
rm -f Makefile-tmp
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2'
cd ex1 ; /usr/bin/make clean
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2/ex1'
System books directory is /<<PKGBUILDDIR>>/books
rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2/ex1'
cd ex2 ; /usr/bin/make clean
make[4]: Entering directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2/ex2'
System books directory is /<<PKGBUILDDIR>>/books
rm -f evaluation-apply.lisp evaluation-user-defs.lisp Makefile-deps
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[4]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2/ex2'
rm -f Makefile-tmp
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/projects/apply-model-2'
make[3]: Entering directory '/<<PKGBUILDDIR>>/books/workshops/2003/kaufmann/support/rtl'
rm -f model.lisp model-defs.lisp model-eq.lisp model.lisp bvecp.lisp
rm -f workxxx* *@expansion.lsp *.out *.date *.*cert *.*cert.time *.pcert0 *.pcert1 *cert*.temp \
*.acl2x *.port Makefile-deps *.h *.c *.o *.sbin *.lbin *.fasl *.ufsl \
*.64ufasl *.ufasl *.pfsl *.dfsl *.dx32fsl *.lx32fsl *.d64fsl \
*.dx64fsl *.lx64fsl *.bin *.sparcf *.axpf *.x86f *.ppcf *.fas \
*.lib *.sse2f *.log TMP*.* temp-emacs-file.lsp
make[3]: Leaving directory '/<<PKGBUILDDIR>>/books/workshops/2003/kaufmann/support/rtl'
Removing even more generated files (documentation, etc).
rm -rf doc/manual system/doc/manual system/doc/manual-fast doc/xdoc.sao
make[2]: Leaving directory '/<<PKGBUILDDIR>>/books'
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
find books -name "*.final" -exec rm {} \;
rm -f saved_acl2 init_nsaved1_acl2.lsp worklispext
rm -f debian/mini-proveall.out books/short-test.log debian/test.log
rm -f foo.lsp nsaved_acl2
for i in data c h ; do \
for j in $(find -name "*.$i") ; do\
k=$(echo $j | sed "s,\.$i$,,1") ;\
! [ -e $k.lisp ] || rm $j ; \
done ; \
done
rm -f books/bdd/benchmarks.data acl2r.lisp tmp
rm -f debian/dpatches debian/acl2.install debian/acl2-source.install debian/acl2-emacs.install debian/acl2-doc.install debian/acl2-books.install debian/acl2-books-source.install debian/acl2-books-certs.install debian/acl2-infix.install debian/acl2-infix-source.install debian/acl2.links debian/acl2-books.links debian/acl2-infix.links debian/README.Debian saved_acl2*
rm -f debian/dlopen.lisp debian/acl2-emacs.emacsen-startup
rm -f debian/acl2.sh pgcl books/Makefile-tmp books/coi/gensym/gensym.out sys-proclaim.lisp
rm -f books/coi/gensym/Makefile-deps books/coi/gensym/workxxx.gensym books/system/doc/rendered-doc.lsp
rm -rf doc/HTML-old doc/EMACS-old doc/acl2-wc.txt books/std/io/test.sao
rm -f books/centaur/bitops/bitsets-opt-raw.o books/centaur/vl/util/gc-raw.o \
books/centaur/misc/tshell-raw.o books/centaur/vl/Makefile-tmp \
books/build/Makefile-sources books/build/Makefile-certs
rm -f books/build/acl2-exports.certdep books/build/acl2-version.certdep \
books/build/first-order-like-terms-and-out-arities.certdep \
books/build/ground-zero-theory.certdep gcl_pool
rm -f debian/acl2-books-certs.lintian-overrides debian/acl2.lintian-overrides
rm -f books/centaur/fty/tests/deftagsum-scale.cert.temp books/centaur/fty/tests/deftranssum.cert.temp
dh_clean -XTAGS
dh_clean: warning: Compatibility levels before 10 are deprecated (level 9 in use)
debian/rules build-arch
/usr/bin/make GCL_ANSI=t LISP=gcl
make[1]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f acl2r.lisp
/usr/bin/make acl2r.lisp
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
/usr/bin/make acl2r
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f acl2r.lisp
/usr/bin/make acl2r.lisp
make[3]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
make[3]: Leaving directory '/<<PKGBUILDDIR>>'
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
rm -f TAGS
rm -f workxxx
echo '(load "init.lisp")' > workxxx
echo '(acl2::make-tags)' >> workxxx
echo '(acl2::exit-lisp)' >> workxxx
gcl < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>;; Loading "init.lisp"
;; Loading "acl2r.lisp"
;; Finished loading "acl2r.lisp"
;; Loading "acl2-init.lisp"
;; Loading "acl2.lisp"
;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration.
;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of REV1@ was replaced by iteration.
;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp"
;; Finished loading "acl2-init.lisp"
;; Finished loading "init.lisp"
T
>GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>/usr/bin/etags
0
0
>rm -f workxxx
if [ -f TAGS ] ; then chmod 644 TAGS ; fi
/usr/bin/make compile
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f workxxx
echo '(load "init.lisp")' > workxxx
echo '(let (#+gcl(compiler::*split-files* 1000000))(acl2::compile-acl2 ))' >> workxxx
echo '(acl2::exit-lisp)' >> workxxx
gcl < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>;; Loading "init.lisp"
;; Loading "acl2r.lisp"
;; Finished loading "acl2r.lisp"
;; Loading "acl2-init.lisp"
;; Loading "acl2.lisp"
;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration.
;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of REV1@ was replaced by iteration.
;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp"
;; Finished loading "acl2-init.lisp"
;; Finished loading "init.lisp"
T
>GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>Check completed.
/<<PKGBUILDDIR>>/serialize-raw.c: In function 'L43':
/<<PKGBUILDDIR>>/serialize-raw.c:4567:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
4567 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/serialize-raw.c:4723:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
4723 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/hons-raw.c: In function 'L27':
/<<PKGBUILDDIR>>/hons-raw.c:2442:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
2442 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/hons-raw.c: In function 'L65':
/<<PKGBUILDDIR>>/hons-raw.c:5146:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
5146 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c: In function 'L397':
/<<PKGBUILDDIR>>/translate.c:36145:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
36145 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:36592:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
36592 | if((Cnil)!=Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:36976:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
36976 | if((Cnil)!=Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:37277:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
37277 | if((Cnil)==Cnil){
| ^~
NIL
>make[3]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
make[3]: Leaving directory '/<<PKGBUILDDIR>>'
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
rm -f acl2-proclaims.lisp
/usr/bin/make acl2-proclaims.lisp
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f acl2-proclaims.lisp
rm -f workxxx
rm -f worklispext
echo '(load "init.lisp")' > workxxx
echo '(in-package "ACL2")' >> workxxx
echo '(generate-acl2-proclaims)' >> workxxx
echo '(exit-lisp)' >> workxxx
gcl < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>;; Loading "init.lisp"
;; Loading "acl2r.lisp"
;; Finished loading "acl2r.lisp"
;; Loading "acl2-init.lisp"
;; Loading "acl2.lisp"
;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration.
;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of REV1@ was replaced by iteration.
;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp"
;; Finished loading "acl2-init.lisp"
;; Finished loading "init.lisp"
T
>GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>
#<"ACL2" package>
ACL2>
NIL
ACL2>[ -f acl2-proclaims.lisp ]
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
/usr/bin/make compile USE_ACL2_PROCLAIMS=t
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -f workxxx
echo '(load "init.lisp")' > workxxx
echo '(let (#+gcl(compiler::*split-files* 1000000))(acl2::compile-acl2 t))' >> workxxx
echo '(acl2::exit-lisp)' >> workxxx
gcl < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>;; Loading "init.lisp"
;; Loading "acl2r.lisp"
;; Finished loading "acl2r.lisp"
;; Loading "acl2-init.lisp"
;; Loading "acl2.lisp"
;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration.
;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of REV1@ was replaced by iteration.
;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp"
;; Finished loading "acl2-init.lisp"
;; Finished loading "init.lisp"
T
>GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>/<<PKGBUILDDIR>>/serialize-raw.c: In function 'LI43':
/<<PKGBUILDDIR>>/serialize-raw.c:4135:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
4135 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/serialize-raw.c:4265:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
4265 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/hons-raw.c: In function 'LI27':
/<<PKGBUILDDIR>>/hons-raw.c:2200:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
2200 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/hons-raw.c: In function 'LI65':
/<<PKGBUILDDIR>>/hons-raw.c:4078:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
4078 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c: In function 'L397':
/<<PKGBUILDDIR>>/translate.c:29143:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
29143 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:29505:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
29505 | if((Cnil)!=Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:29817:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
29817 | if((Cnil)!=Cnil){
| ^~
/<<PKGBUILDDIR>>/translate.c:30059:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
30059 | if((Cnil)==Cnil){
| ^~
NIL
>make[3]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
make[3]: Leaving directory '/<<PKGBUILDDIR>>'
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
rm -f workxxx
rm -f worklispext
echo -n "" >> osaved_acl2
rm -f osaved_acl2
echo '(load "init.lisp")' > workxxx
echo '(in-package "ACL2")' >> workxxx
echo '(save-acl2 (quote (initialize-acl2 (quote include-book) acl2::*acl2-pass-2-files*)) "saved_acl2")' >> workxxx
echo '(exit-lisp)' >> workxxx
gcl < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>;; Loading "init.lisp"
;; Loading "acl2r.lisp"
;; Finished loading "acl2r.lisp"
;; Loading "acl2-init.lisp"
;; Loading "acl2.lisp"
;; Note: Tail-recursive call of GET-TYPE-FROM-DCLS was replaced by iteration.
;; Note: Tail-recursive call of COLLECT-TYPES was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of OUTPUT-TYPE-FOR-DECLARE-FORM-REC was replaced by iteration.
;; Note: Tail-recursive call of REV1@ was replaced by iteration.
;; Note: Tail-recursive call of ACL2-READ-CHARACTER-STRING was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-ESCAPE-CHECK was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.
;; Note: Tail-recursive call of FANCY-STRING-READER-MACRO-AUX was replaced by iteration.;; Finished loading "acl2.lisp"
;; Finished loading "acl2-init.lisp"
;; Finished loading "init.lisp"
T
>GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files:
/tmp/
>
#<"ACL2" package>
ACL2>[GC for 287 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 0 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 128 SYMBOL pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 192 SYMBOL pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=0).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 5632 CONTIGUOUS-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 2 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 10 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 196 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 196 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=2).GC finished]
[GC for 69 SFUN pages..(T=2).GC finished]
[GC for 69 SFUN pages..(T=2).GC finished]
[GC for 69 SFUN pages..(T=2).GC finished]
[GC for 69 SFUN pages..(T=2).GC finished]
[GC for 79 SFUN pages..(T=2).GC finished]
[GC for 79 SFUN pages..(T=2).GC finished]
[GC for 79 SFUN pages..(T=4).GC finished]
[GC for 89 SFUN pages..(T=2).GC finished]
[GC for 89 SFUN pages..(T=2).GC finished]
[GC for 89 SFUN pages..(T=2).GC finished]
[GC for 99 SFUN pages..(T=4).GC finished]
[GC for 99 SFUN pages..(T=2).GC finished]
[GC for 99 SFUN pages..(T=2).GC finished]
[GC for 109 SFUN pages..(T=2).GC finished]
[GC for 109 SFUN pages..(T=4).GC finished]
[GC for 109 SFUN pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=4).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 119 SFUN pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 457 CONS pages..(T=2).GC finished]
[GC for 467 CONS pages..(T=2).GC finished]
[GC for 467 CONS pages..(T=2).GC finished]
[GC for 467 CONS pages..(T=4).GC finished]
[GC for 467 CONS pages..(T=2).GC finished]
[GC for 477 CONS pages..(T=2).GC finished]
[GC for 487 CONS pages..(T=4).GC finished]
[GC for 497 CONS pages..(T=2).GC finished]
[GC for 507 CONS pages..(T=2).GC finished]
[GC for 517 CONS pages..(T=4).GC finished]
[GC for 527 CONS pages..(T=2).GC finished]
[GC for 537 CONS pages..(T=2).GC finished]
[GC for 547 CONS pages..(T=4).GC finished]
[GC for 557 CONS pages..(T=2).GC finished]
[GC for 567 CONS pages..(T=4).GC finished]
[GC for 577 CONS pages..(T=2).GC finished]
[GC for 587 CONS pages..(T=4).GC finished]
[GC for 597 CONS pages..(T=2).GC finished]
[GC for 607 CONS pages..(T=4).GC finished]
[GC for 617 CONS pages..(T=4).GC finished]
[GC for 627 CONS pages..(T=2).GC finished]
[GC for 637 CONS pages..(T=4).GC finished]
[GC for 647 CONS pages..(T=2).GC finished]
[GC for 657 CONS pages..(T=4).GC finished]
[GC for 667 CONS pages..(T=4).GC finished]
[GC for 677 CONS pages..(T=2).GC finished]
[GC for 687 CONS pages..(T=4).GC finished]
[GC for 697 CONS pages..(T=4).GC finished]
[GC for 707 CONS pages..(T=4).GC finished]
[GC for 717 CONS pages..(T=2).GC finished]
[GC for 727 CONS pages..(T=4).GC finished]
[GC for 737 CONS pages..(T=4).GC finished]
[GC for 747 CONS pages..(T=4).GC finished]
[GC for 757 CONS pages..(T=4).GC finished]
[GC for 767 CONS pages..(T=2).GC finished]
[GC for 777 CONS pages..(T=4).GC finished]
[GC for 129 SFUN pages..(T=4).GC finished]
[GC for 6912 CONTIGUOUS-BLOCKS pages..(T=4).GC finished]
[GC for 787 CONS pages..(T=4).GC finished]
[GC for 797 CONS pages..(T=4).GC finished]
[GC for 797 CONS pages..(T=4).GC finished]
[GC for 807 CONS pages..(T=2).GC finished]
[GC for 817 CONS pages..(T=4).GC finished]
[GC for 827 CONS pages..(T=4).GC finished]
[GC for 837 CONS pages..(T=4).GC finished]
[GC for 139 SFUN pages..(T=4).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=4).GC finished]
[GC for 149 SFUN pages..(T=4).GC finished]
[GC for 837 CONS pages..(T=4).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=4).GC finished]
[GC for 847 CONS pages..(T=4).GC finished]
[GC for 857 CONS pages..(T=4).GC finished]
[GC for 867 CONS pages..(T=4).GC finished]
[GC for 867 CONS pages..(T=4).GC finished]
[GC for 877 CONS pages..(T=4).GC finished]
[GC for 8704 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
[GC for 159 SFUN pages..(T=4).GC finished]
[GC for 877 CONS pages..(T=4).GC finished]
[GC for 887 CONS pages..(T=4).GC finished]
[GC for 897 CONS pages..(T=4).GC finished]
[GC for 897 CONS pages..(T=4).GC finished]
[GC for 907 CONS pages..(T=4).GC finished]
[GC for 169 SFUN pages..(T=4).GC finished]
[GC for 8960 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
[GC for 917 CONS pages..(T=4).GC finished]
[GC for 927 CONS pages..(T=4).GC finished]
[GC for 937 CONS pages..(T=4).GC finished]
[GC for 9216 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
[GC for 179 SFUN pages..(T=6).GC finished]
[GC for 947 CONS pages..(T=4).GC finished]
[GC for 957 CONS pages..(T=6).GC finished]
[GC for 957 CONS pages..(T=6).GC finished]
[GC for 967 CONS pages..(T=4).GC finished]
[GC for 977 CONS pages..(T=4).GC finished]
[GC for 9472 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
[GC for 987 CONS pages..(T=6).GC finished]
[GC for 189 SFUN pages..(T=4).GC finished]
[GC for 987 CONS pages..(T=4).GC finished]
[GC for 997 CONS pages..(T=4).GC finished]
[GC for 997 CONS pages..(T=4).GC finished]
[GC for 1007 CONS pages..(T=6).GC finished]
[GC for 199 SFUN pages..(T=4).GC finished]
[GC for 1007 CONS pages..(T=6).GC finished]
[GC for 1017 CONS pages..(T=4).GC finished]
[GC for 1027 CONS pages..(T=4).GC finished]
[GC for 1037 CONS pages..(T=4).GC finished]
[GC for 1047 CONS pages..(T=6).GC finished]
[GC for 1057 CONS pages..(T=6).GC finished]
[GC for 1067 CONS pages..(T=4).GC finished]
[GC for 1077 CONS pages..(T=4).GC finished]
[GC for 1087 CONS pages..(T=4).GC finished]
[GC for 1097 CONS pages..(T=4).GC finished]
[GC for 1107 CONS pages..(T=4).GC finished]
[GC for 1117 CONS pages..(T=6).GC finished]
[GC for 209 SFUN pages..(T=6).GC finished]
[GC for 1127 CONS pages..(T=6).GC finished]
[GC for 1137 CONS pages..(T=6).GC finished]
[GC for 1147 CONS pages..(T=6).GC finished]
[GC for 1157 CONS pages..(T=4).GC finished]
[GC for 1167 CONS pages..(T=4).GC finished]
[GC for 1177 CONS pages..(T=4).GC finished]
[GC for 1187 CONS pages..(T=6).GC finished]
[GC for 1197 CONS pages..(T=6).GC finished]
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
'(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
&AUX *PRINT-PPRINT-DISPATCH*
&BODY *PRINT-PRETTY* &ENVIRONMENT ...))
(DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
'(* ** *** *BREAK-ON-SIGNALS*
*COMPILE-FILE-PATHNAME*
*COMPILE-FILE-TRUENAME*
*COMPILE-PRINT* ...))
(DEFCONST
NIL 'NIL
" NIL, a symbol, represents in Common Lisp both the false truth value
and the empty list.")
(DEFCONST T 'T
"T, a symbol, represents the true truth value in Common Lisp.")
(DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
(DEFMACRO MAKE-PACKAGE-ENTRY
(&KEY NAME IMPORTS HIDDEN-P
BOOK-PATH DEFPKG-EVENT-FORM TTERM)
(CONS 'LIST* (CONS NAME #)))
...).
"ACL2"
*COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
[GC for 1207 CONS pages..(T=6).GC finished]
*COMMON-LISP-SPECIALS-AND-CONSTANTS*
NIL
T
*STOBJ-INLINE-DECLARE*
MAKE-PACKAGE-ENTRY
FIND-PACKAGE-ENTRY
PACKAGE-ENTRY-NAME
PACKAGE-ENTRY-IMPORTS
PACKAGE-ENTRY-HIDDEN-P
PACKAGE-ENTRY-BOOK-PATH
PACKAGE-ENTRY-DEFPKG-EVENT-FORM
PACKAGE-ENTRY-TTERM
FIND-NON-HIDDEN-PACKAGE-ENTRY
REMOVE-PACKAGE-ENTRY
CHANGE-PACKAGE-ENTRY-HIDDEN-P
GETPROP
GETPROPC
*STANDARD-CO*
*STANDARD-OI*
*STANDARD-CI*
[GC for 1217 CONS pages..(T=6).GC finished]
INSIST
IFF
[GC for 219 SFUN pages..(T=6).GC finished]
XOR
EQ
BOOLEANP
NIL
IMPLIES
NIL
NIL
NOT
NIL
HIDE
[GC for 1227 CONS pages..(T=4).GC finished]
REWRITE-EQUIV
REAL/RATIONALP
COMPLEX/COMPLEX-RATIONALP
TRUE-LISTP
LIST-MACRO
LIST
AND-MACRO
AND
OR-MACRO
OR
-
NIL
NIL
INTEGER-ABS
[GC for 9728 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
XXXJOIN
+
LEN
LENGTH
ACL2-COUNT
COND-CLAUSESP
[GC for 1237 CONS pages..(T=6).GC finished]
COND-MACRO
COND
EQLABLEP
NIL
NIL
EQLABLE-LISTP
EQL
ATOM
MAKE-CHARACTER-LIST
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
EQLABLE-ALISTP
ALISTP
NIL
NIL
ACONS
ENDP
CAAR
CADR
CDAR
CDDR
CAAAR
CAADR
CADAR
CADDR
CDAAR
CDADR
CDDAR
CDDDR
CAAAAR
CAAADR
CAADAR
CAADDR
CADAAR
CADADR
CADDAR
CADDDR
[GC for 1247 CONS pages..(T=6).GC finished]
CDAAAR
CDAADR
CDADAR
CDADDR
CDDAAR
CDDADR
CDDDAR
CDDDDR
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
NULL
SYMBOL-LISTP
NIL
SYMBOL-DOUBLET-LISTP
REVERSE-STRIP-CARS
STRIP-CARS
REVERSE-STRIP-CDRS
[GC for 1247 CONS pages..(T=6).GC finished]
STRIP-CDRS
HARD-ERROR
ILLEGAL
RETURN-LAST
RETURN-LAST-FN
MBE1
MUST-BE-EQUAL
MBE
MBT
MBT*
BINARY-APPEND
APPEND
NIL
NIL
NIL
NIL
NIL
NIL
CONCATENATE
[GC for 1257 CONS pages..(T=6).GC finished]
STRING-APPEND
STRING-LISTP
STRING-APPEND-LST
GUARD-CHECK-FN
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
LET-MBE-GUARD-FORM
LET-MBE
DEFUN-WITH-GUARD-CHECK
PROG2$
MEMBER-EQ-EXEC
MEMBER-EQL-EXEC
[GC for 1257 CONS pages..(T=6).GC finished]
MEMBER-EQUAL
MEMBER-EQ
NIL
NIL
MEMBER
SUBSETP-EQ-EXEC
[GC for 1257 CONS pages..(T=6).GC finished]
SUBSETP-EQL-EXEC
SUBSETP-EQUAL
SUBSETP-EQ
NIL
NIL
SUBSETP
SYMBOL-ALISTP
NIL
CHARACTER-ALISTP
NIL
[GC for 1257 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
ASSOC-EQ-EXEC
ASSOC-EQL-EXEC
ASSOC-EQUAL
ASSOC-EQ
NIL
NIL
ASSOC
ASSOC-EQ-EQUAL-ALISTP
[GC for 1257 CONS pages..(T=6).GC finished]
ASSOC-EQ-EQUAL
<=
=
/=
>
>=
INT=
ZP
NIL
NIL
NIL
ZIP
NIL
NIL
NIL
[GC for 1267 CONS pages..(T=6).GC finished]
NTH
CHAR
SLEEP
PROPER-CONSP
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
IMPROPER-CONSP
*
CONJUGATE
ADD-SUFFIX
*INLINE-SUFFIX*
EC-CALL1
EC-CALL
NON-EXEC
/
NIL
NIL
NIL
FIX
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
FORCE
*FORCE-XNUME*
IMMEDIATE-FORCE-MODEP
*IMMEDIATE-FORCE-MODEP-XNUME*
[GC for 1267 CONS pages..(T=6).GC finished]
CASE-SPLIT
NIL
DISABLE-FORCING
ENABLE-FORCING
DISABLE-IMMEDIATE-FORCE-MODEP
ENABLE-IMMEDIATE-FORCE-MODEP
SYNP
SYNTAXP
BIND-FREE
EXTRA-INFO
NIL
*EXTRA-INFO-FN*
TAU-SYSTEM
*TAU-STATUS-BOOT-STRAP-SETTINGS*
NIL
*TAU-SYSTEM-XNUME*
*TAU-ACL2-NUMBERP-PAIR*
*TAU-INTEGERP-PAIR*
*TAU-RATIONALP-PAIR*
*TAU-NATP-PAIR*
*TAU-BITP-PAIR*
*TAU-POSP-PAIR*
*TAU-MINUSP-PAIR*
*TAU-BOOLEANP-PAIR*
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
[GC for 1267 CONS pages..(T=6).GC finished]
NO-DUPLICATESP-EQ-EXEC
NO-DUPLICATESP-EQL-EXEC
NO-DUPLICATESP-EQUAL
NO-DUPLICATESP-EQ
NIL
NIL
NO-DUPLICATESP
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
CHK-NO-DUPLICATESP
R-EQLABLE-ALISTP
R-SYMBOL-ALISTP
RASSOC-EQ-EXEC
RASSOC-EQL-EXEC
[GC for 1277 CONS pages..(T=6).GC finished]
RASSOC-EQUAL
RASSOC-EQ
NIL
NIL
RASSOC
*STANDARD-CHARS*
STANDARD-CHAR-P
STANDARD-CHAR-P+
STANDARD-CHAR-LISTP
CHARACTER-LISTP
NIL
NIL
NIL
NIL
NIL
NIL
[GC for 1277 CONS pages..(T=6).GC finished]
STRING
ALPHA-CHAR-P
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
UPPER-CASE-P
LOWER-CASE-P
CHAR-UPCASE
CHAR-DOWNCASE
NIL
NIL
NIL
NIL
NIL
NIL
[GC for 1277 CONS pages..(T=6).GC finished]
NIL
NIL
NIL
STRING-DOWNCASE1
NIL
STRING-DOWNCASE
STRING-UPCASE1
NIL
STRING-UPCASE
OUR-DIGIT-CHAR-P
[GC for 1277 CONS pages..(T=6).GC finished]
DIGIT-CHAR-P
CHAR-EQUAL
ATOM-LISTP
NIL
NIL
GOOD-ATOM-LISTP
NIL
NIL
IFIX
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
RFIX
REALFIX
NFIX
1+
1-
NATP
NIL
NAT-ALISTP
NIL
STANDARD-STRING-P1
STANDARD-STRING-P
[GC for 1277 CONS pages..(T=6).GC finished]
STANDARD-STRING-LISTP
STRING-EQUAL1
STRING-EQUAL
MEMBER-STRING-EQUAL
[GC for 1277 CONS pages..(T=6).GC finished]
STANDARD-STRING-ALISTP
NIL
ASSOC-STRING-EQUAL
BITP
NIL
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
POSP
NIL
O-FINP
O-INFP
O-FIRST-EXPT
O-FIRST-COEFF
O-RST
O<G
[GC for 1287 CONS pages..(T=6).GC finished]
O<
O>
O<=
O>=
O-P
NIL
NIL
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
MAKE-ORD
LIST*-MACRO
LIST*
THROW-OR-ATTACH-CALL
NULL-BODY-ER
*MAIN-LISP-PACKAGE-NAME*
*INITIAL-KNOWN-PACKAGE-ALIST*
NIL
NIL
NIL
INTERN
INTERN$
KEYWORDP
NIL
NIL
NIL
*PKG-WITNESS-NAME*
NIL
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
MEMBER-SYMBOL-NAME
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
CONS-WITH-HINT
REMOVE-EQ-EXEC
[GC for 1287 CONS pages..(T=6).GC finished]
REMOVE-EQL-EXEC
REMOVE-EQUAL
REMOVE-EQ
NIL
NIL
REMOVE
REMOVE1-EQ-EXEC
[GC for 1287 CONS pages..(T=6).GC finished]
REMOVE1-EQL-EXEC
REMOVE1-EQUAL
REMOVE1-EQ
NIL
NIL
REMOVE1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
REMOVE-DUPLICATES-EQ-EXEC
REMOVE-DUPLICATES-EQL-EXEC
REMOVE-DUPLICATES-EQUAL
REMOVE-DUPLICATES-EQ
NIL
NIL
REMOVE-DUPLICATES-LOGIC
REMOVE-DUPLICATES
NIL
FIRST
SECOND
THIRD
FOURTH
FIFTH
SIXTH
SEVENTH
EIGHTH
[GC for 1297 CONS pages..(T=6).GC finished]
NINTH
TENTH
REST
IDENTITY
REVAPPEND
NIL
NIL
REVERSE
PAIRLIS$-TAILREC
PAIRLIS$
NIL
NIL
[GC for 1297 CONS pages..(T=6).GC finished]
SET-DIFFERENCE-EQ-EXEC
SET-DIFFERENCE-EQL-EXEC
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SET-DIFFERENCE-EQUAL
SET-DIFFERENCE-EQ
NIL
NIL
SET-DIFFERENCE$
*WINDOW-DESCRIPTIONS*
*VALID-OUTPUT-NAMES*
LISTP
*SUMMARY-TYPES*
WITH-EVISC-TUPLE
[GC for 1297 CONS pages..(T=8).GC finished]
[GC for 1307 CONS pages..(T=6).GC finished]
WITH-OUTPUT-FN
LAST
FIRST-N-AC
NIL
TAKE
:EMPTY-ENCAPSULATE
NIL
[GC for 1317 CONS pages..(T=6).GC finished]
BUTLAST
WITH-OUTPUT!
WITH-OUTPUT
MUTUAL-RECURSION-GUARDP
COLLECT-CADRS-WHEN-CAR-EQ
VALUE
VALUE-TRIPLE-FN
VALUE-TRIPLE
ASSERT-EVENT
XD-NAME
[GC for 1317 CONS pages..(T=6).GC finished]
DEFUND-NAME-LIST
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
THROW-NONEXEC-ERROR
DEFUN-NX-FN
DEFUN-NX
DEFUND-NX
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
KEYWORD-VALUE-LISTP
NIL
ASSOC-KEYWORD
[GC for 229 SFUN pages..(T=6).GC finished]
PROGRAM-DECLARED-P2
PROGRAM-DECLARED-P1
PROGRAM-DECLARED-P
TRUE-LIST-LISTP
NIL
SOME-PROGRAM-DECLARED-P
MUTUAL-RECURSION
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
(PSEUDO-TERMP PSEUDO-TERM-LISTP)
NIL
T
PSEUDO-TERM-LIST-LISTP
NIL
ADD-TO-SET-EQ-EXEC
ADD-TO-SET-EQL-EXEC
ADD-TO-SET-EQUAL
ADD-TO-SET-EQ
ADD-TO-SET-EQL
NIL
NIL
NIL
[GC for 1317 CONS pages..(T=6).GC finished]
ADD-TO-SET
VARIABLEP
NVARIABLEP
FQUOTEP
QUOTEP
*T*
*NIL*
*0*
*1*
*-1*
*2*
KWOTE
MAYBE-KWOTE
KWOTE-LST
UNQUOTE
LAMBDA-OBJECT-FORMALS
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
LAMBDA-OBJECT-DCL
LAMBDA-OBJECT-BODY
LAMBDA-OBJECT-SHAPEP
MAKE-LAMBDA-OBJECT
FFN-SYMB
FN-SYMB
FARGS
(ALL-VARS1 ALL-VARS1-LST)
NIL
[GC for 1317 CONS pages..(T=8).GC finished]
ALL-VARS
TRANSLATE-AND-TEST
INTERSECTP-EQ-EXEC
INTERSECTP-EQL-EXEC
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
INTERSECTP-EQUAL
INTERSECTP-EQ
NIL
NIL
INTERSECTP
MAKE-FMT-BINDINGS
*BASE-10-CHARS*
WARNING$
MSG
CHECK-VARS-NOT-FREE-TEST
CHECK-VARS-NOT-FREE
ER-PROGN-FN
ER-PROGN
[GC for 1317 CONS pages..(T=6).GC finished]
LEGAL-CASE-CLAUSESP
CASE-TEST
CASE-LIST
CASE-LIST-CHECK
CASE
[GC for 1317 CONS pages..(T=6).GC finished]
POSITION-AC-EQ-EXEC
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
POSITION-AC-EQL-EXEC
POSITION-EQUAL-AC
POSITION-AC-EQUAL
POSITION-EQ-AC
POSITION-AC-EQ
NIL
NIL
POSITION-AC
POSITION-EQ-EXEC
[GC for 1317 CONS pages..(T=6).GC finished]
POSITION-EQL-EXEC
POSITION-EQUAL
POSITION-EQ
NIL
NIL
POSITION
NONNEGATIVE-INTEGER-QUOTIENT
[GC for 1317 CONS pages..(T=6).GC finished]
LEGAL-LET*-P
WELL-FORMED-TYPE-DECLS-P
SYMBOL-LIST-LISTP
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
GET-TYPE-DECLS
LET*-MACRO
COLLECT-CDRS-WHEN-CAR-EQ
APPEND-LST
[GC for 1327 CONS pages..(T=6).GC finished]
RESTRICT-ALIST
LET*
PROGN
[GC for 1327 CONS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 229 SFUN pages..(T=6).GC finished]
LOGNOT
:EMPTY-ENCAPSULATE
NIL
NIL
NIL
NIL
NIL
[GC for 1327 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ASH
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
CHAR<
[GC for 1327 CONS pages..(T=8).GC finished]
CHAR>
CHAR<=
CHAR>=
STRING<-L
STRING<
[GC for 1327 CONS pages..(T=6).GC finished]
STRING>
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
STRING<=
STRING>=
SYMBOL-<
NIL
NIL
SUBSTITUTE-AC
[GC for 1327 CONS pages..(T=6).GC finished]
SUBSTITUTE
NIL
NIL
SUBLIS
SUBST
PPROGN
PROGN$
ACL2-UNWIND-PROTECT
WHEN-LOGIC
IN-PACKAGE
DEFPKG
DEFUN
DEFUNS
VERIFY-TERMINATION
VERIFY-TERMINATION-BOOT-STRAP
VERIFY-GUARDS
[GC for 1327 CONS pages..(T=8).GC finished]
VERIFY-GUARDS+
DEFMACRO
DEFCONST
DEFTHM
ER
DEFTHMD
DEFAXIOM
DEFLABEL
DEFTHEORY
DEFTHY
DEFTHEORY-STATIC
DEFSTOBJ
IN-THEORY
IN-ARITHMETIC-THEORY
REGENERATE-TAU-DATABASE
PUSH-UNTOUCHABLE
REMOVE-UNTOUCHABLE
SET-BODY
TABLE
ENCAPSULATE
PARTIAL-ENCAPSULATE
*LOAD-COMPILED-FILE-VALUES*
INCLUDE-BOOK
MAKE-EVENT
RECORD-EXPANSION
SKIP-PROOFS
LOCAL
DEFCHOOSE
DEFATTACH
WORLDP
PLIST-WORLDP
NIL
[GC for 1337 CONS pages..(T=6).GC finished]
PUTPROP
*ACL2-PROPERTY-UNBOUND*
GETPROP-DEFAULT
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
FGETPROP
SGETPROP
ORDERED-SYMBOL-ALISTP
NIL
NIL
ADD-PAIR
[GC for 1337 CONS pages..(T=6).GC finished]
REMOVE1-ASSOC-EQ-EXEC
REMOVE1-ASSOC-EQL-EXEC
REMOVE1-ASSOC-EQUAL
REMOVE1-ASSOC-EQ
NIL
NIL
REMOVE1-ASSOC
[GC for 1337 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
REMOVE-ASSOC-EQ-EXEC
REMOVE-ASSOC-EQL-EXEC
REMOVE-ASSOC-EQUAL
REMOVE-ASSOC-EQ
NIL
NIL
REMOVE-ASSOC
GETPROPS1
[GC for 1347 CONS pages..(T=6).GC finished]
GETPROPS
NIL
NIL
NIL
HAS-PROPSP1
HAS-PROPSP
[GC for 1347 CONS pages..(T=6).GC finished]
EXTEND-WORLD
RETRACT-WORLD
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
GLOBAL-VAL
FUNCTION-SYMBOLP
FCONS-TERM*
CONJOIN2
CONJOIN
CONJOIN-UNTRANSLATED-TERMS
[GC for 1347 CONS pages..(T=6).GC finished]
DISJOIN2
DISJOIN
DISJOIN-LST
KWOTE?
CONJOIN?
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
<=?
>?
DISJOIN?
TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN
TRANSLATE-DECLARATION-TO-GUARD/INTEGER
WEAK-SATISFIES-TYPE-SPEC-P
[GC for 1347 CONS pages..(T=6).GC finished]
[GC for 1347 CONS pages..(T=8).GC finished]
TRANSLATE-DECLARATION-TO-GUARD1-GEN
TRANSLATE-DECLARATION-TO-GUARD1
[GC for 1357 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
(TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST)
TRANSLATE-DECLARATION-TO-GUARD
TRANSLATE-DECLARATION-TO-GUARD-LST
THE-CHECK
THE-FN
THE
THE-CHECK-FOR-*1*
[GC for 229 SFUN pages..(T=6).GC finished]
THE-FN-FOR-*1*
THE-FOR-*1*
*MAXIMUM-POSITIVE-32-BIT-INTEGER*
BOUNDED-INTEGER-ALISTP
NIL
NIL
NIL
F-GET-GLOBAL
ARRAY1P
NIL
NIL
BOUNDED-INTEGER-ALISTP2
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ASSOC2
ARRAY2P
NIL
NIL
HEADER
DIMENSIONS
MAXIMUM-LENGTH
[GC for 229 SFUN pages..(T=6).GC finished]
DEFAULT
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
AREF1
COMPRESS11
ARRAY-ORDER
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
COMPRESS1
NIL
ASET1
AREF2
COMPRESS211
[GC for 1357 CONS pages..(T=6).GC finished]
COMPRESS21
COMPRESS2
NIL
ASET2
FLUSH-COMPRESS
MAYBE-FLUSH-AND-COMPRESS1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
CDRN
MV-NTH
MAKE-MV-NTHS
MV
MV?
MV-LET
MV?-LET
MV-LIST
SWAP-STOBJS
UPDATE-NTH
[GC for 1357 CONS pages..(T=6).GC finished]
UPDATE-NTH-ARRAY
MAXIMUM-POSITIVE-32-BIT-INTEGER
MINIMUM-NEGATIVE-32-BIT-INTEGER
32-BIT-INTEGERP
NIL
ACL2-NUMBER-LISTP
NIL
RATIONAL-LISTP
NIL
INTEGER-LISTP
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
NAT-LISTP
NIL
32-BIT-INTEGER-LISTP
NIL
OPEN-INPUT-CHANNELS
UPDATE-OPEN-INPUT-CHANNELS
OPEN-OUTPUT-CHANNELS
UPDATE-OPEN-OUTPUT-CHANNELS
[GC for 229 SFUN pages..(T=6).GC finished]
GLOBAL-TABLE
UPDATE-GLOBAL-TABLE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
T-STACK
UPDATE-T-STACK
32-BIT-INTEGER-STACK
UPDATE-32-BIT-INTEGER-STACK
BIG-CLOCK-ENTRY
UPDATE-BIG-CLOCK-ENTRY
[GC for 229 SFUN pages..(T=6).GC finished]
IDATES
UPDATE-IDATES
ACL2-ORACLE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
UPDATE-ACL2-ORACLE
FILE-CLOCK
UPDATE-FILE-CLOCK
READABLE-FILES
WRITTEN-FILES
[GC for 229 SFUN pages..(T=6).GC finished]
UPDATE-WRITTEN-FILES
READ-FILES
UPDATE-READ-FILES
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
WRITEABLE-FILES
LIST-ALL-PACKAGE-NAMES-LST
UPDATE-LIST-ALL-PACKAGE-NAMES-LST
USER-STOBJ-ALIST1
UPDATE-USER-STOBJ-ALIST1
*INITIAL-CHECKPOINT-PROCESSORS*
*INITIAL-PROGRAM-FNS-WITH-RAW-CODE*
*INITIAL-LOGIC-FNS-WITH-RAW-CODE*
*INITIAL-MACROS-WITH-RAW-CODE*
UNTOUCHABLE-MARKER
DEFMACRO-UNTOUCHABLE
WITH-LIVE-STATE
[GC for 1357 CONS pages..(T=6).GC finished]
INIT-IPRINT-AR
*IPRINT-SOFT-BOUND-DEFAULT*
*IPRINT-HARD-BOUND-DEFAULT*
DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
*FMT-SOFT-RIGHT-MARGIN-DEFAULT*
*FMT-HARD-RIGHT-MARGIN-DEFAULT*
*INITIAL-GLOBAL-TABLE*
T
WITH-INFIXP-NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ALL-BOUNDP
KNOWN-PACKAGE-ALISTP
NIL
TIMER-ALISTP
NIL
TYPED-IO-LISTP
NIL
*FILE-TYPES*
OPEN-CHANNEL1
NIL
[GC for 229 SFUN pages..(T=6).GC finished]
OPEN-CHANNEL-LISTP
OPEN-CHANNELS-P
NIL
FILE-CLOCK-P
NIL
READABLE-FILE
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
READABLE-FILES-LISTP
NIL
READABLE-FILES-P
NIL
WRITTEN-FILE
NIL
WRITTEN-FILE-LISTP
NIL
WRITTEN-FILES-P
NIL
[GC for 229 SFUN pages..(T=6).GC finished]
READ-FILE-LISTP1
NIL
READ-FILE-LISTP
NIL
READ-FILES-P
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
WRITABLE-FILE-LISTP1
NIL
WRITABLE-FILE-LISTP
NIL
WRITEABLE-FILES-P
NIL
STATE-P1
NIL
[GC for 1367 CONS pages..(T=6).GC finished]
STATE-P
NIL
NIL
BUILD-STATE
*DEFAULT-STATE*
BUILD-STATE1
COERCE-STATE-TO-OBJECT
COERCE-OBJECT-TO-STATE
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
GLOBAL-TABLE-CARS1
GLOBAL-TABLE-CARS
BOUNDP-GLOBAL1
BOUNDP-GLOBAL
F-BOUNDP-GLOBAL
MAKUNBOUND-GLOBAL
[GC for 229 SFUN pages..(T=6).GC finished]
GET-GLOBAL
PUT-GLOBAL
F-PUT-GLOBAL
*INITIAL-LD-SPECIAL-BINDINGS*
ALWAYS-BOUNDP-GLOBAL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
STATE-GLOBAL-LET*-BINDINGS-P
STATE-GLOBAL-LET*-GET-GLOBALS
STATE-GLOBAL-LET*-PUT-GLOBALS
[GC for 1367 CONS pages..(T=6).GC finished]
STATE-GLOBAL-LET*-CLEANUP
WITH-PARALLELISM-HAZARD-WARNINGS
WARN-ABOUT-PARALLELISM-HAZARD
WITH-ENSURED-PARALLELISM-FINISHING
STATE-GLOBAL-LET*
INTEGER-RANGE-P
NIL
SIGNED-BYTE-P
UNSIGNED-BYTE-P
NIL
NIL
NIL
THE-FIXNUM
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ZPF
NIL
NIL
NIL
NIL
NIL
NIL
NIL
:EMPTY-ENCAPSULATE
NIL
LOGAND
LOGEQV
LOGIOR
LOGXOR
INTEGER-LENGTH
BINARY-LOGAND
LOGNAND
BINARY-LOGIOR
[GC for 229 SFUN pages..(T=6).GC finished]
LOGORC1
LOGORC2
LOGANDC1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
LOGANDC2
BINARY-LOGEQV
BINARY-LOGXOR
LOGNOR
[GC for 229 SFUN pages..(T=6).GC finished]
LOGTEST
*BOOLE-1*
*BOOLE-2*
*BOOLE-AND*
*BOOLE-ANDC1*
*BOOLE-ANDC2*
*BOOLE-C1*
*BOOLE-C2*
*BOOLE-CLR*
*BOOLE-EQV*
*BOOLE-IOR*
*BOOLE-NAND*
*BOOLE-NOR*
*BOOLE-ORC1*
*BOOLE-ORC2*
*BOOLE-SET*
*BOOLE-XOR*
BOOLE$
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
SET-FORMS-FROM-BINDINGS
*PRINT-CONTROL-DEFAULTS*
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ALIST-DIFFERENCE-EQ
WITH-PRINT-DEFAULTS
RESET-PRINT-CONTROL
DIGIT-TO-CHAR
PRINT-BASE-P
EXPLODE-NONNEGATIVE-INTEGER
NIL
NIL
NIL
NIL
NIL
[GC for 1377 CONS pages..(T=6).GC finished]
EXPLODE-ATOM
NIL
EXPLODE-ATOM+
NIL
NIL
NIL
NIL
[GC for 1377 CONS pages..(T=6).GC finished]
OPEN-INPUT-CHANNEL-P1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
OPEN-OUTPUT-CHANNEL-P1
OPEN-INPUT-CHANNEL-P
OPEN-OUTPUT-CHANNEL-P
OPEN-OUTPUT-CHANNEL-ANY-P1
[GC for 229 SFUN pages..(T=8).GC finished]
OPEN-OUTPUT-CHANNEL-ANY-P
OPEN-INPUT-CHANNEL-ANY-P1
OPEN-INPUT-CHANNEL-ANY-P
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
NON-FREE-VAR-RUNES
FREE-VAR-RUNES
NIL
*DIRECTORY-SEPARATOR*
*DIRECTORY-SEPARATOR-STRING*
OS-ER
OS
[GC for 1377 CONS pages..(T=6).GC finished]
ABSOLUTE-PATHNAME-STRING-P
ILLEGAL-RULER-EXTENDERS-VALUES
TABLE-ALIST
RULER-EXTENDERS-MSG-AUX
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RULER-EXTENDERS-MSG
STRICT-SYMBOL-<-SORTEDP
CHK-RULER-EXTENDERS
FIXNUM-BOUND
*DEFAULT-STEP-LIMIT*
INCLUDE-BOOK-DIR-ALIST-ENTRY-P
INCLUDE-BOOK-DIR-ALISTP
*CHECK-INVARIANT-RISK-VALUES*
[GC for 229 SFUN pages..(T=6).GC finished]
TTAG
GET-REGISTER-INVARIANT-RISK-WORLD
ACL2-DEFAULTS-TABLE
ACL2-DEFAULTS-TABLE
PRINT-CASE
ACL2-PRINT-CASE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SET-PRINT-CASE
SET-ACL2-PRINT-CASE
PRINT-BASE
ACL2-PRINT-BASE
PRINT-RADIX
ACL2-PRINT-RADIX
CHECK-PRINT-BASE
SET-PRINT-BASE
SET-ACL2-PRINT-BASE
SET-PRINT-CIRCLE
SET-PRINT-ESCAPE
[GC for 229 SFUN pages..(T=8).GC finished]
SET-PRINT-PRETTY
SET-PRINT-RADIX
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SET-PRINT-READABLY
CHECK-NULL-OR-NATP
SET-PRINT-LENGTH
SET-PRINT-LEVEL
[GC for 229 SFUN pages..(T=6).GC finished]
SET-PRINT-LINES
SET-PRINT-RIGHT-MARGIN
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
PRINC$
WRITE-BYTE$
W
GET-SERIALIZE-CHARACTER
[GC for 229 SFUN pages..(T=6).GC finished]
HONS-ENABLEDP
SET-SERIALIZE-CHARACTER-FN
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SET-SERIALIZE-CHARACTER
SET-SERIALIZE-CHARACTER-SYSTEM
PRINT-OBJECT$-SER
NIL
NIL
[GC for 1387 CONS pages..(T=6).GC finished]
PRINT-OBJECT$
PRINT-OBJECT$-PRESERVING-CASE
MAKE-INPUT-CHANNEL
MAKE-OUTPUT-CHANNEL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
OPEN-INPUT-CHANNEL
NIL
NIL
NIL
NIL
CLOSE-INPUT-CHANNEL
[GC for 1397 CONS pages..(T=8).GC finished]
OPEN-OUTPUT-CHANNEL
OPEN-OUTPUT-CHANNEL!
ASSERT$
ASSERT*
FMT-TO-COMMENT-WINDOW
FMT-TO-COMMENT-WINDOW!
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
PAIRLIS2
CW
CW!
CW-PRINT-BASE-RADIX
CW-PRINT-BASE-RADIX!
SUBSEQ-LIST
SUBSEQ
LOCK-SYMBOL-NAME-P
[GC for 229 SFUN pages..(T=6).GC finished]
ASSIGN-LOCK
LOCK-TABLE
WITH-LOCK
DEFLOCK
WITH-OUTPUT-LOCK
WITH-LOCAL-STATE-LOCK
GET-OUTPUT-STREAM-STRING$-FN
GET-OUTPUT-STREAM-STRING$
[GC for 1397 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
CLOSE-OUTPUT-CHANNEL
MAYBE-FINISH-OUTPUT$
READ-CHAR$
[GC for 229 SFUN pages..(T=6).GC finished]
PEEK-CHAR$
READ-BYTE$
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RAW-MODE-P
READ-OBJECT
READ-OBJECT-WITH-CASE
READ-OBJECT-SUPPRESS
*SUSPICIOUSLY-FIRST-NUMERIC-CHARS*
*SUSPICIOUSLY-FIRST-HEX-CHARS*
*HEX-CHARS*
*LETTER-CHARS*
*SLASHABLE-CHARS*
[GC for 1397 CONS pages..(T=8).GC finished]
SOME-SLASHABLE
PRIN1-WITH-SLASHES1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
PRIN1-WITH-SLASHES
SUSPICIOUSLY-FIRST-NUMERIC-CHARS
NUMERIC-CHARS
MAY-NEED-SLASHES1
NIL
[GC for 1407 CONS pages..(T=6).GC finished]
MAY-NEED-SLASHES-FN
MAY-NEED-SLASHES
NEEDS-SLASHES
T-STACK-LENGTH1
[GC for 229 SFUN pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
T-STACK-LENGTH
MAKE-LIST-AC
MAKE-LIST
EXTEND-T-STACK
:EMPTY-ENCAPSULATE
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
MSWINDOWS-DRIVE1
[GC for 229 SFUN pages..(T=8).GC finished]
MSWINDOWS-DRIVE
SHRINK-T-STACK
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
AREF-T-STACK
ASET-T-STACK
32-BIT-INTEGER-STACK-LENGTH1
32-BIT-INTEGER-STACK-LENGTH
[GC for 229 SFUN pages..(T=8).GC finished]
EXTEND-32-BIT-INTEGER-STACK
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SHRINK-32-BIT-INTEGER-STACK
AREF-32-BIT-INTEGER-STACK
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
ASET-32-BIT-INTEGER-STACK
F-BIG-CLOCK-NEGATIVE-P
F-DECREMENT-BIG-CLOCK
BIG-CLOCK-NEGATIVE-P
DECREMENT-BIG-CLOCK
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
LIST-ALL-PACKAGE-NAMES
USER-STOBJ-ALIST
UPDATE-USER-STOBJ-ALIST
POWER-EVAL
[GC for 229 SFUN pages..(T=6).GC finished]
READ-IDATE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
READ-RUN-TIME
READ-ACL2-ORACLE
READ-ACL2-ORACLE@PAR
GETENV$
[GC for 229 SFUN pages..(T=6).GC finished]
SETENV$
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RANDOM$
NIL
NIL
NIL
SYS-CALL
NIL
SYS-CALL-STATUS
:EMPTY-ENCAPSULATE
NIL
NIL
SYS-CALL+
[GC for 229 SFUN pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=6).GC finished]
SYS-CALL*
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
MAIN-TIMER
PUT-ASSOC-EQ-EXEC
[GC for 229 SFUN pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
PUT-ASSOC-EQL-EXEC
PUT-ASSOC-EQUAL
PUT-ASSOC-EQ
PUT-ASSOC-EQL
NIL
NIL
PUT-ASSOC
NIL
NIL
NIL
SET-TIMER
[GC for 229 SFUN pages..(T=8).GC finished]
GET-TIMER
NIL
PUSH-TIMER
NIL
NIL
NIL
NIL
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
POP-TIMER
ADD-TIMERS
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
INCREMENT-TIMER
[GC for 1407 CONS pages..(T=6).GC finished]
PRINT-RATIONAL-AS-DECIMAL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
PRINT-TIMER
NIL
SET-PRINT-BASE-RADIX
KNOWN-PACKAGE-ALIST
SYMBOL-IN-CURRENT-PACKAGE-P
[GC for 229 SFUN pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
PRIN1$
NIL
CURRENT-PACKAGE
NIL
*INITIAL-UNTOUCHABLE-FNS*
*INITIAL-UNTOUCHABLE-VARS*
LD-SKIP-PROOFSP
ASSIGN
@
MAKE-VAR-LST1
:EMPTY-ENCAPSULATE
[GC for 229 SFUN pages..(T=6).GC finished]
MAKE-VAR-LST
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
UNION-EQ-EXEC
[GC for 229 SFUN pages..(T=6).GC finished]
UNION-EQL-EXEC
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
UNION-EQUAL
UNION-EQ
NIL
NIL
PARSE-ARGS-AND-TEST
UNION-EQUAL-WITH-UNION-EQ-EXEC-GUARD
UNION-EQUAL-WITH-UNION-EQL-EXEC-GUARD
UNION$
SUBST-FOR-NTH-ARG
THE-MV
THE2S
[GC for 229 SFUN pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
INTERSECTION-EQ-EXEC
INTERSECTION-EQL-EXEC
[GC for 229 SFUN pages..(T=8).GC finished]
INTERSECTION-EQUAL
INTERSECTION-EQ
NIL
NIL
INTERSECTION-EQUAL-WITH-INTERSECTION-EQ-EXEC-GUARD
INTERSECTION-EQUAL-WITH-INTERSECTION-EQL-EXEC-GUARD
INTERSECTION$
SET-ENFORCE-REDUNDANCY
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
GET-ENFORCE-REDUNDANCY
DEFAULT-VERIFY-GUARDS-EAGERNESS-FROM-TABLE
DEFAULT-VERIFY-GUARDS-EAGERNESS
SET-VERIFY-GUARDS-EAGERNESS
[GC for 229 SFUN pages..(T=6).GC finished]
DEFAULT-COMPILE-FNS
SET-COMPILE-FNS
SET-COMPILER-ENABLED
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
SET-PORT-FILE-ENABLED
DEFAULT-MEASURE-FUNCTION
SET-MEASURE-FUNCTION
[GC for 229 SFUN pages..(T=8).GC finished]
DEFAULT-WELL-FOUNDED-RELATION
SET-WELL-FOUNDED-RELATION
DEFAULT-DEFUN-MODE-FROM-TABLE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
DEFAULT-DEFUN-MODE
DEFAULT-DEFUN-MODE-FROM-STATE
LOGIC
PROGRAM
INVISIBLE-FNS-TABLE
SET-INVISIBLE-FNS-TABLE
[GC for 229 SFUN pages..(T=6).GC finished]
UNARY-FUNCTION-SYMBOL-LISTP
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
INVISIBLE-FNS-ENTRYP
INVISIBLE-FNS-TABLE
INVISIBLE-FNS-TABLE
ADD-INVISIBLE-FNS
REMOVE-INVISIBLE-FNS
SET-INVISIBLE-FNS-ALIST
INVISIBLE-FNS-ALIST
SET-BOGUS-DEFUN-HINTS-OK
SET-BOGUS-MEASURE-OK
SET-BOGUS-MUTUAL-RECURSION-OK
SET-IRRELEVANT-FORMALS-OK
SET-IGNORE-OK
INHIBIT-WARNINGS-TABLE
SET-INHIBIT-WARNINGS!
SET-INHIBIT-WARNINGS
SET-INHIBIT-OUTPUT-LST
SET-INHIBITED-SUMMARY-TYPES
SET-STATE-OK
SET-LET*-ABSTRACTIONP
SET-LET*-ABSTRACTION
[GC for 1417 CONS pages..(T=8).GC finished]
LET*-ABSTRACTIONP
*INITIAL-BACKCHAIN-LIMIT*
*INITIAL-DEFAULT-BACKCHAIN-LIMIT*
SET-BACKCHAIN-LIMIT
BACKCHAIN-LIMIT
SET-DEFAULT-BACKCHAIN-LIMIT
[GC for 1427 CONS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
DEFAULT-BACKCHAIN-LIMIT
STEP-LIMIT-FROM-TABLE
SET-PROVER-STEP-LIMIT
*DEFAULT-REWRITE-STACK-LIMIT*
SET-REWRITE-STACK-LIMIT
REWRITE-STACK-LIMIT
[GC for 229 SFUN pages..(T=8).GC finished]
CASE-SPLIT-LIMITATIONS
SR-LIMIT
CASE-LIMIT
SET-CASE-SPLIT-LIMITATIONS
*INITIAL-ACL2-DEFAULTS-TABLE*
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
UNTRANS-TABLE
UNTRANS-TABLE
ADD-MACRO-FN
ADD-BINOP
REMOVE-MACRO-FN
REMOVE-BINOP
MATCH-FREE-DEFAULT
SET-MATCH-FREE-DEFAULT
SET-MATCH-FREE-ERROR
[GC for 229 SFUN pages..(T=6).GC finished]
MATCH-FREE-OVERRIDE
ADD-MATCH-FREE-OVERRIDE
ADD-INCLUDE-BOOK-DIR
DELETE-INCLUDE-BOOK-DIR
INCLUDE-BOOK-DIR!-TABLE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RAW-INCLUDE-BOOK-DIR-P
ADD-INCLUDE-BOOK-DIR!
DELETE-INCLUDE-BOOK-DIR!
*NON-LINEAR-ROUNDS-VALUE*
NON-LINEARP
SET-NON-LINEARP
SET-NON-LINEAR
[GC for 229 SFUN pages..(T=8).GC finished]
TAU-AUTO-MODEP
SET-TAU-AUTO-MODE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
GET-IN-THEORY-REDUNDANT-OKP
DEFTTAG
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES
ADD-MACRO-ALIAS
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
[GC for 1437 CONS pages..(T=8).GC finished]
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
DELETE-ASSOC-EQ-EXEC
MACRO-ALIASES-TABLE
DELETE-ASSOC-EQL-EXEC
MACRO-ALIASES-TABLE
DELETE-ASSOC-EQUAL
MACRO-ALIASES-TABLE
DELETE-ASSOC-EQ
DELETE-ASSOC
REMOVE-MACRO-ALIAS
NTH-ALIASES-TABLE
:REDUNDANT
NTH-ALIASES
ADD-NTH-ALIAS
REMOVE-NTH-ALIAS
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
DEFAULT-HINTS
SET-DEFAULT-HINTS
SET-DEFAULT-HINTS!
ADD-DEFAULT-HINTS
ADD-DEFAULT-HINTS!
REMOVE-DEFAULT-HINTS
REMOVE-DEFAULT-HINTS!
SET-OVERRIDE-HINTS-MACRO
ADD-OVERRIDE-HINTS!
ADD-OVERRIDE-HINTS
SET-OVERRIDE-HINTS!
SET-OVERRIDE-HINTS
REMOVE-OVERRIDE-HINTS!
REMOVE-OVERRIDE-HINTS
SET-RW-CACHE-STATE
SET-RW-CACHE-STATE!
*LEGAL-RW-CACHE-STATES*
RW-CACHE-STATE-TABLE
INDUCTION-DEPTH-LIMIT-TABLE
*INDUCTION-DEPTH-LIMIT-DEFAULT*
INDUCTION-DEPTH-LIMIT-TABLE
SET-INDUCTION-DEPTH-LIMIT!
SET-INDUCTION-DEPTH-LIMIT
TRUE-LIST-FIX-EXEC
[GC for 229 SFUN pages..(T=6).GC finished]
TRUE-LIST-FIX
:EMPTY-ENCAPSULATE
NIL
FIX-TRUE-LIST
MACRO-ALIASES-TABLE
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
BOOLEAN-LISTP
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
DOUBLE-REWRITE
CHK-WITH-PROVER-TIME-LIMIT-ARG
WITH-PROVER-TIME-LIMIT1
WITH-PROVER-TIME-LIMIT
CATCH-TIME-LIMIT5
*INTERRUPT-STRING*
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
TIME-LIMIT5-REACHED-P
CATCH-STEP-LIMIT
*GUARD-CHECKING-VALUES*
CHK-WITH-GUARD-CHECKING-ARG
WITH-GUARD-CHECKING1
WITH-GUARD-CHECKING-GATE
WITH-GUARD-CHECKING
WITH-GUARD-CHECKING-ERROR-TRIPLE
WITH-GUARD-CHECKING-EVENT
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
ABORT!
A!
P!
NIL
BIND-ACL2-TIME-LIMIT
OUR-WITH-TERMINAL-INPUT
WORMHOLE1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
WORMHOLE-P
DUPLICATES
[GC for 229 SFUN pages..(T=6).GC finished]
EVENS
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
ODDS
SET-EQUALP-EQUAL
|Access METAFUNCTION-CONTEXT record field UNIFY-SUBST|
|Access REWRITE-CONSTANT record field CURRENT-CLAUSE|
[GC for 229 SFUN pages..(T=6).GC finished]
RECORD-ERROR
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RECORD-ACCESSOR-FUNCTION-NAME
ACCESS
MFC-CLAUSE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
MFC-RDEPTH
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
TYPE-ALIST-ENTRYP
TYPE-ALISTP
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
MFC-TYPE-ALIST
MFC-ANCESTORS
MFC-UNIFY-SUBST
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
MFC-WORLD
NIL
NIL
BAD-ATOM
NIL
NIL
NIL
NIL
NIL
NIL
[GC for 229 SFUN pages..(T=8).GC finished]
ALPHORDER
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
LEXORDER
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
NIL
MERGE-LEXORDER
NIL
NIL
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
MERGE-SORT-LEXORDER
IF*
RESIZE-LIST-EXEC
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
RESIZE-LIST
NIL
NIL
E/D-FN
E/D
<state>
To verify that the 30 encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 p!>>(LOGIC)
:INVISIBLE
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP)
The admission of ALISTP is trivial, using the relation O< (which is
known to be well-founded on the domain recognized by O-P) and the measure
(ACL2-COUNT L). We observe that the type of ALISTP is described by
the theorem (OR (EQUAL (ALISTP L) T) (EQUAL (ALISTP L) NIL)). We used
primitive type reasoning.
Computing the guard conjecture for ALISTP....
The guard conjecture for ALISTP is trivial to prove. ALISTP is compliant
with Common Lisp.
[GC for 1447 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN ALISTP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
ALISTP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP)
The admission of SYMBOL-ALISTP is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of SYMBOL-ALISTP
is described by the theorem
(OR (EQUAL (SYMBOL-ALISTP X) T) (EQUAL (SYMBOL-ALISTP X) NIL)). We
used primitive type reasoning.
Computing the guard conjecture for SYMBOL-ALISTP....
The guard conjecture for SYMBOL-ALISTP is trivial to prove. SYMBOL-ALISTP
is compliant with Common Lisp.
Summary
Form: ( DEFUN SYMBOL-ALISTP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
SYMBOL-ALISTP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP)
The event ( DEFUN TRUE-LISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN TRUE-LISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN)
The event ( DEFUN LEN ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN LEN ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH)
The event ( DEFUN LENGTH ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN LENGTH ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH)
The admission of NTH is trivial, using the relation O< (which is known
to be well-founded on the domain recognized by O-P) and the measure
(ACL2-COUNT N). We could deduce no constraints on the type of NTH.
Computing the guard conjecture for NTH....
The non-trivial part of the guard conjecture for NTH, given primitive
type reasoning, is
Goal
(IMPLIES (AND (TRUE-LISTP L)
(<= 0 N)
(INTEGERP N)
(NOT (ENDP L))
(NOT (ZP N)))
(<= 0 (+ -1 N))).
But we reduce the conjecture to T, by the simple :definitions ENDP
and ZP and the :executable-counterpart of TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for NTH. NTH is compliant
with Common Lisp.
Summary
Form: ( DEFUN NTH ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION NOT)
(:DEFINITION ZP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
Prover steps counted: 62
NTH
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR)
Since CHAR is non-recursive, its admission is trivial. We could deduce
no constraints on the type of CHAR.
Computing the guard conjecture for CHAR....
[GC for 1457 CONS pages..(T=8).GC finished]
The guard conjecture for CHAR is trivial to prove, given primitive
type reasoning and the :type-prescription rule LENGTH. CHAR is compliant
with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN CHAR ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION LENGTH))
Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30)
CHAR
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP)
The admission of EQLABLE-ALISTP is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of EQLABLE-ALISTP
is described by the theorem
(OR (EQUAL (EQLABLE-ALISTP X) T) (EQUAL (EQLABLE-ALISTP X) NIL)).
We used primitive type reasoning.
Computing the guard conjecture for EQLABLE-ALISTP....
The guard conjecture for EQLABLE-ALISTP is trivial to prove. EQLABLE-ALISTP
is compliant with Common Lisp.
Summary
Form: ( DEFUN EQLABLE-ALISTP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
EQLABLE-ALISTP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC)
The admission of ASSOC-EQL-EXEC is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT ALIST). We could deduce no constraints on the
type of ASSOC-EQL-EXEC.
Computing the guard conjecture for ASSOC-EQL-EXEC....
The non-trivial part of the guard conjecture for ASSOC-EQL-EXEC is
Goal
(AND (IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(NOT (CONSP ALIST)))
(EQ ALIST NIL))
(IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(NOT (ENDP ALIST))
(NOT (EQL X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST)))
(IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(NOT (ENDP ALIST))
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL))
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (EQLABLEP X))
(NOT (ENDP ALIST)))
(EQLABLEP (CAR (CAR ALIST))))
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (EQLABLEP X))
(NOT (ENDP ALIST))
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL))
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (EQLABLEP X))
(NOT (ENDP ALIST))
(NOT (EQL X (CAR (CAR ALIST)))))
(EQLABLE-ALISTP (CDR ALIST)))
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (EQLABLEP X))
(NOT (CONSP ALIST)))
(EQ ALIST NIL))).
By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the
conjecture to the following seven conjectures.
Subgoal 7
(IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(NOT (CONSP ALIST)))
(EQUAL ALIST NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 6
(IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(CONSP ALIST)
(NOT (EQUAL X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST))).
[GC for 1467 CONS pages..(T=6).GC finished]
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 5
(IMPLIES (AND (ALISTP ALIST)
(EQLABLEP X)
(CONSP ALIST)
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 4
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(CONSP ALIST)
(NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
(NOT (SYMBOLP (CAR (CAR ALIST)))))
(CHARACTERP (CAR (CAR ALIST)))).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal 3
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(CONSP ALIST)
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
Subgoal 2
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(CONSP ALIST)
(NOT (EQUAL X (CAR (CAR ALIST)))))
(EQLABLE-ALISTP (CDR ALIST))).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal 1
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(NOT (CONSP ALIST)))
(EQUAL ALIST NIL)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
Q.E.D.
That completes the proof of the guard theorem for ASSOC-EQL-EXEC.
ASSOC-EQL-EXEC is compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN ASSOC-EQL-EXEC ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION EQL)
(:DEFINITION EQLABLE-ALISTP)
(:DEFINITION EQLABLEP)
(:DEFINITION NOT))
Time: 0.36 seconds (prove: 0.08, print: 0.00, other: 0.28)
Prover steps counted: 665
ASSOC-EQL-EXEC
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK)
Since ASSOC-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is
trivial. We observe that the type of ASSOC-EQL-EXEC$GUARD-CHECK is
described by the theorem (EQUAL (ASSOC-EQL-EXEC$GUARD-CHECK X ALIST) T).
Computing the guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK....
The guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK is trivial to prove.
ASSOC-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp.
Summary
Form: ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
ASSOC-EQL-EXEC$GUARD-CHECK
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL)
The admission of ASSOC-EQUAL is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT ALIST). We could deduce no constraints on the
type of ASSOC-EQUAL.
Computing the guard conjecture for ASSOC-EQUAL....
The non-trivial part of the guard conjecture for ASSOC-EQUAL is
Goal
(AND (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST)))
(EQ ALIST NIL))
(IMPLIES (AND (ALISTP ALIST)
(NOT (ENDP ALIST))
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL))
(IMPLIES (AND (ALISTP ALIST)
(NOT (ENDP ALIST))
(NOT (EQUAL X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST)))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following three conjectures.
Subgoal 3
(IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST)))
(EQUAL ALIST NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 2
(IMPLIES (AND (ALISTP ALIST)
(CONSP ALIST)
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 1
(IMPLIES (AND (ALISTP ALIST)
(CONSP ALIST)
(NOT (EQUAL X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST))).
But simplification reduces this to T, using the :definition ALISTP.
Q.E.D.
That completes the proof of the guard theorem for ASSOC-EQUAL. ASSOC-EQUAL
is compliant with Common Lisp.
Summary
Form: ( DEFUN ASSOC-EQUAL ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT))
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
Prover steps counted: 188
ASSOC-EQUAL
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS)
The admission of SUBLIS is trivial, using the relation O< (which is
known to be well-founded on the domain recognized by O-P) and the measure
(ACL2-COUNT TREE). We could deduce no constraints on the type of SUBLIS.
Computing the guard conjecture for SUBLIS....
[GC for 1467 CONS pages..(T=6).GC finished]
The non-trivial part of the guard conjecture for SUBLIS is
Goal
(AND (IMPLIES (AND (EQLABLE-ALISTP ALIST) (ATOM TREE))
(LET ((X TREE))
(AND (OR (NOT (EQLABLEP X)) (ALISTP ALIST))
(OR (EQLABLEP X) (EQLABLE-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQL-EXEC X ALIST)))))
(IMPLIES (AND (EQLABLE-ALISTP ALIST) (ATOM TREE))
(LET ((PAIR (ASSOC-EQUAL TREE ALIST)))
(OR (NOT PAIR)
(CONSP PAIR)
(EQUAL PAIR NIL))))).
By the simple :definition ATOM we reduce the conjecture to the following
two conjectures.
Subgoal 2
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(LET ((X TREE))
(AND (OR (NOT (EQLABLEP X)) (ALISTP ALIST))
(OR (EQLABLEP X) (EQLABLE-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQL-EXEC X ALIST))))).
This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
(if-intro) and the :type-prescription rule EQLABLE-ALISTP, to the following
four conjectures.
Subgoal 2.4
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
Name the formula above *1.
Subgoal 2.3
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
Name the formula above *2.
Subgoal 2.2
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
[GC for 1467 CONS pages..(T=8).GC finished]
Name the formula above *3.
Subgoal 2.1
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
Name the formula above *4.
Subgoal 1
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST)
(NOT (CONSP (ASSOC-EQUAL TREE ALIST))))
(EQUAL (ASSOC-EQUAL TREE ALIST) NIL)).
This simplifies, using primitive type reasoning, to
Subgoal 1'
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
Name the formula above *5.
Perhaps we can prove *5 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
These merge into one derived induction scheme.
We will induct according to a scheme suggested by (ASSOC-EQUAL TREE ALIST).
This suggestion was produced using the :induction rules ASSOC-EQUAL
and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *5 above then
the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(:P (CDR ALIST) TREE))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ENDP ALIST))
(EQUAL TREE (CAR (CAR ALIST))))
(:P ALIST TREE))
(IMPLIES (ENDP ALIST) (:P ALIST TREE))).
This induction is justified by the same argument used to admit ASSOC-EQUAL.
When applied to the goal at hand the above induction scheme produces
five nontautological subgoals.
Subgoal *5/5
(IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(CONSP (ASSOC-EQUAL TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
[GC for 1467 CONS pages..(T=6).GC finished]
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/5'
(IMPLIES (AND (CONSP ALIST)
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(CONSP (ASSOC-EQUAL TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
Subgoal *5/4
(IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(NOT (ASSOC-EQUAL TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/4'
(IMPLIES (AND (CONSP ALIST)
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(NOT (ASSOC-EQUAL TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
Subgoal *5/3
(IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/3'
(IMPLIES (AND (CONSP ALIST)
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *5/2
(IMPLIES (AND (NOT (ENDP ALIST))
(EQUAL TREE (CAR (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/2'
(IMPLIES (AND (CONSP ALIST)
(EQUAL TREE (CAR (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
[GC for 1467 CONS pages..(T=6).GC finished]
But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
Subgoal *5/1
(IMPLIES (AND (ENDP ALIST)
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/1'
(IMPLIES (AND (NOT (CONSP ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ASSOC-EQUAL TREE ALIST))
(CONSP (ASSOC-EQUAL TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQUAL
and EQLABLE-ALISTP, the :executable-counterpart of CONSP and primitive
type reasoning.
That completes the proof of *5.
We therefore turn our attention to *4, which is
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
Perhaps we can prove *4 by induction. Two induction schemes are suggested
by this conjecture. Subsumption reduces that number to one.
We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
This suggestion was produced using the :induction rules ALISTP and
EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *4 above then the
induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST)))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(:P (CDR ALIST) TREE))
(:P ALIST TREE))
(IMPLIES (ATOM ALIST) (:P ALIST TREE))).
This induction is justified by the same argument used to admit
EQLABLE-ALISTP. When applied to the goal at hand the above induction
scheme produces five nontautological subgoals.
Subgoal *4/5
(IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *4/5'
(IMPLIES (AND (CONSP ALIST)
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
Subgoal *4/4
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
to
Subgoal *4/4'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
(NOT (SYMBOLP (CAR (CAR ALIST))))
(NOT (CHARACTERP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
[GC for 1467 CONS pages..(T=6).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *4/3
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *4/3'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions ALISTP,
EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
Subgoal *4/2
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *4/2'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *4/1
(IMPLIES (AND (ATOM ALIST)
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *4/1'
(IMPLIES (AND (NOT (CONSP ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(SYMBOLP TREE))
(ALISTP ALIST)).
[GC for 1467 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
the :executable-counterparts of ALISTP and CONSP and primitive type
reasoning.
That completes the proof of *4.
We therefore turn our attention to *3, which is
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
Perhaps we can prove *3 by induction. Two induction schemes are suggested
by this conjecture. Subsumption reduces that number to one.
We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
This suggestion was produced using the :induction rules ALISTP and
EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *3 above then the
induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST)))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(:P (CDR ALIST) TREE))
(:P ALIST TREE))
(IMPLIES (ATOM ALIST) (:P ALIST TREE))).
This induction is justified by the same argument used to admit
EQLABLE-ALISTP. When applied to the goal at hand the above induction
scheme produces five nontautological subgoals.
Subgoal *3/5
(IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *3/5'
(IMPLIES (AND (CONSP ALIST)
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
Subgoal *3/4
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
to
Subgoal *3/4'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
(NOT (SYMBOLP (CAR (CAR ALIST))))
(NOT (CHARACTERP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *3/3
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *3/3'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
[GC for 1467 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions ALISTP,
EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
Subgoal *3/2
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *3/2'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *3/1
(IMPLIES (AND (ATOM ALIST)
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *3/1'
(IMPLIES (AND (NOT (CONSP ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(CHARACTERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
the :executable-counterparts of ALISTP and CONSP and primitive type
reasoning.
That completes the proof of *3.
We therefore turn our attention to *2, which is
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
Perhaps we can prove *2 by induction. Two induction schemes are suggested
by this conjecture. Subsumption reduces that number to one.
We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST).
This suggestion was produced using the :induction rules ALISTP and
EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *2 above then the
induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST)))))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(:P (CDR ALIST) TREE))
(:P ALIST TREE))
(IMPLIES (ATOM ALIST) (:P ALIST TREE))).
This induction is justified by the same argument used to admit
EQLABLE-ALISTP. When applied to the goal at hand the above induction
scheme produces five nontautological subgoals.
Subgoal *2/5
(IMPLIES (AND (NOT (ATOM ALIST))
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
[GC for 1467 CONS pages..(T=6).GC finished]
Subgoal *2/5'
(IMPLIES (AND (CONSP ALIST)
(NOT (CONSP (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP.
Subgoal *2/4
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(NOT (EQLABLEP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
By the simple :definitions ATOM and EQLABLEP we reduce the conjecture
to
Subgoal *2/4'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(NOT (ACL2-NUMBERP (CAR (CAR ALIST))))
(NOT (SYMBOLP (CAR (CAR ALIST))))
(NOT (CHARACTERP (CAR (CAR ALIST))))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *2/3
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *2/3'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(ALISTP (CDR ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions ALISTP,
EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP.
Subgoal *2/2
(IMPLIES (AND (NOT (ATOM ALIST))
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
[GC for 1467 CONS pages..(T=8).GC finished]
Subgoal *2/2'
(IMPLIES (AND (CONSP ALIST)
(CONSP (CAR ALIST))
(EQLABLEP (CAR (CAR ALIST)))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *2/1
(IMPLIES (AND (ATOM ALIST)
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *2/1'
(IMPLIES (AND (NOT (CONSP ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE))
(ACL2-NUMBERP TREE))
(ALISTP ALIST)).
But simplification reduces this to T, using the :definition EQLABLE-ALISTP,
the :executable-counterparts of ALISTP and CONSP and primitive type
reasoning.
That completes the proof of *2.
We therefore turn our attention to *1, which is
(IMPLIES (AND (EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. These merge into one derived induction
scheme.
We will induct according to a scheme suggested by
(ASSOC-EQL-EXEC TREE ALIST). This suggestion was produced using the
:induction rules ASSOC-EQL-EXEC, ASSOC-EQUAL and EQLABLE-ALISTP. If
we let (:P ALIST TREE) denote *1 above then the induction scheme we'll
use is
(AND (IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQL TREE (CAR (CAR ALIST))))
(:P (CDR ALIST) TREE))
(:P ALIST TREE))
(IMPLIES (AND (NOT (ENDP ALIST))
(EQL TREE (CAR (CAR ALIST))))
(:P ALIST TREE))
(IMPLIES (ENDP ALIST) (:P ALIST TREE))).
This induction is justified by the same argument used to admit
ASSOC-EQL-EXEC. When applied to the goal at hand the above induction
scheme produces four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQL TREE (CAR (CAR ALIST))))
(EQUAL (ASSOC-EQUAL TREE (CDR ALIST))
(ASSOC-EQL-EXEC TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/4'
(IMPLIES (AND (CONSP ALIST)
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(EQUAL (ASSOC-EQUAL TREE (CDR ALIST))
(ASSOC-EQL-EXEC TREE (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
Subgoal *1/3
(IMPLIES (AND (NOT (ENDP ALIST))
(NOT (EQL TREE (CAR (CAR ALIST))))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/3'
(IMPLIES (AND (CONSP ALIST)
(NOT (EQUAL TREE (CAR (CAR ALIST))))
(NOT (EQLABLE-ALISTP (CDR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
[GC for 1467 CONS pages..(T=6).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-ALISTP
and EQLABLEP.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP ALIST))
(EQL TREE (CAR (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP ALIST)
(EQUAL TREE (CAR (CAR ALIST)))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ENDP ALIST)
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (AND (NOT (CONSP ALIST))
(EQLABLE-ALISTP ALIST)
(NOT (CONSP TREE)))
(EQUAL (ASSOC-EQUAL TREE ALIST)
(ASSOC-EQL-EXEC TREE ALIST))).
But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC,
ASSOC-EQUAL and EQLABLE-ALISTP, the :executable-counterparts of CONSP
and EQUAL and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
That completes the proof of the guard theorem for SUBLIS. SUBLIS is
compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN SUBLIS ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ASSOC-EQL-EXEC)
(:DEFINITION ASSOC-EQUAL)
(:DEFINITION ATOM)
(:DEFINITION ENDP)
(:DEFINITION EQL)
(:DEFINITION EQLABLE-ALISTP)
(:DEFINITION EQLABLEP)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART ALISTP)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION ALISTP)
(:INDUCTION ASSOC-EQL-EXEC)
(:INDUCTION ASSOC-EQUAL)
(:INDUCTION EQLABLE-ALISTP)
(:TYPE-PRESCRIPTION ALISTP)
(:TYPE-PRESCRIPTION EQLABLE-ALISTP))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION EQLABLEP)
(:DEFINITION NOT))
Time: 1.10 seconds (prove: 0.50, print: 0.18, other: 0.42)
Prover steps counted: 5516
SUBLIS
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX)
Since NFIX is non-recursive, its admission is trivial. We observe
that the type of NFIX is described by the theorem
(AND (INTEGERP (NFIX X)) (<= 0 (NFIX X))).
Computing the guard conjecture for NFIX....
The guard conjecture for NFIX is trivial to prove. NFIX is compliant
with Common Lisp.
Summary
Form: ( DEFUN NFIX ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
NFIX
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX)
Since IFIX is non-recursive, its admission is trivial. We observe
that the type of IFIX is described by the theorem (INTEGERP (IFIX X)).
Computing the guard conjecture for IFIX....
The guard conjecture for IFIX is trivial to prove. IFIX is compliant
with Common Lisp.
Summary
Form: ( DEFUN IFIX ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
IFIX
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS)
Since INTEGER-ABS is non-recursive, its admission is trivial. We observe
that the type of INTEGER-ABS is described by the theorem
(AND (INTEGERP (INTEGER-ABS X)) (<= 0 (INTEGER-ABS X))). We used primitive
type reasoning.
Computing the guard conjecture for INTEGER-ABS....
The guard conjecture for INTEGER-ABS is trivial to prove. INTEGER-ABS
is compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN INTEGER-ABS ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
INTEGER-ABS
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT)
The admission of ACL2-COUNT is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of ACL2-COUNT is
described by the theorem
(AND (INTEGERP (ACL2-COUNT X)) (<= 0 (ACL2-COUNT X))). We used primitive
type reasoning and the :type-prescription rules INTEGER-ABS and LENGTH.
Computing the guard conjecture for ACL2-COUNT....
The guard conjecture for ACL2-COUNT is trivial to prove, given primitive
type reasoning and the :type-prescription rules ACL2-COUNT and INTEGER-ABS.
ACL2-COUNT is compliant with Common Lisp.
Summary
Form: ( DEFUN ACL2-COUNT ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION ACL2-COUNT)
(:TYPE-PRESCRIPTION INTEGER-ABS)
(:TYPE-PRESCRIPTION LENGTH))
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
ACL2-COUNT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT)
For the admission of NONNEGATIVE-INTEGER-QUOTIENT we will use the relation
O< (which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT I). The non-trivial part of the measure
conjecture is
Goal
(IMPLIES (NOT (OR (= (NFIX J) 0) (< (IFIX I) J)))
(O< (ACL2-COUNT (+ I (- J)))
(ACL2-COUNT I))).
By the simple :definition = we reduce the conjecture to
Goal'
(IMPLIES (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J)))
(O< (ACL2-COUNT (+ I (- J)))
(ACL2-COUNT I))).
This simplifies, using the :definitions ACL2-COUNT (if-intro), IFIX
(if-intro), INTEGER-ABS (if-intro), NFIX (if-intro), O-FINP and O<
(if-intro) and primitive type reasoning, to the following two conjectures.
Subgoal 2
(IMPLIES (AND (INTEGERP J)
(<= 0 J)
(NOT (EQUAL J 0))
(INTEGERP I)
(<= J I)
(< (+ I (- J)) 0))
(< (- (+ I (- J))) I)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (INTEGERP J)
(<= 0 J)
(NOT (EQUAL J 0))
(INTEGERP I)
(<= J I)
(<= 0 (+ I (- J))))
(< (+ I (- J)) I)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the measure theorem for
NONNEGATIVE-INTEGER-QUOTIENT. Thus, we admit this function under the
principle of definition. We observe that the type of
NONNEGATIVE-INTEGER-QUOTIENT is described by the theorem
(AND (INTEGERP (NONNEGATIVE-INTEGER-QUOTIENT I J))
(<= 0 (NONNEGATIVE-INTEGER-QUOTIENT I J))).
We used primitive type reasoning and the :type-prescription rule NFIX.
Computing the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT....
[GC for 1467 CONS pages..(T=6).GC finished]
The non-trivial part of the guard conjecture for
NONNEGATIVE-INTEGER-QUOTIENT, given primitive type reasoning and the
:type-prescription rules IFIX, NFIX and NONNEGATIVE-INTEGER-QUOTIENT,
is
Goal
(IMPLIES (AND (< 0 J)
(INTEGERP J)
(<= 0 I)
(INTEGERP I)
(NOT (OR (= (NFIX J) 0) (< (IFIX I) J))))
(<= 0 (+ I (- J)))).
By the simple :definition = we reduce the conjecture to
Goal'
(IMPLIES (AND (< 0 J)
(INTEGERP J)
(<= 0 I)
(INTEGERP I)
(NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J))))
(<= 0 (+ I (- J)))).
This simplifies, using the :definitions IFIX and NFIX and primitive
type reasoning, to
Goal''
(IMPLIES (AND (< 0 J)
(INTEGERP J)
(<= 0 I)
(INTEGERP I)
(<= J I))
(<= 0 (+ I (- J)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for
NONNEGATIVE-INTEGER-QUOTIENT. NONNEGATIVE-INTEGER-QUOTIENT is compliant
with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...)
Rules: ((:DEFINITION =)
(:DEFINITION ACL2-COUNT)
(:DEFINITION IFIX)
(:DEFINITION INTEGER-ABS)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION O-FINP)
(:DEFINITION O<)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION IFIX)
(:TYPE-PRESCRIPTION NFIX)
(:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION ACL2-COUNT)
(:DEFINITION IFIX)
(:DEFINITION INTEGER-ABS)
(:DEFINITION NFIX)
(:DEFINITION O<))
Time: 0.38 seconds (prove: 0.02, print: 0.00, other: 0.36)
Prover steps counted: 501
NONNEGATIVE-INTEGER-QUOTIENT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR)
Since FLOOR is non-recursive, its admission is trivial. We observe
that the type of FLOOR is described by the theorem (INTEGERP (FLOOR I J)).
We used primitive type reasoning and the :type-prescription rule
NONNEGATIVE-INTEGER-QUOTIENT.
Computing the guard conjecture for FLOOR....
The guard conjecture for FLOOR is trivial to prove, given the :executable-
counterpart of EQLABLEP, primitive type reasoning and the :type-prescription
rule NONNEGATIVE-INTEGER-QUOTIENT. FLOOR is compliant with Common
Lisp.
Summary
Form: ( DEFUN FLOOR ...)
Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT))
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
FLOOR
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP)
The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SYMBOL-LISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND)
The admission of BINARY-APPEND is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of BINARY-APPEND
is described by the theorem (OR (CONSP (APPEND X Y)) (EQUAL (APPEND X Y) Y)).
We used primitive type reasoning.
Computing the guard conjecture for BINARY-APPEND....
The guard conjecture for BINARY-APPEND is trivial to prove, given primitive
type reasoning. BINARY-APPEND is compliant with Common Lisp.
Summary
Form: ( DEFUN BINARY-APPEND ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
BINARY-APPEND
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND)
Since STRING-APPEND is non-recursive, its admission is trivial. We
observe that the type of STRING-APPEND is described by the theorem
(STRINGP (STRING-APPEND STR1 STR2)). We used primitive type reasoning.
Computing the guard conjecture for STRING-APPEND....
The non-trivial part of the guard conjecture for STRING-APPEND is
Goal
(IMPLIES (AND (STRINGP STR2) (STRINGP STR1))
(EQUAL (COERCE (APPEND (COERCE STR1 'LIST)
(COERCE STR2 'LIST))
'STRING)
(STRING-APPEND STR1 STR2))).
But we reduce the conjecture to T, by the simple :definition STRING-APPEND.
Q.E.D.
That completes the proof of the guard theorem for STRING-APPEND.
STRING-APPEND is compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN STRING-APPEND ...)
Rules: ((:DEFINITION STRING-APPEND)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.28 seconds (prove: 0.02, print: 0.00, other: 0.26)
Prover steps counted: 32
STRING-APPEND
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP)
The admission of PLIST-WORLDP is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT ALIST). We observe that the type of PLIST-WORLDP
is described by the theorem
(OR (EQUAL (PLIST-WORLDP ALIST) T) (EQUAL (PLIST-WORLDP ALIST) NIL)).
We used primitive type reasoning.
Computing the guard conjecture for PLIST-WORLDP....
The guard conjecture for PLIST-WORLDP is trivial to prove. PLIST-WORLDP
is compliant with Common Lisp.
Summary
Form: ( DEFUN PLIST-WORLDP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
PLIST-WORLDP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP)
The admission of FGETPROP is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT WORLD-ALIST). We could deduce no constraints on
the type of FGETPROP.
Computing the guard conjecture for FGETPROP....
The non-trivial part of the guard conjecture for FGETPROP is
Goal
(AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (CONSP WORLD-ALIST)))
(EQ WORLD-ALIST NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(NOT (CONSP (CAR WORLD-ALIST))))
(EQUAL (CAR WORLD-ALIST) NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
(EQ KEY (CADR (CAR WORLD-ALIST))))))
(PLIST-WORLDP (CDR WORLD-ALIST)))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
(EQ KEY (CADR (CAR WORLD-ALIST))))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(EQ SYMB (CAR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following five conjectures.
Subgoal 5
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (CONSP WORLD-ALIST)))
(EQUAL WORLD-ALIST NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 4
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(NOT (CONSP (CAR WORLD-ALIST))))
(EQUAL (CAR WORLD-ALIST) NIL)).
[GC for 1477 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 3
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(EQUAL KEY (CADR (CAR WORLD-ALIST))))))
(PLIST-WORLDP (CDR WORLD-ALIST))).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 2
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(EQUAL KEY (CADR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 1
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Q.E.D.
That completes the proof of the guard theorem for FGETPROP. FGETPROP
is compliant with Common Lisp.
Summary
Form: ( DEFUN FGETPROP ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT)
(:DEFINITION PLIST-WORLDP))
Time: 0.30 seconds (prove: 0.08, print: 0.00, other: 0.22)
Prover steps counted: 704
FGETPROP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP)
The admission of SGETPROP is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT WORLD-ALIST). We could deduce no constraints on
the type of SGETPROP.
Computing the guard conjecture for SGETPROP....
The non-trivial part of the guard conjecture for SGETPROP is
Goal
(AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (CONSP WORLD-ALIST)))
(EQ WORLD-ALIST NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(NOT (CONSP (CAR WORLD-ALIST))))
(EQUAL (CAR WORLD-ALIST) NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
(EQ KEY (CADR (CAR WORLD-ALIST))))))
(PLIST-WORLDP (CDR WORLD-ALIST)))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(AND (EQ SYMB (CAR (CAR WORLD-ALIST)))
(EQ KEY (CADR (CAR WORLD-ALIST))))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL))
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (ENDP WORLD-ALIST))
(EQ SYMB (CAR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL))).
[GC for 1477 CONS pages..(T=8).GC finished]
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following five conjectures.
Subgoal 5
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(NOT (CONSP WORLD-ALIST)))
(EQUAL WORLD-ALIST NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 4
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(NOT (CONSP (CAR WORLD-ALIST))))
(EQUAL (CAR WORLD-ALIST) NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 3
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(EQUAL KEY (CADR (CAR WORLD-ALIST))))))
(PLIST-WORLDP (CDR WORLD-ALIST))).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 2
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(EQUAL KEY (CADR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Subgoal 1
(IMPLIES (AND (PLIST-WORLDP WORLD-ALIST)
(SYMBOLP WORLD-NAME)
(SYMBOLP KEY)
(SYMBOLP SYMB)
(CONSP WORLD-ALIST)
(EQUAL SYMB (CAR (CAR WORLD-ALIST)))
(NOT (CONSP (CDR (CAR WORLD-ALIST)))))
(EQUAL (CDR (CAR WORLD-ALIST)) NIL)).
But simplification reduces this to T, using the :definition PLIST-WORLDP.
Q.E.D.
That completes the proof of the guard theorem for SGETPROP. SGETPROP
is compliant with Common Lisp.
[GC for 1477 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN SGETPROP ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT)
(:DEFINITION PLIST-WORLDP))
Time: 0.44 seconds (prove: 0.00, print: 0.00, other: 0.44)
Prover steps counted: 804
SGETPROP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP)
Since FUNCTION-SYMBOLP is non-recursive, its admission is trivial.
We observe that the type of FUNCTION-SYMBOLP is described by the theorem
(OR (EQUAL (FUNCTION-SYMBOLP SYM WRLD) T)
(EQUAL (FUNCTION-SYMBOLP SYM WRLD)
NIL)).
Computing the guard conjecture for FUNCTION-SYMBOLP....
The guard conjecture for FUNCTION-SYMBOLP is trivial to prove.
FUNCTION-SYMBOLP is compliant with Common Lisp.
Summary
Form: ( DEFUN FUNCTION-SYMBOLP ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
FUNCTION-SYMBOLP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS)
The admission of STRIP-CARS is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of STRIP-CARS is
described by the theorem (TRUE-LISTP (STRIP-CARS X)). We used primitive
type reasoning.
Computing the guard conjecture for STRIP-CARS....
The non-trivial part of the guard conjecture for STRIP-CARS is
Goal
(AND (IMPLIES (AND (ALISTP X) (NOT (CONSP X)))
(EQ X NIL))
(IMPLIES (AND (ALISTP X) (NOT (ENDP X)))
(ALISTP (CDR X)))
(IMPLIES (AND (ALISTP X)
(NOT (ENDP X))
(NOT (CONSP (CAR X))))
(EQUAL (CAR X) NIL))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following three conjectures.
Subgoal 3
(IMPLIES (AND (ALISTP X) (NOT (CONSP X)))
(EQUAL X NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 2
(IMPLIES (AND (ALISTP X) (CONSP X))
(ALISTP (CDR X))).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 1
(IMPLIES (AND (ALISTP X)
(CONSP X)
(NOT (CONSP (CAR X))))
(EQUAL (CAR X) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Q.E.D.
That completes the proof of the guard theorem for STRIP-CARS. STRIP-CARS
is compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN STRIP-CARS ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
Prover steps counted: 174
STRIP-CARS
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK)
Since ASSOC-EQ-EXEC$GUARD-CHECK is non-recursive, its admission is
trivial. We observe that the type of ASSOC-EQ-EXEC$GUARD-CHECK is
described by the theorem (EQUAL (ASSOC-EQ-EXEC$GUARD-CHECK X ALIST) T).
Computing the guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK....
The guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK is trivial to prove.
ASSOC-EQ-EXEC$GUARD-CHECK is compliant with Common Lisp.
Summary
Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
ASSOC-EQ-EXEC$GUARD-CHECK
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC)
The admission of ASSOC-EQ-EXEC is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT ALIST). We could deduce no constraints on the
type of ASSOC-EQ-EXEC.
Computing the guard conjecture for ASSOC-EQ-EXEC....
The non-trivial part of the guard conjecture for ASSOC-EQ-EXEC is
Goal
(AND (IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(NOT (CONSP ALIST)))
(EQ ALIST NIL))
(IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(NOT (ENDP ALIST))
(NOT (EQ X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST)))
(IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(NOT (ENDP ALIST))
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL))
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(NOT (ENDP ALIST)))
(SYMBOLP (CAR (CAR ALIST))))
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(NOT (ENDP ALIST))
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL))
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(NOT (ENDP ALIST))
(NOT (EQ X (CAR (CAR ALIST)))))
(SYMBOL-ALISTP (CDR ALIST)))
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(NOT (CONSP ALIST)))
(EQ ALIST NIL))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following seven conjectures.
Subgoal 7
(IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(NOT (CONSP ALIST)))
(EQUAL ALIST NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 6
(IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(CONSP ALIST)
(NOT (EQUAL X (CAR (CAR ALIST)))))
(ALISTP (CDR ALIST))).
[GC for 1477 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 5
(IMPLIES (AND (ALISTP ALIST)
(SYMBOLP X)
(CONSP ALIST)
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 4
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(CONSP ALIST))
(SYMBOLP (CAR (CAR ALIST)))).
But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
Subgoal 3
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(CONSP ALIST)
(NOT (CONSP (CAR ALIST))))
(EQUAL (CAR ALIST) NIL)).
But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
Subgoal 2
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(CONSP ALIST)
(NOT (EQUAL X (CAR (CAR ALIST)))))
(SYMBOL-ALISTP (CDR ALIST))).
But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
Subgoal 1
(IMPLIES (AND (SYMBOL-ALISTP ALIST)
(NOT (SYMBOLP X))
(NOT (CONSP ALIST)))
(EQUAL ALIST NIL)).
But simplification reduces this to T, using the :definition SYMBOL-ALISTP.
Q.E.D.
That completes the proof of the guard theorem for ASSOC-EQ-EXEC.
ASSOC-EQ-EXEC is compliant with Common Lisp.
Summary
Form: ( DEFUN ASSOC-EQ-EXEC ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT)
(:DEFINITION SYMBOL-ALISTP))
Time: 0.26 seconds (prove: 0.08, print: 0.00, other: 0.18)
Prover steps counted: 547
ASSOC-EQ-EXEC
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST)
Since TABLE-ALIST is non-recursive, its admission is trivial. We could
deduce no constraints on the type of TABLE-ALIST.
Computing the guard conjecture for TABLE-ALIST....
The guard conjecture for TABLE-ALIST is trivial to prove. TABLE-ALIST
is compliant with Common Lisp.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN TABLE-ALIST ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
TABLE-ALIST
End of Encapsulated Events.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 1477 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export TABLE-ALIST, ASSOC-EQ-EXEC, ASSOC-EQ-EXEC$GUARD-CHECK, STRIP-CARS,
FUNCTION-SYMBOLP, SGETPROP, FGETPROP, PLIST-WORLDP, STRING-APPEND,
BINARY-APPEND, FLOOR, NONNEGATIVE-INTEGER-QUOTIENT, ACL2-COUNT, INTEGER-ABS,
IFIX, NFIX, SUBLIS, ASSOC-EQUAL, ASSOC-EQL-EXEC$GUARD-CHECK, ASSOC-EQL-EXEC,
EQLABLE-ALISTP, CHAR, NTH, SYMBOL-ALISTP and ALISTP.
Summary
Form: ( ENCAPSULATE NIL (LOGIC) ...)
Rules: NIL
Time: 10.78 seconds (prove: 0.78, print: 0.18, other: 9.82)
Prover steps counted: 9193
T
Summary
Form: ( DEFUN MOD-EXPT ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
MOD-EXPT
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN CONJOIN-CLAUSES ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
CONJOIN-CLAUSES
Summary
Form: ( DEFCONST *TRUE-CLAUSE* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*TRUE-CLAUSE*
Summary
Form: ( DEFCONST *FALSE-CLAUSE* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*FALSE-CLAUSE*
Summary
Form: ( DEFUN CLAUSES-RESULT ...)
Rules: NIL
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
CLAUSES-RESULT
Summary
Form: ( TABLE EVISC-TABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
EVISC-TABLE
Summary
Form: ( DEFCONST *TOP-HINT-KEYWORDS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*TOP-HINT-KEYWORDS*
Summary
Form: ( DEFCONST *HINT-KEYWORDS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*HINT-KEYWORDS*
Summary
Form: ( TABLE CUSTOM-KEYWORDS-TABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CUSTOM-KEYWORDS-TABLE
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ADD-CUSTOM-KEYWORD-HINT
Summary
Form: ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
REMOVE-CUSTOM-KEYWORD-HINT
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN SPLICE-KEYWORD-ALIST ...)
Rules: NIL
Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30)
SPLICE-KEYWORD-ALIST
Summary
Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SHOW-CUSTOM-KEYWORD-HINT-EXPANSION
Summary
Form: ( DEFUN SEARCH-FN-GUARD ...)
Rules: NIL
Time: 0.36 seconds (prove: 0.00, print: 0.00, other: 0.36)
SEARCH-FN-GUARD
Summary
Form: ( DEFUN SEARCH-FROM-START ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
SEARCH-FROM-START
[GC for 1487 CONS pages..(T=6).GC finished]
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN SEARCH-FROM-END ...)
Rules: NIL
Time: 0.40 seconds (prove: 0.00, print: 0.00, other: 0.40)
SEARCH-FROM-END
To verify that the 18 encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 p!>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1
(EQUAL (LEN (STRING-DOWNCASE1 X))
(LEN X))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM STRINGP-SUBSEQ
(IMPLIES (STRINGP STR)
(STRINGP (SUBSEQ STR START END)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-NTHCDR
(IMPLIES (STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP (NTHCDR N X)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-REVAPPEND
(IMPLIES (AND (STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-OF-TAKE
(IMPLIES (AND (STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE
(IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR
(IMPLIES (CHARACTER-LISTP X)
(CHARACTER-LISTP (NTHCDR N X)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL)))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM LEN-NTHCDR
(EQUAL (LEN (NTHCDR N X))
(NFIX (- (LEN X) (NFIX N))))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL
(DEFTHM
SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
(IMPLIES (AND (STRINGP SEQ)
(NATP START)
(NATP END)
(<= START END)
(<= END (LENGTH SEQ))
(STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END)
'LIST)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
(IMPLIES (TRUE-LISTP X)
(TRUE-LISTP (NTHCDR N X)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ
(IMPLIES (TRUE-LISTP SEQ)
(TRUE-LISTP (SUBSEQ SEQ START END)))
:RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION)))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM LEN-REVAPPEND
(EQUAL (LEN (REVAPPEND X Y))
(+ (LEN X) (LEN Y)))))
[GC for 1497 CONS pages..(T=6).GC finished]
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM LEN-OF-TAKE
(EQUAL (LEN (TAKE N LST)) (NFIX N))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ
(IMPLIES (AND (TRUE-LISTP SEQ)
(NATP START)
(NATP END)
(<= START END))
(EQUAL (LEN (SUBSEQ SEQ START END))
(- END START)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(LOCAL
(DEFTHM LEN-SUBSEQ-STRING
(IMPLIES (AND (STRINGP SEQ)
(NATP START)
(NATP END)
(<= START END)
(<= END (LEN (COERCE SEQ 'LIST))))
(EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
(- END START)))
:HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(DEFUN
SEARCH-FN
(SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
(DECLARE
(XARGS
:GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
:GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ)))))
(LET*
((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2)))
(SEQ1 (SUBSEQ SEQ1 START1 END1)))
(MV-LET
(SEQ1 SEQ2)
(COND ((EQ TEST 'CHAR-EQUAL)
(MV (STRING-DOWNCASE SEQ1)
(STRING-DOWNCASE SEQ2)))
(T (MV SEQ1 SEQ2)))
(AND (<= (- END1 START1) (- END2 START2))
(COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL))
(T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)))))))
Summary
Form: ( DEFUN SEARCH-FN ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
SEARCH-FN
End of Encapsulated Events.
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export SEARCH-FN.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Time: 0.66 seconds (prove: 0.00, print: 0.00, other: 0.66)
T
Summary
Form: ( DEFMACRO SEARCH ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SEARCH
ACL2 Observation in TOP-LEVEL: DEFTHM events are skipped when the
default-defun-mode is :PROGRAM.
NIL
Summary
Form: ( DEFUN COUNT-STRINGP ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
COUNT-STRINGP
Summary
Form: ( DEFUN COUNT-LISTP ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
COUNT-LISTP
To verify that the two encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
(IMPLIES (TRUE-LISTP X)
(TRUE-LISTP (NTHCDR N X)))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(DEFUN
COUNT-FN (ITEM SEQUENCE START END)
(DECLARE
(XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE)
T (STRINGP SEQUENCE))
(NATP START)
(OR (NULL END)
(AND (NATP END)
(<= END (LENGTH SEQUENCE)))))))
(LET ((END (OR END (LENGTH SEQUENCE))))
(COND ((<= END START) 0)
((STRINGP SEQUENCE)
(COUNT-STRINGP ITEM SEQUENCE START END))
(T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE)
(- END START))))))
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN COUNT-FN ...)
Rules: NIL
Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30)
COUNT-FN
End of Encapsulated Events.
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export COUNT-FN.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Time: 0.52 seconds (prove: 0.00, print: 0.00, other: 0.52)
T
Summary
Form: ( DEFMACRO COUNT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
COUNT
ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped
when the default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped
when the default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped
when the default-defun-mode is :PROGRAM.
NIL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN MAKE-SHARP-ATSIGN ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
MAKE-SHARP-ATSIGN
Summary
Form: ( DEFUN SHARP-ATSIGN-ALIST ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
SHARP-ATSIGN-ALIST
Summary
Form: ( DEFMACRO TIME$1 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TIME$1
Summary
Form: ( DEFMACRO TIME$ ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TIME$
To verify that the five encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))))
ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default-
defun-mode is :PROGRAM.
NIL
ACL2 p!>>(VERIFY-GUARDS THROW-NONEXEC-ERROR)
ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when
the default-defun-mode is :PROGRAM.
NIL
ACL2 p!>>(VERIFY-GUARDS DEFUN-NX-FN)
ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when
the default-defun-mode is :PROGRAM.
NIL
ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when
the default-defun-mode is :PROGRAM.
NIL
ACL2 p!>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
ACL2 Observation in TOP-LEVEL: VERIFY-GUARDS events are skipped when
the default-defun-mode is :PROGRAM.
NIL
End of Encapsulated Events.
ACL2 Observation in ( ENCAPSULATE NIL (LOCAL ...) ...): The submitted
encapsulate event has created no new ACL2 events, and thus is leaving
the ACL2 logical world unchanged. See :DOC encapsulate.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:EMPTY-ENCAPSULATE
Summary
Form: ( DEFUN GC$-FN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
GC$-FN
Summary
Form: ( DEFMACRO GC$ ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
GC$
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN GC-VERBOSE-FN ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
GC-VERBOSE-FN
Summary
Form: ( DEFMACRO GC-VERBOSE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
GC-VERBOSE
Summary
Form: ( DEFUN GET-WORMHOLE-STATUS ...)
Rules: NIL
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
GET-WORMHOLE-STATUS
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN FILE-WRITE-DATE$ ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
FILE-WRITE-DATE$
Summary
Form: ( DEFUN DELETE-FILE$ ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
DELETE-FILE$
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN DEBUGGER-ENABLE ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
DEBUGGER-ENABLE
Summary
Form: ( DEFUN BREAK$ ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
BREAK$
Summary
Form: ( DEFUN PRINT-CALL-HISTORY ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
PRINT-CALL-HISTORY
Summary
Form: ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
DEBUGGER-ENABLEDP-VAL
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN DEBUGGER-ENABLEDP ...)
Rules: NIL
Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30)
DEBUGGER-ENABLEDP
Summary
Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...)
Rules: NIL
Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20)
MAYBE-PRINT-CALL-HISTORY
Summary
Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WITH-RECKLESS-READTABLE
Summary
Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SET-DEBUGGER-ENABLE
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...)
Rules: NIL
Time: 0.32 seconds (prove: 0.00, print: 0.00, other: 0.32)
SET-DEBUGGER-ENABLE-FN
ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the
default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the
default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: IN-THEORY events are skipped when the
default-defun-mode is :PROGRAM.
NIL
Summary
Form: ( DEFUN ADD-@PAR-SUFFIX ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
ADD-@PAR-SUFFIX
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
GENERATE-@PAR-MAPPINGS
Summary
Form: ( DEFCONST *@PAR-MAPPINGS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*@PAR-MAPPINGS*
Summary
Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
MAKE-IDENTITY-FOR-@PAR-MAPPINGS
Summary
Form: ( DEFMACRO DEFINE-@PAR-MACROS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
DEFINE-@PAR-MACROS
ACL2 p!>>(DEFMACRO CATCH-TIME-LIMIT5@PAR (&REST RST)
(CONS 'CATCH-TIME-LIMIT5 RST))
Summary
Form: ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CATCH-TIME-LIMIT5@PAR
ACL2 p!>>(DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
(&REST RST)
(CONS 'CMP-AND-VALUE-TO-ERROR-QUADRUPLE
RST))
Summary
Form: ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
ACL2 p!>>(DEFMACRO CMP-TO-ERROR-TRIPLE@PAR (&REST RST)
(CONS 'CMP-TO-ERROR-TRIPLE RST))
Summary
Form: ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CMP-TO-ERROR-TRIPLE@PAR
ACL2 p!>>(DEFMACRO ER@PAR (&REST RST)
(CONS 'ER RST))
Summary
Form: ( DEFMACRO ER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ER@PAR
ACL2 p!>>(DEFMACRO ER-LET*@PAR (&REST RST)
(CONS 'ER-LET* RST))
Summary
Form: ( DEFMACRO ER-LET*@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ER-LET*@PAR
ACL2 p!>>(DEFMACRO ER-PROGN@PAR (&REST RST)
(CONS 'ER-PROGN RST))
Summary
Form: ( DEFMACRO ER-PROGN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ER-PROGN@PAR
ACL2 p!>>(DEFMACRO ERROR-FMS@PAR (&REST RST)
(CONS 'ERROR-FMS RST))
Summary
Form: ( DEFMACRO ERROR-FMS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ERROR-FMS@PAR
ACL2 p!>>(DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR
(&REST RST)
(CONS 'ERROR-IN-PARALLELISM-MODE RST))
Summary
Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ERROR-IN-PARALLELISM-MODE@PAR
ACL2 p!>>(DEFMACRO ERROR1@PAR (&REST RST)
(CONS 'ERROR1 RST))
Summary
Form: ( DEFMACRO ERROR1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ERROR1@PAR
ACL2 p!>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST)
(CONS 'F-PUT-GLOBAL RST))
Summary
Form: ( DEFMACRO F-PUT-GLOBAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
F-PUT-GLOBAL@PAR
ACL2 p!>>(DEFMACRO IO?@PAR (&REST RST)
(CONS 'IO? RST))
Summary
Form: ( DEFMACRO IO?@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
IO?@PAR
ACL2 p!>>(DEFMACRO IO?-PROVE@PAR (&REST RST)
(CONS 'IO?-PROVE RST))
Summary
Form: ( DEFMACRO IO?-PROVE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
IO?-PROVE@PAR
ACL2 p!>>(DEFMACRO MV@PAR (&REST RST)
(CONS 'MV RST))
Summary
Form: ( DEFMACRO MV@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MV@PAR
ACL2 p!>>(DEFMACRO MV-LET@PAR (&REST RST)
(CONS 'MV-LET RST))
Summary
Form: ( DEFMACRO MV-LET@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MV-LET@PAR
ACL2 p!>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST)
(CONS 'PARALLEL-ONLY RST))
Summary
Form: ( DEFMACRO PARALLEL-ONLY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PARALLEL-ONLY@PAR
ACL2 p!>>(DEFMACRO PPROGN@PAR (&REST RST)
(CONS 'PPROGN RST))
Summary
Form: ( DEFMACRO PPROGN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PPROGN@PAR
ACL2 p!>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
(&REST RST)
(CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
RST))
[GC for 1497 CONS pages..(T=8).GC finished]
Summary
Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
ACL2 p!>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST)
(CONS 'SERIAL-ONLY RST))
Summary
Form: ( DEFMACRO SERIAL-ONLY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SERIAL-ONLY@PAR
ACL2 p!>>(DEFMACRO SL-LET@PAR (&REST RST)
(CONS 'SL-LET RST))
Summary
Form: ( DEFMACRO SL-LET@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SL-LET@PAR
ACL2 p!>>(DEFMACRO STATE-MAC@PAR (&REST RST)
(CONS 'STATE-MAC RST))
Summary
Form: ( DEFMACRO STATE-MAC@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
STATE-MAC@PAR
ACL2 p!>>(DEFMACRO VALUE@PAR (&REST RST)
(CONS 'VALUE RST))
Summary
Form: ( DEFMACRO VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
VALUE@PAR
ACL2 p!>>(DEFMACRO WARNING$@PAR (&REST RST)
(CONS 'WARNING$ RST))
Summary
Form: ( DEFMACRO WARNING$@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WARNING$@PAR
ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST)
(CONS 'ADD-CUSTOM-KEYWORD-HINT RST))
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ADD-CUSTOM-KEYWORD-HINT@PAR
ACL2 p!>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST)
(CONS 'EVAL-CLAUSE-PROCESSOR RST))
Summary
Form: ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
EVAL-CLAUSE-PROCESSOR@PAR
ACL2 p!>>(DEFMACRO EVAL-THEORY-EXPR@PAR (&REST RST)
(CONS 'EVAL-THEORY-EXPR RST))
Summary
Form: ( DEFMACRO EVAL-THEORY-EXPR@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
EVAL-THEORY-EXPR@PAR
ACL2 p!>>(DEFMACRO FORMAL-VALUE-TRIPLE@PAR (&REST RST)
(CONS 'FORMAL-VALUE-TRIPLE RST))
Summary
Form: ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
FORMAL-VALUE-TRIPLE@PAR
ACL2 p!>>(DEFMACRO INCREMENT-TIMER@PAR (&REST RST)
(CONS 'INCREMENT-TIMER RST))
Summary
Form: ( DEFMACRO INCREMENT-TIMER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
INCREMENT-TIMER@PAR
ACL2 p!>>(DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR
(&REST RST)
(CONS 'SIMPLE-TRANSLATE-AND-EVAL RST))
Summary
Form: ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SIMPLE-TRANSLATE-AND-EVAL@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-IN-THEORY-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-IN-THEORY-HINT@PAR
ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR
(&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE-ID RST))
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-PRINT-CLAUSE-ID@PAR
ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
(&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
RST))
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
ACL2 p!>>(DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR
(&REST RST)
(CONS 'WATERFALL-UPDATE-GAG-STATE RST))
Summary
Form: ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-UPDATE-GAG-STATE@PAR
ACL2 p!>>(DEFMACRO WATERFALL1-LST@PAR (&REST RST)
(CONS 'WATERFALL1-LST RST))
Summary
Form: ( DEFMACRO WATERFALL1-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL1-LST@PAR
ACL2 p!>>(DEFMACRO WATERFALL1-WRAPPER@PAR (&REST RST)
(CONS 'WATERFALL1-WRAPPER RST))
Summary
Form: ( DEFMACRO WATERFALL1-WRAPPER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL1-WRAPPER@PAR
ACL2 p!>>(DEFMACRO XTRANS-EVAL@PAR (&REST RST)
(CONS 'XTRANS-EVAL RST))
Summary
Form: ( DEFMACRO XTRANS-EVAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
XTRANS-EVAL@PAR
ACL2 p!>>(DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
(&REST RST)
(CONS 'ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
RST))
Summary
Form: ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR
(&REST RST)
(CONS 'ADD-CUSTOM-KEYWORD-HINT-FN RST))
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ADD-CUSTOM-KEYWORD-HINT-FN@PAR
ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINT@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINT RST))
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
APPLY-OVERRIDE-HINT@PAR
ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINT1@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINT1 RST))
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
APPLY-OVERRIDE-HINT1@PAR
ACL2 p!>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINTS RST))
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
APPLY-OVERRIDE-HINTS@PAR
ACL2 p!>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST)
(CONS 'APPLY-REORDER-HINT RST))
Summary
Form: ( DEFMACRO APPLY-REORDER-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
APPLY-REORDER-HINT@PAR
ACL2 p!>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST)
(CONS 'APPLY-TOP-HINTS-CLAUSE RST))
Summary
Form: ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
APPLY-TOP-HINTS-CLAUSE@PAR
ACL2 p!>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR
(&REST RST)
(CONS 'CHECK-TRANSLATED-OVERRIDE-HINT
RST))
Summary
Form: ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHECK-TRANSLATED-OVERRIDE-HINT@PAR
ACL2 p!>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST)
(CONS 'CHK-ARGLIST RST))
Summary
Form: ( DEFMACRO CHK-ARGLIST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-ARGLIST@PAR
ACL2 p!>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST)
(CONS 'CHK-DO-NOT-EXPR-VALUE RST))
Summary
Form: ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-DO-NOT-EXPR-VALUE@PAR
ACL2 p!>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST)
(CONS 'CHK-EQUAL-ARITIES RST))
Summary
Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-EQUAL-ARITIES@PAR
ACL2 p!>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST)
(CONS 'CHK-EQUIV-CLASSICALP RST))
Summary
Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-EQUIV-CLASSICALP@PAR
ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST)
(CONS 'CHK-THEORY-EXPR-VALUE RST))
Summary
Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-THEORY-EXPR-VALUE@PAR
ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST)
(CONS 'CHK-THEORY-EXPR-VALUE1 RST))
Summary
Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-THEORY-EXPR-VALUE1@PAR
ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST)
(CONS 'CHK-THEORY-INVARIANT RST))
Summary
Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-THEORY-INVARIANT@PAR
ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST)
(CONS 'CHK-THEORY-INVARIANT1 RST))
Summary
Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...)
Rules: NIL
[GC for 1507 CONS pages..(T=6).GC finished]
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CHK-THEORY-INVARIANT1@PAR
ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
(&REST RST)
(CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER
RST))
Summary
Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
(&REST RST)
(CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1
RST))
Summary
Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
ACL2 p!>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
(&REST RST)
(CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION
RST))
Summary
Form: ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR
(&REST RST)
(CONS 'FIND-APPLICABLE-HINT-SETTINGS
RST))
Summary
Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
FIND-APPLICABLE-HINT-SETTINGS@PAR
ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR
(&REST RST)
(CONS 'FIND-APPLICABLE-HINT-SETTINGS1
RST))
Summary
Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
FIND-APPLICABLE-HINT-SETTINGS1@PAR
ACL2 p!>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST)
(CONS 'GAG-STATE-EXITING-CL-ID RST))
Summary
Form: ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
GAG-STATE-EXITING-CL-ID@PAR
ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR
(&REST RST)
(CONS 'LOAD-HINT-SETTINGS-INTO-PSPV
RST))
Summary
Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
LOAD-HINT-SETTINGS-INTO-PSPV@PAR
ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR
(&REST RST)
(CONS 'LOAD-HINT-SETTINGS-INTO-RCNST
RST))
Summary
Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
LOAD-HINT-SETTINGS-INTO-RCNST@PAR
ACL2 p!>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
(&REST RST)
(CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE
RST))
Summary
Form: ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY RST))
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MAYBE-WARN-ABOUT-THEORY@PAR
ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
(&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
RST))
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
(&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE
RST))
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
ACL2 p!>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST)
(CONS 'MAYBE-WARN-FOR-USE-HINT RST))
Summary
Form: ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MAYBE-WARN-FOR-USE-HINT@PAR
ACL2 p!>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR
(&REST RST)
(CONS 'PAIR-CL-ID-WITH-HINT-SETTING
RST))
Summary
Form: ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PAIR-CL-ID-WITH-HINT-SETTING@PAR
ACL2 p!>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST)
(CONS 'PROCESS-BACKTRACK-HINT RST))
Summary
Form: ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PROCESS-BACKTRACK-HINT@PAR
ACL2 p!>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST)
(CONS 'PUSH-CLAUSE RST))
Summary
Form: ( DEFMACRO PUSH-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PUSH-CLAUSE@PAR
ACL2 p!>>(DEFMACRO
PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
(&REST RST)
(CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
RST))
Summary
Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
ACL2 p!>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST)
(CONS 'RECORD-GAG-STATE RST))
Summary
Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
RECORD-GAG-STATE@PAR
ACL2 p!>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST)
(CONS 'THANKS-FOR-THE-HINT RST))
Summary
Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
THANKS-FOR-THE-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE@PAR (&REST RST)
(CONS 'TRANSLATE RST))
Summary
Form: ( DEFMACRO TRANSLATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE@PAR
ACL2 p!>>(DEFMACRO TRANSLATE1@PAR (&REST RST)
(CONS 'TRANSLATE1 RST))
Summary
Form: ( DEFMACRO TRANSLATE1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BACKTRACK-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-BACKTRACK-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BDD-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-BDD-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-BDD-HINT1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-BDD-HINT1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BY-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-BY-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-CASES-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-CASES-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-DO-NOT-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...)
Rules: NIL
[GC for 1507 CONS pages..(T=6).GC finished]
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-DO-NOT-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-DO-NOT-INDUCT-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-DO-NOT-INDUCT-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-ERROR-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-ERROR-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-EXPAND-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-HINT1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-EXPAND-HINT1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-TERM RST))
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-EXPAND-TERM@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-TERM1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-EXPAND-TERM1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
(&REST RST)
(CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION
RST))
Summary
Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-HANDS-OFF-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HANDS-OFF-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR
(&REST RST)
(CONS 'TRANSLATE-HANDS-OFF-HINT1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HANDS-OFF-HINT1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINTS@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINTS1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS2 RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINTS2@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS+1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINTS+1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR
(&REST RST)
(CONS 'TRANSLATE-HINT-EXPRESSION RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINT-EXPRESSION@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR
(&REST RST)
(CONS 'TRANSLATE-HINT-EXPRESSIONS RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINT-EXPRESSIONS@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST)
(CONS 'TRANSLATE-HINT-SETTINGS RST))
Summary
Form: ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-HINT-SETTINGS@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-INDUCT-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-INDUCT-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST)
(CONS 'TRANSLATE-LMI RST))
Summary
Form: ( DEFMACRO TRANSLATE-LMI@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-LMI@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
(&REST RST)
(CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE
RST))
Summary
Form: ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST)
(CONS 'TRANSLATE-LMI/INSTANCE RST))
Summary
Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-LMI/INSTANCE@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-NO-OP-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-NO-OP-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-NO-THANKS-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-NO-THANKS-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-NONLINEARP-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-NONLINEARP-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-OR-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-OR-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-REORDER-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-REORDER-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-RESTRICT-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-RESTRICT-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-RW-CACHE-STATE-HINT
RST))
Summary
Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-RW-CACHE-STATE-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
(&REST RST)
(CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
RST))
Summary
Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST)
(CONS 'TRANSLATE-SUBSTITUTION RST))
Summary
Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-SUBSTITUTION@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR
(&REST RST)
(CONS 'TRANSLATE-SUBSTITUTION-LST RST))
Summary
Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-SUBSTITUTION-LST@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST)
(CONS 'TRANSLATE-TERM-LST RST))
Summary
Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-TERM-LST@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-USE-HINT RST))
Summary
Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-USE-HINT@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-USE-HINT1 RST))
Summary
Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-USE-HINT1@PAR
ACL2 p!>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST)
(CONS 'TRANSLATE-X-HINT-VALUE RST))
Summary
Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRANSLATE-X-HINT-VALUE@PAR
ACL2 p!>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
(&REST RST)
(CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS
RST))
Summary
Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
ACL2 p!>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST)
(CONS 'WATERFALL-MSG RST))
Summary
Form: ( DEFMACRO WATERFALL-MSG@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-MSG@PAR
ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE RST))
[GC for 1517 CONS pages..(T=6).GC finished]
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-PRINT-CLAUSE@PAR
ACL2 p!>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST)
(CONS 'WATERFALL-STEP RST))
Summary
Form: ( DEFMACRO WATERFALL-STEP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-STEP@PAR
ACL2 p!>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST)
(CONS 'WATERFALL-STEP1 RST))
Summary
Form: ( DEFMACRO WATERFALL-STEP1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-STEP1@PAR
ACL2 p!>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST)
(CONS 'WATERFALL-STEP-CLEANUP RST))
Summary
Form: ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL-STEP-CLEANUP@PAR
ACL2 p!>>(DEFMACRO WATERFALL0@PAR (&REST RST)
(CONS 'WATERFALL0 RST))
Summary
Form: ( DEFMACRO WATERFALL0@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL0@PAR
ACL2 p!>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST)
(CONS 'WATERFALL0-OR-HIT RST))
Summary
Form: ( DEFMACRO WATERFALL0-OR-HIT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL0-OR-HIT@PAR
ACL2 p!>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR
(&REST RST)
(CONS 'WATERFALL0-WITH-HINT-SETTINGS
RST))
Summary
Form: ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL0-WITH-HINT-SETTINGS@PAR
ACL2 p!>>(DEFMACRO WATERFALL1@PAR (&REST RST)
(CONS 'WATERFALL1 RST))
Summary
Form: ( DEFMACRO WATERFALL1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WATERFALL1@PAR
Summary
Form: ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...)
Rules: NIL
Time: 0.34 seconds (prove: 0.00, print: 0.00, other: 0.34)
WATERFALL1@PAR
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
REPLACE-DEFUN@PAR-WITH-DEFUN
Summary
Form: ( DEFMACRO MUTUAL-RECURSION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
MUTUAL-RECURSION@PAR
Summary
Form: ( DEFMACRO DEFUN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
DEFUN@PAR
Summary
Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
Summary
Form: ( DEFMACRO SERIAL-ONLY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SERIAL-ONLY
Summary
Form: ( DEFMACRO PARALLEL-ONLY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PARALLEL-ONLY
Summary
Form: ( DEFMACRO STATE-MAC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
STATE-MAC
Summary
Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
ERROR-IN-PARALLELISM-MODE
Summary
Form: ( DEFCONST *WATERFALL-PRINTING-VALUES* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*WATERFALL-PRINTING-VALUES*
Summary
Form: ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*WATERFALL-PARALLELISM-VALUES*
Summary
Form: ( DEFUN SYMBOL-CONSTANT-FN ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
SYMBOL-CONSTANT-FN
Summary
Form: ( DEFUN STOBJS-IN ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
STOBJS-IN
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN ALL-NILS ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
ALL-NILS
Summary
Form: ( DEFCONST *TTAG-FNS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*TTAG-FNS*
Summary
Form: ( DEFUN LOGICP ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
LOGICP
Summary
Form: ( DEFMACRO LOGICALP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
LOGICALP
Summary
Form: ( DEFMACRO PROGRAMP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PROGRAMP
Summary
Form: ( DEFCONST *STOBJS-OUT-INVALID* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*STOBJS-OUT-INVALID*
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN STOBJS-OUT ...)
Rules: NIL
Time: 0.34 seconds (prove: 0.00, print: 0.00, other: 0.34)
STOBJS-OUT
Summary
Form: ( DEFUN EV-FNCALL-W-GUARD1 ...)
Rules: NIL
Time: 0.42 seconds (prove: 0.00, print: 0.00, other: 0.42)
EV-FNCALL-W-GUARD1
[GC for 9984 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN EV-FNCALL-W-GUARD ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
EV-FNCALL-W-GUARD
[GC for 782 RELOCATABLE-BLOCKS pages..(T=6).GC finished]
Summary
Form: ( DEFUN TIME-TRACKER-FN ...)
Rules: NIL
Time: 0.36 seconds (prove: 0.00, print: 0.00, other: 0.36)
TIME-TRACKER-FN
Summary
Form: ( DEFMACRO TIME-TRACKER ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TIME-TRACKER
Summary
Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
SET-ABSSTOBJ-DEBUG-FN
Summary
Form: ( DEFMACRO SET-ABSSTOBJ-DEBUG ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SET-ABSSTOBJ-DEBUG
Summary
Form: ( DEFUN <? ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
<?
Summary
Form: ( DEFUN TAU-INTERVAL-DOMAINP ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-DOMAINP
Summary
Form: ( DEFUN TAU-INTERVAL-DOM ...)
Rules: NIL
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
TAU-INTERVAL-DOM
[GC for 1517 CONS pages..(T=8).GC finished]
Summary
Form: ( DEFUN TAU-INTERVAL-LO-REL ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-LO-REL
Summary
Form: ( DEFUN TAU-INTERVAL-LO ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-LO
Summary
Form: ( DEFUN TAU-INTERVAL-HI-REL ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-HI-REL
Summary
Form: ( DEFUN TAU-INTERVAL-HI ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-HI
Summary
Form: ( DEFUN MAKE-TAU-INTERVAL ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
MAKE-TAU-INTERVAL
Summary
Form: ( DEFUN TAU-INTERVALP ...)
Rules: NIL
Time: 0.34 seconds (prove: 0.00, print: 0.00, other: 0.34)
TAU-INTERVALP
[GC for 1527 CONS pages..(T=8).GC finished]
Summary
Form: ( DEFUN IN-TAU-INTERVALP ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
IN-TAU-INTERVALP
ACL2 Observation in TOP-LEVEL: DEFTHM events are skipped when the
default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: DEFTHM events are skipped when the
default-defun-mode is :PROGRAM.
NIL
ACL2 Observation in TOP-LEVEL: DEFTHM events are skipped when the
default-defun-mode is :PROGRAM.
NIL
Summary
Form: ( DEFUN DECIMAL-STRING-TO-NUMBER ...)
Rules: NIL
Time: 0.38 seconds (prove: 0.00, print: 0.00, other: 0.38)
DECIMAL-STRING-TO-NUMBER
Summary
Form: ( DEFUN CHECK-DCL-GUARDIAN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
CHECK-DCL-GUARDIAN
Summary
Form: ( DEFCONST *GC-STRATEGY-ALIST* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*GC-STRATEGY-ALIST*
Summary
Form: ( DEFUN SET-GC-STRATEGY-FN ...)
Rules: NIL
Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20)
SET-GC-STRATEGY-FN
Summary
Form: ( DEFMACRO SET-GC-STRATEGY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
SET-GC-STRATEGY
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN GC-STRATEGY ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
GC-STRATEGY
Summary
Form: ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*EXPANDABLE-BOOT-STRAP-NON-REC-FNS*
Summary
Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*DEFINITION-MINIMAL-THEORY*
Summary
Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY-ALIST* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*DEFINITION-MINIMAL-THEORY-ALIST*
Summary
Form: ( DEFUN BBODY-FN ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
BBODY-FN
Summary
Form: ( DEFMACRO BBODY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
BBODY
Summary
Form: ( DEFUN FILE-LENGTH$ ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
FILE-LENGTH$
Since CONSTANT-T-FUNCTION-ARITY-0 is non-recursive, its admission is
trivial. We observe that the type of CONSTANT-T-FUNCTION-ARITY-0 is
described by the theorem (EQUAL (CONSTANT-T-FUNCTION-ARITY-0) T).
Computing the guard conjecture for CONSTANT-T-FUNCTION-ARITY-0....
The guard conjecture for CONSTANT-T-FUNCTION-ARITY-0 is trivial to
prove. CONSTANT-T-FUNCTION-ARITY-0 is compliant with Common Lisp.
Summary
Form: ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
CONSTANT-T-FUNCTION-ARITY-0
Since CONSTANT-NIL-FUNCTION-ARITY-0 is non-recursive, its admission
is trivial. We observe that the type of CONSTANT-NIL-FUNCTION-ARITY-0
is described by the theorem (EQUAL (CONSTANT-NIL-FUNCTION-ARITY-0) NIL).
Computing the guard conjecture for CONSTANT-NIL-FUNCTION-ARITY-0....
The guard conjecture for CONSTANT-NIL-FUNCTION-ARITY-0 is trivial to
prove. CONSTANT-NIL-FUNCTION-ARITY-0 is compliant with Common Lisp.
Summary
Form: ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
CONSTANT-NIL-FUNCTION-ARITY-0
To verify that the twelve encapsulated events correctly extend the
current theory we will evaluate them. The theory thus constructed
is only ephemeral.
Encapsulated Events:
ACL2 p!>>(LOGIC)
:INVISIBLE
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BOOLEANP)
Since BOOLEANP is non-recursive, its admission is trivial. We observe
that the type of BOOLEANP is described by the theorem
(OR (EQUAL (BOOLEANP X) T) (EQUAL (BOOLEANP X) NIL)). We used primitive
type reasoning.
Computing the guard conjecture for BOOLEANP....
The guard conjecture for BOOLEANP is trivial to prove. BOOLEANP is
compliant with Common Lisp.
[GC for 1527 CONS pages..(T=6).GC finished]
Summary
Form: ( DEFUN BOOLEANP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
BOOLEANP
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS)
The admission of ALL-NILS is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT LST). We observe that the type of ALL-NILS is
described by the theorem
(OR (EQUAL (ALL-NILS LST) T) (EQUAL (ALL-NILS LST) NIL)).
Computing the guard conjecture for ALL-NILS....
The guard conjecture for ALL-NILS is trivial to prove, given primitive
type reasoning. ALL-NILS is compliant with Common Lisp.
Summary
Form: ( DEFUN ALL-NILS ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
ALL-NILS
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC)
The admission of MEMBER-EQL-EXEC is trivial, using the relation O<
(which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT LST). We observe that the type of
MEMBER-EQL-EXEC is described by the theorem
(OR (CONSP (MEMBER-EQL-EXEC X LST)) (EQUAL (MEMBER-EQL-EXEC X LST) NIL)).
Computing the guard conjecture for MEMBER-EQL-EXEC....
The non-trivial part of the guard conjecture for MEMBER-EQL-EXEC, given
primitive type reasoning, is
Goal
(AND (IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (EQLABLEP X))
(NOT (CONSP LST)))
(EQ LST NIL))
(IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (EQLABLEP X))
(NOT (ENDP LST)))
(EQLABLEP (CAR LST)))
(IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (EQLABLEP X))
(NOT (ENDP LST))
(NOT (EQL X (CAR LST))))
(EQLABLE-LISTP (CDR LST)))).
By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the
conjecture to the following three conjectures.
Subgoal 3
(IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(NOT (CONSP LST)))
(EQUAL LST NIL)).
But simplification reduces this to T, using the :definition EQLABLE-LISTP.
Subgoal 2
(IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(CONSP LST)
(NOT (ACL2-NUMBERP (CAR LST)))
(NOT (SYMBOLP (CAR LST))))
(CHARACTERP (CAR LST))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal 1
(IMPLIES (AND (EQLABLE-LISTP LST)
(NOT (ACL2-NUMBERP X))
(NOT (SYMBOLP X))
(NOT (CHARACTERP X))
(CONSP LST)
(NOT (EQUAL X (CAR LST))))
(EQLABLE-LISTP (CDR LST))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Q.E.D.
That completes the proof of the guard theorem for MEMBER-EQL-EXEC.
MEMBER-EQL-EXEC is compliant with Common Lisp.
[GC for 1527 CONS pages..(T=6).GC finished]
Summary
Form: ( DEFUN MEMBER-EQL-EXEC ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION EQL)
(:DEFINITION EQLABLE-LISTP)
(:DEFINITION EQLABLEP)
(:DEFINITION NOT)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.28 seconds (prove: 0.00, print: 0.02, other: 0.26)
Prover steps counted: 296
MEMBER-EQL-EXEC
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK)
Since MEMBER-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is
trivial. We observe that the type of MEMBER-EQL-EXEC$GUARD-CHECK is
described by the theorem (EQUAL (MEMBER-EQL-EXEC$GUARD-CHECK X LST) T).
Computing the guard conjecture for MEMBER-EQL-EXEC$GUARD-CHECK....
The guard conjecture for MEMBER-EQL-EXEC$GUARD-CHECK is trivial to
prove. MEMBER-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp.
Summary
Form: ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
MEMBER-EQL-EXEC$GUARD-CHECK
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL)
The admission of MEMBER-EQUAL is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT LST). We observe that the type of MEMBER-EQUAL
is described by the theorem
(OR (CONSP (MEMBER-EQUAL X LST)) (EQUAL (MEMBER-EQUAL X LST) NIL)).
Computing the guard conjecture for MEMBER-EQUAL....
The guard conjecture for MEMBER-EQUAL is trivial to prove, given primitive
type reasoning. MEMBER-EQUAL is compliant with Common Lisp.
Summary
Form: ( DEFUN MEMBER-EQUAL ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
MEMBER-EQUAL
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC)
The admission of SUBSETP-EQL-EXEC is trivial, using the relation O<
(which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT X). We observe that the type of
SUBSETP-EQL-EXEC is described by the theorem
(OR (EQUAL (SUBSETP-EQL-EXEC X Y) T) (EQUAL (SUBSETP-EQL-EXEC X Y) NIL)).
Computing the guard conjecture for SUBSETP-EQL-EXEC....
The non-trivial part of the guard conjecture for SUBSETP-EQL-EXEC,
given primitive type reasoning, is
Goal
[GC for 1527 CONS pages..(T=8).GC finished]
(AND (IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(NOT (ENDP X)))
(LET ((X (CAR X)) (L Y))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L)))))
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(NOT (CONSP X)))
(EQ X NIL))
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(NOT (ENDP X)))
(LET ((X (CAR X)) (L Y))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L)))))
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(NOT (ENDP X))
(MEMBER-EQUAL (CAR X) Y))
(EQLABLE-LISTP (CDR X)))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following four conjectures.
Subgoal 4
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(LET ((X (CAR X)) (L Y))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L))))).
This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
(if-intro) and the :type-prescription rule EQLABLE-LISTP, to the following
four conjectures.
Subgoal 4.4
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
Name the formula above *1.
[GC for 1527 CONS pages..(T=8).GC finished]
Subgoal 4.3
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
Name the formula above *2.
Subgoal 4.2
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
Name the formula above *3.
Subgoal 4.1
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
Name the formula above *4.
Subgoal 3
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(NOT (CONSP X)))
(EQUAL X NIL)).
But simplification reduces this to T, using the :definition EQLABLE-LISTP.
Subgoal 2
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(LET ((X (CAR X)) (L Y))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L))))).
[GC for 1537 CONS pages..(T=8).GC finished]
This simplifies, using the :definitions EQLABLEP (if-intro) and NOT
(if-intro), to the following two conjectures.
Subgoal 2.2
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
Name the formula above *5.
Subgoal 2.1
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X)
(NOT (ACL2-NUMBERP (CAR X)))
(NOT (SYMBOLP (CAR X))))
(CHARACTERP (CAR X))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal 1
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X)
(MEMBER-EQUAL (CAR X) Y))
(EQLABLE-LISTP (CDR X))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
So we now return to *5, which is
(IMPLIES (AND (TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
Perhaps we can prove *5 by induction. Five induction schemes are suggested
by this conjecture. Subsumption reduces that number to four. These
merge into two derived induction schemes. One of these has a score
higher than the other.
We will induct according to a scheme suggested by
(MEMBER-EQL-EXEC (CAR X) Y). This suggestion was produced using the
:induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP.
If we let (:P X Y) denote *5 above then the induction scheme we'll
use is
(AND (IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(:P X (CDR Y)))
(:P X Y))
(IMPLIES (AND (NOT (ENDP Y))
(EQL (CAR X) (CAR Y)))
(:P X Y))
(IMPLIES (ENDP Y) (:P X Y))).
This induction is justified by the same argument used to admit
MEMBER-EQL-EXEC. When applied to the goal at hand the above induction
scheme produces five nontautological subgoals.
Subgoal *5/5
(IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(EQUAL (MEMBER-EQUAL (CAR X) (CDR Y))
(MEMBER-EQL-EXEC (CAR X) (CDR Y)))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5/5'
(IMPLIES (AND (CONSP Y)
(NOT (EQUAL (CAR X) (CAR Y)))
(EQUAL (MEMBER-EQUAL (CAR X) (CDR Y))
(MEMBER-EQL-EXEC (CAR X) (CDR Y)))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
type reasoning.
Subgoal *5/4
(IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(EQLABLE-LISTP (CDR Y))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5/4'
(IMPLIES (AND (CONSP Y)
(NOT (EQUAL (CAR X) (CAR Y)))
(EQLABLE-LISTP (CDR Y))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
This simplifies, using the :definitions EQLABLE-LISTP, EQLABLEP,
MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP, primitive type reasoning
and the :type-prescription rule EQLABLE-LISTP, to
Subgoal *5/4''
(IMPLIES (AND (CONSP Y)
(NOT (EQUAL (CAR X) (CAR Y)))
(EQLABLE-LISTP (CDR Y))
(TRUE-LISTP (CDR Y))
(EQLABLE-LISTP X)
(NOT (ACL2-NUMBERP (CAR Y)))
(NOT (SYMBOLP (CAR Y)))
(NOT (CHARACTERP (CAR Y)))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) (CDR Y))
(MEMBER-EQL-EXEC (CAR X) (CDR Y)))).
[GC for 1537 CONS pages..(T=8).GC finished]
We generalize this conjecture, replacing (CAR Y) by Y1, (CDR Y) by
Y2 and (CAR X) by X1 and restricting the type of the new variable Y1
to be that of the term it replaces. This produces
Subgoal *5/4'''
(IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(CONSP Y)
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(NOT (CHARACTERP Y1))
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
By case analysis we reduce the conjecture to
Subgoal *5/4'4'
(IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(CONSP Y)
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
We suspect that the term (CONSP Y) is irrelevant to the truth of this
conjecture and throw it out. We will thus try to prove
Subgoal *5/4'5'
(IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
Name the formula above *5.1.
Subgoal *5/3
(IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(NOT (TRUE-LISTP (CDR Y)))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
But we reduce the conjecture to T, by primitive type reasoning.
Subgoal *5/2
(IMPLIES (AND (NOT (ENDP Y))
(EQL (CAR X) (CAR Y))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5/2'
(IMPLIES (AND (CONSP Y)
(EQUAL (CAR X) (CAR Y))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
type reasoning.
Subgoal *5/1
(IMPLIES (AND (ENDP Y)
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5/1'
(IMPLIES (AND (NOT (CONSP Y))
(TRUE-LISTP Y)
(EQLABLE-LISTP X)
(NOT (EQLABLE-LISTP Y))
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
But simplification reduces this to T, using the :definition TRUE-LISTP,
the :executable-counterparts of CONSP and EQLABLE-LISTP and primitive
type reasoning.
So we now return to *5.1, which is
(IMPLIES (AND (NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
Perhaps we can prove *5.1 by induction. Five induction schemes are
suggested by this conjecture. Subsumption reduces that number to four.
These merge into two derived induction schemes. One of these has a
score higher than the other.
We will induct according to a scheme suggested by (MEMBER-EQL-EXEC X1 Y2).
This suggestion was produced using the :induction rules EQLABLE-LISTP,
MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X X1 Y1 Y2)
denote *5.1 above then the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ENDP Y2))
(NOT (EQL X1 (CAR Y2)))
(:P X X1 Y1 (CDR Y2)))
(:P X X1 Y1 Y2))
(IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)))
(:P X X1 Y1 Y2))
(IMPLIES (ENDP Y2) (:P X X1 Y1 Y2))).
This induction is justified by the same argument used to admit
MEMBER-EQL-EXEC. When applied to the goal at hand the above induction
scheme produces five nontautological subgoals.
Subgoal *5.1/5
(IMPLIES (AND (NOT (ENDP Y2))
(NOT (EQL X1 (CAR Y2)))
(EQUAL (MEMBER-EQUAL X1 (CDR Y2))
(MEMBER-EQL-EXEC X1 (CDR Y2)))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5.1/5'
(IMPLIES (AND (CONSP Y2)
(NOT (EQUAL X1 (CAR Y2)))
(EQUAL (MEMBER-EQUAL X1 (CDR Y2))
(MEMBER-EQL-EXEC X1 (CDR Y2)))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
type reasoning.
Subgoal *5.1/4
(IMPLIES (AND (NOT (ENDP Y2))
(NOT (EQL X1 (CAR Y2)))
(NOT (TRUE-LISTP (CDR Y2)))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
But we reduce the conjecture to T, by primitive type reasoning.
Subgoal *5.1/3
(IMPLIES (AND (NOT (ENDP Y2))
(NOT (EQL X1 (CAR Y2)))
(NOT (EQLABLE-LISTP (CDR Y2)))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5.1/3'
(IMPLIES (AND (CONSP Y2)
(NOT (EQUAL X1 (CAR Y2)))
(NOT (EQLABLE-LISTP (CDR Y2)))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal *5.1/2
(IMPLIES (AND (NOT (ENDP Y2))
(EQL X1 (CAR Y2))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *5.1/2'
(IMPLIES (AND (CONSP Y2)
(EQUAL X1 (CAR Y2))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive
type reasoning.
Subgoal *5.1/1
(IMPLIES (AND (ENDP Y2)
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *5.1/1'
(IMPLIES (AND (NOT (CONSP Y2))
(NOT (ACL2-NUMBERP Y1))
(NOT (SYMBOLP Y1))
(NOT (CHARACTERP Y1))
(NOT (EQUAL X1 Y1))
(EQLABLE-LISTP Y2)
(TRUE-LISTP Y2)
(EQLABLE-LISTP X)
(CONSP X))
(EQUAL (MEMBER-EQUAL X1 Y2)
(MEMBER-EQL-EXEC X1 Y2))).
But simplification reduces this to T, using the :definitions MEMBER-EQL-EXEC,
MEMBER-EQUAL and TRUE-LISTP, the :executable-counterparts of CONSP,
EQLABLE-LISTP and EQUAL and primitive type reasoning.
That completes the proofs of *5.1 and *5.
We therefore turn our attention to *4, which is
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
Perhaps we can prove *4 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
One of these has a score higher than the other.
We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
This suggestion was produced using the :induction rules EQLABLE-LISTP
and TRUE-LISTP. If we let (:P X Y) denote *4 above then the induction
scheme we'll use is
(AND (IMPLIES (NOT (CONSP Y)) (:P X Y))
(IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
(:P X Y))
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(:P X (CDR Y)))
(:P X Y))).
This induction is justified by the same argument used to admit EQLABLE-LISTP.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *4/4
(IMPLIES (AND (NOT (CONSP Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definition EQLABLE-LISTP
and primitive type reasoning.
Subgoal *4/3
(IMPLIES (AND (CONSP Y)
(NOT (EQLABLEP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
By the simple :definition EQLABLEP we reduce the conjecture to
Subgoal *4/3'
(IMPLIES (AND (CONSP Y)
(NOT (ACL2-NUMBERP (CAR Y)))
(NOT (SYMBOLP (CAR Y)))
(NOT (CHARACTERP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
[GC for 1537 CONS pages..(T=6).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal *4/2
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(TRUE-LISTP (CDR Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
But we reduce the conjecture to T, by primitive type reasoning.
Subgoal *4/1
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(NOT (EQLABLE-LISTP (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(SYMBOLP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
That completes the proof of *4.
We therefore turn our attention to *3, which is
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
Perhaps we can prove *3 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
One of these has a score higher than the other.
We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
This suggestion was produced using the :induction rules EQLABLE-LISTP
and TRUE-LISTP. If we let (:P X Y) denote *3 above then the induction
scheme we'll use is
(AND (IMPLIES (NOT (CONSP Y)) (:P X Y))
(IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
(:P X Y))
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(:P X (CDR Y)))
(:P X Y))).
This induction is justified by the same argument used to admit EQLABLE-LISTP.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *3/4
(IMPLIES (AND (NOT (CONSP Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definition EQLABLE-LISTP
and primitive type reasoning.
Subgoal *3/3
(IMPLIES (AND (CONSP Y)
(NOT (EQLABLEP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
By the simple :definition EQLABLEP we reduce the conjecture to
Subgoal *3/3'
(IMPLIES (AND (CONSP Y)
(NOT (ACL2-NUMBERP (CAR Y)))
(NOT (SYMBOLP (CAR Y)))
(NOT (CHARACTERP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal *3/2
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(TRUE-LISTP (CDR Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
But we reduce the conjecture to T, by primitive type reasoning.
Subgoal *3/1
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(NOT (EQLABLE-LISTP (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(CHARACTERP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
That completes the proof of *3.
We therefore turn our attention to *2, which is
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
Perhaps we can prove *2 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
One of these has a score higher than the other.
We will induct according to a scheme suggested by (EQLABLE-LISTP Y).
This suggestion was produced using the :induction rules EQLABLE-LISTP
and TRUE-LISTP. If we let (:P X Y) denote *2 above then the induction
scheme we'll use is
(AND (IMPLIES (NOT (CONSP Y)) (:P X Y))
(IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y))))
(:P X Y))
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(:P X (CDR Y)))
(:P X Y))).
This induction is justified by the same argument used to admit EQLABLE-LISTP.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *2/4
(IMPLIES (AND (NOT (CONSP Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definition EQLABLE-LISTP
and primitive type reasoning.
Subgoal *2/3
(IMPLIES (AND (CONSP Y)
(NOT (EQLABLEP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
By the simple :definition EQLABLEP we reduce the conjecture to
Subgoal *2/3'
(IMPLIES (AND (CONSP Y)
(NOT (ACL2-NUMBERP (CAR Y)))
(NOT (SYMBOLP (CAR Y)))
(NOT (CHARACTERP (CAR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal *2/2
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(TRUE-LISTP (CDR Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
But we reduce the conjecture to T, by primitive type reasoning.
Subgoal *2/1
(IMPLIES (AND (CONSP Y)
(EQLABLEP (CAR Y))
(NOT (EQLABLE-LISTP (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X)
(ACL2-NUMBERP (CAR X)))
(TRUE-LISTP Y)).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
That completes the proof of *2.
We therefore turn our attention to *1, which is
(IMPLIES (AND (TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
Perhaps we can prove *1 by induction. Four induction schemes are suggested
by this conjecture. These merge into two derived induction schemes.
One of these has a score higher than the other.
We will induct according to a scheme suggested by
(MEMBER-EQL-EXEC (CAR X) Y). This suggestion was produced using the
:induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC and MEMBER-EQUAL.
If we let (:P X Y) denote *1 above then the induction scheme we'll
use is
(AND (IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(:P X (CDR Y)))
(:P X Y))
(IMPLIES (AND (NOT (ENDP Y))
(EQL (CAR X) (CAR Y)))
(:P X Y))
(IMPLIES (ENDP Y) (:P X Y))).
This induction is justified by the same argument used to admit
MEMBER-EQL-EXEC. When applied to the goal at hand the above induction
scheme produces four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(EQUAL (MEMBER-EQUAL (CAR X) (CDR Y))
(MEMBER-EQL-EXEC (CAR X) (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/4'
(IMPLIES (AND (CONSP Y)
(NOT (EQUAL (CAR X) (CAR Y)))
(EQUAL (MEMBER-EQUAL (CAR X) (CDR Y))
(MEMBER-EQL-EXEC (CAR X) (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
[GC for 1537 CONS pages..(T=8).GC finished]
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning.
Subgoal *1/3
(IMPLIES (AND (NOT (ENDP Y))
(NOT (EQL (CAR X) (CAR Y)))
(NOT (EQLABLE-LISTP (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/3'
(IMPLIES (AND (CONSP Y)
(NOT (EQUAL (CAR X) (CAR Y)))
(NOT (EQLABLE-LISTP (CDR Y)))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and EQLABLEP.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP Y))
(EQL (CAR X) (CAR Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definitions ENDP and EQL we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP Y)
(EQUAL (CAR X) (CAR Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ENDP Y)
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (AND (NOT (CONSP Y))
(TRUE-LISTP X)
(EQLABLE-LISTP Y)
(CONSP X))
(EQUAL (MEMBER-EQUAL (CAR X) Y)
(MEMBER-EQL-EXEC (CAR X) Y))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP,
MEMBER-EQL-EXEC and MEMBER-EQUAL, the :executable-counterparts of CONSP
and EQUAL and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
That completes the proof of the guard theorem for SUBSETP-EQL-EXEC.
SUBSETP-EQL-EXEC is compliant with Common Lisp.
[GC for 1537 CONS pages..(T=6).GC finished]
Summary
Form: ( DEFUN SUBSETP-EQL-EXEC ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION EQL)
(:DEFINITION EQLABLE-LISTP)
(:DEFINITION EQLABLEP)
(:DEFINITION MEMBER-EQL-EXEC)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT)
(:DEFINITION TRUE-LISTP)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQLABLE-LISTP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION EQLABLE-LISTP)
(:INDUCTION MEMBER-EQL-EXEC)
(:INDUCTION MEMBER-EQUAL)
(:INDUCTION TRUE-LISTP)
(:TYPE-PRESCRIPTION EQLABLE-LISTP))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION EQLABLEP)
(:DEFINITION NOT))
Time: 1.18 seconds (prove: 0.72, print: 0.16, other: 0.30)
Prover steps counted: 7034
SUBSETP-EQL-EXEC
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK)
Since SUBSETP-EQL-EXEC$GUARD-CHECK is non-recursive, its admission
is trivial. We observe that the type of SUBSETP-EQL-EXEC$GUARD-CHECK
is described by the theorem (EQUAL (SUBSETP-EQL-EXEC$GUARD-CHECK X Y) T).
Computing the guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK....
The guard conjecture for SUBSETP-EQL-EXEC$GUARD-CHECK is trivial to
prove. SUBSETP-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp.
Summary
Form: ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.02, other: 0.16)
SUBSETP-EQL-EXEC$GUARD-CHECK
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL)
The admission of SUBSETP-EQUAL is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of SUBSETP-EQUAL
is described by the theorem
(OR (EQUAL (SUBSETP-EQUAL X Y) T) (EQUAL (SUBSETP-EQUAL X Y) NIL)).
Computing the guard conjecture for SUBSETP-EQUAL....
The guard conjecture for SUBSETP-EQUAL is trivial to prove, given primitive
type reasoning. SUBSETP-EQUAL is compliant with Common Lisp.
Summary
Form: ( DEFUN SUBSETP-EQUAL ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
SUBSETP-EQUAL
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND)
The admission of REVAPPEND is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). We observe that the type of REVAPPEND is described
by the theorem (OR (CONSP (REVAPPEND X Y)) (EQUAL (REVAPPEND X Y) Y)).
We used primitive type reasoning.
Computing the guard conjecture for REVAPPEND....
The guard conjecture for REVAPPEND is trivial to prove, given primitive
type reasoning. REVAPPEND is compliant with Common Lisp.
Summary
Form: ( DEFUN REVAPPEND ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
REVAPPEND
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC)
The admission of FIRST-N-AC is trivial, using the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT I). We observe that the type of FIRST-N-AC is
described by the theorem
(OR (CONSP (FIRST-N-AC I L AC)) (EQUAL (FIRST-N-AC I L AC) NIL)).
We used the :type-prescription rule REVAPPEND.
Computing the guard conjecture for FIRST-N-AC....
The non-trivial part of the guard conjecture for FIRST-N-AC, given
primitive type reasoning, is
Goal
(IMPLIES (AND (TRUE-LISTP AC)
(TRUE-LISTP L)
(<= 0 I)
(INTEGERP I)
(NOT (ZP I)))
(<= 0 (+ -1 I))).
But we reduce the conjecture to T, by the simple :definition ZP and
the :executable-counterpart of TAU-SYSTEM.
Q.E.D.
[GC for 1537 CONS pages..(T=8).GC finished]
That completes the proof of the guard theorem for FIRST-N-AC. FIRST-N-AC
is compliant with Common Lisp.
Summary
Form: ( DEFUN FIRST-N-AC ...)
Rules: ((:DEFINITION NOT)
(:DEFINITION ZP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION REVAPPEND))
Time: 0.26 seconds (prove: 0.08, print: 0.00, other: 0.18)
Prover steps counted: 63
FIRST-N-AC
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE)
The admission of TAKE is trivial, using the relation O< (which is known
to be well-founded on the domain recognized by O-P) and the measure
(ACL2-COUNT N). We observe that the type of TAKE is described by the
theorem (TRUE-LISTP (TAKE N L)). We used primitive type reasoning.
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
Summary
Form: ( DEFUN TAKE ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.46 seconds (prove: 0.00, print: 0.00, other: 0.46)
TAKE
End of Encapsulated Events.
[GC for 1537 CONS pages..(T=8).GC finished]
[GC for 1537 CONS pages..(T=8).GC finished]
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export TAKE, FIRST-N-AC, REVAPPEND, SUBSETP-EQUAL,
SUBSETP-EQL-EXEC$GUARD-CHECK, SUBSETP-EQL-EXEC, MEMBER-EQUAL,
MEMBER-EQL-EXEC$GUARD-CHECK, MEMBER-EQL-EXEC, ALL-NILS and BOOLEANP.
Summary
Form: ( ENCAPSULATE NIL (LOGIC) ...)
Rules: NIL
Time: 5.52 seconds (prove: 0.80, print: 0.20, other: 4.52)
Prover steps counted: 7393
T
Summary
Form: ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
*READ-FILE-INTO-STRING-BOUND*
Summary
Form: ( DEFUN READ-FILE-INTO-STRING1 ...)
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
READ-FILE-INTO-STRING1
[GC for 1537 CONS pages..(T=8).GC finished]
Summary
Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...)
Rules: NIL
Time: 0.38 seconds (prove: 0.00, print: 0.00, other: 0.38)
READ-FILE-INTO-STRING2-LOGICAL
Summary
Form: ( DEFUN READ-FILE-INTO-STRING2 ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
READ-FILE-INTO-STRING2
Summary
Form: ( DEFMACRO READ-FILE-INTO-STRING ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
READ-FILE-INTO-STRING
Summary
Form: ( DEFMACRO WHEN-PASS-2 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
WHEN-PASS-2
Summary
Form: ( DEFUN PRINT-CL-CACHE-FN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
PRINT-CL-CACHE-FN
Summary
Form: ( DEFMACRO PRINT-CL-CACHE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
PRINT-CL-CACHE
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
Summary
Form: ( DEFUN HONS-REMOVE-ASSOC ...)
Rules: NIL
Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22)
HONS-REMOVE-ASSOC
Summary
Form: ( DEFUN COUNT-KEYS ...)
Rules: NIL
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
COUNT-KEYS
Finished loading
'((IN-PACKAGE "ACL2")
(DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
'(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
&AUX *PRINT-PPRINT-DISPATCH*
&BODY *PRINT-PRETTY* &ENVIRONMENT ...))
(DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
'(* ** *** *BREAK-ON-SIGNALS*
*COMPILE-FILE-PATHNAME*
*COMPILE-FILE-TRUENAME*
*COMPILE-PRINT* ...))
(DEFCONST
NIL 'NIL
" NIL, a symbol, represents in Common Lisp both the false truth value
and the empty list.")
(DEFCONST T 'T
"T, a symbol, represents the true truth value in Common Lisp.")
(DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
(DEFMACRO MAKE-PACKAGE-ENTRY
(&KEY NAME IMPORTS HIDDEN-P
BOOK-PATH DEFPKG-EVENT-FORM TTERM)
(CONS 'LIST* (CONS NAME #)))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFMACRO DEFN (F A &REST R)
(CONS 'DEFUN (CONS F #)))
(DEFMACRO DEFND (F A &REST R)
(CONS 'DEFUND (CONS F #)))
(DEFN HONS-EQUAL (X Y)
(DECLARE (XARGS :MODE :LOGIC))
(EQUAL X Y))
(DEFN HONS-ASSOC-EQUAL (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(COND (# NIL) (# #) (T #)))
(DEFN HONS-GET (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(HONS-ASSOC-EQUAL KEY ALIST))
(DEFN HONS-ACONS (KEY VAL ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(CONS (CONS KEY VAL) ALIST))
...).
"ACL2"
DEFN
DEFND
HONS-EQUAL
HONS-ASSOC-EQUAL
HONS-GET
HONS-ACONS
FAST-ALIST-FREE-ON-EXIT-RAW
FAST-ALIST-FREE
FAST-ALIST-FREE-ON-EXIT
HONS-COPY
HONS-COPY-PERSISTENT
[GC for 239 SFUN pages..(T=8).GC finished]
HONS
HONS-EQUAL-LITE
HONS-CLEAR
HONS-CLEAR!
HONS-WASH
HONS-WASH!
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
HONS-SUMMARY
HONS-RESIZE
HONS-RESIZE-FN
HONS
SET-SLOW-ALIST-ACTION
GET-SLOW-ALIST-ACTION
HONS-ACONS!
MAKE-FAST-ALIST
FAST-ALIST-FORK
FAST-ALIST-FORK!
HONS-SHRINK-ALIST
HONS-SHRINK-ALIST!
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
FAST-ALIST-CLEAN
FAST-ALIST-CLEAN!
[GC for 1547 CONS pages..(T=6).GC finished]
FAST-ALIST-LEN
FAST-ALIST-SUMMARY
WITH-FAST-ALIST-RAW
WITH-FAST-ALIST
WITH-STOLEN-ALIST-RAW
WITH-STOLEN-ALIST
CONS-SUBTREES
NUMBER-SUBTREES
FLUSH-HONS-GET-HASH-TABLE-LINK
NIL
REMOVE-KEYWORD
Finished loading
'((IN-PACKAGE "ACL2")
(DEFMACRO DEFN (F A &REST R)
(CONS 'DEFUN (CONS F #)))
(DEFMACRO DEFND (F A &REST R)
(CONS 'DEFUND (CONS F #)))
(DEFN HONS-EQUAL (X Y)
(DECLARE (XARGS :MODE :LOGIC))
(EQUAL X Y))
(DEFN HONS-ASSOC-EQUAL (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(COND (# NIL) (# #) (T #)))
(DEFN HONS-GET (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(HONS-ASSOC-EQUAL KEY ALIST))
(DEFN HONS-ACONS (KEY VAL ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(CONS (CONS KEY VAL) ALIST))
...).
ACL2 loading "basis-a.lisp".
"ACL2"
WORMHOLE-STATUSP
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
WORMHOLE-ENTRY-CODE
WORMHOLE-DATA
SET-WORMHOLE-ENTRY-CODE
SET-WORMHOLE-DATA
MAKE-WORMHOLE-STATUS
TREE-OCCUR-EQ
WORMHOLE-EVAL
[GC for 1547 CONS pages..(T=6).GC finished]
WITH-WORMHOLE-LOCK
WORMHOLE
LEGAL-CONSTANTP1
LAMBDA-KEYWORDP
LEGAL-VARIABLE-OR-CONSTANT-NAMEP
LEGAL-VARIABLEP
ARGLISTP1
[GC for 1557 CONS pages..(T=6).GC finished]
ARGLISTP
FIND-FIRST-BAD-ARG
PROCESS-DEFABBREV-DECLARES
[GC for 1557 CONS pages..(T=6).GC finished]
DEFABBREV1
DEFABBREV
*EVISCERATION-MARK*
*EVISCERATION-HASH-MARK*
*EVISCERATION-ELLIPSIS-MARK*
*EVISCERATION-WORLD-MARK*
*EVISCERATION-STATE-MARK*
*EVISCERATION-ERROR-TRIPLE-MARKS*
*EVISCERATION-HIDING-MARK*
*ANTI-EVISCERATION-MARK*
EVISCERATEDP
*SHARP-ATSIGN-AR*
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
GET-SHARP-ATSIGN
UPDATE-IPRINT-ALIST-FAL
(EVISCERATE1 EVISCERATE1-LST)
[GC for 1567 CONS pages..(T=6).GC finished]
[GC for 288 SYMBOL pages..(T=8).GC finished]
(EVISCERATE1P EVISCERATE1P-LST)
EVISCERATE
EVISCERATE-SIMPLE
ASET1-LST
IPRINT-HARD-BOUND
IPRINT-SOFT-BOUND
[GC for 1567 CONS pages..(T=8).GC finished]
IPRINT-LAST-INDEX*
IPRINT-LAST-INDEX
IPRINT-AR-ILLEGAL-INDEX
IPRINT-ENABLEDP
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
IPRINT-AR-AREF1
COLLECT-POSP-INDICES-TO-HEADER
IPRINT-FAL-NAME
IPRINT-EAGER-P
INIT-IPRINT-FAL
[GC for 1567 CONS pages..(T=8).GC finished]
ROLLOVER-IPRINT-AR
UPDATE-IPRINT-FAL-REC
UPDATE-IPRINT-FAL
UPDATE-IPRINT-AR-FAL
EVISCERATE-TOP
MV-LETC
ER-HARD-VAL
ER-HARD?-VAL?
THE-FIXNUM!
THE-HALF-FIXNUM!
THE-UNSIGNED-BYTE!
THE-STRING!
[GC for 1577 CONS pages..(T=8).GC finished]
XXXJOIN-FIXNUM
+F
-F
|1-F|
|1+F|
CHARF
*F
PPR-FLAT-RIGHT-MARGIN
SET-PPR-FLAT-RIGHT-MARGIN
KEYWORD-PARAM-VALUEP
[GC for 1577 CONS pages..(T=8).GC finished]
CONS-PPR1
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
FLSZ-INTEGER
[GC for 1587 CONS pages..(T=8).GC finished]
FLSZ-ATOM
[GC for 1587 CONS pages..(T=8).GC finished]
FLSZ1
FLSZ
MAX-WIDTH
[GC for 1587 CONS pages..(T=8).GC finished]
(PPR1 PPR1-LST)
NEWLINE
FMT-HARD-RIGHT-MARGIN
FMT-SOFT-RIGHT-MARGIN
[GC for 1587 CONS pages..(T=8).GC finished]
SET-FMT-HARD-RIGHT-MARGIN
SET-FMT-SOFT-RIGHT-MARGIN
WRITE-FOR-READ
SPACES1
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
MAKE-SPACES-ARRAY-REC
MAKE-SPACES-ARRAY
*ACL2-BUILT-IN-SPACES-ARRAY*
SPACES
(FLPR1 FLPR11)
[GC for 1587 CONS pages..(T=8).GC finished]
FLPR
PPR2-FLAT
[GC for 1587 CONS pages..(T=8).GC finished]
(PPR2-COLUMN PPR2)
*FMT-PPR-INDENTATION*
PPR
*ILLEGAL-FMT-KEYS*
ILLEGAL-FMT-STRING
ILLEGAL-FMT-MSG
[GC for 1587 CONS pages..(T=8).GC finished]
SCAN-PAST-WHITESPACE
ZERO-ONE-OR-MORE
[GC for 1587 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
FIND-ALTERNATIVE-SKIP
[GC for 1597 CONS pages..(T=6).GC finished]
FIND-ALTERNATIVE-START1
FMT-CHAR
[GC for 1607 CONS pages..(T=8).GC finished]
FIND-ALTERNATIVE-START
FIND-ALTERNATIVE-STOP
PUNCTP
[GC for 1607 CONS pages..(T=8).GC finished]
FMT-TILDE-S1
FMT-TILDE-CAP-S1
[GC for 1607 CONS pages..(T=6).GC finished]
FMT-VAR
SPLAT-ATOM
SPLAT-ATOM!
[GC for 1607 CONS pages..(T=8).GC finished]
(SPLAT SPLAT1)
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
NUMBER-OF-DIGITS
LEFT-PAD-WITH-BLANKS
MAYBE-NEWLINE
EVISC-TUPLE
STANDARD-EVISC-TUPLEP
WORLD-EVISCERATION-ALIST
ABBREV-EVISC-TUPLE
GAG-MODE
[GC for 239 SFUN pages..(T=8).GC finished]
TERM-EVISC-TUPLE
GAG-MODE-EVISC-TUPLE
LD-EVISC-TUPLE
FMT-PPR
MSGP
[GC for 1607 CONS pages..(T=8).GC finished]
[GC for 1607 CONS pages..(T=8).GC finished]
[GC for 1617 CONS pages..(T=8).GC finished]
[GC for 1627 CONS pages..(T=8).GC finished]
[GC for 1627 CONS pages..(T=8).GC finished]
[GC for 1637 CONS pages..(T=8).GC finished]
[GC for 1647 CONS pages..(T=8).GC finished]
[GC for 48 STRUCTURE pages..(T=8).GC finished]
[GC for 1657 CONS pages..(T=8).GC finished]
[GC for 1667 CONS pages..(T=8).GC finished]
[GC for 1677 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
[GC for 239 SFUN pages..(T=8).GC finished]
(FMT0* FMT0&V SPELL-NUMBER
FMT-TILDE-S FMT-TILDE-CAP-S FMT0)
TILDE-*-&V-STRINGS
[GC for 239 SFUN pages..(T=6).GC finished]
FMT1
FMT
FMS
FMT1!
FMT!
[GC for 239 SFUN pages..(T=6).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
FMS!
FMX
FMX-CW-MSG-1-BODY
[GC for 1687 CONS pages..(T=8).GC finished]
FMX-CW-MSG-1
[GC for 239 SFUN pages..(T=8).GC finished]
FMX-CW-MSG
FMX-CW-FN-GUARD
FMX-CW-FN
FMX!-CW-FN
FMX-CW
FMX!-CW
FMT-DOC-EXAMPLE1
[GC for 239 SFUN pages..(T=6).GC finished]
FMT-DOC-EXAMPLE
*SEE-DOC-SET-IPRINT*
FMT-ABBREV1
FMT-ABBREV
*FMT-CTX-SPACERS*
FMT-CTX
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
FMT-IN-CTX
ERROR-FMS-CHANNEL
ERROR-FMS
PUSH-WARNING-FRAME
ABSORB-FRAME
[GC for 239 SFUN pages..(T=8).GC finished]
POP-WARNING-FRAME
PUSH-WARNING
RECORD-MAKER-FUNCTION-NAME
RECORD-CHANGER-FUNCTION-NAME
MAKE
CHANGE
[GC for 239 SFUN pages..(T=8).GC finished]
MAKE-RECORD-CAR-CDRS1
MAKE-RECORD-CAR-CDRS
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=8).GC finished]
MAKE-RECORD-ACCESSORS
SYMBOL-NAME-TREE-OCCUR
SOME-SYMBOL-NAME-TREE-OCCUR
MAKE-RECORD-CHANGER-CONS
MAKE-RECORD-CHANGER-LET-BINDINGS
[GC for 239 SFUN pages..(T=8).GC finished]
MAKE-RECORD-CHANGER-LET
MAKE-RECORD-CHANGER
MAKE-RECORD-MAKER-CONS
MAKE-RECORD-MAKER-LET
MAKE-RECORD-MAKER
[GC for 239 SFUN pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
MAKE-RECORD-FIELD-LST
RECORD-MAKER-RECOGNIZER-NAME
MAKE-RECORD-RECOGNIZER-BODY
MAKE-RECORD-RECOGNIZER
[GC for 239 SFUN pages..(T=8).GC finished]
RECORD-MACROS
DEFREC
RECORD-TYPE
IO?-NIL-OUTPUT
CHECK-EXACT-FREE-VARS
FORMAL-BINDINGS
WEAK-IO-RECORD-P
PUSH-IO-RECORD
[GC for 239 SFUN pages..(T=8).GC finished]
SAVED-OUTPUT-TOKEN-P
IO?-WORMHOLE-BINDINGS
IO?
IO?-PROVE
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
OUTPUT-IGNORED-P
ERROR1
ERROR1-SAFE
*UNINHIBITED-WARNING-SUMMARIES*
[GC for 239 SFUN pages..(T=8).GC finished]
WARNING-OFF-P1
WARNING-OFF-P
WEAK-STATE-VARS-P
DEFAULT-STATE-VARS
[GC for 239 SFUN pages..(T=8).GC finished]
WARNING1-BODY
WARNING1-FORM
WARNING1
WARNING-DISABLED-P
OBSERVATION1-BODY
[GC for 239 SFUN pages..(T=8).GC finished]
OBSERVATION1
OBSERVATION1-CW
OBSERVATION
OBSERVATION-CW
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
WEAK-DEFSTOBJ-FIELD-TEMPLATE-P
WEAK-DEFSTOBJ-TEMPLATE-P
PACKN1
PACKN-POS
[GC for 239 SFUN pages..(T=8).GC finished]
FIND-FIRST-NON-CL-SYMBOL
PACKN
PACK2
DEFSTOBJ-FNNAME-KEY2
[GC for 239 SFUN pages..(T=8).GC finished]
DEFSTOBJ-FNNAME
DEFINED-CONSTANT
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
FIX-STOBJ-ARRAY-TYPE
DEFSTOBJ-FIELD-TEMPLATES
*DEFSTOBJ-KEYWORDS*
PARTITION-REST-AND-KEYWORD-ARGS1
[GC for 239 SFUN pages..(T=8).GC finished]
PARTITION-REST-AND-KEYWORD-ARGS2
PARTITION-REST-AND-KEYWORD-ARGS
DEFSTOBJ-TEMPLATE
[GC for 239 SFUN pages..(T=8).GC finished]
SIMPLE-ARRAY-TYPE
LIVE-STOBJP
*EXPT2-28*
ARRAY-ETYPE-IS-FIXNUM-TYPE
ABSSTOBJ-NAME
[GC for 239 SFUN pages..(T=8).GC finished]
GET-STOBJ-CREATOR
THE$
GET-STOBJ-SCALAR-FIELD
MAKE-STOBJ-SCALAR-FIELD
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
(MAYBE-CONTAINED-IN-CHARACTER SOME-MAYBE-CONTAINED-IN-CHARACTER
ALL-MAYBE-CONTAINED-IN-CHARACTER)
[GC for 239 SFUN pages..(T=8).GC finished]
SINGLE-FIELD-TYPE-P
DEFSTOBJ-FIELD-FNS-RAW-DEFS
[GC for 1687 CONS pages..(T=8).GC finished]
DEFSTOBJ-RAW-INIT-FIELDS
DEFSTOBJ-RAW-INIT-SETF-FORMS
[GC for 239 SFUN pages..(T=8).GC finished]
DEFSTOBJ-RAW-INIT
DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
STOBJP
TRANSLATE-STOBJ-TYPE-TO-GUARD
[GC for 239 SFUN pages..(T=8).GC finished]
DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS
CONGRUENT-STOBJ-REP
ALL-BUT-LAST
DEFSTOBJ-RAW-DEFS
DEFCONST-NAME
DEFSTOBJ-DEFCONSTS
STRIP-ACCESSOR-NAMES
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
THE-LIVE-VAR
STANDARD-CO
EQUAL-X-CONSTANT
MATCH-TESTS-AND-BINDINGS
MATCH-CLAUSE
MATCH-CLAUSE-LIST
CASE-MATCH
[GC for 1687 CONS pages..(T=8).GC finished]
PARSE-WITH-LOCAL-STOBJ
PARSE-VERSION
PCD2
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
POWER-REP
DECODE-IDATE
PRINT-IDATE
GOOD-BYE-FN
GOOD-BYE
EXIT
QUIT
SAVE-EXEC-FN
SAVE-EXEC
*SLASH-DOT-DOT*
*LENGTH-SLASH-DOT-DOT*
[GC for 1687 CONS pages..(T=8).GC finished]
FIND-DOT-DOT
(CANCEL-DOT-DOTS GET-PARENT-DIRECTORY
MERGE-USING-DOT-DOT)
Finished loading "basis-a.lisp".
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
(DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
(DEFN MEMOIZE-SUMMARY NIL NIL)
(DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
(DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
(DEFCONST *HONS-PRIMITIVE-FNS*
'(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
...).
"ACL2"
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
CLEAR-MEMOIZE-TABLE
CLEAR-MEMOIZE-TABLES
MEMOIZE-SUMMARY
CLEAR-MEMOIZE-STATISTICS
MEMSUM
*HONS-PRIMITIVE-FNS*
*HONS-PRIMITIVES*
*MHT-DEFAULT-SIZE*
[GC for 1687 CONS pages..(T=8).GC finished]
[GC for 1697 CONS pages..(T=8).GC finished]
MEMOIZE-FORM
MEMOIZE
UNMEMOIZE
PROFILE
MEMOIZEDP-WORLD
MEMOIZEDP
NEVER-MEMOIZE-FN
NEVER-MEMOIZE
*BAD-LISP-CONSP-MEMOIZATION*
*THREAD-UNSAFE-BUILTIN-MEMOIZATIONS*
SET-BAD-LISP-CONSP-MEMOIZE
*SPECIAL-CLTL-CMD-ATTACHMENT-MARK-NAME*
*SPECIAL-CLTL-CMD-ATTACHMENT-MARK*
Finished loading
'((IN-PACKAGE "ACL2")
(DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
(DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
(DEFN MEMOIZE-SUMMARY NIL NIL)
(DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
(DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
(DEFCONST *HONS-PRIMITIVE-FNS*
'(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFMACRO SERIALIZE-WRITE
(FILENAME OBJ &KEY VERBOSEP)
(CONS 'SERIALIZE-WRITE-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-WRITE-FN
(FILENAME OBJ VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME OBJ VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
STATE))
(DEFMACRO SERIALIZE-READ
(FILENAME &KEY (HONS-MODE #) VERBOSEP)
(CONS 'SERIALIZE-READ-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-READ-FN
(FILENAME HONS-MODE VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME HONS-MODE VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
(MV VAL STATE)))
(DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
(DECLARE (XARGS :GUARD #))
(CONS 'STATE-GLOBAL-LET* (CONS # #)))).
"ACL2"
SERIALIZE-WRITE
[GC for 1707 CONS pages..(T=8).GC finished]
SERIALIZE-WRITE-FN
SERIALIZE-READ
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SERIALIZE-READ-FN
WITH-SERIALIZE-CHARACTER
Finished loading
'((IN-PACKAGE "ACL2")
(DEFMACRO SERIALIZE-WRITE
(FILENAME OBJ &KEY VERBOSEP)
(CONS 'SERIALIZE-WRITE-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-WRITE-FN
(FILENAME OBJ VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME OBJ VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
STATE))
(DEFMACRO SERIALIZE-READ
(FILENAME &KEY (HONS-MODE #) VERBOSEP)
(CONS 'SERIALIZE-READ-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-READ-FN
(FILENAME HONS-MODE VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME HONS-MODE VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
(MV VAL STATE)))
(DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
(DECLARE (XARGS :GUARD #))
(CONS 'STATE-GLOBAL-LET* (CONS # #)))).
ACL2 loading "basis-b.lisp".
"ACL2"
ENFORCE-REDUNDANCY-ER-ARGS
ENFORCE-REDUNDANCY
GLOBAL-SET
TILDE-@-ILLEGAL-VARIABLE-OR-CONSTANT-NAME-PHRASE
LEGAL-CONSTANTP
GENVAR1
GENVAR
[GC for 1707 CONS pages..(T=10).GC finished]
GEN-FORMALS-FROM-PRETTY-FLAGS1
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
GEN-FORMALS-FROM-PRETTY-FLAGS
COLLECT-NON-X
COLLECT-NON-*
DEFSTUB-BODY-NEW
DEFPROXY
DEFSTUB-IGNORES
DEFSTUB-BODY-OLD-AUX
DEFSTUB-BODY-OLD
[GC for 1707 CONS pages..(T=8).GC finished]
DEFSTUB-FN
DEFSTUB
*PRIMITIVE-FORMALS-AND-GUARDS*
*PRIMITIVE-MONADIC-BOOLEANS*
CONS-TERM1-CASES
*CONS-TERM1-ALIST*
CONS-TERM1-BODY
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
QUOTE-LISTP
CONS-TERM1
CONS-TERM
CONS-TERM*
MCONS-TERM
MCONS-TERM*
FCONS-TERM
[GC for 1707 CONS pages..(T=8).GC finished]
FARGN1
FARGN
CDR-NEST
STOBJ-PRINT-NAME
EVISCERATION-STOBJ-MARK
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
EVISCERATION-STOBJ-MARKS1
*ERROR-TRIPLE-SIG*
*CMP-SIG*
EVISCERATION-STOBJ-MARKS
EVISCERATE-STOBJS1
EVISCERATE-STOBJS
EVISCERATE-STOBJS-TOP
FLAMBDA-APPLICATIONP
LAMBDA-APPLICATIONP
FLAMBDAP
LAMBDA-FORMALS
LAMBDA-BODY
MAKE-LAMBDA
MAKE-LET
DOUBLET-LISTP
ER-LET*
MATCH
MATCH!
[GC for 1707 CONS pages..(T=8).GC finished]
DEF-BASIC-TYPE-SETS1
DEF-BASIC-TYPE-SETS
LIST-OF-THE-TYPE-SET
TS=
TS-COMPLEMENT0
TS-COMPLEMENTP
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
TS-UNION0-FN
TS-UNION0
TS-INTERSECTION0
TS-DISJOINTP
TS-INTERSECTP
TS-BUILDER-CASE-LISTP
TS-BUILDER-MACRO1
TS-BUILDER-MACRO
TS-BUILDER
FFN-SYMB-P
STRIP-NOT
EQUALITYP
INEQUALITYP
CONSITYP
PRINT-CURRENT-IDATE
[GC for 1707 CONS pages..(T=8).GC finished]
SKIP-WHEN-LOGIC
CHK-INHIBIT-OUTPUT-LST
*LD-SPECIAL-ERROR*
CHK-LD-SKIP-PROOFSP
[GC for 1717 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SET-LD-SKIP-PROOFSP
SET-LD-SKIP-PROOFS
SET-WRITE-ACL2X
*CHECK-SUM-EXCLUSIVE-MAXIMUM*
*CHECK-LENGTH-EXCLUSIVE-MAXIMUM*
*-CHECK-SUM-EXCLUSIVE-MAXIMUM*
*1-CHECK-LENGTH-EXCLUSIVE-MAXIMUM*
ASCII-CODE!
CHECK-SUM1
[GC for 1717 CONS pages..(T=8).GC finished]
CHECK-SUM
CHECK-SUM-INC
CHECK-SUM-NATURAL
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
CHECK-SUM-STRING1
CHECK-SUM-STRING2
CHECK-SUM-STRING
[GC for 1717 CONS pages..(T=8).GC finished]
CHECK-SUM-OBJ1
OLD-CHECK-SUM-OBJ
PLUS-MOD-M31
[GC for 298 SYMBOL pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
DOUBLE-MOD-M31
TIMES-EXPT-2-16-MOD-M31
TIMES-MOD-M31
FCHECKSUM-NATURAL-AUX
FCHECKSUM-NATURAL
[GC for 1727 CONS pages..(T=8).GC finished]
FCHECKSUM-STRING1
[GC for 1727 CONS pages..(T=8).GC finished]
FCHECKSUM-STRING2
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
FCHECKSUM-STRING
FCHECKSUM-ATOM
*FCHECKSUM-OBJ-STACK-BOUND-INIT*
(FCHECKSUM-OBJ2 FCHECKSUM-OBJ)
CHECK-SUM-OBJ
READ-FILE-ITERATE
READ-FILE
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
FORMALS
PLIST-WORLDP-WITH-FORMALS
ARITY
SYMBOL-CLASS
FDEFUN-MODE
DEFUN-MODE
ARITIES-OKP
USER-DEFINED-FUNCTIONS-TABLE
[GC for 1737 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
WEAK-DEF-BODY-P
LATEST-BODY
DEF-BODY
BODY
GET-STOBJ-RECOGNIZER
STOBJ-RECOGNIZER-TERMS
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
MCONS-TERM-SMART
(OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST)
OPTIMIZE-STOBJ-RECOGNIZERS
GUARD
GUARD-LST
EQUIVALENCE-RELATIONP
>=-LEN
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
ALL->=-LEN
STRIP-CADRS
STRIP-CDDRS
GLOBAL-SET-LST
CONS-TERM1-BODY-MV2
[GC for 1737 CONS pages..(T=8).GC finished]
CONS-TERM1-MV2
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
(SUBLIS-VAR1 SUBLIS-VAR1-LST)
SUBLIS-VAR
SUBLIS-VAR-LST
SUBCOR-VAR1
(SUBCOR-VAR SUBCOR-VAR-LST)
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
MAKE-REVERSED-AD-LIST
CAR-CDR-ABBREV-NAME
PRETTY-PARSE-AD-LIST
UNTRANSLATE-CAR-CDR-NEST
COLLECT-NON-TRIVIAL-BINDINGS
UNTRANSLATE-AND
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
UNTRANSLATE-OR
CASE-LENGTH
COND-LENGTH
*UNTRANSLATE-BOOLEAN-PRIMITIVES*
RIGHT-ASSOCIATED-ARGS
[GC for 1747 CONS pages..(T=8).GC finished]
DUMB-NEGATE-LIT
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
DUMB-NEGATE-LIT-LST
(TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT)
ACCESSOR-ROOT
PROGN!
LD-REDEFINITION-ACTION
[GC for 1747 CONS pages..(T=10).GC finished]
CHK-LD-REDEFINITION-ACTION
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SET-LD-REDEFINITION-ACTION
REDEF
REDEF!
REDEF+
REDEF-
CHK-CURRENT-PACKAGE
SET-CURRENT-PACKAGE
STANDARD-OI
READ-STANDARD-OI
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
CHK-STANDARD-OI
SET-STANDARD-OI
CHK-STANDARD-CO
SET-STANDARD-CO
PROOFS-CO
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
CHK-PROOFS-CO
SET-PROOFS-CO
LD-PROMPT
CHK-LD-PROMPT
SET-LD-PROMPT
LD-KEYWORD-ALIASES
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
LD-KEYWORD-ALIASESP
LD-KEYWORD-ALIASES
ADD-LD-KEYWORD-ALIAS!
ADD-LD-KEYWORD-ALIAS
SET-LD-KEYWORD-ALIASES!
SET-LD-KEYWORD-ALIASES
LD-MISSING-INPUT-OK
CHK-LD-MISSING-INPUT-OK
SET-LD-MISSING-INPUT-OK
LD-PRE-EVAL-FILTER
[GC for 1747 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
NEW-NAMEP
CHK-LD-PRE-EVAL-FILTER
SET-LD-PRE-EVAL-FILTER
LD-PRE-EVAL-PRINT
CHK-LD-PRE-EVAL-PRINT
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SET-LD-PRE-EVAL-PRINT
LD-POST-EVAL-PRINT
CHK-LD-POST-EVAL-PRINT
SET-LD-POST-EVAL-PRINT
LD-ERROR-TRIPLES
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
CHK-LD-ERROR-TRIPLES
SET-LD-ERROR-TRIPLES
LD-ERROR-ACTION
CHK-LD-ERROR-ACTION
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SET-LD-ERROR-ACTION
LD-QUERY-CONTROL-ALIST
LD-QUERY-CONTROL-ALISTP
CDR-ASSOC-QUERY-ID
CHK-LD-QUERY-CONTROL-ALIST
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
SET-LD-QUERY-CONTROL-ALIST
LD-VERBOSE
CHK-LD-VERBOSE
SET-LD-VERBOSE
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
CHK-LD-USER-STOBJS-MODIFIED-WARNING
SET-LD-USER-STOBJS-MODIFIED-WARNING
*NQTHM-TO-ACL2-PRIMITIVES*
*NQTHM-TO-ACL2-COMMANDS*
[GC for 1757 CONS pages..(T=10).GC finished]
NQTHM-TO-ACL2-FN
NQTHM-TO-ACL2
ALLOCATE-FIXNUM-RANGE
ALLEGRO-ALLOCATE-SLOWLY-FN
CLEAR-PSTK
*PSTK-VARS*
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
PSTK-BINDINGS-AND-ARGS
PSTK
PSTACK-FN
PSTACK
VERBOSE-PSTACK
SET-PRINT-CLAUSE-IDS
SET-SAVED-OUTPUT-TOKEN-LST
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
SET-GAG-MODE-FN
SET-GAG-MODE
POP-INHIBIT-OUTPUT-LST-STACK
PUSH-INHIBIT-OUTPUT-LST-STACK
SET-GC-THRESHOLD$-FN
SET-GC-THRESHOLD$
Finished loading "basis-b.lisp".
ACL2 loading "parallel.lisp".
"ACL2"
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
SET-PARALLEL-EXECUTION-FN
SET-PARALLEL-EXECUTION
WATERFALL-PRINTING-VALUE-FOR-PARALLELISM-VALUE
PRINT-SET-WATERFALL-PARALLELISM-NOTICE
[GC for 1767 CONS pages..(T=8).GC finished]
CHECK-FOR-NO-OVERRIDE-HINTS
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
SET-WATERFALL-PARALLELISM-FN
SET-WATERFALL-PARALLELISM1
SAVED-MEMOIZE-TABLE
SAVE-MEMO-TABLE
CLEAR-MEMO-TABLE-EVENTS
CLEAR-MEMO-TABLE
SAVE-AND-CLEAR-MEMOIZATION-SETTINGS
SET-MEMO-TABLE-EVENTS
RESTORE-MEMOIZATION-SETTINGS
SET-WATERFALL-PARALLELISM
SET-WATERFALL-PRINTING-FN
SET-WATERFALL-PRINTING
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
SET-WATERFALL-PARALLELISM-HACKS-ENABLED-GUARD
WATERFALL-PARALLELISM-TABLE
SET-WATERFALL-PARALLELISM-HACKS-ENABLED
SET-WATERFALL-PARALLELISM-HACKS-ENABLED!
CAAR-IS-DECLAREP
DECLARE-GRANULARITY-P
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
CHECK-AND-PARSE-FOR-GRANULARITY-FORM
PARGS
PLET
BINARY-PAND
PAND
BINARY-POR
POR
OR-LIST
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
AND-LIST
CPU-CORE-COUNT
SPEC-MV-LET
SET-TOTAL-PARALLELISM-WORK-LIMIT-FN
SET-TOTAL-PARALLELISM-WORK-LIMIT
SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR-FN
SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR
Finished loading "parallel.lisp".
ACL2 loading "translate.lisp".
"ACL2"
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
(TERMP TERM-LISTP)
TERM-LIST-LISTP
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
COMPUTED-HINT-TUPLE-LISTP
DEFAULT-HINTS-TABLE
:REDUNDANT
MACRO-ARGS
*MACRO-EXPANSION-CTX*
ERROR-TRACE-SUGGESTION
IGNORED-ATTACHMENT-MSG
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
EV-FNCALL-NULL-BODY-ER-MSG
EV-FNCALL-NULL-BODY-ERP
EV-FNCALL-NULL-BODY-ER
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
EV-FNCALL-CREATOR-ER-MSG
UNKNOWN-PKG-ERROR-MSG
ILLEGAL-MSG
PROGRAM-ONLY-ER-MSG
*SAFE-MODE-GUARD-ER-ADDENDUM*
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
FIND-FIRST-NON-NIL
LATCH-STOBJS1
LATCH-STOBJS
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
ACTUAL-STOBJS-OUT1
APPLY-SYMBOL-ALIST
APPLY-INVERSE-SYMBOL-ALIST
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
ACTUAL-STOBJS-OUT
[GC for 1777 CONS pages..(T=8).GC finished]
[GC for 1787 CONS pages..(T=8).GC finished]
[GC for 10240 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
TRANSLATED-ACL2-UNWIND-PROTECTP4
TRANSLATED-ACL2-UNWIND-PROTECTP
ACL2-SYSTEM-NAMEP
ACL2-SYSTEM-NAMEP-STATE
[GC for 249 SFUN pages..(T=8).GC finished]
T
W-OF-ANY-STATE
UNTRANSLATE-PREPROCESS-FN
UNTRANSLATE*
SAVE-EV-FNCALL-GUARD-ER
[GC for 249 SFUN pages..(T=8).GC finished]
WEAK-ATTACHMENT-P
WEAK-ATTACHMENT-COMPONENT-P
ATTACHMENT-RECORD-PAIRS
ALL-ATTACHMENTS
GC-OFF1
[GC for 249 SFUN pages..(T=8).GC finished]
GC-OFF
RETURN-LAST-LOOKUP
MAKE-LET-OR-LET*
UNTRANSLATE*-LST
[GC for 10496 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
LIVE-STATE-SYMBOLP
APPLY-USER-STOBJ-ALIST-OR-KWOTE
SIGNATURE-FNS
MAKE-EVENT-TUPLE
[GC for 249 SFUN pages..(T=10).GC finished]
ACCESS-EVENT-TUPLE-NUMBER
ACCESS-EVENT-TUPLE-DEPTH
ACCESS-EVENT-TUPLE-TYPE
ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P
ACCESS-EVENT-TUPLE-NAMEX
[GC for 249 SFUN pages..(T=10).GC finished]
ACCESS-EVENT-TUPLE-FORM
ACCESS-EVENT-TUPLE-SYMBOL-CLASS
WEAK-COMMAND-TUPLE-P
MAKE-COMMAND-TUPLE
ACCESS-COMMAND-TUPLE-NUMBER
[GC for 249 SFUN pages..(T=8).GC finished]
ACCESS-COMMAND-TUPLE-DEFUN-MODE
ACCESS-COMMAND-TUPLE-FORM
SAFE-ACCESS-COMMAND-TUPLE-FORM
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
ACCESS-COMMAND-TUPLE-LAST-MAKE-EVENT-EXPANSION
ACCESS-COMMAND-TUPLE-CBD
MAX-ABSOLUTE-EVENT-NUMBER
NEXT-ABSOLUTE-EVENT-NUMBER
MAX-ABSOLUTE-COMMAND-NUMBER
[GC for 249 SFUN pages..(T=8).GC finished]
NEXT-ABSOLUTE-COMMAND-NUMBER
SCAN-TO-LANDMARK-NUMBER
ADD-TO-ZAP-TABLE
FETCH-FROM-ZAP-TABLE
*EVENT-INDEX-INTERVAL*
*COMMAND-INDEX-INTERVAL*
LOOKUP-WORLD-INDEX1
[GC for 249 SFUN pages..(T=8).GC finished]
LOOKUP-WORLD-INDEX
*UNSPECIFIED-XARG-VALUE*
GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS1
GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS
GET-UNAMBIGUOUS-XARGS-FLG1
[GC for 1797 CONS pages..(T=8).GC finished]
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
GET-UNAMBIGUOUS-XARGS-FLG
GET-UNAMBIGUOUS-XARGS-FLG-LST
REMOVE-STRINGS
REV-UNION-EQUAL
[GC for 249 SFUN pages..(T=8).GC finished]
TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST
TRANSLATE-DECLARATION-TO-GUARD-VAR-LST
GET-GUARDS2
GET-GUARDS1
[GC for 249 SFUN pages..(T=8).GC finished]
GET-GUARDS
DCLS-GUARD-RAW-FROM-DEF
GET-EVENT
GET-SKIPPED-PROOFS-P
[GC for 249 SFUN pages..(T=8).GC finished]
NEGATE-UNTRANSLATED-FORM
EVENT-TUPLE-FN-NAMES
CLTL-DEF-FROM-NAME2
CLTL-DEF-FROM-NAME1
[GC for 249 SFUN pages..(T=8).GC finished]
CLTL-DEF-FROM-NAME
UNMAKE-TRUE-LIST-CONS-NEST
UNMAKE-FORMAL-PAIRLIS2
[GC for 1807 CONS pages..(T=8).GC finished]
COLLECT-IGNORED-MV-VARS
ALL-QUOTEPS
(SUBST-VAR SUBST-VAR-LST)
[GC for 249 SFUN pages..(T=10).GC finished]
SUBST-EACH-FOR-VAR
TYPE-EXPRESSIONS-FROM-TYPE-SPEC
SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1
[GC for 249 SFUN pages..(T=8).GC finished]
FLATTEN-ANDS-IN-LIT
FLATTEN-ANDS-IN-LIT-LST
[GC for 1817 CONS pages..(T=10).GC finished]
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
(SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP
SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN
SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN-LST)
COLLECT-PROGRAMS
ALL-FNNAMES1
ALL-FNNAMES
ALL-FNNAMES-LST
GET-BADGE
[GC for 249 SFUN pages..(T=8).GC finished]
T
APPLY$-BADGE-ARITY
*GENERIC-TAME-BADGE-1*
*GENERIC-TAME-BADGE-2*
*GENERIC-TAME-BADGE-3*
*APPLY$-BADGE*
*EV$-BADGE*
EXECUTABLE-BADGE
EXECUTABLE-TAMEP-LAMBDAP
[GC for 249 SFUN pages..(T=8).GC finished]
(EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP
EXECUTABLE-SUITABLY-TAMEP-LISTP)
WELL-FORMED-LAMBDA-OBJECTP1
WELL-FORMED-LAMBDA-OBJECTP
[GC for 249 SFUN pages..(T=10).GC finished]
T
:ATTACHMENTS-RECORDED
(POSSIBLY-DIRTY-LAMBDA-OBJECTP1 POSSIBLY-DIRTY-LAMBDA-OBJECTP1-LST)
[GC for 249 SFUN pages..(T=8).GC finished]
POSSIBLY-DIRTY-LAMBDA-OBJECTP
(MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP-LST)
[GC for 249 SFUN pages..(T=8).GC finished]
(EXPAND-ALL-LAMBDAS EXPAND-ALL-LAMBDAS-LST)
(REMOVE-GUARD-HOLDERS1 REMOVE-GUARD-HOLDERS1-LST)
[GC for 1827 CONS pages..(T=10).GC finished]
REMOVE-GUARD-HOLDERS-WEAK
REMOVE-GUARD-HOLDERS-WEAK-LST
REMOVE-GUARD-HOLDERS1-LST-LST
[GC for 249 SFUN pages..(T=8).GC finished]
REMOVE-GUARD-HOLDERS-WEAK-LST-LST
(CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST)
POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS
[GC for 249 SFUN pages..(T=8).GC finished]
POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST
POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST-LST
REMOVE-GUARD-HOLDERS
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
REMOVE-GUARD-HOLDERS-LST
REMOVE-GUARD-HOLDERS-LST-LST
LAMBDA-OBJECT-GUARD
[GC for 249 SFUN pages..(T=10).GC finished]
TAG-TRANSLATED-LAMBDA$-BODY
LAMBDA$-BODYP
MEMBER-LAMBDA-OBJECTP
ATTACHMENT-ALIST
[GC for 249 SFUN pages..(T=10).GC finished]
ATTACHMENT-PAIR
APPLY$-LAMBDA-GUARD
APPLY$-GUARD
[GC for 249 SFUN pages..(T=10).GC finished]
NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES
ALL-FUNCTION-SYMBOLPS
*UNKNOWN-CONSTRAINTS*
UNKNOWN-CONSTRAINTS-TABLE-GUARD
UNKNOWN-CONSTRAINTS-TABLE
SET-UNKNOWN-CONSTRAINTS-SUPPORTERS
T
[GC for 1827 CONS pages..(T=8).GC finished]
[GC for 1837 CONS pages..(T=8).GC finished]
[GC for 1847 CONS pages..(T=8).GC finished]
[GC for 1857 CONS pages..(T=8).GC finished]
[GC for 1867 CONS pages..(T=8).GC finished]
[GC for 1877 CONS pages..(T=8).GC finished]
[GC for 1877 CONS pages..(T=8).GC finished]
[GC for 308 SYMBOL pages..(T=10).GC finished]
[GC for 1887 CONS pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
[GC for 1897 CONS pages..(T=8).GC finished]
[GC for 1907 CONS pages..(T=10).GC finished]
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 1907 CONS pages..(T=8).GC finished]
(GUARD-RAW EV-FNCALL-GUARD-ER EV-FNCALL-REC-LOGICAL
EV-FNCALL-REC EV-REC-RETURN-LAST
EV-REC EV-REC-LST ...)
EV-FNCALL
EV
EV-LST
UNTRANSLATE
UNTRANSLATE-LST
EV-W-LST
[GC for 259 SFUN pages..(T=10).GC finished]
SILENT-ERROR
CMP-TO-ERROR-TRIPLE
CMP-TO-ERROR-DOUBLE
CMP-AND-VALUE-TO-ERROR-QUADRUPLE
ER-CMP-FN
ER-CMP
VALUE-CMP
ER-PROGN-FN-CMP
ER-PROGN-CMP
ER-LET*-CMP
WARNING1-CW
WARNING$-CW1
WARNING$-CW
CHK-LENGTH-AND-KEYS
DUPLICATE-KEYS-ACTION-TABLE
SET-DUPLICATE-KEYS-ACTION!
SET-DUPLICATE-KEYS-ACTION
DUPLICATE-KEYS-ACTION
LEGAL-INITP
[GC for 259 SFUN pages..(T=8).GC finished]
MACRO-ARGLIST-KEYSP
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=10).GC finished]
MACRO-ARGLIST-AFTER-RESTP
MACRO-ARGLIST-OPTIONALP
MACRO-ARGLIST1P
SUBSEQUENCEP
COLLECT-LAMBDA-KEYWORDPS
MACRO-ARGS-STRUCTUREP
[GC for 259 SFUN pages..(T=8).GC finished]
BIND-MACRO-ARGS-KEYS1
BIND-MACRO-ARGS-KEYS
BIND-MACRO-ARGS-AFTER-REST
BIND-MACRO-ARGS-OPTIONAL
BIND-MACRO-ARGS1
BIND-MACRO-ARGS
MACRO-GUARD-ER-MSG
[GC for 259 SFUN pages..(T=8).GC finished]
MACROEXPAND1-CMP
MACROEXPAND1
CHK-DECLARE
COLLECT-DCLS
TAG-LOOP$
*ACCEPTABLE-DCLS-ALIST*
*DOCUMENTATION-STRINGS-PERMITTED*
*DCL-EXPLANATION-ALIST*
TILDE-*-CONJUNCTION-PHRASE1
TILDE-*-CONJUNCTION-PHRASE
COLLECT-NON-LEGAL-VARIABLEPS
[GC for 259 SFUN pages..(T=10).GC finished]
OPTIMIZE-ALISTP
CHK-DCL-LST
NUMBER-OF-STRINGS
GET-STRING
COLLECT-DECLARATIONS-CMP
COLLECT-DECLARATIONS
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
LISTIFY
TRANSLATE-DCL-LST
*ONEIFY-PRIMITIVES*
*EC-CALL-BAD-OPS*
RETURN-LAST-CALL
PROG2$-CALL
DCL-GUARDIAN
IGNORE-VARS
IGNORABLE-VARS
MV-NTH-LIST
TRANSLATE-BIND
TRANSLATE-DEREF
TRANSLATE-UNBOUND
LISTLIS
[GC for 259 SFUN pages..(T=8).GC finished]
(FIND-FIRST-VAR FIND-FIRST-VAR-LST)
(FIND-FIRST-FNSYMB FIND-FIRST-FNSYMB-LST)
FIND-PKG-WITNESS
TRANS-ER
TRANS-ER+
TRANS-ER+?
TRANS-VALUE
TRANS-ER-LET*
HIDE-IGNORED-ACTUALS
AUGMENT-IGNORE-VARS
COMPUTE-STOBJ-FLAGS
[GC for 259 SFUN pages..(T=8).GC finished]
PRETTYIFY-STOBJ-FLAGS
PRETTYIFY-STOBJS-OUT
DEFSTOBJ-SUPPORTERP
STOBJ-CREATORP
(FFNNAMEP FFNNAMEP-LST)
UNKNOWN-BINDING-MSG
*MACROS-FOR-NONEXPANSION-IN-RAW-LISP*
CHK-NO-DUPLICATE-DEFUNS-CMP
[GC for 259 SFUN pages..(T=10).GC finished]
CHK-NO-DUPLICATE-DEFUNS
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
CHK-STATE-OK-MSG
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
CHK-STATE-OK
CHK-ARGLIST-MSG
MSG-TO-CMP
CHK-ARGLIST-CMP
CHK-ARGLIST
LOGICAL-NAME-TYPE
CHK-ALL-BUT-NEW-NAME-CMP
[GC for 259 SFUN pages..(T=8).GC finished]
CHK-ALL-BUT-NEW-NAME
CHK-DEFUNS-TUPLES-CMP
CHK-DEFUNS-TUPLES
NAME-DROPPER
FIRST-ASSOC-EQ
CONTEXT-FOR-ENCAPSULATE-PASS-2
*BRR-GLOBALS*
UNKNOWN-BINDING-MSG-ER
CONGRUENT-STOBJSP
[GC for 259 SFUN pages..(T=8).GC finished]
STOBJS-IN-OUT1
STOBJS-IN-MATCHP
STOBJS-IN-OUT
NON-TRIVIAL-STOBJ-BINDING
FORMALIZED-VARLISTP
THROW-NONEXEC-ERROR-P1
THROW-NONEXEC-ERROR-P
[GC for 259 SFUN pages..(T=8).GC finished]
CHK-FLET-DECLARATIONS
CHK-FLET-DECLARE-FORM
CHK-FLET-DECLARE-FORM-LIST
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
STOBJ-UPDATER-GUESS-FROM-ACCESSOR
PARSE-STOBJ-LET1
ILLEGAL-STOBJ-LET-MSG
PARSE-STOBJ-LET
PAIRLIS-X1
PAIRLIS-X2
[GC for 1907 CONS pages..(T=8).GC finished]
NO-DUPLICATESP-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST
NO-DUPLICATESP-CHECKS-FOR-STOBJ-LET-ACTUALS
STOBJ-LET-FN
STOBJ-FIELD-ACCESSOR-P
CHK-STOBJ-LET/BINDINGS
[GC for 1907 CONS pages..(T=8).GC finished]
CHK-STOBJ-LET/UPDATERS1
CHK-STOBJ-LET/UPDATERS
CHK-STOBJ-LET
ALL-NILS-OR-X
STOBJ-FIELD-FN-OF-STOBJ-TYPE-P
STOBJ-RECOGNIZER-P
TRANS-OR
INSIDE-DEFABSSTOBJ
[GC for 259 SFUN pages..(T=10).GC finished]
MISSING-KNOWN-STOBJS
DEREF-MACRO-NAME
CORRESPONDING-INLINE-FN
UNTOUCHABLE-FN-P
MACROEXPAND1*-CMP
FIND-STOBJ-OUT-AND-CALL
*INITIAL-RETURN-LAST-TABLE*
[GC for 1907 CONS pages..(T=8).GC finished]
DEFINED-SYMBOLS
MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
MATCH-STOBJS
MAKE-LAMBDA-TERM
(ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST)
*GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG*
[GC for 1907 CONS pages..(T=8).GC finished]
EDCLS-FROM-LAMBDA-OBJECT-DCLS
EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT
*LOOP$-KEYWORD-INFO*
*LOOP$-SPECIAL-FUNCTION-SYMBOLS*
ASSOC-EQUAL-CADR
LOOP$-OPERATOR-SCIONP
LOOP$-SCION-STYLE
[GC for 1907 CONS pages..(T=10).GC finished]
LOOP$-SCION-RESTRICTION
MAKE-CARTON
EXCART
SYMBOL-NAME-EQUAL
ASSOC-SYMBOL-NAME-EQUAL
PARSE-LOOP$-ACCUM
PARSE-LOOP$-WHEN
[GC for 1907 CONS pages..(T=8).GC finished]
PARSE-LOOP$-UNTIL
PARSE-LOOP$-VSTS
[GC for 1917 CONS pages..(T=8).GC finished]
PARSE-LOOP$
MAKE-PLAIN-LOOP$-LAMBDA-OBJECT
TRANSLATE-VSTS
MAKE-BINDINGS
COLLECT-TVSTS-LIFTED-GUARDS
[GC for 1917 CONS pages..(T=10).GC finished]
MAKE-FANCY-LOOP$-TYPE-SPECS
LIFT-FANCY-LOOP$-CARTON-GUARD
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
MAKE-FANCY-LOOP$-LAMBDA-OBJECT
MAKE-PLAIN-LOOP$
MAKE-FANCY-LOOP$-TARGET
MAKE-FANCY-LOOP$
REMOVE-LOOP$-GUARDS
[GC for 1917 CONS pages..(T=8).GC finished]
TRANSLATE11-VAR-OR-QUOTE-EXIT
WEAK-APPLY$-BADGE-ALISTP
ILKS-PLIST-WORLDP
ILKS-PER-ARGUMENT-SLOT
[GC for 1917 CONS pages..(T=10).GC finished]
(QUOTE-NORMAL-FORM1 QUOTE-NORMAL-FORM1-LST)
QUOTE-NORMAL-FORM
PRIMITIVE-EVENT-MACROS
*SYMS-NOT-CALLABLE-IN-CODE-FAL*
[GC for 1917 CONS pages..(T=8).GC finished]
[GC for 1927 CONS pages..(T=8).GC finished]
[GC for 1937 CONS pages..(T=8).GC finished]
[GC for 1947 CONS pages..(T=10).GC finished]
[GC for 1957 CONS pages..(T=10).GC finished]
[GC for 1967 CONS pages..(T=10).GC finished]
[GC for 1977 CONS pages..(T=10).GC finished]
[GC for 1987 CONS pages..(T=10).GC finished]
[GC for 1997 CONS pages..(T=10).GC finished]
[GC for 1997 CONS pages..(T=10).GC finished]
[GC for 1997 CONS pages..(T=8).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2007 CONS pages..(T=8).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2007 CONS pages..(T=10).GC finished]
[GC for 2017 CONS pages..(T=10).GC finished]
[GC for 2027 CONS pages..(T=8).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
[GC for 2037 CONS pages..(T=10).GC finished]
[GC for 58 STRUCTURE pages..(T=8).GC finished]
[GC for 127 ARRAY pages..(T=8).GC finished]
[GC for 127 ARRAY pages..(T=10).GC finished]
[GC for 2047 CONS pages..(T=10).GC finished]
[GC for 2057 CONS pages..(T=10).GC finished]
[GC for 2067 CONS pages..(T=10).GC finished]
[GC for 2077 CONS pages..(T=8).GC finished]
[GC for 2087 CONS pages..(T=10).GC finished]
[GC for 10752 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
/tmp/gazonk_18091_0.c: In function 'L1':
/tmp/gazonk_18091_0.c:1154:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
1154 | if((Cnil)==Cnil){
| ^~
/tmp/gazonk_18091_0.c:1651:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
1651 | if((Cnil)!=Cnil){
| ^~
/tmp/gazonk_18091_0.c:2133:11: warning: self-comparison always evaluates to false [-Wtautological-compare]
2133 | if((Cnil)!=Cnil){
| ^~
/tmp/gazonk_18091_0.c:2449:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
2449 | if((Cnil)==Cnil){
| ^~
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
(TRANSLATE11-FLET-ALIST TRANSLATE11-FLET-ALIST1 TRANSLATE11-FLET
TRANSLATE-STOBJ-CALLS TRANSLATE11-LET
TRANSLATE11-LET* TRANSLATE11-MV-LET ...)
TRANSLATE1-CMP
TRANSLATE1
[GC for 259 SFUN pages..(T=10).GC finished]
(LOGIC-FNSP LOGIC-FNS-LISTP)
LOGIC-TERMP
LOGIC-TERM-LISTP
[GC for 259 SFUN pages..(T=8).GC finished]
LOGIC-FNS-LIST-LISTP
LOGIC-TERM-LIST-LISTP
TRANSLATE-CMP
TRANSLATE
TRANSLATABLE-P
CHK-TRANSLATABLE
[GC for 259 SFUN pages..(T=10).GC finished]
REPLACED-STOBJ
REPLACE-STOBJS1
REPLACE-STOBJS
NON-STOBJPS
USER-STOBJSP
[GC for 259 SFUN pages..(T=10).GC finished]
PUT-ASSOC-EQ-ALIST
COLLECT-USER-STOBJS
EV-FOR-TRANS-EVAL
MACROEXPAND1*
[GC for 259 SFUN pages..(T=10).GC finished]
TRANS-EVAL1
TRANS-EVAL0
TRANS-EVAL
TRANS-EVAL-NO-WARNING
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
TRANS-EVAL-DEFAULT-WARNING
LAMBDA-OBJECT-GUARD-LST
LAMBDA-OBJECT-BODY-LST
FILTER-LAMBDA$-OBJECTS
[GC for 259 SFUN pages..(T=8).GC finished]
(COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST)
TAGGED-LOOP$P
(COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST)
[GC for 259 SFUN pages..(T=8).GC finished]
(ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST)
COLLECT-NON-EMPTY-PAIRS
ANCESTRAL-LAMBDA$S-BY-CALLER
[GC for 259 SFUN pages..(T=10).GC finished]
(ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST)
TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1
TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2
TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3
[GC for 259 SFUN pages..(T=8).GC finished]
TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4
[GC for 782 RELOCATABLE-BLOCKS pages..(T=8).GC finished]
TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5
SIMPLE-TRANSLATE-AND-EVAL
ERROR-FMS-CW
[GC for 259 SFUN pages..(T=10).GC finished]
SIMPLE-TRANSLATE-AND-EVAL-CMP
SIMPLE-TRANSLATE-AND-EVAL-ERROR-DOUBLE
TILDE-*-ALIST-PHRASE1
[GC for 259 SFUN pages..(T=10).GC finished]
TILDE-*-ALIST-PHRASE
SET-TEMP-TOUCHABLE-FNS
SET-TEMP-TOUCHABLE-VARS
CLEAR-TEMP-TOUCHABLE-FNS
[GC for 259 SFUN pages..(T=10).GC finished]
CLEAR-TEMP-TOUCHABLE-VARS
MAPCAR$
MAPDO
ALWAYS
[GC for 259 SFUN pages..(T=8).GC finished]
THEREIS
GUARD-MSG-TABLE
SET-GUARD-MSG
GUARD-MSG-TABLE
GUARD-MSG-TABLE
GUARD-MSG-TABLE
GUARD-MSG-TABLE
GUARD-MSG-TABLE
GUARD-MSG-TABLE
GUARD-MSG-TABLE
Finished loading "translate.lisp".
ACL2 loading "type-set-a.lisp".
"ACL2"
*TS-CHARACTER*
*TS-POSITIVE-INTEGER*
*TS-NON-NEGATIVE-INTEGER*
*TS-NON-POSITIVE-INTEGER*
*TS-INTEGER*
*TS-RATIONAL*
*TS-ACL2-NUMBER*
*TS-RATIONAL-ACL2-NUMBER*
*TS-NEGATIVE-RATIONAL*
*TS-POSITIVE-RATIONAL*
*TS-NON-POSITIVE-RATIONAL*
*TS-NON-NEGATIVE-RATIONAL*
*TS-RATIO*
*TS-BIT*
*TS-CONS*
*TS-BOOLEAN*
*TS-TRUE-LIST*
*TS-NON-NIL*
*TS-SYMBOL*
*TS-TRUE-LIST-OR-STRING*
*TS-EMPTY*
*TS-UNKNOWN*
[GC for 259 SFUN pages..(T=10).GC finished]
ONE-BIT-TYPE-SETP
*CODE-TYPE-SET-ALIST*
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
LOGIOR-LST
LOGAND-LST
[GC for 259 SFUN pages..(T=10).GC finished]
(TS-COMPLEMENT-FN TS-UNION-FN TS-INTERSECTION-FN
EVAL-TYPE-SET EVAL-TYPE-SET-LST)
TS-COMPLEMENT
TS-INTERSECTION
TS-UNION
TS-SUBSETP
[GC for 2097 CONS pages..(T=10).GC finished]
[GC for 2097 CONS pages..(T=8).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
TYPE-SET-BINARY-+-ALIST-ENTRY
TYPE-SET-BINARY-+-ALIST1
TYPE-SET-BINARY-+-ALIST
[GC for 2097 CONS pages..(T=8).GC finished]
[GC for 2097 CONS pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=10).GC finished]
[GC for 259 SFUN pages..(T=8).GC finished]
[GC for 259 SFUN pages..(T=8).GC finished]
TYPE-SET-BINARY-*-ALIST-ENTRY
TYPE-SET-BINARY-*-ALIST1
[GC for 259 SFUN pages..(T=10).GC finished]
TYPE-SET-BINARY-*-ALIST
[GC for 2097 CONS pages..(T=10).GC finished]
[GC for 2097 CONS pages..(T=8).GC finished]
[GC for 259 SFUN pages..(T=8).GC finished]
[GC for 259 SFUN pages..(T=8).GC finished]
[GC for 259 SFUN pages..(T=8).GC finished]
TYPE-SET-<-ALIST-ENTRY
TYPE-SET-<-ALIST1
TYPE-SET-<-ALIST
Finished loading "type-set-a.lisp".
ACL2 loading "linear-a.lisp".
"ACL2"
TS-ACL2-NUMBERP
TS-RATIONALP
[GC for 259 SFUN pages..(T=10).GC finished]
TS-REAL/RATIONALP
TS-INTEGERP
(DUMB-OCCUR DUMB-OCCUR-LST)
WEAK-HISTORY-ENTRY-P
[GC for 259 SFUN pages..(T=8).GC finished]
PT-OCCUR
PT-INTERSECTP
TAG-TREE-OCCUR
REMOVE-TAG-FROM-TAG-TREE
REMOVE-TAG-FROM-TAG-TREE!
EXTEND-TAG-TREE
ADD-TO-TAG-TREE
ADD-TO-TAG-TREE!
*FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE*
FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE-P
PUSH-LEMMA
REMOVE1-ASSOC-EQ-ASSOC-EQ-1
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
REMOVE1-ASSOC-EQ-ASSOC-EQ
CONS-TAG-TREES1
[GC for 318 SYMBOL pages..(T=10).GC finished]
CONS-TAG-TREES
TAGGED-OBJECTS
TAGGED-OBJECTSP
TAGGED-OBJECT
WITH-TTREE-LOCK
ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
PTS-TO-TTREE-LST
MARRY-PARENTS
COLLECT-PARENTS1
COLLECT-PARENTS0
COLLECT-PARENTS
IGNORE-POLYP
TO-BE-IGNOREDP1
TO-BE-IGNOREDP
WEAK-ASSUMNOTE-P
WEAK-ASSUMPTION-P
[GC for 269 SFUN pages..(T=10).GC finished]
WEAK-FC-DERIVATION-P
(CONTAINS-ASSUMPTIONP CONTAINS-ASSUMPTIONP-FC-DERIVATIONS)
REMOVE-ASSUMPTION-ENTRIES-FROM-TYPE-ALIST
FORCE-ASSUMPTION1
DUMB-OCCUR-IN-TYPE-ALIST
ALL-DUMB-OCCUR-IN-TYPE-ALIST
*FORCE-XRUNE*
FORCE-ASSUMPTION
TAG-TREE-OCCUR-ASSUMPTION-NIL-1
[GC for 269 SFUN pages..(T=10).GC finished]
TAG-TREE-OCCUR-ASSUMPTION-NIL
ASSUMPTION-FREE-TTREEP
*IMPOSSIBLE-ASSUMPTION*
FN-COUNT-EVG-MAX-VAL
FN-COUNT-EVG-MAX-VAL-NEG
FN-COUNT-EVG-MAX-CALLS
MIN-FIXNUM
FN-COUNT-EVG-REC
FN-COUNT-EVG
VAR-FN-COUNT-1
VAR-FN-COUNT
VAR-OR-FN-COUNT-<
TERM-ORDER1
ARITH-TERM-ORDER
[GC for 269 SFUN pages..(T=8).GC finished]
WEAK-POLY-P
FIRST-VAR
FIRST-COEFFICIENT
GOOD-COEFFICIENT
GOOD-POT-VARP
GOOD-POLYP
LOGICAL-<
LOGICAL-<=
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
EVALUATE-GROUND-POLY
IMPOSSIBLE-POLYP
TRUE-POLYP
SILLY-POLYP
IMPOSSIBLE-POLY
BASE-POLY0
BASE-POLY
POLY-ALIST-EQUAL
POLY-EQUAL
POLY-WEAKERP
[GC for 269 SFUN pages..(T=8).GC finished]
POLY-MEMBER
NEW-AND-UGLY-LINEAR-VARSP
FILTER-POLYS
ADD-LINEAR-VARIABLE1
ZERO-FACTOR-P
GET-COEFFICIENT
ADD-LINEAR-VARIABLE
DUMB-EVAL-YIELDS-QUOTEP
DUMB-EVAL
[GC for 269 SFUN pages..(T=10).GC finished]
ADD-LINEAR-TERM
ADD-LINEAR-TERMS-FN
ADD-LINEAR-TERMS
NORMALIZE-POLY1
NORMALIZE-POLY
NORMALIZE-POLY-LST
WEAK-LINEAR-POT-P
MODIFY-LINEAR-POT
*MAX-LINEAR-POT-LOOP-STOPPER-VALUE*
LOOP-STOPPER-VALUE-OF-VAR
SET-LOOP-STOPPER-VALUES
[GC for 269 SFUN pages..(T=10).GC finished]
VAR-IN-POT-LST-P
BOUNDS-POLY-WITH-VAR
BOUNDS-POLYS-WITH-VAR
POLYS-WITH-VAR1
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
POLYS-WITH-VAR
POLYS-WITH-POTS
NEW-VARS-IN-POT-LST
CHANGED-POT-VARS
INFECT-POLYS
INFECT-FIRST-N-POLYS
INFECT-NEW-POLYS
FCOMPLEMENTARY-MULTIPLEP1
FCOMPLEMENTARY-MULTIPLEP
[GC for 269 SFUN pages..(T=10).GC finished]
ALREADY-USED-BY-FIND-EQUATIONAL-POLYP-LST
ALREADY-USED-BY-FIND-EQUATIONAL-POLYP
CONS-TERM-BINARY-+-CONSTANT
CONS-TERM-UNARY--
CONS-TERM-BINARY-*-CONSTANT
FIND-EQUATIONAL-POLY-RHS1
FIND-EQUATIONAL-POLY-RHS
FIND-EQUATIONAL-POLY3
FIND-EQUATIONAL-POLY2
[GC for 269 SFUN pages..(T=10).GC finished]
FIND-EQUATIONAL-POLY1
FIND-EQUATIONAL-POLY
GET-COEFF-FOR-CANCEL1
CANCEL2
CANCEL1
CANCEL
CANCEL-POLY-AGAINST-ALL-POLYS
ADD-POLY
PRUNE-POLY-LST
[GC for 269 SFUN pages..(T=10).GC finished]
ADD-POLYS1
ADD-POLYS0
SHOW-POLY2
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
SHOW-POLY1
SHOW-POLY
SHOW-POLY-LST
Finished loading "linear-a.lisp".
ACL2 loading "type-set-b.lisp".
"ACL2"
*NUMBER-OF-NUMERIC-TYPE-SET-BITS*
*TYPE-SET-BINARY-+-TABLE-LIST*
*TYPE-SET-BINARY-+-TABLE*
*TYPE-SET-BINARY-*-TABLE-LIST*
*TYPE-SET-BINARY-*-TABLE*
*TYPE-SET-<-TABLE-LIST*
*TYPE-SET-<-TABLE*
ASSOC-EQUAL-CDR
RUNEP
BASE-SYMBOL
STRIP-BASE-SYMBOLS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
FNUME
FRUNIC-MAPPING-PAIR
FN-RUNE-NUME
DEFINITION-RUNES
GET-NEXT-NUME
DEREF-MACRO-NAME-LST
*ABBREV-RUNE-ALIST*
TRANSLATE-ABBREV-RUNE
RULE-NAME-DESIGNATORP
[GC for 269 SFUN pages..(T=10).GC finished]
THEORYP1
THEORYP
RUNIC-THEORYP1
RUNIC-THEORYP
FIND-MAPPING-PAIRS-TAIL1
FIND-MAPPING-PAIRS-TAIL
AUGMENT-RUNIC-THEORY1
AUGMENT-RUNIC-THEORY
*BAD-RUNIC-DESIGNATOR-STRING*
CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1
[GC for 269 SFUN pages..(T=10).GC finished]
CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS
DUPLICITOUS-CONS-CAR
DUPLICITOUS-REVAPPEND-CAR
DUPLICITOUS-MERGE-CAR
DUPLICITOUS-SORT-CAR
AUGMENT-THEORY
ASSERT$-RUNIC-THEORYP
RUNIC-THEORY
WEAK-ENABLED-STRUCTURE-P
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
ENABLED-STRUCTURE-P
ENABLED-NUMEP
ENABLED-ARITH-NUMEP
ENABLED-RUNEP
ACTIVE-RUNEP
ACTIVE-OR-NON-RUNEP
ENABLED-XFNP
(SUBLIS-VAR! SUBLIS-VAR!-LST)
THEORY-WARNING-FNS-AUX
[GC for 269 SFUN pages..(T=10).GC finished]
THEORY-WARNING-FNS
MAYBE-WARN-ABOUT-THEORY
WEAK-THEORY-INVARIANT-RECORD-P
ENABLED-DISABLED-RUNEPS
THEORY-INVARIANT-MSG-IMPLICATION
COMBINE-ANDS
[GC for 269 SFUN pages..(T=8).GC finished]
THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST
THEORY-INVARIANT-MSG
CHK-THEORY-INVARIANT1
CHK-THEORY-INVARIANT
WEAK-CLAUSE-ID-P
POS-LISTP
[GC for 269 SFUN pages..(T=10).GC finished]
ALL-DIGITS-P
D-POS-LISTP
CLAUSE-ID-P
*INITIAL-CLAUSE-ID*
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE
[GC for 269 SFUN pages..(T=10).GC finished]
STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE
UPDATE-ENABLED-STRUCTURE-ARRAY
UPDATE-ENABLED-STRUCTURE
LOAD-THEORY-INTO-ENABLED-STRUCTURE
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
INITIAL-GLOBAL-ENABLED-STRUCTURE
RECOMPRESS-GLOBAL-ENABLED-STRUCTURE
RECOMPRESS-STOBJ-ACCESSOR-ARRAYS
*FAKE-RUNE-FOR-TYPE-SET*
PUFFERT
IMMEDIATE-FORCEP
NUMERIC-TYPE-SET
RATIONAL-TYPE-SET
[GC for 269 SFUN pages..(T=10).GC finished]
TYPE-SET-BINARY-+
TYPE-SET-BINARY-*
TYPE-SET-NOT
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-<-1
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-<
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-UNARY--
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-UNARY-/
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-NUMERATOR
TYPE-SET-DENOMINATOR
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-REALPART
TYPE-SET-IMAGPART
TYPE-SET-COMPLEX
[GC for 2097 CONS pages..(T=10).GC finished]
WEAK-RECOGNIZER-TUPLE-P
*INITIAL-RECOGNIZER-ALIST*
MOST-RECENT-ENABLED-RECOG-TUPLE1
MOST-RECENT-ENABLED-RECOG-TUPLE
TYPE-SET-RECOGNIZER
TYPE-SET-CAR
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-CDR
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
TYPE-SET-COERCE
TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL
TYPE-SET-LENGTH
[GC for 2097 CONS pages..(T=10).GC finished]
TYPE-SET-CONS
*SINGLETON-TYPE-SETS*
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
TYPE-SET-EQUAL
TYPE-SET-QUOTE
TYPE-SET-CHAR-CODE
FN-COUNT-1
FN-COUNT
TERM-ORDER
[GC for 269 SFUN pages..(T=10).GC finished]
WEAK-TYPE-PRESCRIPTION-P
FIND-RUNED-TYPE-PRESCRIPTION
MV-ATF
ASSUME-TRUE-FALSE-ERROR
NON-CONS-CDR
*ONE-WAY-UNIFY1-IMPLICIT-FNS*
ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS
[GC for 269 SFUN pages..(T=8).GC finished]
(ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1
ONE-WAY-UNIFY1-EQUAL)
ONE-WAY-UNIFY
CANONICAL-REPRESENTATIVE
[GC for 269 SFUN pages..(T=10).GC finished]
SUBST-TYPE-ALIST1-CHECK
NIL-FN
*NIL-FN-TS-ENTRY*
SUBST-TYPE-ALIST1
SUBST-TYPE-ALIST
INFECT-TYPE-ALIST-ENTRY
INFECT-NEW-TYPE-ALIST-ENTRIES2
[GC for 269 SFUN pages..(T=10).GC finished]
INFECT-NEW-TYPE-ALIST-ENTRIES1
INFECT-NEW-TYPE-ALIST-ENTRIES
EXTEND-TYPE-ALIST-SIMPLE
EXTEND-TYPE-ALIST1
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=12).GC finished]
EXTEND-TYPE-ALIST
ZIP-VARIABLE-TYPE-ALIST
ASSOC-EQUIV
ASSOC-EQUIV+
[GC for 2097 CONS pages..(T=10).GC finished]
ASSOC-TYPE-ALIST
LOOK-IN-TYPE-ALIST
MEMBER-CHAR-STRINGP
TERMINAL-SUBSTRINGP1
TERMINAL-SUBSTRINGP
[GC for 269 SFUN pages..(T=10).GC finished]
EVG-OCCUR
(OCCUR OCCUR-LST)
(PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST)
DECREMENT-WORSE-THAN-CLK
WITH-DECREMENT-WORSE-THAN-CLK
WORSE-THAN-BUILTIN-CLOCKED-BODY
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
(WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED
BASIC-WORSE-THAN-LST1
BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN
SOME-SUBTERM-WORSE-THAN-OR-EQUAL
SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST
...)
T
T
WORSE-THAN-CLK
[GC for 269 SFUN pages..(T=8).GC finished]
WORSE-THAN-BUILTIN
WORSE-THAN-OR-EQUAL-BUILTIN
:ATTACHMENTS-RECORDED
:ATTACHMENTS-RECORDED
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
WEAK-ANCESTOR-P
MAKE-ANCESTOR-BINDING-HYP
ANCESTOR-BINDING-HYP-P
ANCESTOR-BINDING-HYP/HYP
ANCESTOR-BINDING-HYP/UNIFY-SUBST
PUSH-ANCESTOR
ANCESTOR-LISTP
EARLIER-ANCESTOR-BIGGERP
[GC for 2097 CONS pages..(T=10).GC finished]
EQUAL-MOD-COMMUTING
ANCESTORS-CHECK1
ANCESTORS-CHECK-BUILTIN
ANCESTORS-CHECK
:ATTACHMENTS-RECORDED
MAP-MULTIPLY-CAR
[GC for 2097 CONS pages..(T=10).GC finished]
NORMALIZE-ADDEND
INSERT-CDR-TERM-ORDER
NORMALIZE-LINEAR-SUM-2
NORMALIZE-LINEAR-SUM-1
NORMALIZE-LINEAR-SUM
[GC for 269 SFUN pages..(T=10).GC finished]
NORMALIZE-LINEAR-SUM-P1
NORMALIZE-LINEAR-SUM-P
[GC for 2097 CONS pages..(T=10).GC finished]
[GC for 2107 CONS pages..(T=8).GC finished]
[GC for 2117 CONS pages..(T=10).GC finished]
TYPE-SET-FINISH-1
[GC for 2127 CONS pages..(T=10).GC finished]
TYPE-SET-FINISH
SEARCH-TYPE-ALIST-REC
[GC for 269 SFUN pages..(T=10).GC finished]
(FREE-VARSP FREE-VARSP-LST)
SEARCH-TYPE-ALIST-WITH-REST
SEARCH-TYPE-ALIST
TERM-AND-TYP-TO-LOOKUP
LOOKUP-HYP
BIND-FREE-VARS-TO-UNBOUND-FREE-VARS
X-XRUNEP
HYP-XRUNE
HYP-XRUNE-RUNE
CONC-XRUNE
CONC-XRUNE-RUNE
XRUNE-RUNE
RUNE=
XRUNE=
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
PRETTYIFY-XRUNE
WEAK-ACCP-INFO-P
WEAK-ACCP-ENTRY-P
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
MERGE-ACCUMULATED-PERSISTENCE-AUX
MERGE-ACCUMULATED-PERSISTENCE-REC
MERGE-ACCUMULATED-PERSISTENCE
ADD-ACCUMULATED-PERSISTENCE-S
[GC for 2127 CONS pages..(T=10).GC finished]
ADD-ACCUMULATED-PERSISTENCE-F
ACCUMULATED-PERSISTENCE-MAKE-FAILURES
[GC for 328 SYMBOL pages..(T=10).GC finished]
ADD-ACCUMULATED-PERSISTENCE
ACCUMULATED-PERSISTENCE
ACCUMULATED-PERSISTENCE-OOPS
SET-ACCUMULATED-PERSISTENCE
MERGE-CAR->
MERGE-SORT-CAR->
*ACCP-MAJOR-SEPARATOR*
*ACCP-MINOR-SEPARATOR*
SHOW-ACCUMULATED-PERSISTENCE-PHRASE0
[GC for 269 SFUN pages..(T=12).GC finished]
SHOW-ACCUMULATED-PERSISTENCE-PHRASE1
SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS
SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY
SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE
[GC for 269 SFUN pages..(T=12).GC finished]
SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE
SHOW-ACCUMULATED-PERSISTENCE-PHRASE2
SPLIT-XRUNE-ALIST
SORT-XRUNE-ALIST-BY-RUNE1
SORT-XRUNE-ALIST-BY-RUNE
[GC for 2127 CONS pages..(T=10).GC finished]
POP-ACCP-FN
POP-ACCP-FN-ITERATE
SHOW-ACCUMULATED-PERSISTENCE-LIST
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
SHOW-ACCUMULATED-PERSISTENCE-PHRASE
SHOW-ACCUMULATED-PERSISTENCE
PUSH-ACCP-FN
PUSH-ACCP
[GC for 269 SFUN pages..(T=10).GC finished]
POP-ACCP
WITH-ACCUMULATED-PERSISTENCE
[GC for 2127 CONS pages..(T=10).GC finished]
[GC for 2137 CONS pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
ASSUME-TRUE-FALSE-<
MV-ATF-2
BINDING-HYP-P
ADJUST-IGNORE-FOR-ATF
[GC for 2147 CONS pages..(T=10).GC finished]
BACKCHAIN-LIMIT-REACHEDP1
BACKCHAIN-LIMIT-REACHEDP
NEW-BACKCHAIN-LIMIT
ONCEP-TP
[GC for 269 SFUN pages..(T=12).GC finished]
ONCEP-TP-BUILTIN
:ATTACHMENTS-RECORDED
STRENGTHEN-RECOG-CALL
PUSH-LEMMA?
[GC for 2147 CONS pages..(T=10).GC finished]
[GC for 2157 CONS pages..(T=10).GC finished]
[GC for 2167 CONS pages..(T=10).GC finished]
[GC for 2177 CONS pages..(T=10).GC finished]
[GC for 2177 CONS pages..(T=10).GC finished]
[GC for 2187 CONS pages..(T=10).GC finished]
[GC for 2197 CONS pages..(T=10).GC finished]
[GC for 2197 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2207 CONS pages..(T=10).GC finished]
[GC for 2217 CONS pages..(T=10).GC finished]
[GC for 2227 CONS pages..(T=12).GC finished]
[GC for 2237 CONS pages..(T=10).GC finished]
[GC for 2247 CONS pages..(T=10).GC finished]
[GC for 2257 CONS pages..(T=12).GC finished]
[GC for 2267 CONS pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 11008 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 269 SFUN pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
(TYPE-SET-REC TYPE-SET-LST TYPE-SET-RELIEVE-HYPS-FREE
TYPE-SET-RELIEVE-HYPS1
TYPE-SET-RELIEVE-HYPS
EXTEND-TYPE-ALIST-WITH-BINDINGS
TYPE-SET-WITH-RULE ...)
TYPE-SET
[GC for 269 SFUN pages..(T=10).GC finished]
TYPE-SET-BC
T
:ATTACHMENTS-RECORDED
TOP-LEVEL-IF-REDUCE-REC
TOP-LEVEL-IF-REDUCE
[GC for 269 SFUN pages..(T=10).GC finished]
TOP-LEVEL-IF-P
TYPE-ALIST-REDUCIBLE-ENTRIES
ASSUME-TRUE-FALSE-AGGRESSIVE-1
ASSUME-TRUE-FALSE-AGGRESSIVE
[GC for 269 SFUN pages..(T=10).GC finished]
ASSUME-TRUE-FALSE
ASSUME-TRUE-FALSE-BC
OK-TO-FORCE-ENS
[GC for 269 SFUN pages..(T=10).GC finished]
ADD-LINEAR-ASSUMPTION
RETURN-TYPE-ALIST
TYPE-ALIST-EQUALITY-LOOP1
CLEAN-UP-ALIST
DUPLICATE-KEYSP
CLEAN-TYPE-ALIST
TYPE-ALIST-EQUALITY-LOOP-EXIT
*TYPE-ALIST-EQUALITY-LOOP-MAX-DEPTH*
TYPE-ALIST-EQUALITY-LOOP
PUT-ASSOC-EQUAL-TS
[GC for 279 SFUN pages..(T=10).GC finished]
RECONSIDER-TYPE-ALIST
TYPE-ALIST-CLAUSE-FINISH1
TYPE-ALIST-CLAUSE-FINISH
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
TYPE-ALIST-CLAUSE
KNOWN-WHETHER-NIL
TS-BOOLEANP
WEAK-CONS-OCCUR
EQUAL-X-CONS-X-YP
NOT-IDENT
FIRST-IF
ALL-VARIABLEP
NORMALIZE-WITH-TYPE-SET
[GC for 279 SFUN pages..(T=12).GC finished]
(NORMALIZE NORMALIZE-LST
NORMALIZE-OR-DISTRIBUTE-FIRST-IF
DISTRIBUTE-FIRST-IF)
DECODE-TYPE-SET1
DECODE-TYPE-SET
DTS
ENS
Finished loading "type-set-b.lisp".
ACL2 loading "linear-b.lisp".
"ACL2"
[GC for 2277 CONS pages..(T=10).GC finished]
POLYS-FROM-TYPE-SET
ADD-TYPE-SET-POLYS
ADD-POLYNOMIAL-INEQUALITIES
ADD-POLYS
[GC for 279 SFUN pages..(T=10).GC finished]
(EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST)
EVAL-GROUND-SUBEXPRESSIONS
EVAL-GROUND-SUBEXPRESSIONS-LST
POLY-SET
[GC for 2277 CONS pages..(T=10).GC finished]
[GC for 2277 CONS pages..(T=10).GC finished]
LINEARIZE1
LINEARIZE
LINEARIZE-LST1
LINEARIZE-LST
Finished loading "linear-b.lisp".
ACL2 loading "non-linear.lisp".
"ACL2"
CLEANSE-TYPE-ALIST
VAR-WITH-DIVISIONP
VARIFY
VARIFY!
VARIFY!-LST1
[GC for 279 SFUN pages..(T=10).GC finished]
VARIFY!-LST
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
INVERT-VAR
PART-OF1
PART-OF
PRODUCT-ALREADY-TRIEDP
TOO-MANY-POLYSP
EXPANDED-NEW-VARS-IN-POT-LST2
EXPANDED-NEW-VARS-IN-POT-LST1
EXPANDED-NEW-VARS-IN-POT-LST
EXTRACT-BOUNDS
GOOD-BOUNDS-IN-POT
[GC for 279 SFUN pages..(T=10).GC finished]
INVERSE-POLYS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
ADD-INVERSE-POLYS
ADD-POLYS-FROM-TYPE-SET
LENGTH-OF-SHORTEST-POLYS-WITH-VAR
SHORTEST-POLYS-WITH-VAR1
SHORTEST-POLYS-WITH-VAR
BINARY-*-LEAVES
BINARY-*-TREE
MERGE-ARITH-TERM-ORDER
INSERT-ARITH-TERM-ORDER
[GC for 279 SFUN pages..(T=10).GC finished]
SORT-ARITH-TERM-ORDER
MULTIPLY-ALIST-AND-CONST
COLLECT-RATIONAL-POLY-P-LST
Finished loading "non-linear.lisp".
ACL2 loading "tau.lisp".
"ACL2"
ALMOST-LEXORDER-SINGLETONS
MEMBER-NIL-NEG-EVGS
MEMBER-NEG-EVGS1
MEMBER-NEG-EVGS
INSERT-NEG-EVGS1
INSERT-NEG-EVGS
MERGE-CAR-<
[GC for 279 SFUN pages..(T=12).GC finished]
MERGE-SORT-CAR-<
MERGE-CADR-<
MERGE-SORT-CADR-<
STRIP-CADDRS
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
UNPRETTYIFY/ADD-HYPS-TO-PAIRS
UNPRETTYIFY
REPRETTYIFY
CONVERT-RETURNED-VARS-TO-TERM-LST
IMPLICATE
WEAK-TYPE-SET-INVERTER-RULE-P
*INITIAL-TYPE-SET-INVERTER-RULES*
CONVERT-TYPE-SET-TO-TERM-LST
CONVERT-TYPE-SET-TO-TERM1
[GC for 279 SFUN pages..(T=10).GC finished]
CONVERT-TYPE-SET-TO-TERM
CONVERT-TYPE-PRESCRIPTION-TO-TERM
ALL-RUNES-IN-VAR-TO-RUNES-ALIST
ALL-RUNES-IN-VAR-TO-RUNES-ALIST-LST
UNION-EQUAL-REMOVING-DUPLICATES
WEAK-SUMMARY-DATA-P
MAKE-SUMMARY-DATA
[GC for 279 SFUN pages..(T=10).GC finished]
(ALL-RUNES-IN-ELIM-SEQUENCE-LST ALL-RUNES-IN-ELIM-SEQUENCE
ALL-RUNES-IN-TTREE-FC-DERIVATION-LST
ALL-RUNES-IN-TTREE-FIND-EQUATIONAL-POLY-LST
ALL-RUNES-SUMMARY-DATA-LST
ALL-RUNES-IN-TTREE
ALL-RUNES-IN-TTREE-LST)
WEAK-TAU-INTERVAL-P
*TAU-EMPTY-INTERVAL*
TAU-EMPTY-INTERVALP
<?-NUMBER-V-RATIONAL
<?-RATIONAL-V-NUMBER
[GC for 279 SFUN pages..(T=10).GC finished]
EVAL-TAU-INTERVAL1
EVAL-TAU-INTERVAL
DECODE-TAU-INTERVAL
WEAK-TAU-P
*TAU-EMPTY*
*NIL-SINGLETON-EVG-LIST*
*TAU-T*
*TAU-NIL*
*TAU-NON-NIL*
*TAU-CONTRADICTION*
*CONTRADICTORY-TAU*
WEAK-SIGNATURE-RULE-P
WEAK-BIG-SWITCH-RULE-P
TAU-SIMPLE-IMPLICANTS
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-PAIR-MEMBER1
TAU-PAIR-MEMBER
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
EV-FNCALL-W-TAU-RECOG
BAD-VAL-OR-UNKNOWNS
EXISTS-BAD-VALP
ALL-EVAL-VALP
DELETE-BAD-VALS
DELETE-BAD-VALS1
TAU-PAIRS-SUBSETP
TAU-PAIRS-NEAR-SUBSETP
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-PAIRS-INTERSECTIONP
INSERT-TAU-PAIR
INTERVAL-DECIDER
SIGNATE
REDUCE-SIGN/RECOG
EVERY-NEG-EVG-IN-TAU-P1
EVERY-NEG-EVG-IN-TAU-P
LOWER-BOUND-<=
[GC for 279 SFUN pages..(T=10).GC finished]
UPPER-BOUND->=
LOWER-BOUND->
UPPER-BOUND-<
TAU-SUBINTERVALP
TAU-IMPLIES
EMPTY-TAU-INTERVALP
SINGLETON-TAU-INTERVALP
MAKE-IDENTITY-INTERVAL
[GC for 279 SFUN pages..(T=10).GC finished]
IDENTITY-INTERVALP
DELETE-CONSECUTIVE-INTEGERS-UPWARD
DELETE-CONSECUTIVE-INTEGERS-DOWNWARD
COLLECT-<?-X-K
COLLECT-<?-K-X
ADJUST-UPPER-BOUND-WITH-NEG-EVGS
ADJUST-LOWER-BOUND-WITH-NEG-EVGS
SQUEEZE-K
[GC for 279 SFUN pages..(T=10).GC finished]
SET-TAU-POS-EVG
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
POSITIVE-LOWER-BOUNDP
NONNEGATIVE-LOWER-BOUNDP
NEGATIVE-UPPER-BOUNDP
TIGHTEN-BOUND
ADD-TO-TAU1
ADD-RECOGS-TO-TAU1
[GC for 2277 CONS pages..(T=10).GC finished]
TAU-INTERVAL-ENDPOINT-TO-SIGN-K-TOKEN
TAU-UNION
ALL-INTEGERS-IN-RANGE-EXCLUDEDP1
ALL-INTEGERS-IN-RANGE-EXCLUDEDP
ADD-TO-TAU
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
POS-EVG-NEAR-SUBSETP
NEG-EVGS-NEAR-SUBSETP
TAU-INTERVAL-ENDPOINT-IMPLICATION
TAU-INTERVAL-NEAR-SUBSETP
TAU-NEAR-SUBSETP
TAU-PUT
[GC for 2277 CONS pages..(T=10).GC finished]
(TAU-PUT* TAU-PUT*-TAU TAU-PUT*-INTERVAL-ENDPOINTS
TAU-PUT*-RECOGS)
*NON-TAU-MONADIC-BOOLEAN-FUNCTIONS*
MONADIC-BOOLEAN-FNP
PUTPROP-IF-DIFFERENT
TAU-VISIT-FUNCTION-INTRODUCTION
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-VISIT-FUNCTION-INTRODUCTIONS
PUTPROP-TAU-PAIR
INITIALIZE-TAU-PRED
INITIALIZE-TAU-PREDS
TAU-BOOLEAN-FORMP
TAU-EVAL-FORMP
RUNE-<
[GC for 279 SFUN pages..(T=10).GC finished]
MERGE-RUNES-STRICT
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
MERGE-SORT-RUNES-STRICT
GET-TAU-RUNES
SET-TAU-RUNES
ADD-TAU-BOOLEAN-RULE
ADD-TAU-EVAL-RULE
TAU-LIKE-SUBJECT-CRITERION
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-LIKE-TERM
TAU-LIKE-TERM-LISTP
TAU-CONJUNCTIVE-FORMP
TAU-SIMPLE-FORMP
ADD-TAU-SIMPLE-RULE
CONVERT-TAU-LIKE-TERMS-TO-TAU
ADD-TAU-CONJUNCTIVE-RULE
[GC for 279 SFUN pages..(T=10).GC finished]
PARTITION-SIGNATURE-HYPS-INTO-TAU-ALIST-AND-OTHERS
TAU-BOOLEAN-SIGNATURE-FORMP
TAU-SIGNATURE-FORMP
REPLACE-VARS-BY-BINDINGS
[GC for 2277 CONS pages..(T=10).GC finished]
ADD-TAU-SIGNATURE-RULE
SWITCH-VARP
TAU-BIG-SWITCH-EQUATIONP
TAU-BIG-SWITCH-VAR
TAU-BIG-SWITCH-FORMP
ADD-TAU-BIG-SWITCH-RULE
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-MV-NTH-SYNONYM-FORMP
ADD-TAU-MV-NTH-SYNONYM-RULE
WEAK-BOUNDER-CORRECTNESS-P
ALL-CARS-NIL
FIND-SUBJECT-BOUNDER-LINK-TERM
[GC for 2277 CONS pages..(T=10).GC finished]
TAU-BOUNDER-DOMS-EXTRACTION
TAU-BOUNDER-HYP-EXTRACTION
*ALL-INTERVAL-DOMAINS*
ACCEPTABLE-DOMAINS-FOR-BOUNDER
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
BOUNDER-ARGS
TAU-BOUNDER-FORMP
PAIRWISE-SUBSETP-EQ
BOUNDER-SUBSUMEDP
BOUNDER-SUBSUMEDP-BY-SOME
[GC for 279 SFUN pages..(T=10).GC finished]
DELETE-SOME-SUBSUMED-BOUNDERS
ADD-BOUNDER-TO-BOUNDERS
ADD-TAU-BOUNDER-RULE
STRIP-FORCE-AND-CASE-SPLIT
STRIP-FORCE-AND-CASE-SPLIT-IN-HYPS-OF-PAIRS
ACCEPTABLE-TAU-RULEP
ACCEPTABLE-TAU-RULESP
[GC for 279 SFUN pages..(T=12).GC finished]
ACCEPTABLE-TAU-RULES
CROSS-PROD1
CROSS-PROD2
CROSS-PROD
CNF-DNF
SPLIT-ON-CONJOINED-DISJUNCTIONS
[GC for 279 SFUN pages..(T=10).GC finished]
SPLIT-ON-CONJOINED-DISJUNCTIONS-IN-HYPS-OF-PAIRS
CHK-ACCEPTABLE-TAU-RULE
ADD-TAU-RULE1
ADD-TAU-RULE
DISCOVER-TAU-PRED
DISCOVER-TAU-PREDS
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-RULES-FROM-TYPE-PRESCRIPTIONS
ORIGINAL-DEF-BODY1
[GC for 338 SYMBOL pages..(T=10).GC finished]
ORIGINAL-DEF-BODY
TAU-LIKE-PROPOSITIONP
EXPAND-TAU-LIKE-PROPOSITION
ADD-ONLY-SIMPLE-AND-CONJUNCTIVE-TAU-RULES
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
CONVERT-NORMALIZED-TERM-TO-PAIRS
COMPLEMENTARYP
SUBSUMES-BUT-FOR-ONE-NEGATION
REMOVE-ANCESTOR-LITERALS-FROM-PAIRS1
REMOVE-ANCESTOR-LITERALS-FROM-PAIRS
CONVERT-TERM-TO-PAIRS
[GC for 279 SFUN pages..(T=10).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
TAU-SUBRS
TAU-VISIT-DEFUNS1
TAU-VISIT-DEFUNS
TAU-VISIT-DEFUN
COROLLARIES-AND-RUNES-OF-ENABLED-RULES
TAU-VISIT-DEFTHM1
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-VISIT-DEFTHM
TAU-VISIT-EVENT
APPLY-CONJUNCTIVE-TAU-RULE
APPLY-CONJUNCTIVE-TAU-RULES2
APPLY-CONJUNCTIVE-TAU-RULES1
APPLY-CONJUNCTIVE-TAU-RULES
[GC for 279 SFUN pages..(T=10).GC finished]
ADD-TO-TAU!
ALL-TAU-EMPTYP
ALL-UNRESTRICTED-SIGNATURE-RULESP
DISJOIN-INTERVALS
CONJOIN-INTERVALS
[GC for 2277 CONS pages..(T=12).GC finished]
COMBINE-POS/NEG-PAIRS-FROM-TAU1
AUGMENT-POS/NEG-PAIRS-WITH-IMPLICIT-NUMERIC-RECOGS
COMBINE-POS/NEG-PAIRS-FROM-TAU
COMBINE-TAU
PUSH-MV-NTH-DOWN
[GC for 2277 CONS pages..(T=12).GC finished]
TAU-EXPAND-BIG-SWITCH
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
DECONSTRUCT-CONJUNCTION
OK-TO-FIRE-SIGNATURE-RULEP1
SMART-MEMBER-EQUAL-+-
RECURSIVEP
FIND-FIRST-ACCEPTABLE-DOMAIN
TAU-LST-WITH-ACCEPTABLE-DOMAINSP
[GC for 279 SFUN pages..(T=10).GC finished]
COLLECT-BOUNDER-ARGS
BOUNDING-INTERVAL
CONJOIN-BOUNDING-INTERVALS
APPLY-TAU-BOUNDERS
TAU-INTERVAL-EQUAL-DECIDER
TAU-INTERVAL-<-DECIDER
[GC for 279 SFUN pages..(T=10).GC finished]
[GC for 2277 CONS pages..(T=10).GC finished]
[GC for 2287 CONS pages..(T=12).GC finished]
[GC for 2297 CONS pages..(T=10).GC finished]
[GC for 279 SFUN pages..(T=10).GC finished]
(TAU-TERM TAU-TERM-LST
TAU-REWRITE RELIEVE-DEPENDENT-HYPS
OK-TO-FIRE-SIGNATURE-RULEP
APPLY-SIGNATURE-TAU-RULE
APPLY-SIGNATURE-TAU-RULES1 ...)
ANNOTATE-CLAUSE-WITH-KEY-NUMBERS
TAU-CLAUSE1P
[GC for 2307 CONS pages..(T=10).GC finished]
TAU-GET-ALL-PREDS
TAU-GET-STATS-NEW-MAX-BLOCK
TAU-SIZE
TAU-GET-STATS-ON-IMPLICANT-SIZES
[GC for 279 SFUN pages..(T=12).GC finished]
DECODE-RECOG
DECODE-RECOG-LST
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
DECODE-TAU1
DECODE-TAU
DECODE-TAU-CONJUNCTIVE-RULE
DECODE-TAU-CONJUNCTIVE-RULES
DECODE-TAU-LST
[GC for 279 SFUN pages..(T=12).GC finished]
DECODE-TAU-ALIST
DECODE-TAU-SIGNATURE-RULE
DECODE-TAU-SIGNATURE-RULES1
DECODE-TAU-SIGNATURE-RULES2
DECODE-TAU-SIGNATURE-RULES
[GC for 279 SFUN pages..(T=12).GC finished]
TAU-GET-ALL-SIG-FNS
SOME-SLOT-HAS-MULTIPLE-TAU-SIGS
COUNT-TAU-SIGS-BY-SLOT
COLLECT-RULES-WITH-DEPENDENT-HYPS
COLLECT-RULES-WITH-DEPENDENT-HYPS-ACROSS-MV
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-GET-STATS-ON-SIGNATURES1
TAU-GET-STATS-ON-SIGNATURES
COLLECT-TAU-BIG-SWITCHES
TAU-SUM-LST
[GC for 279 SFUN pages..(T=10).GC finished]
TAU-GET-STATS
TAU-STATUS
TAU-DATA-FN
TAU-DATA
ALL-FNNAMES-WORLD1
[GC for 279 SFUN pages..(T=10).GC finished]
ALL-FNNAMES-WORLD
TAU-DATA-FNS
TAU-DATABASE
INITIALIZE-TAU-GLOBALS
COLLECT-TAU-RELEVANT-TRIPLES
Finished loading "tau.lisp".
ACL2 loading "rewrite.lisp".
"ACL2"
[GC for 279 SFUN pages..(T=10).GC finished]
BADGED-FNS-OF-WORLD
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
T
EV-FNCALL+-W
EV-FNCALL+
[GC for 279 SFUN pages..(T=12).GC finished]
WEAK-CONGRUENCE-RULE-P
*GENEQV-IFF*
REFINEMENTP
GENEQV-REFINEMENTP1
GENEQV-REFINEMENTP
[GC for 279 SFUN pages..(T=10).GC finished]
SOME-CONGRUENCE-RULE-DISABLEDP
FILTER-GENEQV1
FILTER-GENEQV
SOME-GENEQV-DISABLEDP
FILTER-GENEQV-LST1
[GC for 279 SFUN pages..(T=10).GC finished]
FILTER-GENEQV-LST
REFINEMENTP1
PAIR-CONGRUENCE-RULES-WITH-COARSENINGS
ADD-TO-CR-AND-COARSENINGS
[GC for 279 SFUN pages..(T=10).GC finished]
UNION-GENEQV1
UNION-GENEQV
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
PAIRWISE-UNION-GENEQV
GENEQV-LST1
GENEQV-LST
(SUBST-EXPR1 SUBST-EXPR1-LST)
SUBST-EXPR-ERROR
SUBST-EXPR
[GC for 2307 CONS pages..(T=12).GC finished]
SCONS-TERM
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
(SUBST-EQUIV-EXPR1 SUBST-EQUIV-EXPR1-LST)
SUBST-EQUIV-EXPR
*ANONYMOUS-VAR*
(EQUAL-MOD-ALIST EQUAL-MOD-ALIST-LST)
(EQUAL-MOD-ALIST2 EQUAL-MOD-ALIST2-LST)
[GC for 2317 CONS pages..(T=12).GC finished]
(ONE-WAY-UNIFY1-TERM-ALIST ONE-WAY-UNIFY1-TERM-ALIST-LST)
WEAK-PEQUIV-P
WEAK-PEQUIV-PATTERN-P
[GC for 2317 CONS pages..(T=12).GC finished]
WEAK-PEQUIV-INFO-P
WEAK-PEQUIVS-PROPERTY-P
*EMPTY-PEQUIVS-PROPERTY*
PEQUIVS-PROPERTY-FIELD
NEXT-PEQUIV
NEXT-PEQUIVS
[GC for 2317 CONS pages..(T=10).GC finished]
NEXT-PEQUIVS-ALIST
EXTEND-PEQUIV-LST
ACCUMULATE-SHALLOW-PEQUIV-ALIST
PEQUIVS-FOR-REWRITE-ARGS
PEQUIV-INFO-FOR-REWRITE
REDUCE-GENEQV-FOR-EQUIV
[GC for 2327 CONS pages..(T=12).GC finished]
GENEQV-FOR-REWRITE
GENEQV-AND-PEQUIV-INFO-FOR-REWRITE
(FFNNAMESP FFNNAMESP-LST)
(COLLECT-FFNNAMES COLLECT-FFNNAMES-LST)
COMM-EQUAL
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
MEMBER-TERM2
MEMBER-COMPLEMENT-TERM2
MEMBER-COMPLEMENT-TERM1
(MEMBER-TERM MEMBER-COMPLEMENT-TERM)
INSTR-LISTP
SPLICED-INSTR-LISTP
[GC for 2327 CONS pages..(T=12).GC finished]
NEXT-TAG
IF-COMPILE-FORMAL
(FFNNAMEP-HIDE FFNNAMEP-HIDE-LST)
(IF-COMPILE IF-COMPILE-LST)
IF-INTERP-ASSUME-TRUE
IF-INTERP-SWITCH
[GC for 2337 CONS pages..(T=10).GC finished]
IF-INTERP-ASSUMED-VALUE0
IF-INTERP-ASSUMED-VALUE1
IF-INTERP-ASSUMED-VALUE2-EQUAL-CONSTANT
IF-INTERP-ASSUMED-VALUE2
IF-INTERP-ASSUMED-VALUE3
IF-INTERP-ASSUMED-VALUE4
IF-INTERP-ASSUMED-VALUE-X
[GC for 2337 CONS pages..(T=12).GC finished]
IF-INTERP-ASSUMED-VALUE
CONVERT-ASSUMPTIONS-TO-CLAUSE-SEGMENT
CONVERT-CLAUSE-TO-ASSUMPTIONS
SIMPLIFIABLE-MV-NTH1
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
SIMPLIFIABLE-MV-NTH
CALL-STACK
RET-STACK
EXTRA-INFO-LIT-P
SUBSETP-EQUAL-MOD-EXTRA-INFO-LITS
QUICK-AND-DIRTY-SUBSUMPTION-REPLACEMENT-STEP1
[GC for 2337 CONS pages..(T=12).GC finished]
QUICK-AND-DIRTY-SUBSUMPTION-REPLACEMENT-STEP
T
QUICK-AND-DIRTY-SRS-BUILTIN
:ATTACHMENTS-RECORDED
IF-INTERP-ADD-CLAUSE
IF-INTERP
[GC for 2337 CONS pages..(T=12).GC finished]
SPLICE-INSTRS1
SPLICE-INSTRS
STRIP-BRANCHES
MERGE-LENGTH
MERGE-SORT-LENGTH
MEMBER-EQUAL-+-
ARG1-ALMOST-SUBSUMES-ARG2
FIND-SUBSUMER-REPLACEMENT-REC
[GC for 289 SFUN pages..(T=12).GC finished]
FIND-SUBSUMER-REPLACEMENT
REMOVE-ONE-COMPLEMENT
WEAK-DISC-TREE
SWEEP-CLAUSES1
SWEEP-CLAUSES
FILTER-WITH-AND-WITHOUT
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=14).GC finished]
DISC-TREE
FIND-CLAUSES1
FIND-CLAUSES
REMOVE-ONE-+-
STORE-CLAUSE1
STORE-CLAUSE
SUBSTITUTE1-AC
SUBSTITUTE1
[GC for 2347 CONS pages..(T=10).GC finished]
REPLACE-CLAUSE1
REPLACE-CLAUSE
EXTRA-INFO-LITS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
MERGE-EXTRA-INFO-LITS
SUBSUMPTION-REPLACEMENT-LOOP
CLAUSIFY
FIND-REWRITING-EQUIVALENCE
[GC for 2357 CONS pages..(T=10).GC finished]
OBJ-TABLE
REWRITE-SOLIDIFY-REC
*REWRITE-EQUIV-SOLIDIFY-ITERATION-BOUND*
REWRITE-SOLIDIFY
[GC for 2357 CONS pages..(T=12).GC finished]
REWRITE-IF11
T
:ATTACHMENTS-RECORDED
REWRITE-IF1
MEMBER-EQUAL-MOD-ALIST
NOT-TO-BE-REWRITTENP1
NOT-TO-BE-REWRITTENP
[GC for 2357 CONS pages..(T=12).GC finished]
REWRITE-RECOGNIZER
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
REMOVE-INVISIBLE-FNCALLS
TERM-ORDER+
INVISIBLE-FNS
LOOP-STOPPERP-REC
LOOP-STOPPERP
[GC for 2357 CONS pages..(T=10).GC finished]
WEAK-REWRITE-RULE-P
RELEVANT-GROUND-LEMMAS
SEARCH-GROUND-UNITS1
SEARCH-GROUND-UNITS
IF-TAUTOLOGYP
(EXPAND-SOME-NON-REC-FNS EXPAND-SOME-NON-REC-FNS-LST)
[GC for 2367 CONS pages..(T=12).GC finished]
TAUTOLOGYP
MAKE-TRUE-LIST-CONS-NEST
BEING-OPENEDP-REC
BEING-OPENEDP
RECURSIVE-FN-ON-FNSTACKP
FNSTACK-TERM-MEMBER
(VAR-COUNTS1 VAR-COUNTS1-LST)
VAR-COUNTS
[GC for 289 SFUN pages..(T=12).GC finished]
(COUNT-IFS COUNT-IFS-LST)
TOO-MANY-IFS0
TOO-MANY-IFS-PRE-REWRITE
TOO-MANY-IFS-PRE-REWRITE-BUILTIN
:ATTACHMENTS-RECORDED
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
(OCCUR-CNT-BOUNDED OCCUR-CNT-BOUNDED-LST)
TOO-MANY-IFS1
TOO-MANY-IFS-POST-REWRITE
TOO-MANY-IFS-POST-REWRITE-BUILTIN
:ATTACHMENTS-RECORDED
ALL-ARGS-OCCUR-IN-TOP-CLAUSEP
[GC for 2367 CONS pages..(T=10).GC finished]
CONS-COUNT-BOUNDED-AC
CONS-COUNT-BOUNDED
(MAX-FORM-COUNT MAX-FORM-COUNT-LST)
CONTROLLER-COMPLEXITY1
CONTROLLER-COMPLEXITY
CONTROLLER-POCKET-SIMPLERP
CONSTANT-CONTROLLER-POCKETP1
[GC for 289 SFUN pages..(T=10).GC finished]
CONSTANT-CONTROLLER-POCKETP
SOME-CONTROLLER-POCKET-CONSTANT-AND-NON-CONTROLLER-SIMPLERP
(REWRITE-FNCALLP REWRITE-FNCALLP-LISTP)
(CONTAINS-REWRITABLE-CALLP CONTAINS-REWRITABLE-CALLP-LST)
WEAK-LINEAR-LEMMA-P
[GC for 289 SFUN pages..(T=12).GC finished]
WEAK-CURRENT-LITERAL-P
WEAK-REWRITE-CONSTANT-P
*DEFAULT-RW-CACHE-STATE*
*EMPTY-REWRITE-CONSTANT*
[GC for 2377 CONS pages..(T=10).GC finished]
WEAK-METAFUNCTION-CONTEXT-P
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
OK-TO-FORCE
PLIST-TO-ALIST
ADJUST-RDEPTH
ADD-REWRITE-ARGS
WEAK-STEP-LIMIT-RECORD-P
STEP-LIMIT-START
STEP-LIMIT-STRICTP
INITIAL-STEP-LIMIT
[GC for 289 SFUN pages..(T=12).GC finished]
STEP-LIMIT-ERROR1
STEP-LIMIT-ERROR
DECREMENT-STEP-LIMIT
REWRITE-ENTRY
*FAKE-RUNE-FOR-LINEAR*
WEAK-GFRAME-P
PUSH-GFRAME
INITIAL-GSTACK
TILDE-@-BKPTR-PHRASE
GET-RULE-FIELD
[GC for 2387 CONS pages..(T=10).GC finished]
CW-GFRAME
CW-GSTACK1
CW-GSTACK-FN
CW-GSTACK
[GC for 2397 CONS pages..(T=12).GC finished]
RESTORE-BRR-GLOBALS1
RESTORE-BRR-GLOBALS
SAVE-BRR-GLOBALS
GET-BRR-GLOBAL
EXIT-BRR-WORMHOLE
BRR-WORMHOLE
[GC for 2397 CONS pages..(T=10).GC finished]
INITIALIZE-BRR-STACK
LOOKUP-BRR-STACK
CLEAN-BRR-STACK1
CLEAN-BRR-STACK
GET-BRR-LOCAL
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
PUT-BRR-LOCAL1
PUT-BRR-LOCAL
PUT-BRR-LOCAL-LST
[GC for 348 SYMBOL pages..(T=10).GC finished]
SOME-CDR-EQUALP
PUSH-BRR-STACK-FRAME
POP-BRR-STACK-FRAME
DECODE-TYPE-ALIST
TRANSLATE-BREAK-CONDITION
EVAL-BREAK-CONDITION
*DEFAULT-FREE-VARS-DISPLAY-LIMIT*
SET-FREE-VARS-DISPLAY-LIMIT
[GC for 289 SFUN pages..(T=10).GC finished]
FREE-VARS-DISPLAY-LIMIT
[GC for 782 RELOCATABLE-BLOCKS pages..(T=10).GC finished]
(LIMIT-FAILURE-REASON LIMIT-FAILURE-REASON-ALIST)
(FIX-FREE-FAILURE-REASON FIX-FREE-FAILURE-REASON-ALIST)
ANCESTOR-BACKCHAIN-RUNE
WEAK-FORWARD-CHAINING-RULE-P
[GC for 2407 CONS pages..(T=12).GC finished]
WEAK-ELIM-RULE-P
WEAK-GENERALIZE-RULE-P
WEAK-INDUCTION-RULE-P
WEAK-BUILT-IN-CLAUSE-P
SCAN-TO-DEFPKG
[GC for 2417 CONS pages..(T=12).GC finished]
SCAN-TO-INCLUDE-BOOK
MULTIPLE-ASSOC-TERMINAL-SUBSTRINGP1
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
MULTIPLE-ASSOC-TERMINAL-SUBSTRINGP
POSSIBLY-ADD-LISP-EXTENSION
STUFF-STANDARD-OI
DEFUN-MODE-PROMPT-STRING
BRR-PROMPT
[GC for 2427 CONS pages..(T=10).GC finished]
TS<
ADD-TO-TYPE-ALIST-SEGMENTS
MERGE-TERM-ORDER
MERGE-SORT-TERM-ORDER
SORT-TYPE-ALIST-SEGMENTS
[GC for 289 SFUN pages..(T=12).GC finished]
TYPE-ALIST-SEGMENTS
PRINT-TERMS
PRINT-TYPE-ALIST-SEGMENTS
PRINT-TYPE-ALIST
SCAN-TO-EVENT
DECODE-LOGICAL-NAME
[GC for 289 SFUN pages..(T=12).GC finished]
ACCESS-X-RULE-RUNE
COLLECT-X-RULES-OF-RUNE
COLLECT-CONGRUENCE-RULES-OF-RUNE-IN-GENEQV-LST
COLLECT-CONGRUENCE-RULES-OF-RUNE
COLLECT-PEQUIVS-OF-RUNE
[GC for 289 SFUN pages..(T=10).GC finished]
FIND-RULES-OF-RUNE2
FIND-RULES-OF-RUNE1
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
WORLD-TO-NEXT-EVENT
ACTUAL-PROPS
FIND-RULES-OF-RUNE
BACKCHAIN-LIMIT-ENFORCERS
TILDE-*-ANCESTORS-STACK-MSG1
[GC for 289 SFUN pages..(T=12).GC finished]
TILDE-*-ANCESTORS-STACK-MSG
BRR-EVISC-TUPLE
SET-BRR-EVISC-TUPLE
MAYBE-INITIALIZE-BRR-EVISC-TUPLE
[GC for 2437 CONS pages..(T=12).GC finished]
SHOW-BRR-EVISC-TUPLE-FN
SHOW-BRR-EVISC-TUPLE
SHOW-ANCESTORS-STACK-MSG
TILDE-@-FAILURE-REASON-PHRASE1-BACKCHAIN-LIMIT
[GC for 289 SFUN pages..(T=12).GC finished]
(TILDE-@-FAILURE-REASON-FREE-PHRASE TILDE-@-FAILURE-REASON-PHRASE1)
TILDE-@-FAILURE-REASON-PHRASE
BRR-RESULT
*BRKPT1-ALIASES*
*BRKPT2-ALIASES*
[GC for 2447 CONS pages..(T=12).GC finished]
BRKPT1
[GC for 2457 CONS pages..(T=10).GC finished]
BRKPT2
WEAK-EXPAND-HINT-P
BINDS-TO-CONSTANTS-P
EXPAND-PERMISSION-RESULT1
[GC for 289 SFUN pages..(T=12).GC finished]
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
REMOVE1-BY-POSITION
EXPAND-PERMISSION-RESULT
EXPAND-PERMISSION-P
ONE-WAY-UNIFY-RESTRICTIONS1
ONE-WAY-UNIFY-RESTRICTIONS
EV-FNCALL!
[GC for 289 SFUN pages..(T=12).GC finished]
EV-FNCALL-META
GET-EVG
EV-SYNP
BAD-SYNP-ALIST1
[GC for 289 SFUN pages..(T=12).GC finished]
BAD-SYNP-ALIST1-LST
BIND-FREE-INFO
EVGS-OR-T
SEARCH-TYPE-ALIST+
ONCEP
ZERO-DEPTHP
RDEPTH-ERROR
[GC for 2467 CONS pages..(T=12).GC finished]
BAD-SYNP-HYP-MSG1
BAD-SYNP-HYP-MSG
SL-LET
REWRITE-ENTRY-EXTENDING-FAILURE
[GC for 289 SFUN pages..(T=12).GC finished]
SET-DIFFERENCE-ASSOC-EQ
EXTEND-UNIFY-SUBST
RELIEVE-HYP-SYNP
PUSH-LEMMA+
PUSH-SPLITTER?
PREPEND-STEP-LIMIT
WEAK-RW-CACHE-ENTRY-P
FREE-FAILURE-P
COMBINE-FREE-FAILURE-REASONS
[GC for 289 SFUN pages..(T=12).GC finished]
COMBINE-FREE-FAILURE-ALISTS
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
COMBINE-SORTED-RW-CACHE-LISTS1
SPLIT-PSORTED-LIST1
SPLIT-PSORTED-LIST
MERGE-LEXORDER-FAST
[GC for 289 SFUN pages..(T=12).GC finished]
MERGE-SORT-LEXORDER-FAST
SORT-RW-CACHE-LIST
COMBINE-RW-CACHE-LISTS
MERGE-RW-CACHES
SORTED-RW-CACHE-P
MERGE-SYMBOL-ALISTP
[GC for 289 SFUN pages..(T=12).GC finished]
MERGE-SORT-SYMBOL-ALISTP
CDR-SORT-RW-CACHE
COMBINE-RW-CACHES
UNIFY-SUBST-SUBSETP
RW-CACHE-LIST-LOOKUP
[GC for 289 SFUN pages..(T=12).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
T
RELIEVE-HYP-FAILURE-ENTRY-SKIP-P-BUILTIN
:ATTACHMENTS-RECORDED
RW-CACHE-ACTIVE-P
ASSOC-RW-CACHE
PUT-ASSOC-RW-CACHE1
[GC for 289 SFUN pages..(T=12).GC finished]
PUT-ASSOC-RW-CACHE
RELIEVE-HYP-FAILURE-ENTRY
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
MAYBE-EXTEND-TAG-TREE
ACCUMULATE-RW-CACHE1
ACCUMULATE-RW-CACHE
ACCUMULATE-RW-CACHE?
[GC for 289 SFUN pages..(T=12).GC finished]
(DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST)
RESTRICT-ALIST-TO-ALL-VARS1
[GC for 289 SFUN pages..(T=12).GC finished]
(ALL-VARS-BOUNDP ALL-VARS-LST-BOUNDP)
RESTRICT-ALIST-TO-ALL-VARS
PUSH-RW-CACHE-ENTRY
T
[GC for 289 SFUN pages..(T=12).GC finished]
T
RW-CACHE-DEBUG-BUILTIN
RW-CACHE-DEBUG-ACTION-BUILTIN
T
[GC for 289 SFUN pages..(T=10).GC finished]
RW-CACHEABLE-FAILURE-REASON-BUILTIN
:ATTACHMENTS-RECORDED
RW-CACHEABLE-NIL-TAG
NOTE-RELIEVE-HYP-FAILURE
[GC for 289 SFUN pages..(T=12).GC finished]
REPLACE-FREE-RW-CACHE-ENTRY1
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
REPLACE-FREE-RW-CACHE-ENTRY
RW-CACHE-ALIST-NIL-TAG-P
MERGE-FREE-FAILURE-REASONS-NIL-TAG
MERGE-FREE-FAILURE-ALISTS-NIL-TAG
NOTE-RW-CACHE-FREE-NIL-TAG
[GC for 2477 CONS pages..(T=12).GC finished]
NOTE-RELIEVE-HYPS-FAILURE-FREE
RW-CACHE-ENTER-CONTEXT
ERASE-RW-CACHE
[GC for 289 SFUN pages..(T=12).GC finished]
RW-CACHE-EXIT-CONTEXT
RESTORE-RW-CACHE-ANY-TAG
CONS-TAG-TREES-RW-CACHE
NORMALIZE-RW-ANY-CACHE
CONS-TAG-TREES-RW-CACHE-FIRST
[GC for 2487 CONS pages..(T=12).GC finished]
ALIST-KEYS-SUBSETP
TAG-TREE-TAGS-SUBSETP
RW-CACHE
RW-CACHED-FAILURE-PAIR
EXTEND-RW-CACHE-ALIST-FREE
RW-CACHE-ADD-FAILURE-REASON
ADD-LINEAR-LEMMA-FINISH
APPEND?
[GC for 2497 CONS pages..(T=12).GC finished]
MAKE-STACK-FROM-ALIST
COLLECT-BY-POSITION
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
MAKE-LAMBDA-APPLICATION
LAMBDA-NEST-HIDEP
LAMBDA-NEST-UNHIDE
MEMO-ACTIVEP
ACTIVATE-MEMO
INTERSECTION1-EQ
FORBIDDEN-FNS-IN-TERM
FORBIDDEN-FNS-IN-TERM-LIST
ALL-FNNAMES-LST-LST1
FORBIDDEN-FNS-IN-TERM-LIST-LIST
[GC for 2497 CONS pages..(T=12).GC finished]
FORBIDDEN-FNS
SKIP-META-TERMP-CHECKS-TABLE
SET-SKIP-META-TERMP-CHECKS!
SET-SKIP-META-TERMP-CHECKS
SKIP-META-TERMP-CHECKS
COLLECT-BAD-FN-ARITY-INFO
BAD-ARITIES-MSG
ALL-FFN-SYMBS
ALL-FFN-SYMBS-LST
WARRANT-NAME
APPLY$-RULE-NAME
[GC for 2507 CONS pages..(T=12).GC finished]
PUSH-WARRANTS
COMMENT-FN
COMMENT
T
:ATTACHMENTS-RECORDED
HIDE-WITH-COMMENT
[GC for 2507 CONS pages..(T=12).GC finished]
[GC for 2517 CONS pages..(T=12).GC finished]
[GC for 2527 CONS pages..(T=12).GC finished]
[GC for 2537 CONS pages..(T=10).GC finished]
[GC for 2547 CONS pages..(T=12).GC finished]
[GC for 2557 CONS pages..(T=12).GC finished]
[GC for 2567 CONS pages..(T=12).GC finished]
[GC for 2577 CONS pages..(T=12).GC finished]
[GC for 2587 CONS pages..(T=12).GC finished]
[GC for 2597 CONS pages..(T=12).GC finished]
[GC for 2607 CONS pages..(T=12).GC finished]
[GC for 2617 CONS pages..(T=10).GC finished]
[GC for 2627 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2637 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2647 CONS pages..(T=12).GC finished]
[GC for 2657 CONS pages..(T=12).GC finished]
[GC for 2657 CONS pages..(T=12).GC finished]
[GC for 2657 CONS pages..(T=12).GC finished]
[GC for 2667 CONS pages..(T=12).GC finished]
[GC for 2677 CONS pages..(T=14).GC finished]
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
[GC for 2687 CONS pages..(T=12).GC finished]
[GC for 2697 CONS pages..(T=12).GC finished]
[GC for 2697 CONS pages..(T=14).GC finished]
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
[GC for 2697 CONS pages..(T=12).GC finished]
[GC for 2707 CONS pages..(T=14).GC finished]
[GC for 2717 CONS pages..(T=12).GC finished]
[GC for 11264 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
[GC for 2727 CONS pages..(T=12).GC finished]
[GC for 2727 CONS pages..(T=14).GC finished]
[GC for 2727 CONS pages..(T=12).GC finished]
[GC for 2727 CONS pages..(T=14).GC finished]
[GC for 2727 CONS pages..(T=12).GC finished]
(REWRITE REWRITE-SOLIDIFY-PLUS REWRITE-IF
REWRITE-ARGS REWRITE-PRIMITIVE
REWRITE-EQUAL RELIEVE-HYP ...)
Finished loading "rewrite.lisp".
ACL2 loading "simplify.lisp".
"ACL2"
NEGATE-LIT
PEGATE-LIT
ADD-LITERAL
ADD-EACH-LITERAL
[GC for 2727 CONS pages..(T=12).GC finished]
(SUBSUMES-REC SUBSUMES1-EQUALITY-WITH-CONST SUBSUMES1)
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
(SUBSUMES!-REC SUBSUMES!1-EQUALITY-WITH-CONST
SUBSUMES!1)
*INIT-SUBSUMES-COUNT*
SUBSUMES
SOME-MEMBER-SUBSUMES
EQUAL-MOD-COMMUTING-LST
MEMBER-EQUAL-MOD-COMMUTING-LST
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
CONJOIN-CLAUSE-TO-CLAUSE-SET
ADD-EACH-LITERAL-LST
CONJOIN-CLAUSE-SETS
SOME-ELEMENT-MEMBER-COMPLEMENT-TERM
DISJOIN-CLAUSES1
DISJOIN-CLAUSES
DISJOIN-CLAUSE-SEGMENT-TO-CLAUSE-SET
SPLIT-ON-ASSUMPTIONS
REWRITE-CLAUSE-ACTION
[GC for 299 SFUN pages..(T=12).GC finished]
WEAK-FC-ACTIVATION-P
SUSPEND-FC-ACTIVATION
PRETTYIFY-FC-ACTIVATION
PRETTYIFY-FC-ACTIVATIONS
MAKE-FC-ACTIVATION
MAKE-FC-ACTIVATIONS
(COLLECT-TERMS-AND-ACTIVATIONS COLLECT-TERMS-AND-ACTIVATIONS-LST)
COLLECT-TERMS-AND-ACTIVATIONS-FROM-FCD-LST
[GC for 299 SFUN pages..(T=12).GC finished]
(SUBLIS-VARP SUBLIS-VAR-LSTP)
MULT-SEARCH-TYPE-ALIST
MULT-LOOKUP-HYP
(EV-RESPECTING-ENS EV-LST-RESPECTING-ENS)
ADD-FC-DERIVATIONS
[GC for 299 SFUN pages..(T=12).GC finished]
(PRETTYIFY-FC-DERIVATION PRETTYIFY-FC-DERIVATIONS)
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
(EXPUNGE-FC-DERIVATIONS EXPUNGE-FC-DERIVATIONS-LST
EXPUNGE-FC-DERIVATIONS-TYPE-ALIST
EXPUNGE-FC-DERIVATIONS-ASSUMPTIONS-LST
EXPUNGE-FC-DERIVATIONS-ASSUMPTIONS)
CURRENT-FC-CALL-NUMBER
CURRENT-FC-CALL-ALIST
PUT-CURRENT-FC-CALL-ALIST
INITIALIZE-FC-WORMHOLE-SITES
[GC for 299 SFUN pages..(T=12).GC finished]
SHOW-FC-CRITERIA
RESET-FC-REPORTING
TRANSLATE-FC-CRITERION
TRANSLATE-FC-CRITERIA
SET-FC-CRITERIA-FN
SET-FC-CRITERIA
SET-FC-REPORT-ON-THE-FLY
[GC for 299 SFUN pages..(T=12).GC finished]
NEW-FC-CALL
MEMBER-ONE-WAY-UNIFY1
SATISFYING-FC-ACTIVATION1P
SATISFYING-FC-ACTIVATIONP
COLLECT-SATISFYING-FC-ACTIVATIONS
SATISFYING-VIRTUAL-FC-ACTIVATION1P
SATISFYING-VIRTUAL-FC-ACTIVATIONP
[GC for 299 SFUN pages..(T=12).GC finished]
SATISFYING-FC-DERIVATION1P
SATISFYING-FC-DERIVATIONP
COLLECT-SATISFYING-FC-DERIVATIONS
FILTER-SATISFYING-VIRTUAL-FC-ACTIVATION
FILTER-ALL-SATISFYING-FC-DERIVATIONS
[GC for 299 SFUN pages..(T=12).GC finished]
FILTER-SATISFYING-FC-ACTIVATIONS
FILTER-REDUNDANT-APPROVED-FC-DERIVATION
[GC for 358 SYMBOL pages..(T=12).GC finished]
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
COLLECT-RUNE-TRIGGER-PAIRS-FROM-FC-ACTIVATIONS
COLLECT-RUNE-TRIGGER-PAIRS-FROM-FC-DERIVATIONS
PRETTYIFY-SUBST
COLLECT-FC-STATUS-SITE-1
COLLECT-FC-STATUS-SITES-2-3-5
PRETTYIFY-BLOCKED-FC-INST-HYP
COLLECT-FC-STATUS-SITE-4
COLLECT-FC-STATUS
[GC for 299 SFUN pages..(T=12).GC finished]
MAKE-FC-ACTIVITY-REPORT1
MAKE-FC-ACTIVITY-REPORT
FC-REPORT1
FC-REPORT
[GC for 299 SFUN pages..(T=12).GC finished]
FC-EXIT
(ADVANCE-FC-ACTIVATION1 ADVANCE-FC-ACTIVATION2
ADVANCE-FC-ACTIVATION3)
ADVANCE-FC-ACTIVATION
[GC for 299 SFUN pages..(T=12).GC finished]
ADVANCE-FC-ACTIVATIONS
FC-PAIR-LST
FC-PAIR-LST-TYPE-ALIST
FCD-RUNEP
FCD-RUNEP-LST
FCD-WORSE-THAN-OR-EQUAL
FCD-WORSE-THAN-OR-EQUAL-LST
EXISTS-FCD-WORSE-THAN-OR-EQUAL
ALL-DUMB-OCCUR-LST
[GC for 299 SFUN pages..(T=12).GC finished]
ALL-ARGS-OCCUR-AFTER-STRIP-NOT
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
APPROVED-FC-DERIVATIONP
APPROVE-FC-DERIVATIONS
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
(MAX-LEVEL-NO MAX-LEVEL-NO-LST GET-LEVEL-NO)
(SORT-FCDS1-RATING1 SORT-FCDS1-RATING1-LST)
SORT-FCDS1-RATING
SORT-FCDS1
SORT-FCDS
[GC for 299 SFUN pages..(T=12).GC finished]
STRIP-FCD-CONCLS
TYPE-ALIST-FCD-LST
EVERY-CONCL-MEMBER-EQUALP
COLLECT-DISJUNCTS
COLLECT-DISJUNCTION-TRIPLES
EXPLOIT-DISJUNCTION-TRIPLE
[GC for 299 SFUN pages..(T=12).GC finished]
EXPLOIT-DISJUNCTION-TRIPLES1
EXPLOIT-DISJUNCTION-TRIPLES
PROCESS-DISJUNCTION-TRIPLES
CONCLS-FROM-FCDS
MAKE-TYPE-ALIST
STRIP-TTREES-FROM-TYPE-ALIST
CW-ROUND-BY-ROUND-FN
CW-ROUND-BY-ROUND
FORWARD-CHAIN1
FORWARD-CHAIN-TOP
[GC for 299 SFUN pages..(T=12).GC finished]
FORWARD-CHAIN
SELECT-FORWARD-CHAINED-CONCLS-AND-TTREES
REWRITE-CLAUSE-TYPE-ALIST
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
(FOCCURRENCES FOCCURRENCES-LST)
(MAXIMAL-MULTIPLE MAXIMAL-MULTIPLE-LST)
MAXIMAL-MULTIPLES1
MAXIMAL-MULTIPLES
MUTUALLY-EXCLUSIVE-TESTS
MUTUALLY-EXCLUSIVE-SUBSUMPTIONP
[GC for 299 SFUN pages..(T=12).GC finished]
(CLEANUP-IF-EXPR CLEANUP-IF-EXPR-LST)
ALL-TYPE-REASONING-TAGS-P1
ALL-TYPE-REASONING-TAGS-P
TRY-CLAUSE
*TRIVIAL-NON-NIL-TTREE*
MAKE-NON-NIL-TTREE
[GC for 299 SFUN pages..(T=12).GC finished]
TRY-TYPE-SET-AND-CLAUSE
(LAMBDA-SUBTERMP LAMBDA-SUBTERMP-LST)
REWRITE-ATM
[GC for 299 SFUN pages..(T=14).GC finished]
(EVERY-OCCURRENCE-EQUIV-HITTABLEP1 EVERY-OCCURRENCE-EQUIV-HITTABLEP1-LISTP)
EVERY-OCCURRENCE-EQUIV-HITTABLEP
EVERY-OCCURRENCE-EQUIV-HITTABLEP-IN-CLAUSEP
(SOME-OCCURRENCE-EQUIV-HITTABLEP1 SOME-OCCURRENCE-EQUIV-HITTABLEP1-LISTP)
SOME-OCCURRENCE-EQUIV-HITTABLEP
EQUIV-HITTABLE-IN-SOME-OTHER-LIT
[GC for 299 SFUN pages..(T=14).GC finished]
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=16).GC finished]
FIND-TRIVIAL-EQUIVALENCE1
FIND-TRIVIAL-EQUIVALENCE
ADD-LITERAL-AND-PT1
ADD-LITERAL-AND-PT
ADD-BINDING-TO-TAG-TREE
SUBST-EQUIV-AND-MAYBE-DELETE-LIT
T
:ATTACHMENTS-RECORDED
[GC for 299 SFUN pages..(T=12).GC finished]
REMOVE-TRIVIAL-EQUIVALENCES-REC
REMOVE-TRIVIAL-EQUIVALENCES
*INITIAL-BUILT-IN-CLAUSES*
BUILT-IN-CLAUSEP2
BUILT-IN-CLAUSEP1
POSSIBLE-TRIVIAL-CLAUSE-P
TRIVIAL-CLAUSE-P
[GC for 299 SFUN pages..(T=12).GC finished]
BUILT-IN-CLAUSEP
CRUNCH-CLAUSE-SEGMENTS1
CRUNCH-CLAUSE-SEGMENTS2
CRUNCH-CLAUSE-SEGMENTS
STRIP-NON-REWRITTENP-ASSUMPTIONS1
STRIP-NON-REWRITTENP-ASSUMPTIONS
[GC for 299 SFUN pages..(T=12).GC finished]
ASSUMNOTE-LIST-TO-TOKEN-LIST
RESUME-SUSPENDED-ASSUMPTION-REWRITING1
RESUME-SUSPENDED-ASSUMPTION-REWRITING
HELPFUL-LITTLE-ECNT-MSG
[GC for 299 SFUN pages..(T=14).GC finished]
(REWRITE-CLAUSE REWRITE-CLAUSE-LST)
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
SETUP-SIMPLIFY-CLAUSE-POT-LST1
SETUP-SIMPLIFY-CLAUSE-POT-LST
SEQUENTIAL-SUBST-VAR-TERM
PROCESS-EQUATIONAL-POLYS
ENUMERATE-ELEMENTS
ALREADY-USED-BY-FERTILIZE-CLAUSEP
[GC for 299 SFUN pages..(T=12).GC finished]
UNHIDDEN-LIT-INFO
TILDE-@-HYP-PHRASE
SIMPLIFY-CLAUSE1
SOME-ELEMENT-DUMB-OCCUR-LST
WEAK-PROVE-SPEC-VAR-P
[GC for 299 SFUN pages..(T=12).GC finished]
WEAK-GAG-INFO-P
WEAK-GAG-STATE-P
*INITIAL-GAG-STATE*
*EMPTY-PROVE-SPEC-VAR*
CONTROLLER-UNIFY-SUBST2
CONTROLLER-UNIFY-SUBST1
CONTROLLER-UNIFY-SUBST
[GC for 299 SFUN pages..(T=14).GC finished]
FILTER-DISABLED-EXPAND-TERMS
FOUND-HIT-REWRITE-HIST-ENTRY
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
SIMPLIFY-CLAUSE
SETTLED-DOWN-CLAUSE
MEMBER-CLASS-NAME-RUNES
EXTRACT-AND-CLASSIFY-LEMMAS2
EXTRACT-AND-CLASSIFY-LEMMAS1
[GC for 299 SFUN pages..(T=14).GC finished]
RUNES-TO-CLASS-ALIST1
STRICT-MERGE-SYMBOL-<
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
STRICT-MERGE-SORT-SYMBOL-<
SORT-SYMBOL-LISTP
SET-RULER-EXTENDERS
STRICT-MERGE-SORT-SYMBOL-<-CDRS
RUNES-TO-CLASS-ALIST
EXTRACT-AND-CLASSIFY-LEMMAS
[GC for 299 SFUN pages..(T=14).GC finished]
TILDE-*-CONJUNCTION-OF-POSSIBLY-FORCED-NAMES-PHRASE1
TILDE-*-CONJUNCTION-OF-POSSIBLY-FORCED-NAMES-PHRASE
*FAKE-RUNE-FOR-CERT-DATA*
*FAKE-RUNE-ALIST*
MERGE-RUNES
MERGE-SORT-RUNES
[GC for 299 SFUN pages..(T=12).GC finished]
TILDE-*-SIMP-PHRASE1
TILDE-*-RAW-SIMP-PHRASE1
RECOVER-FORCED-RUNES1
RECOVER-FORCED-RUNES
[GC for 299 SFUN pages..(T=12).GC finished]
TILDE-*-RAW-SIMP-PHRASE
TILDE-*-SIMP-PHRASE
TILDE-@-POOL-NAME-PHRASE
TILDE-@-POOL-NAME-PHRASE-LST
[GC for 299 SFUN pages..(T=14).GC finished]
TILDE-@-CLAUSE-ID-PHRASE
WEAK-BDDNOTE-P
TILDE-@-BDDNOTE-PHRASE
PARSE-NATURAL1
[GC for 299 SFUN pages..(T=14).GC finished]
PARSE-NATURAL
PARSE-DOTTED-NATURALS
PARSE-MATCH
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
PARSE-PRIMES
PARSE-CLAUSE-ID2
PARSE-CLAUSE-ID1
PARSE-CLAUSE-ID
[GC for 299 SFUN pages..(T=12).GC finished]
TILDE-@-CASE-SPLIT-LIMITATIONS-PHRASE
[GC for 299 SFUN pages..(T=12).GC finished]
SIMPLIFY-CLAUSE-MSG1
SETTLED-DOWN-CLAUSE-MSG1
Finished loading "simplify.lisp".
ACL2 loading "bdd.lisp".
"ACL2"
MVF
LOGANDF
LOGXORF
LOGIORF
ASHF
MX-ID-BOUND
1+MX-ID
BDD-ERROR
UNIQUE-ID
TST
CST-BOOLP
TBR
FBR
LEAFP
TRM
BDD-CONSTRUCTORS
MAKE-LEAF-CST
EVG-FN-SYMB
BDD-CONSTRUCTOR-TRM-P
EVG-TYPE
MAKE-IF-CST
*CST-T*
*CST-NIL*
CST=
CST-TP
CST-NILP
CST-VARP
CST-NONNILP
[GC for 309 SFUN pages..(T=14).GC finished]
BOOL-MASK1
BOOLEAN-TERM-VAR
BOOLEAN-HYPS-VARS
FIRST-BOOLEAN-TYPE-PRESCRIPTION
RECOGNIZER-RUNE
BOOL-MASK
COMMUTATIVE-P1
FIND-EQUIVALENCE-RUNE
EQUIVALENCE-RUNE1
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
EQUIVALENCE-RUNE
COMMUTATIVE-P
OP-ALIST
OP-ALIST-INFO
IF-OP-CODE
HASH-SIZE
IF-HASH-INDEX
OP-HASH-INDEX1
OP-HASH-INDEX
OP-HASH-INDEX-2
OP-HASH-INDEX-IF
IF-SEARCH-BUCKET
CST=-LST
EQ-OP
OP-SEARCH-BUCKET
OP-SEARCH-BUCKET-2
[GC for 309 SFUN pages..(T=12).GC finished]
OP-SEARCH-BUCKET-IF
CHK-MEMO
CHK-MEMO-2
CHK-MEMO-IF
HALF-HASH-SIZE
FOURTH-HASH-SIZE
OP-HASH-INDEX-STRING
OP-HASH-INDEX-EVG
OP-SEARCH-BUCKET-QUOTE
CHK-MEMO-QUOTEP
[GC for 2727 CONS pages..(T=12).GC finished]
BDD-QUOTEP
BDD-QUOTEP+
WEAK-BDD-RULE-P
REWRITE-RULE-TO-BDD-RULE
BDD-RULES-ALIST1
EXTRA-RULES-FOR-BDDS
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
BDD-RULES-ALIST
ONE-WAY-UNIFY1-CST-2
ONE-WAY-UNIFY1-CST-3
[GC for 2727 CONS pages..(T=12).GC finished]
(ONE-WAY-UNIFY1-CST ONE-WAY-UNIFY1-CST-LST
ONE-WAY-UNIFY1-CST-EQUAL)
SOME-ONE-WAY-UNIFY-CST-LST
LEAF-CST-LIST
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
(DECODE-CST DECODE-CST-LST)
DECODE-CST-ALIST1
DECODE-CST-ALIST
LEAF-CST-LIST-ARRAY
*SOME-NON-NIL-VALUE*
FALSIFYING-ASSIGNMENT1
FALSIFYING-ASSIGNMENT
MAKE-IF
[GC for 2727 CONS pages..(T=12).GC finished]
MAKE-IF-NO-MEMO
SPLIT-VAR
MIN-VAR
COMBINE-OP-CSTS1
BOOL-FLG
SOME-BDD-CONSTRUCTORP
COMBINE-OP-CSTS-SIMPLE
BDD-MV-LET
COMBINE-IF-CSTS+
COMBINE-IF-CSTS1
[GC for 2727 CONS pages..(T=12).GC finished]
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
COMBINE-IF-CSTS
CST-LIST-TO-EVG-LIST
CST-QUOTE-LISTP
WEAK-BDDSPV-P
BDD-EV-FNCALL
COMBINE-OP-CSTS+
MAKE-IF-FOR-OP
[GC for 2727 CONS pages..(T=14).GC finished]
[GC for 2727 CONS pages..(T=12).GC finished]
(COMBINE-OP-CSTS COMBINE-OP-CSTS-COMM
COMBINE-OP-CSTS-GUTS
BDD BDD-ALIST BDD-LIST)
[GC for 2727 CONS pages..(T=12).GC finished]
IF-HT-MAX-LENGTH
OP-HT-MAX-LENGTH
LEAF-CST-LIST-TO-ALIST
BDD-TOP
GET-BOOL-VARS
[GC for 2727 CONS pages..(T=12).GC finished]
BDD-CLAUSE1
EXPAND-AND-OR-SIMPLE+
EXPAND-AND-OR-SIMPLE
EXPAND-CLAUSE
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
BDD-CLAUSE
Finished loading "bdd.lisp".
ACL2 loading "other-processes.lisp".
"ACL2"
STRIP-FINAL-DIGITS1
STRIP-FINAL-DIGITS
*VAR-FAMILIES-BY-TYPE*
ASSOC-TS-SUBSETP
FIRST-NON-MEMBER-EQ
ABBREVIATE-HYPHENATED-STRING1
ABBREVIATE-HYPHENATED-STRING
[GC for 309 SFUN pages..(T=14).GC finished]
GENERATE-VARIABLE-ROOT1
GENERATE-VARIABLE-ROOT
GENERATE-VARIABLE
GENERATE-VARIABLE-LST
OCCURS-NOWHERE-ELSE
FIRST-NOMINATION
SECOND-NOMINATION
SOME-HYP-PROBABLY-NILP
(SUBLIS-EXPR SUBLIS-EXPR-LST)
[GC for 309 SFUN pages..(T=14).GC finished]
NOMINATE-DESTRUCTOR-CANDIDATE
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
(NOMINATE-DESTRUCTOR-CANDIDATES NOMINATE-DESTRUCTOR-CANDIDATES-LST)
SUM-LEVEL-NOS
PICK-HIGHEST-SUM-LEVEL-NOS
SELECT-INSTANTIATED-ELIM-RULE
TYPE-RESTRICTION-SEGMENT
(SUBTERM-ONE-WAY-UNIFY SUBTERM-ONE-WAY-UNIFY-LST)
APPLY-GENERALIZE-RULE
GENERALIZE-RULE-SEGMENT1
[GC for 309 SFUN pages..(T=14).GC finished]
GENERALIZE-RULE-SEGMENT
GENERALIZE1
APPLY-INSTANTIATED-ELIM-RULE
ELIMINATE-DESTRUCTORS-CLAUSE1
OWNED-VARS
ENS-FROM-PSPV
[GC for 368 SYMBOL pages..(T=12).GC finished]
ELIMINATE-DESTRUCTORS-CLAUSE
PRETTYIFY-CLAUSE1
PRETTYIFY-CLAUSE2
PRETTYIFY-CLAUSE
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
PRETTYIFY-CLAUSE-LST
PRETTYIFY-CLAUSE-SET
TILDE-*-ELIM-PHRASE/ALIST1
TILDE-*-ELIM-PHRASE/ALIST
TILDE-*-ELIM-PHRASE3
TILDE-*-ELIM-PHRASE2
TILDE-*-ELIM-PHRASE1
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
TILDE-*-ELIM-PHRASE
TILDE-*-UNTRANSLATE-LST-PHRASE
ELIMINATE-DESTRUCTORS-CLAUSE-MSG1
(ALMOST-QUOTEP1 ALMOST-QUOTEP1-LISTP)
ALMOST-QUOTEP
DESTRUCTOR-APPLIED-TO-VARSP
DUMB-OCCUR-LST-EXCEPT
[GC for 309 SFUN pages..(T=14).GC finished]
FERTILIZE-FEASIBLE
(FERTILIZE-COMPLEXITY MAXIMIZE-FERTILIZE-COMPLEXITY)
FIRST-FERTILIZE-LIT
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
CROSS-FERTILIZEP/C
CROSS-FERTILIZEP/D
CROSS-FERTILIZEP
DELETE-FROM-TTREE
FERTILIZE-CLAUSE1
[GC for 2727 CONS pages..(T=12).GC finished]
FERTILIZE-CLAUSE
FERTILIZE-CLAUSE-MSG1
COLLECTABLE-FNP
(SMALLEST-COMMON-SUBTERMS1 SMALLEST-COMMON-SUBTERMS1-LST)
DUMB-FN-COUNT-1
DUMB-FN-COUNT
SMALLEST-COMMON-SUBTERMS
[GC for 309 SFUN pages..(T=12).GC finished]
GENERALIZING-RELATIONP
GENERALIZABLE-TERMS-ACROSS-RELATIONS
GENERALIZABLE-TERMS-ACROSS-LITERALS1
GENERALIZABLE-TERMS-ACROSS-LITERALS
GENERALIZABLE-TERMS
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
GENERALIZE-CLAUSE
TILDE-*-GEN-PHRASE/ALIST1
TILDE-*-GEN-PHRASE/ALIST
TILDE-*-GEN-PHRASE
GENERALIZE-CLAUSE-MSG1
Finished loading "other-processes.lisp".
ACL2 loading "induct.lisp".
"ACL2"
SELECT-X-CL-SET
[GC for 309 SFUN pages..(T=14).GC finished]
UNCHANGEABLES
CHANGEABLES
SOUND-INDUCTION-PRINCIPLE-MASK1
SOUND-INDUCTION-PRINCIPLE-MASK
WEAK-CANDIDATE-P
COUNT-NON-NILS
[GC for 2727 CONS pages..(T=14).GC finished]
CONTROLLERS
CHANGED/UNCHANGED-VARS
WEAK-TESTS-AND-ALISTS-P
TESTS-AND-ALISTS/ALIST
TESTS-AND-ALISTS/ALISTS
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
WEAK-TESTS-AND-CALLS-P
WEAK-JUSTIFICATION-P
TESTS-AND-ALISTS
TESTS-AND-ALISTS-LST
FLESH-OUT-INDUCTION-PRINCIPLE
INTRINSIC-SUGGESTED-INDUCTION-CAND
[GC for 2727 CONS pages..(T=12).GC finished]
(APPLY-INDUCTION-RULE SUGGESTED-INDUCTION-CANDS1
SUGGESTED-INDUCTION-CANDS)
(GET-INDUCTION-CANDS GET-INDUCTION-CANDS-LST)
GET-INDUCTION-CANDS-FROM-CL-SET1
[GC for 309 SFUN pages..(T=12).GC finished]
GET-INDUCTION-CANDS-FROM-CL-SET
(PIGEON-HOLEP-APPLY PIGEON-HOLEP PIGEON-HOLEP1)
[GC for 2737 CONS pages..(T=14).GC finished]
FLUSH-CAND1-DOWN-CAND2
FLUSH-CANDIDATES
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
ALISTS-AGREEP
IRRECONCILABLE-ALISTSP
AFFINITY
MEMBER-AFFINITY
OCCUR-AFFINITY
SOME-OCCUR-AFFINITY
ALL-OCCUR-AFFINITY
[GC for 309 SFUN pages..(T=14).GC finished]
CONTAINS-AFFINITY
ANTAGONISTIC-TESTS-AND-ALISTS-LSTP
ANTAGONISTIC-TESTS-AND-ALISTS-LSTSP
EVERY-ALIST1-MATEDP
MERGE-ALIST1-INTO-ALIST2
MERGE-ALIST1-LST-INTO-ALIST2
MERGE-LST1-INTO-ALIST2
[GC for 309 SFUN pages..(T=12).GC finished]
MERGE-LST1-INTO-ALIST2-LST
MERGE-LST1-INTO-LST2
MERGE-TESTS-AND-ALISTS-LSTS
[GC for 2747 CONS pages..(T=14).GC finished]
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
MERGE-CAND1-INTO-CAND2
MERGE-CANDIDATES
CONTROLLER-VARIABLES1
CONTROLLER-VARIABLES
[GC for 309 SFUN pages..(T=12).GC finished]
INDUCT-VARS1
INDUCT-VARS
VETOEDP
COMPUTE-VETOES1
COMPUTE-VETOES2
COMPUTE-VETOES
[GC for 309 SFUN pages..(T=14).GC finished]
INDUCTION-COMPLEXITY1
MAXIMAL-ELEMENTS-APPLY
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
MAXIMAL-ELEMENTS1
MAXIMAL-ELEMENTS
INTERSECTP-EQ/UNION-EQUAL
EQUAL/UNION-EQUAL
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
SUBSETP-EQUAL/SMALLER
M&M-APPLY
COUNT-OFF
M&M-SEARCH
M&M1
M&M
CONS-SUBSET-TREE
CAR-SUBSET-TREE
[GC for 309 SFUN pages..(T=12).GC finished]
CDR-SUBSET-TREE
OR-SUBSET-TREES
M&M-OVER-POWERSET1
M&M-OVER-POWERSET
ALL-PICKS2
ALL-PICKS2R
ALL-PICKS1
ALL-PICKS
[GC for 309 SFUN pages..(T=14).GC finished]
DUMB-NEGATE-LIT-LST-LST
INDUCTION-HYP-CLAUSE-SEGMENTS2
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
INDUCTION-HYP-CLAUSE-SEGMENTS1
INDUCTION-HYP-CLAUSE-SEGMENTS
INDUCTION-FORMULA3
INDUCTION-FORMULA2
INDUCTION-FORMULA1
INDUCTION-FORMULA
[GC for 309 SFUN pages..(T=14).GC finished]
ALL-PICKS-SIZE
INDUCTION-FORMULA-SIZE1
INDUCTION-FORMULA-SIZE
*MAXIMUM-INDUCT-SIZE*
TERMIFY-CLAUSE-SET
INFORM-SIMPLIFY3
INFORM-SIMPLIFY2
INFORM-SIMPLIFY1
[GC for 309 SFUN pages..(T=14).GC finished]
INFORM-SIMPLIFY
ALL-VARS1-LST-LST
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
GEN-NEW-NAME1
GEN-NEW-NAME
UNMEASURED-VARIABLES3
UNMEASURED-VARIABLES2
UNMEASURED-VARIABLES1
UNMEASURED-VARIABLES
[GC for 309 SFUN pages..(T=12).GC finished]
TILDE-@-WELL-FOUNDED-RELATION-PHRASE
MEASURED-VARIABLES
[GC for 2757 CONS pages..(T=12).GC finished]
INDUCT-MSG/CONTINUE
(REC-FNNAMES REC-FNNAMES-LST)
INDUCT-MSG/LOSE
[GC for 2767 CONS pages..(T=12).GC finished]
LOAD-HINT-SETTINGS-INTO-RCNST
UPDATE-HINT-SETTINGS
LOAD-HINT-SETTINGS-INTO-PSPV
[GC for 2767 CONS pages..(T=14).GC finished]
RESTORE-HINT-SETTINGS-IN-PSPV
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
REMOVE-TRIVIAL-CLAUSES
REMOVE-ADJACENT-DUPLICATES-EQ
[GC for 2767 CONS pages..(T=14).GC finished]
INDUCT
PAIR-VARS-WITH-LITS
[GC for 309 SFUN pages..(T=14).GC finished]
(FFNNAMES-SUBSETP FFNNAMES-SUBSETP-LISTP)
PROBABLY-NOT-VALIDP
IRRELEVANT-LITS
ELIMINATE-IRRELEVANCE-CLAUSE
ELIMINATE-IRRELEVANCE-CLAUSE-MSG1
Finished loading "induct.lisp".
[GC for 309 SFUN pages..(T=12).GC finished]
ACL2 loading "proof-builder-pkg.lisp".
"ACL2"
"ACL2-PC"
Finished loading "proof-builder-pkg.lisp".
ACL2 loading "doc.lisp".
"ACL2"
[GC for 11520 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=12).GC finished]
[GC for 309 SFUN pages..(T=14).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
*ACL2-SYSTEM-DOCUMENTATION*
Finished loading "doc.lisp".
ACL2 loading "history-management.lisp".
"ACL2"
[GC for 319 SFUN pages..(T=12).GC finished]
WEAK-GOAL-TREE-P
START-PROOF-TREE-FN
START-PROOF-TREE
CHECKPOINT-FORCED-GOALS
STOP-PROOF-TREE-FN
STOP-PROOF-TREE
(INSERT-INTO-GOAL-TREE-REC INSERT-INTO-GOAL-TREE-LST)
INSERT-INTO-GOAL-TREE
SET-DIFFERENCE-EQUAL-CHANGEDP
[GC for 2777 CONS pages..(T=14).GC finished]
(PRUNE-GOAL-TREE PRUNE-GOAL-TREE-LST)
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
PRUNE-PROOF-TREE
PRINT-STRING-REPEAT
*FORMAT-PROC-ALIST*
FORMAT-FORCED-SUBGOALS
FORMAT-PROCESSOR
[GC for 2787 CONS pages..(T=14).GC finished]
(FORMAT-GOAL-TREE-LST FORMAT-GOAL-TREE)
FORMAT-PROOF-TREE
PRINT-PROOF-TREE1
*PROOF-FAILURE-STRING*
PRINT-PROOF-TREE-CTX
*PROOF-TREE-START-DELIMITER*
*PROOF-TREE-END-DELIMITER*
[GC for 2787 CONS pages..(T=14).GC finished]
PRINT-PROOF-TREE-FINISH
PRINT-PROOF-TREE
(DECORATE-FORCED-GOALS-1 DECORATE-FORCED-GOALS-1-LST)
DECORATE-FORCED-GOALS
DECORATE-FORCED-GOALS-IN-PROOF-TREE
ASSUMNOTE-LIST-TO-CLAUSE-ID-LIST
ASSUMNOTE-LIST-LIST-TO-CLAUSE-ID-LIST-LIST
[GC for 319 SFUN pages..(T=14).GC finished]
EXTEND-PROOF-TREE-FOR-FORCING-ROUND
INITIALIZE-PROOF-TREE1
INITIALIZE-PROOF-TREE
*STAR-1-CLAUSE-ID*
[GC for 2787 CONS pages..(T=14).GC finished]
(REVERT-GOAL-TREE-REC REVERT-GOAL-TREE-LST)
REVERT-GOAL-TREE
WEAK-POOL-ELEMENT-P
POOL-LST1
POOL-LST
[GC for 2787 CONS pages..(T=14).GC finished]
INCREMENT-PROOF-TREE
GOAL-TREE-WITH-CL-ID
(GOAL-TREE-CHOOSE-DISJUNCT-REC GOAL-TREE-CHOOSE-DISJUNCT-LST)
GOAL-TREE-CHOOSE-DISJUNCT
INSTALL-DISJUNCT-INTO-PROOF-TREE
LOGICAL-NAMEP
[GC for 319 SFUN pages..(T=14).GC finished]
LOGICAL-NAME-TYPE-STRING
SCAN-TO-COMMAND
UPDATE-WORLD-INDEX
STORE-ABSOLUTE-EVENT-NUMBER
THE-NAMEX-SYMBOL-CLASS1
THE-NAMEX-SYMBOL-CLASS
ADD-EVENT-LANDMARK
ER-DECODE-LOGICAL-NAME
[GC for 319 SFUN pages..(T=14).GC finished]
RENEW-LEMMAS
RENEW-NAME/ERASE
RENEW-NAME/OVERWRITE
RENEW-NAME
RENEW-NAMES
COLLECT-REDEFINED
SCRUNCH-EQ
[GC for 319 SFUN pages..(T=14).GC finished]
PRINT-REDEFINITION-WARNING
CLEAR-EVENT-DATA
GET-EVENT-DATA
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
PUT-EVENT-DATA
LAST-PROVER-STEPS
INITIALIZE-SUMMARY-ACCUMULATORS
PRINT-WARNINGS-SUMMARY
SKIP-PROOF-TREE-TIME
[GC for 2797 CONS pages..(T=14).GC finished]
PRINT-TIME-SUMMARY
PROVER-STEPS
[GC for 2807 CONS pages..(T=14).GC finished]
PRINT-STEPS-SUMMARY
*GAG-PREFIX*
*GAG-SUFFIX*
GAG-START-MSG
PRINT-GAG-INFO
SET-CHECKPOINT-SUMMARY-LIMIT-FN
SET-CHECKPOINT-SUMMARY-LIMIT
CHECKPOINT-SUMMARY-LIMIT
PRINT-GAG-STACK-REV
REVERSE-GAG-STACK
[GC for 319 SFUN pages..(T=14).GC finished]
PRINT-GAG-STATE-ABORT-STACK-MSG
PRINT-GAG-STATE1
ERASE-GAG-STATE
PRINT-GAG-STATE
TILDE-@P
[GC for 2807 CONS pages..(T=14).GC finished]
PRINT-FAILURE1
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
PRINT-FAILURE
T
T
LMI-SEED
LMI-TECHS
[GC for 319 SFUN pages..(T=14).GC finished]
LMI-SEED-LST
LMI-TECHS-LST
LMI-SEEDS-INFO
PRINT-RUNES-SUMMARY
USE-NAMES-IN-TTREE
BY-NAMES-IN-TTREE
[GC for 2807 CONS pages..(T=12).GC finished]
WEAK-CLAUSE-PROCESSOR-HINT-P
COLLECT-NON-HINT-EVENTS
HINT-EVENTS-SYMBOLS
GET-SUMMARY-DATA
CL-PROC-DATA-IN-TTREE-1
CL-PROC-DATA-IN-TTREE
HINT-EVENT-NAMES-IN-TTREE
[GC for 2817 CONS pages..(T=14).GC finished]
PRINT-HINT-EVENTS-SUMMARY
PRINT-SPLITTER-RULES-SUMMARY-1
PRINT-SPLITTER-RULES-SUMMARY
[GC for 2817 CONS pages..(T=12).GC finished]
PRINT-RULES-AND-HINT-EVENTS-SUMMARY
MODIFIED-SYSTEM-ATTACHMENT
MODIFIED-SYSTEM-ATTACHMENTS-1
MODIFIED-SYSTEM-ATTACHMENTS
ALIST-TO-DOUBLETS
[GC for 2817 CONS pages..(T=14).GC finished]
PRINT-SYSTEM-ATTACHMENTS-SUMMARY
[GC for 2827 CONS pages..(T=12).GC finished]
PRINT-SUMMARY
WITH-PROVER-STEP-LIMIT-FN
WITH-PROVER-STEP-LIMIT
WITH-PROVER-STEP-LIMIT!
WEAK-PROVED-FUNCTIONAL-INSTANCES-ALIST-ENTRY-P
SUPPLY-NAME-FOR-PROVED-FUNCTIONAL-INSTANCES-ALIST-ENTRY
[GC for 319 SFUN pages..(T=14).GC finished]
PROVED-FUNCTIONAL-INSTANCES-FROM-TAGGED-OBJECTS
ADD-COMMAND-LANDMARK
FIND-LONGEST-COMMON-RETRACTION1
FIND-LONGEST-COMMON-RETRACTION1-EVENT
FIND-LONGEST-COMMON-RETRACTION
INSTALL-GLOBAL-ENABLED-STRUCTURE
[GC for 319 SFUN pages..(T=12).GC finished]
SET-W
SET-W!
SAVE-EVENT-STATE-GLOBALS
*PROTECTED-SYSTEM-STATE-GLOBALS*
STATE-GLOBAL-BINDINGS
PROTECT-SYSTEM-STATE-GLOBALS
FORMAL-VALUE-TRIPLE
TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
[GC for 2827 CONS pages..(T=14).GC finished]
[GC for 2837 CONS pages..(T=12).GC finished]
[GC for 2847 CONS pages..(T=12).GC finished]
[GC for 2847 CONS pages..(T=14).GC finished]
[GC for 2857 CONS pages..(T=14).GC finished]
[GC for 378 SYMBOL pages..(T=14).GC finished]
[GC for 68 STRUCTURE pages..(T=14).GC finished]
[GC for 137 ARRAY pages..(T=14).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
[GC for 2867 CONS pages..(T=14).GC finished]
[GC for 2877 CONS pages..(T=14).GC finished]
[GC for 2887 CONS pages..(T=14).GC finished]
[GC for 2897 CONS pages..(T=14).GC finished]
[GC for 2907 CONS pages..(T=14).GC finished]
XTRANS-EVAL
XTRANS-EVAL-STATE-FN-ATTACHMENT
WITH-CTX-SUMMARIZED
REVERT-WORLD-ON-ERROR
CHK-THEORY-EXPR-VALUE1
CHK-THEORY-EXPR-VALUE
THEORY-FN-TRANSLATED-CALLP
[GC for 2917 CONS pages..(T=12).GC finished]
EVAL-THEORY-EXPR
APPEND-STRIP-CARS
APPEND-STRIP-CDRS
NO-RUNE-BASED-ON
REVAPPEND-DELETE-RUNES-BASED-ON-SYMBOLS1
[GC for 319 SFUN pages..(T=14).GC finished]
REVAPPEND-DELETE-RUNES-BASED-ON-SYMBOLS
CURRENT-THEORY1
FIRST-N-AC-REV
LONGEST-COMMON-TAIL-LENGTH-REC
LONGEST-COMMON-TAIL-LENGTH
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
EXTEND-CURRENT-THEORY
UPDATE-CURRENT-THEORY
PUT-CLTL-COMMAND
STRIP-NON-NIL-BASE-SYMBOLS
INSTALL-PROOF-SUPPORTERS
UPDATE-W
[GC for 319 SFUN pages..(T=14).GC finished]
INSTALL-EVENT
STOP-REDUNDANT-EVENT-FN
STOP-REDUNDANT-EVENT
WEAK-COMMAND-NUMBER-BASELINE-INFO-P
ABSOLUTE-TO-RELATIVE-COMMAND-NUMBER
[GC for 319 SFUN pages..(T=14).GC finished]
RELATIVE-TO-ABSOLUTE-COMMAND-NUMBER
NORMALIZE-ABSOLUTE-COMMAND-NUMBER
TREE-OCCUR
CD-FORM-MATCHP
CD-SOME-EVENT-MATCHP
CD-SEARCH
[GC for 319 SFUN pages..(T=12).GC finished]
SUPERIOR-COMMAND-WORLD
ER-DECODE-CD
WEAK-LDD-STATUS-P
MAKE-LDD-FLAGS
MAKE-LDD
[GC for 319 SFUN pages..(T=14).GC finished]
ACCESS-LDD-CLASS
ACCESS-LDD-MARKP
ACCESS-LDD-STATUS
ACCESS-LDD-FULLP
ACCESS-LDD-N
ACCESS-LDD-FORM
[GC for 319 SFUN pages..(T=14).GC finished]
BIG-D-LITTLE-D-NAME1
BIG-D-LITTLE-D-NAME
BIG-D-LITTLE-D-CLIQUE1
BIG-D-LITTLE-D-CLIQUE
BIG-D-LITTLE-D-EVENT
[GC for 319 SFUN pages..(T=14).GC finished]
BIG-D-LITTLE-D-COMMAND-BLOCK
BIG-M-LITTLE-M-NAME
BIG-M-LITTLE-M-CLIQUE1
BIG-M-LITTLE-M-CLIQUE
BIG-M-LITTLE-M-EVENT
[GC for 319 SFUN pages..(T=14).GC finished]
BIG-M-LITTLE-M-COMMAND-BLOCK
SYMBOL-CLASS-CHAR
DEFUN-MODE-STRING
BIG-C-LITTLE-C-EVENT
BIG-C-LITTLE-C-COMMAND-BLOCK
[GC for 319 SFUN pages..(T=14).GC finished]
PRINT-LDD-FULL-OR-SKETCH/MUTUAL-RECURSION
PRINT-LDD-FULL-OR-SKETCH/ENCAPSULATE
NORMALIZE-CHAR
NORMALIZE-STRING1
NORMALIZE-STRING
STRING-MATCHP
[GC for 319 SFUN pages..(T=12).GC finished]
PRINT-LDD-FULL-OR-SKETCH
WITH-BASE-10
PRINT-LDD-FORMULA-COLUMN
PRINT-LDD
[GC for 319 SFUN pages..(T=14).GC finished]
PRINT-LDDS
MAKE-COMMAND-LDD
EXTEND-PE-TABLE
PE-EVENT-FORM
MAKE-EVENT-LDD
[GC for 319 SFUN pages..(T=12).GC finished]
MAKE-LDDS-COMMAND-SEQUENCE
MAKE-LDDS-COMMAND-BLOCK1
MAKE-LDDS-COMMAND-BLOCK
ENS-MAYBE-BRR
PCB-PCB!-FN
[GC for 319 SFUN pages..(T=14).GC finished]
PCB!-FN
PCB-FN
PCB!
PC-FN
PC
[GC for 319 SFUN pages..(T=14).GC finished]
PCS-FN
PCS
GET-COMMAND-SEQUENCE-FN1
GET-COMMAND-SEQUENCE-FN
GET-COMMAND-SEQUENCE
GCS
PBT
PCB
PRINT-INDENTED-LIST-MSG
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
PRINT-INDENTED-LIST
STRING-PREFIXP-1
STRING-PREFIXP
RELATIVIZE-BOOK-PATH
[GC for 319 SFUN pages..(T=14).GC finished]
RELATIVIZE-BOOK-PATH-LST
PRINT-BOOK-PATH
PE-FN1
PE-FN2
[GC for 319 SFUN pages..(T=14).GC finished]
PE-FN-MAIN
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
PE-FN
PE
PE!
GTHM
TTHM
COMMAND-BLOCK-NAMES1
COMMAND-BLOCK-NAMES
SYMBOL-NAME-LST
[GC for 319 SFUN pages..(T=14).GC finished]
ACL2-QUERY-SIMULATE-INTERACTION
ACL2-QUERY1
ACL2-QUERY
[GC for 319 SFUN pages..(T=12).GC finished]
COLLECT-NAMES-IN-DEFUN-MODES
UBT-UBU-QUERY
UBT?
UBT
UBT!
UBU?
UBU
UBU!
U
CHK-VIRGIN-MSG
CHK-VIRGIN
CHK-BOOT-STRAP-REDEFINEABLE-NAMEP
MAYBE-COERCE-OVERWRITE-TO-ERASE
[GC for 2917 CONS pages..(T=14).GC finished]
REDEFINITION-RENEWAL-MODE
REDEFINED-NAMES1
REDEFINED-NAMES
CHK-REDEFINEABLE-NAMEP
CHK-JUST-NEW-NAME
NO-NEW-NAMESP
CHK-JUST-NEW-NAMES-REC
[GC for 329 SFUN pages..(T=14).GC finished]
CHK-JUST-NEW-NAMES
ALPHA-<
MERGE-ALPHA-<
MERGE-SORT-ALPHA-<
PUTPROP-UNLESS
REDEFINED-WARNING
REDUNDANT-LABELP
MAKE-CTX-FOR-EVENT
DEFLABEL-FN
DEGREE-OF-MATCH2
DEGREE-OF-MATCH1
DEGREE-OF-MATCH
[GC for 329 SFUN pages..(T=14).GC finished]
FIND-LIKELY-NEAR-MISSES
PRINT-DOC-DWIM
DOC-FN
DOC
HELP
TRANS-FN
TRANS!-FN
TRANS
TRANS!
TRANS1-FN
TRANS1
TRANSLAM
TILDE-*-PROPS-FN-PHRASE1
TILDE-*-PROPS-FN-PHRASE
[GC for 2917 CONS pages..(T=14).GC finished]
PROPS-FN
PROPS
WALKABOUT-NTH
WALKABOUT-IP
WALKABOUT-HUH
WALKABOUT1
WALKABOUT
WALKABOUT=-FN
WALKABOUT=
LOOKUP-BDDNOTE
[GC for 2917 CONS pages..(T=14).GC finished]
UPDATE-BDDNOTE-WITH-TERM
SHOW-BDD
SHOW-BDD-GOAL
MERGE-CAR-TERM-ORDER
MERGE-SORT-CAR-TERM-ORDER
FALSIFYING-PAIR-P
BOGUS-FALSIFYING-ASSIGNMENT-VAR
SHOW-FALSIFYING-ASSIGNMENT
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
SHOW-BDD-TERM
TILDE-*-SUBSTITUTION-PHRASE1
TILDE-*-SUBSTITUTION-PHRASE
SHOW-BDD-BACKTRACE
SHOW-BDD-FN
GET-DOCS
GET-GUARDSP
*NO-MEASURE*
GET-MEASURES1
[GC for 2917 CONS pages..(T=14).GC finished]
GET-MEASURES2
GET-MEASURES
*NO-RULER-EXTENDERS*
*BASIC-RULER-EXTENDERS*
*BASIC-RULER-EXTENDERS-PLUS-LAMBDAS*
GET-RULER-EXTENDERS1
GET-RULER-EXTENDERS2
DEFAULT-RULER-EXTENDERS-FROM-TABLE
DEFAULT-RULER-EXTENDERS
GET-RULER-EXTENDERS-LST
GET-HINTS1
GET-HINTS
GET-GUARD-HINTS1
[GC for 329 SFUN pages..(T=14).GC finished]
GET-GUARD-HINTS
GET-NORMALIZEP
GET-NORMALIZEPS
CHK-XARGS-KEYWORDS1
CHK-XARGS-KEYWORDS
GET-NAMES
GET-BODIES
(FIND-NONTRIVIAL-RULERS FIND-NONTRIVIAL-RULERS-LST)
[GC for 329 SFUN pages..(T=14).GC finished]
TILDE-@-FREE-VARS-PHRASE
CHK-FREE-VARS
CHK-DECLARED-IGNORES
CHK-FREE-AND-IGNORED-VARS
[GC for 2917 CONS pages..(T=14).GC finished]
CHK-FREE-AND-IGNORED-VARS-LSTS
PUTPROP-X-LST1
PUTPROP-X-LST2
PUTPROP-X-LST2-UNLESS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
TRANSLATE-TERM-LST
FIND-NAMED-LEMMA
FIND-RUNED-LEMMA
(FREE-VARSP-MEMBER FREE-VARSP-MEMBER-LST)
[GC for 2917 CONS pages..(T=14).GC finished]
TRANSLATE-EXPAND-TERM1
TRANSLATE-EXPAND-TERM
TRANSLATE-EXPAND-HINT1
TRANSLATE-EXPAND-HINT
CONS-ALL-TO-LST
[GC for 2927 CONS pages..(T=12).GC finished]
TRANSLATE-SUBSTITUTION
TRANSLATE-SUBSTITUTION-LST
GET-REWRITE-AND-DEFN-RUNES-FROM-RUNIC-MAPPING-PAIRS
TRANSLATE-RESTRICT-HINT
*DO-NOT-PROCESSES*
COERCE-TO-PROCESS-NAME-LST
COERCE-TO-ACL2-PACKAGE-LST
CHK-DO-NOT-EXPR-VALUE
TRANSLATE-DO-NOT-HINT
[GC for 2927 CONS pages..(T=14).GC finished]
TRANSLATE-DO-NOT-INDUCT-HINT
TRANSLATE-HANDS-OFF-HINT1
TRANSLATE-HANDS-OFF-HINT
TRUNCATED-CLASS
TESTS-AND-ALISTS-LST-FROM-FN
COROLLARY
[GC for 2927 CONS pages..(T=14).GC finished]
FORMULA
PF-INDUCTION-SCHEME
PF-FN
PF
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=18).GC finished]
MERGE-SYMBOL-<
MERGE-SORT-SYMBOL-<
*NON-INSTANTIABLE-PRIMITIVES*
INSTANTIABLEP
CONSTRAINT-INFO
CHK-EQUAL-ARITIES
EXTEND-SORTED-SYMBOL-ALIST
TRANSLATE-FUNCTIONAL-SUBSTITUTION
[GC for 2927 CONS pages..(T=14).GC finished]
(SUBLIS-FN-REC SUBLIS-FN-REC-LST)
SUBLIS-FN
SUBLIS-FN-SIMPLE
SUBLIS-FN-LST-SIMPLE
(INSTANTIABLE-FFN-SYMBS INSTANTIABLE-FFN-SYMBS-LST)
UNKNOWN-CONSTRAINTS-P
[GC for 2927 CONS pages..(T=14).GC finished]
UNKNOWN-CONSTRAINTS-SUPPORTERS
COLLECT-INSTANTIABLEP1
ALL-INSTANTIABLEP
COLLECT-INSTANTIABLEP
IMMEDIATE-INSTANTIABLE-ANCESTORS
INSTANTIABLE-ANCESTORS
(HITP HITP-LST)
[GC for 329 SFUN pages..(T=14).GC finished]
EVENT-RESPONSIBLE-FOR-PROVED-CONSTRAINT
GETPROP-X-LST
FILTER-HITPS
RELEVANT-CONSTRAINTS1
RELEVANT-CONSTRAINTS1-AXIOMS
RELEVANT-CONSTRAINTS
[GC for 2927 CONS pages..(T=14).GC finished]
(BOUND-VARS BOUND-VARS-LST)
TRANSLATE-LMI/INSTANCE-FIX-ALIST
TRANSLATE-LMI/INSTANCE
FN-SUBST-FREE-VARS
FN-SUBST-RENAMING-ALIST
REMOVE-CAPTURE-IN-CONSTRAINT-LST
[GC for 2937 CONS pages..(T=14).GC finished]
TRANSLATE-LMI/FUNCTIONAL-INSTANCE
WEAK-TESTS-AND-CALL-P
(ALL-CALLS ALL-CALLS-LST)
ALL-CALLS-ALIST
TERMINATION-MACHINE1
(FFNNAMESP-EQ FFNNAMESP-EQ-LST)
[GC for 329 SFUN pages..(T=14).GC finished]
MEMBER-EQ-ALL
*EQUALITY-ALIASES*
TERM-EQUATED-TO-CONSTANT
TERM-EQUATED-TO-CONSTANT-IN-TERMLIST
SIMPLIFY-TESTS
ADD-TEST-SMART
(CHOKE-ON-LOOP$-RECURSION1 CHOKE-ON-LOOP$-RECURSION1-LST)
CHOKE-ON-LOOP$-RECURSION
[GC for 329 SFUN pages..(T=14).GC finished]
(ALL-LOOP$-SCION-QUOTE-LAMBDAS ALL-LOOP$-SCION-QUOTE-LAMBDAS-LST)
(TERMINATION-MACHINE-REC TERMINATION-MACHINE-REC-FOR-LIST)
TERMINATION-MACHINE
TERMINATION-MACHINES
[GC for 2937 CONS pages..(T=14).GC finished]
MAYBE-ADD-EXTRA-INFO-LIT
MEASURE-CLAUSE-FOR-BRANCH
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
SPLIT-INITIAL-EXTRA-INFO-LITS
CONJOIN-CLAUSE-TO-CLAUSE-SET-EXTRA-INFO1
CONJOIN-CLAUSE-TO-CLAUSE-SET-EXTRA-INFO
MEASURE-CLAUSES-FOR-FN1
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
MEASURE-CLAUSES-FOR-FN
CONJOIN-CLAUSE-SETS-EXTRA-INFO
CONJOIN-CLAUSE-SETS+
MEASURE-CLAUSES-FOR-CLIQUE
TERMINATION-THEOREM-CLAUSES
MEASURE-ALIST?
RULER-EXTENDERS-LST
GET-UNNORMALIZED-BODIES
[GC for 329 SFUN pages..(T=14).GC finished]
TERMINATION-THEOREM
EVAL-GROUND-SUBEXPRESSIONS1-LST-LST
EVAL-GROUND-SUBEXPRESSIONS-LST-LST
SUBLIS-VAR-LST-LST
ADD-SEGMENTS-TO-CLAUSE
SIMPLIFY-CLAUSE-FOR-TERM-EQUAL-CONST-1
SIMPLIFY-CLAUSE-FOR-TERM-EQUAL-CONST
[GC for 329 SFUN pages..(T=14).GC finished]
ADD-LITERAL-SMART
(ALL-VARS!1 ALL-VARS!1-LST)
ALL-VARS!-OF-FN
RECOVER-TYPE-SPEC-EXPRS1
RECOVER-TYPE-SPEC-EXPRS
[GC for 2947 CONS pages..(T=14).GC finished]
TERMS-IN-VAR
TYPE-SPECS-FOR-VAR
RECOVER-FANCY-TARGETS
RECOVER-DEEP-TARGETS
VARS-SPECS-AND-TARGETS1
VARS-SPECS-AND-TARGETS
[GC for 2957 CONS pages..(T=14).GC finished]
SPECIAL-LOOP$-GUARD-CLAUSES-C2
SPECIAL-LOOP$-GUARD-CLAUSES-C1
SPECIAL-LOOP$-GUARD-CLAUSES-C
SPECIAL-LOOP$-SCION-CALLP
WARRANT-NAME-INVERSE
WARRANTP
[GC for 329 SFUN pages..(T=14).GC finished]
(COLLECT-WARRANTED-FNS COLLECT-WARRANTED-FNS-LST)
COLLECT-NEGATED-WARRANTS1
COLLECT-NEGATED-WARRANTS
SPECIAL-LOOP$-GUARD-CLAUSES
[GC for 2957 CONS pages..(T=14).GC finished]
(GUARD-CLAUSES GUARD-CLAUSES-LST)
GUARD-CLAUSES+
GUARD-CLAUSES-FOR-BODY
NORMALIZE-TS-BACKCHAIN-LIMIT-FOR-DEFS
GUARD-CLAUSES-FOR-FN1
GUARD-CLAUSES-FOR-FN1-LST
COLLECT-WELL-FORMED-LAMBDA-OBJECTS
[GC for 329 SFUN pages..(T=14).GC finished]
COLLECT-WELL-FORMED-LAMBDA-OBJECTS-LST
GUARD-CLAUSES-FOR-FN
GUARD-CLAUSES-FOR-CLIQUE
REMOVE-BUILT-IN-CLAUSES
LENGTH-EXCEEDSP
*HALF-LENGTH-INITIAL-BUILT-IN-CLAUSES*
CLEAN-UP-CLAUSE-SET
GUARD-THEOREM
[GC for 329 SFUN pages..(T=14).GC finished]
GUARD-OR-TERMINATION-THEOREM-MSG
GUARD-MSG-TABLE
GUARD-MSG-TABLE
TERMINATION-THEOREM-FN-SUBST2
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
TERMINATION-THEOREM-FN-SUBST1
TERMINATION-THEOREM-FN-SUBST
[GC for 2967 CONS pages..(T=14).GC finished]
TRANSLATE-LMI
TRANSLATE-USE-HINT1
TRANSLATE-USE-HINT
CONVERT-NAME-TREE-TO-NEW-NAME1
CONVERT-NAME-TREE-TO-NEW-NAME
[GC for 329 SFUN pages..(T=14).GC finished]
TRANSLATE-BY-HINT
TRANSLATE-CASES-HINT
[GC for 388 SYMBOL pages..(T=14).GC finished]
TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
TRANSLATE-NO-OP-HINT
TRANSLATE-ERROR-HINT
TRANSLATE-INDUCT-HINT
*BUILT-IN-EXECUTABLE-COUNTERPARTS*
*S-PROP-THEORY*
NEW-DISABLES
SOME-NEW-DISABLES-1
[GC for 329 SFUN pages..(T=14).GC finished]
SOME-NEW-DISABLES
SOME-NEW-ENABLES-1
SOME-NEW-ENABLES
TRANSLATE-IN-THEORY-HINT
NON-FUNCTION-SYMBOLS
COLLECT-NON-LOGIC-MODE
[GC for 2977 CONS pages..(T=14).GC finished]
TRANSLATE-BDD-HINT1
TRANSLATE-BDD-HINT
TRANSLATE-NONLINEARP-HINT
TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
TRANSLATE-NO-THANKS-HINT
[GC for 329 SFUN pages..(T=14).GC finished]
TRANSLATE-REORDER-HINT
ARITY-MISMATCH-MSG
MACRO-MINIMAL-ARITY1
MACRO-MINIMAL-ARITY
TRANSLATE-CLAUSE-PROCESSOR-HINT/SYMBOL-TO-CALL
[GC for 12544 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
TRANSLATE-CLAUSE-PROCESSOR-HINT
TRANSLATE-CUSTOM-KEYWORD-HINT
CUSTOM-KEYWORD-HINT
REMOVE-ALL-NO-OPS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
REMOVE-REDUNDANT-NO-OPS
FIND-FIRST-CUSTOM-KEYWORD-HINT
*CUSTOM-KEYWORD-MAX-ITERATIONS*
CUSTOM-KEYWORD-HINT-INTERPRETER1
CUSTOM-KEYWORD-HINT-INTERPRETER
CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
[GC for 329 SFUN pages..(T=14).GC finished]
PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
MAKE-DISJUNCTIVE-CLAUSE-ID
MAKE-DISJUNCTIVE-GOAL-SPEC
MINIMALLY-WELL-FORMED-OR-HINTP
SPLIT-KEYWORD-ALIST
DISTRIBUTE-OTHER-HINTS-INTO-OR1
[GC for 329 SFUN pages..(T=14).GC finished]
DISTRIBUTE-OTHER-HINTS-INTO-OR
*HINT-EXPRESSION-BASIC-VARS*
*HINT-EXPRESSION-OVERRIDE-VARS*
*HINT-EXPRESSION-BACKTRACK-VARS*
*HINT-EXPRESSION-ALL-VARS*
TRANSLATE-HINT-EXPRESSION
TRANSLATE-BACKTRACK-HINT
TRANSLATE-RW-CACHE-STATE-HINT
[GC for 2987 CONS pages..(T=14).GC finished]
[GC for 2997 CONS pages..(T=16).GC finished]
(TRANSLATE-OR-HINT TRANSLATE-HINT-SETTINGS
TRANSLATE-X-HINT-VALUE
REPLACE-GOAL-SPEC-IN-NAME-TREE1
REPLACE-GOAL-SPEC-IN-NAME-TREE
TRANSLATE-HINT)
[GC for 329 SFUN pages..(T=14).GC finished]
TRANSLATE-HINT-EXPRESSIONS
CHECK-TRANSLATED-OVERRIDE-HINT
TRANSLATE-HINTS1
WARN-ON-DUPLICATE-HINT-GOAL-SPECS
[GC for 329 SFUN pages..(T=16).GC finished]
TRANSLATE-HINTS2
OVERRIDE-HINTS
TRANSLATE-HINTS
TRANSLATE-HINTS+1
TRANSLATE-HINTS+
[GC for 329 SFUN pages..(T=16).GC finished]
TRANSLATE-OVERRIDE-HINTS
APPLY-OVERRIDE-HINT1
APPLY-OVERRIDE-HINT
APPLY-OVERRIDE-HINTS
[GC for 2997 CONS pages..(T=14).GC finished]
EVAL-AND-TRANSLATE-HINT-EXPRESSION
TTAGS-SEEN
WEAK-CERTIFY-BOOK-INFO-P
ACTIVE-BOOK-NAME
WEAK-DEFERRED-TTAG-NOTE-P
[GC for 329 SFUN pages..(T=14).GC finished]
FMS-TO-STANDARD-CO
PRINT-TTAG-NOTE
SHOW-TTAG-NOTES1
[GC for 329 SFUN pages..(T=14).GC finished]
SHOW-TTAG-NOTES-FN
SHOW-TTAG-NOTES
SET-DEFERRED-TTAG-NOTES
TTAGS-FROM-DEFERRED-TTAG-NOTES1
TTAGS-FROM-DEFERRED-TTAG-NOTES
[GC for 329 SFUN pages..(T=14).GC finished]
PRINT-DEFERRED-TTAG-NOTES-SUMMARY
NOTIFY-ON-DEFTTAG
TTAG-ALLOWED-P
CHK-ACCEPTABLE-TTAG1
[GC for 329 SFUN pages..(T=14).GC finished]
CHK-ACCEPTABLE-TTAG
CHK-ACCEPTABLE-TTAGS2
CHK-ACCEPTABLE-TTAGS1
CHK-ACCEPTABLE-TTAGS
CHK-TABLE-NIL-ARGS
[GC for 329 SFUN pages..(T=16).GC finished]
CHK-TABLE-GUARD
CHK-TABLE-GUARDS-REC
CHK-TABLE-GUARDS
PUT-ASSOC-EQUAL-FAST
[GC for 329 SFUN pages..(T=14).GC finished]
GLOBAL-SET?
WEAK-ABSSTOBJ-INFO-P
TABLE-CLTL-CMD
[GC for 3007 CONS pages..(T=14).GC finished]
[GC for 3017 CONS pages..(T=14).GC finished]
[GC for 3027 CONS pages..(T=16).GC finished]
[GC for 3037 CONS pages..(T=14).GC finished]
TABLE-FN1
[GC for 329 SFUN pages..(T=14).GC finished]
TABLE-FN
SET-OVERRIDE-HINTS-FN
Finished loading "history-management.lisp".
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=20).GC finished]
ACL2 loading "prove.lisp".
"ACL2"
(ABBREVIATIONP1 ABBREVIATIONP1-LST)
ABBREVIATIONP
(ALL-VARS-BAG ALL-VARS-BAG-LST)
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
FIND-ABBREVIATION-LEMMA
[GC for 3047 CONS pages..(T=16).GC finished]
(EXPAND-ABBREVIATIONS-WITH-LEMMA EXPAND-ABBREVIATIONS
EXPAND-ABBREVIATIONS-LST)
AND-ORP
FIND-AND-OR-LEMMA
[GC for 3047 CONS pages..(T=14).GC finished]
EXPAND-AND-OR
CLAUSIFY-INPUT1
CLAUSIFY-INPUT1-LST
CLAUSIFY-INPUT
EXPAND-SOME-NON-REC-FNS-IN-CLAUSES
NO-OP-HISTP
(EXPAND-ANY-FINAL-IMPLIES1 EXPAND-ANY-FINAL-IMPLIES1-LST)
EXPAND-ANY-FINAL-IMPLIES
[GC for 3047 CONS pages..(T=14).GC finished]
RW-CACHE-STATE
MAKE-RCNST
CHEAP-TYPE-ALIST-AND-POT-LST
*TAU-TTREE*
TAU-CLAUSEP
TAU-CLAUSEP-LST-REC
TAU-CLAUSEP-LST
PRETTYIFY-CLAUSE-SIMPLE
PREPROCESS-CLAUSE
TILDE-*-PREPROCESS-PHRASE
[GC for 3047 CONS pages..(T=14).GC finished]
TILDE-*-RAW-PREPROCESS-PHRASE
PREPROCESS-CLAUSE-MSG1
MORE-THAN-SIMPLIFIEDP
REMOVE1-ASSOC-EQ-LST
DELETE-ASSUMPTIONS-1
DELETE-ASSUMPTIONS
INDUCTION-DEPTH-LIMIT
[GC for 3047 CONS pages..(T=14).GC finished]
PUSH-CLAUSE
PUSH-CLAUSE-MSG1-ABORT
PUSH-CLAUSE-MSG1
CLAUSE-SET-SUBSUMES-1
CLAUSE-SET-SUBSUMES
PREPROCESS-CLAUSE?
[GC for 3047 CONS pages..(T=14).GC finished]
APPLY-USE-HINT-CLAUSES
APPLY-CASES-HINT-CLAUSE
NON-TERM-LISTP-MSG
NON-TERM-LIST-LISTP-MSG
ALL-FFN-SYMBS-LST-LST
TILDE-@-UNKNOWN-NAMES-PHRASE
TILDE-@-ILLEGAL-HINT-EVENTS-PHRASE
COLLECT-NON-RUNES-FROM-SUMMARY-DATA
TILDE-@-ILLEGAL-SUMMARY-DATA-PHRASE
[GC for 3047 CONS pages..(T=16).GC finished]
[GC for 3047 CONS pages..(T=14).GC finished]
[GC for 3057 CONS pages..(T=14).GC finished]
[GC for 3057 CONS pages..(T=14).GC finished]
[GC for 3057 CONS pages..(T=14).GC finished]
[GC for 3057 CONS pages..(T=14).GC finished]
[GC for 3057 CONS pages..(T=16).GC finished]
[GC for 3067 CONS pages..(T=14).GC finished]
[GC for 3067 CONS pages..(T=14).GC finished]
[GC for 147 ARRAY pages..(T=16).GC finished]
[GC for 3077 CONS pages..(T=16).GC finished]
[GC for 3087 CONS pages..(T=14).GC finished]
[GC for 3097 CONS pages..(T=14).GC finished]
[GC for 3107 CONS pages..(T=14).GC finished]
[GC for 3117 CONS pages..(T=16).GC finished]
EVAL-CLAUSE-PROCESSOR
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
APPLY-TOP-HINTS-CLAUSE1
APPLY-TOP-HINTS-CLAUSE
TILDE-@-LMI-PHRASE
OR-HIT-MSG
APPLY-TOP-HINTS-CLAUSE-MSG1
[GC for 339 SFUN pages..(T=14).GC finished]
PREVIOUS-PROCESS-WAS-SPECIOUSP
*PREPROCESS-CLAUSE-LEDGE*
INITIALIZE-PSPV-FOR-GAG-MODE
WATERFALL-UPDATE-GAG-STATE
RECORD-GAG-STATE
[GC for 3117 CONS pages..(T=14).GC finished]
GAG-STATE-EXITING-CL-ID
REMOVE-POOL-LST-FROM-GAG-STATE
POP-CLAUSE-UPDATE-GAG-STATE-POP
GAG-MODE-JPPL-FLG
SPLITTER-OUTPUT
SET-SPLITTER-OUTPUT
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
WATERFALL-MSG1
IO?-PROVE-CW
WATERFALL-PRINT-CLAUSE-BODY
WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
WATERFALL-PRINT-CLAUSE-ID
PRINT-CLAUSE-ID-OKP
PRINT-CLAUSE-ID-OKP-BUILTIN
:ATTACHMENTS-RECORDED
WATERFALL-PRINT-CLAUSE
WATERFALL-MSG
[GC for 339 SFUN pages..(T=14).GC finished]
PUT-TTREE-INTO-PSPV
SET-CL-IDS-OF-ASSUMPTIONS1
SET-CL-IDS-OF-ASSUMPTIONS
COLLECT-ASSUMPTIONS1
COLLECT-ASSUMPTIONS
LINKED-VARIABLES1
LINKED-VARIABLES
(CONTAINS-CONSTRAINED-CONSTANTP CONTAINS-CONSTRAINED-CONSTANTP-LST)
[GC for 339 SFUN pages..(T=14).GC finished]
DISVAR-TYPE-ALIST1
COLLECT-ALL-VARS
DISVAR-TYPE-ALIST
UNENCUMBER-TYPE-ALIST
UNENCUMBER-ASSUMPTION
UNENCUMBER-ASSUMPTIONS
DUMB-TYPE-ALIST-IMPLICATIONP1
DUMB-TYPE-ALIST-IMPLICATIONP2
DUMB-TYPE-ALIST-IMPLICATIONP
PARTITION-ACCORDING-TO-ASSUMPTION-TERM
EXISTS-ASSUMPTION-WITH-WEAKER-TYPE-ALIST
[GC for 339 SFUN pages..(T=14).GC finished]
ADD-ASSUMPTION-WITH-WEAK-TYPE-ALIST
DUMB-KEEP-ASSUMPTIONS-WITH-WEAKEST-TYPE-ALISTS
DUMB-ASSUMPTION-SUBSUMPTION1
DUMB-ASSUMPTION-SUBSUMPTION
CLAUSIFY-TYPE-ALIST
CLAUSIFY-ASSUMPTION
CLAUSIFY-ASSUMPTIONS
STRIP-ASSUMPTION-TERMS
ADD-SPLITTERS-TO-TTREE1
ADD-SPLITTERS-TO-TTREE
[GC for 339 SFUN pages..(T=16).GC finished]
MAYBE-ADD-SPLITTERS-TO-TTREE
EXTRACT-AND-CLAUSIFY-ASSUMPTIONS
WATERFALL-STEP1
PROCESS-BACKTRACK-HINT
SET-RW-CACHE-STATE-IN-PSPV
MAYBE-SET-RW-CACHE-STATE-DISABLED
MAYBE-SET-RW-CACHE-STATE-ENABLED
ACCUMULATE-RW-CACHE-INTO-PSPV
[GC for 339 SFUN pages..(T=16).GC finished]
ERASE-RW-CACHE-FROM-PSPV
*SIMPLIFY-CLAUSE-LEDGE*
*SIMPLIFY-CLAUSE-LEDGE-COMPLEMENT*
WATERFALL-STEP-CLEANUP
IPRINT-ORACLE-UPDATES
IPRINT-ORACLE-UPDATES@PAR
WATERFALL-STEP
FIND-APPLICABLE-HINT-SETTINGS1
[GC for 339 SFUN pages..(T=16).GC finished]
FIND-APPLICABLE-HINT-SETTINGS
THANKS-FOR-THE-HINT
LMI-NAME-OR-RUNE
ENABLED-LMI-NAMES1
ENABLED-LMI-NAMES
MAYBE-WARN-FOR-USE-HINT
MAYBE-WARN-ABOUT-THEORY-SIMPLE
[GC for 339 SFUN pages..(T=16).GC finished]
MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
WATERFALL-OR-HIT-MSG-A
WATERFALL-OR-HIT-MSG-B
TILDE-*-OR-HIT-SUMMARY-PHRASE1
TILDE-*-OR-HIT-SUMMARY-PHRASE
WATERFALL-OR-HIT-MSG-C
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
(TERM-DIFFICULTY1 TERM-DIFFICULTY1-LST)
TERM-DIFFICULTY
CLAUSE-DIFFICULTY
CLAUSE-SET-DIFFICULTY
POOL-DIFFICULTY
HOW-MANY-TO-BE-PROVED
PICK-BEST-PSPV-FOR-WATERFALL0-OR-HIT1
PICK-BEST-PSPV-FOR-WATERFALL0-OR-HIT
[GC for 339 SFUN pages..(T=14).GC finished]
CHANGE-OR-HIT-HISTORY-ENTRY
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
PAIR-CL-ID-WITH-HINT-SETTING
APPLY-REORDER-HINT-FRONT
APPLY-REORDER-HINT-BACK
FILTER->
APPLY-REORDER-HINT
ERASE-RW-CACHE-ANY-TAG-FROM-PSPV
RESTORE-RW-CACHE-STATE-IN-PSPV
WATERFALL1-WRAPPER
[GC for 3117 CONS pages..(T=16).GC finished]
[GC for 3117 CONS pages..(T=14).GC finished]
[GC for 339 SFUN pages..(T=14).GC finished]
(WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0
WATERFALL0-OR-HIT WATERFALL1-LST)
WATERFALL
SOME-POOL-MEMBER-SUBSUMES
ADD-TO-POP-HISTORY
POP-CLAUSE1
MAKE-DEFTHM-FORMS-FOR-BYES
[GC for 3117 CONS pages..(T=14).GC finished]
POP-CLAUSE-MSG1
POP-CLAUSE-MSG
SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY
INCREMENT-PROOF-TREE-POP-CLAUSE
POP-CLAUSE
[GC for 339 SFUN pages..(T=14).GC finished]
TILDE-@-ASSUMNOTES-PHRASE-LST
TILDE-*-ASSUMNOTES-COLUMN-PHRASE
TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE
TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE
PROCESS-ASSUMPTIONS-MSG1
PROCESS-ASSUMPTIONS-MSG
[GC for 339 SFUN pages..(T=14).GC finished]
COUNT-ASSUMPTIONS
ADD-TYPE-ALIST-RUNES-TO-TTREE1
ADD-TYPE-ALIST-RUNES-TO-TTREE
PROCESS-ASSUMPTIONS-TTREE
PROCESS-ASSUMPTIONS
[GC for 339 SFUN pages..(T=16).GC finished]
DO-NOT-INDUCT-MSG
PROVE-LOOP2
PROVE-LOOP1
PRINT-SUMMARY-ON-ERROR
PROVE-LOOP0
[GC for 339 SFUN pages..(T=14).GC finished]
PROVE-LOOP
MAKE-PSPV
CHK-ASSUMPTION-FREE-TTREE
PUSH-CURRENT-ACL2-WORLD
POP-CURRENT-ACL2-WORLD
REVERT-WORLD
PROVE
Finished loading "prove.lisp".
ACL2 loading "defuns.lisp".
"ACL2"
CERT-DATA-PAIR
[GC for 339 SFUN pages..(T=14).GC finished]
CERT-DATA-VAL
CERT-DATA-ENTRY-PAIR
CERT-DATA-ENTRY
IN-ENCAPSULATEP
(CONTAINS-LAMBDA-OBJECTP CONTAINS-LAMBDA-OBJECT-LISTP)
[GC for 339 SFUN pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
STORE-CERT-DATA
WEAK-TRANSLATE-CERT-DATA-RECORD-P
UPDATE-TRANSLATE-CERT-DATA-FN
UPDATE-TRANSLATE-CERT-DATA
*MUTUAL-RECURSION-CTX-STRING*
TRANSLATE-BODIES1
CHK-NON-EXECUTABLE-BODIES
COLLECT-UNTOUCHABLE-FNS
[GC for 339 SFUN pages..(T=14).GC finished]
COLLECT-UNTOUCHABLE-VARS
GET-TRANSLATE-CERT-DATA-RECORD
GET-TRANSLATE-BODIES
TRANSLATE-BODIES
CHK-MUTUAL-RECURSION-BAD-NAMES
*CHK-MUTUAL-RECURSION-STRING*
CHK-MUTUAL-RECURSION1
[GC for 339 SFUN pages..(T=14).GC finished]
CHK-MUTUAL-RECURSION
(FFNNAMEP-MOD-MBE FFNNAMEP-MOD-MBE-LST)
PUTPROP-RECURSIVEP-LST
PROPER-DUMB-OCCUR-AS-OUTPUT
ALWAYS-TESTED-AND-CHANGEDP
[GC for 339 SFUN pages..(T=16).GC finished]
GUESS-MEASURE
GUESS-MEASURE-ALIST
TILDE-*-MEASURE-PHRASE1
TILDE-*-MEASURE-PHRASE
FIND-?-MEASURE
[GC for 3117 CONS pages..(T=14).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
PROVE-TERMINATION
PUTPROP-JUSTIFICATION-LST
UNION-EQUAL-TO-END
[GC for 339 SFUN pages..(T=16).GC finished]
CROSS-TESTS-AND-CALLS3
CROSS-TESTS-AND-CALLS2
[GC for 398 SYMBOL pages..(T=14).GC finished]
CROSS-TESTS-AND-CALLS1
SUBLIS-TESTS-REV
ALL-CALLS-TEST-ALIST
CROSS-TESTS-AND-CALLS
MARK-LOOP$-RECURSION-NUGGET
MARKED-LOOP$-RECURSION-NUGGETP
[GC for 339 SFUN pages..(T=16).GC finished]
(INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST)
SIMPLIFY-TESTS-AND-CALLS
SIMPLIFY-TESTS-AND-CALLS-LST
(LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST)
[GC for 339 SFUN pages..(T=14).GC finished]
INDUCTION-MACHINE-FOR-FN
CLEAN-UP-NOTS
CLEAN-UP-NOTS-LST
CLEAN-UP-CONJUNCTION1
CLEAN-UP-CONJUNCTION
CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE
INDUCTION-MACHINES
[GC for 339 SFUN pages..(T=14).GC finished]
PUTPROP-INDUCTION-MACHINE-LST
QUICK-BLOCK-INITIAL-SETTINGS
QUICK-BLOCK-INFO1
QUICK-BLOCK-INFO2
QUICK-BLOCK-SETTINGS
QUICK-BLOCK-DOWN-T-MACHINE
QUICK-BLOCK-INFO
[GC for 339 SFUN pages..(T=14).GC finished]
PUTPROP-QUICK-BLOCK-INFO-LST
BIG-MUTREC
GET-SIG-FNS1
GET-SIG-FNS
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
SELECTED-ALL-FNNAMES-LST
SUBVERSIVEP
SUBVERSIVE-CLIQUEP
PROVE-TERMINATION-NON-RECURSIVE
PROVE-TERMINATION-RECURSIVE
[GC for 3117 CONS pages..(T=16).GC finished]
PUT-INDUCTION-INFO-RECURSIVE
MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE
PUT-INDUCTION-INFO
DESTRUCTURE-DEFINITION
[GC for 339 SFUN pages..(T=14).GC finished]
MEMBER-REWRITE-RULE-RUNE
REPLACE-REWRITE-RULE-RUNE
PREPROCESS-HYP
PREPROCESS-HYPS
ADD-DEFINITION-RULE-WITH-TTREE
ADD-DEFINITION-RULE
PUTPROP-BODY-LST
[GC for 339 SFUN pages..(T=14).GC finished]
TYPE-SET-IMPLIED-BY-TERM1
TYPE-SET-IMPLIED-BY-TERM
PUTPROP-INITIAL-TYPE-PRESCRIPTIONS
MAP-RETURNED-FORMALS-VIA-FORMALS
MAP-TYPE-SETS-VIA-FORMALS
[GC for 339 SFUN pages..(T=16).GC finished]
VECTOR-TS-UNION
MAP-CONS-TAG-TREES
TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1
TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE
[GC for 3127 CONS pages..(T=14).GC finished]
TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES
[GC for 3127 CONS pages..(T=16).GC finished]
(TYPE-SET-AND-RETURNED-FORMALS TYPE-SET-AND-RETURNED-FORMALS-LST)
TYPE-SET-AND-RETURNED-FORMALS-TOP
GUESS-TYPE-PRESCRIPTION-FOR-FN-STEP
*CLIQUE-STEP-INSTALL-INTERVAL*
[GC for 339 SFUN pages..(T=16).GC finished]
GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE-STEP
(GUARDED-TERMP GUARDED-TERM-LISTP)
[GC for 3137 CONS pages..(T=16).GC finished]
CONJOIN-TYPE-PRESCRIPTIONS
CLEANSE-TYPE-PRESCRIPTIONS
GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE
[GC for 339 SFUN pages..(T=14).GC finished]
GET-NORMALIZED-BODIES
CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE
PUTPROP-TYPE-PRESCRIPTION-LST
PUTPROP-LEVEL-NO-LST
PRIMITIVE-RECURSIVE-ARGP
[GC for 339 SFUN pages..(T=16).GC finished]
PRIMITIVE-RECURSIVE-CALLP
PRIMITIVE-RECURSIVE-CALLSP
PRIMITIVE-RECURSIVE-MACHINEP
PUTPROP-PRIMITIVE-RECURSIVE-DEFUNP-LST
MAKE-CONTROLLER-POCKET
[GC for 339 SFUN pages..(T=14).GC finished]
MAKE-CONTROLLER-ALIST1
MAKE-CONTROLLER-ALIST
MAX-NUME-EXCEEDED-ERROR
PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS1
PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS
[GC for 339 SFUN pages..(T=16).GC finished]
PRINT-VERIFY-GUARDS-MSG
COLLECT-IDEALS
COLLECT-NON-IDEALS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
COLLECT-NON-COMMON-LISP-COMPLIANTS
ALL-FNNAMES1-EXEC
ALL-FNNAMES-EXEC
COLLECT-GUARDS-AND-BODIES
CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS
CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP
CHK-ACCEPTABLE-VERIFY-GUARDS-CMP
[GC for 339 SFUN pages..(T=14).GC finished]
CHK-ACCEPTABLE-VERIFY-GUARDS
GUARD-OBLIGATION-CLAUSES
GUARD-OBLIGATION
PROVE-GUARD-CLAUSES-MSG
[GC for 339 SFUN pages..(T=16).GC finished]
VERIFY-GUARDS-FORMULA-FN
VERIFY-GUARDS-FORMULA
[GC for 3147 CONS pages..(T=16).GC finished]
PROVE-GUARD-CLAUSES
MAYBE-REMOVE-INVARIANT-RISK
[GC for 339 SFUN pages..(T=16).GC finished]
VERIFY-GUARDS-FN1
VERIFY-GUARDS-FN
*SUPER-DEFUN-WART-TABLE*
PROJECT-OUT-COLUMNS-I-AND-J
*SUPER-DEFUN-WART-BINDING-ALIST*
*SUPER-DEFUN-WART-STOBJS-IN-ALIST*
SUPER-DEFUN-WART-BINDINGS
STORE-STOBJS-INS
STORE-SUPER-DEFUN-WARTS-STOBJS-IN
COLLECT-OLD-NAMEPS
PUT-INVARIANT-RISK1
[GC for 3157 CONS pages..(T=14).GC finished]
STOBJS-GUARD-ONLY-LST
STOBJS-GUARD-ONLY
REMOVE-GUARD-T
PUT-INVARIANT-RISK
DEFUNS-FN-SHORT-CUT
PRINT-DEFUN-MSG/COLLECT-TYPE-PRESCRIPTIONS
PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS1
PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS
SIMPLE-SIGNATUREP
ALL-SIMPLE-SIGNATURESP
PRINT-DEFUN-MSG/SIGNATURES1
PRINT-DEFUN-MSG/SIGNATURES
[GC for 3157 CONS pages..(T=16).GC finished]
PRINT-DEFUN-MSG
GET-IGNORES
GET-IGNORABLES
IRRELEVANT-VARS
GET-IRRELEVANTS
CHK-ALL-STOBJ-NAMES
GET-DECLARED-STOBJ-NAMES
[GC for 3157 CONS pages..(T=16).GC finished]
GET-STOBJS-IN-LST
CHK-STOBJS-OUT-BOUND
STORE-STOBJS-OUT
UNPARSE-SIGNATURE
CHK-DEFUN-MODE
SCAN-TO-CLTL-COMMAND
*XARGS-KEYWORDS*
PLAUSIBLE-DCLSP1
PLAUSIBLE-DCLSP
[GC for 3157 CONS pages..(T=16).GC finished]
DCL-FIELDS1
DCL-FIELDS
STRIP-KEYWORD-LIST
STRIP-DCLS1
STRIP-DCLS
FETCH-DCL-FIELDS2
[GC for 3157 CONS pages..(T=16).GC finished]
FETCH-DCL-FIELDS1
FETCH-DCL-FIELDS
FETCH-DCL-FIELD
SET-EQUALP-EQ
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
NON-IDENTICAL-DEFP-CHK-MEASURES
NON-IDENTICAL-DEFP
IDENTICAL-DEFP
[GC for 3167 CONS pages..(T=16).GC finished]
REDUNDANT-OR-RECLASSIFYING-DEFUNP0
REDUNDANT-OR-RECLASSIFYING-DEFUNP
REDUNDANT-OR-RECLASSIFYING-DEFUNSP10
REDUNDANT-OR-RECLASSIFYING-DEFUNSP1
RECOVER-DEFS-LST
GET-CLIQUE
REDUNDANT-OR-RECLASSIFYING-DEFUNSP0
STRIP-LAST-ELEMENTS
REDUNDANT-OR-RECLASSIFYING-DEFUNSP
COLLECT-WHEN-CADR-EQ
ALL-PROGRAMP
[GC for 349 SFUN pages..(T=14).GC finished]
FORMAL-POSITION
MAKE-POSNS
(RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST
RELEVANT-POSNS-CALL)
RELEVANT-POSNS-CLIQUE1
RELEVANT-POSNS-CLIQUE-RECUR
RELEVANT-POSNS-CLIQUE-INIT
(RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST)
[GC for 349 SFUN pages..(T=16).GC finished]
RELEVANT-POSNS-MERGE
RELEVANT-POSNS-LAMBDAS-TOP
RELEVANT-POSNS-CLIQUE
IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2
IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1
IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
TILDE-*-IRRELEVANT-FORMALS-MSG1
TILDE-*-IRRELEVANT-FORMALS-MSG
MISSING-IRRELEVANT-SLOTS1
MISSING-IRRELEVANT-SLOTS
FIND-SLOT
BOGUS-IRRELEVANTS-ALIST2
BOGUS-IRRELEVANTS-ALIST1
BOGUS-IRRELEVANTS-ALIST
TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG1
TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG
[GC for 349 SFUN pages..(T=14).GC finished]
CHK-IRRELEVANT-FORMALS
CHK-LOGIC-SUBFUNCTIONS
UNION-COLLECT-NON-X
TRANSLATE-MEASURES
REDUNDANT-PREDEFINED-ERROR-MSG
CHK-ACCEPTABLE-DEFUNS-REDUNDANCY
[GC for 3167 CONS pages..(T=14).GC finished]
CHK-ACCEPTABLE-DEFUNS-VERIFY-GUARDS-ER
CHK-NON-EXECUTABLEP
CHK-ACCEPTABLE-DEFUNS0
GET-BOOLEAN-UNAMBIGUOUS-XARGS-FLG-LST
GET-IRRELEVANTS-ALIST
RAW-LAMBDA$S-TO-LAMBDAS
*DEFAULT-STATE-VARS*
[GC for 3177 CONS pages..(T=14).GC finished]
CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS1
CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS2
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS
WEAK-LOOP$-ALIST-ENTRY-P
LOOP$-ALIST-TERM
*PRIMITIVE-UNTRANSLATE-ALIST*
(LOGIC-CODE-TO-RUNNABLE-CODE LOGIC-CODE-TO-RUNNABLE-CODE-LST)
AUTHENTICATE-TAGGED-LAMBDA$
MAKE-COMPILEABLE-GUARD-AND-BODY-LAMBDAS
CONVERT-TAGGED-LOOP$S-TO-PAIRS
[GC for 3187 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-LOOP$-TRANSLATIONS1
CHK-ACCEPTABLE-LOOP$-TRANSLATIONS2
CHK-ACCEPTABLE-LOOP$-TRANSLATIONS
(STATE-GLOBALS-SET-BY STATE-GLOBALS-SET-BY-LST)
[GC for 3187 CONS pages..(T=16).GC finished]
(CHK-LAMBDAS-FOR-LOOP$-RECURSION1 CHK-LAMBDAS-FOR-LOOP$-RECURSION1-LST)
CHK-LAMBDAS-FOR-LOOP$-RECURSION
WEAK-LAMBDA-INFO-P
[GC for 3197 CONS pages..(T=14).GC finished]
[GC for 3207 CONS pages..(T=14).GC finished]
CHK-ACCEPTABLE-DEFUNS1
CONDITIONALLY-MEMOIZED-FNS
CHK-ACCEPTABLE-DEFUNS
[GC for 3207 CONS pages..(T=16).GC finished]
UNION-EQ1-REV
COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES
PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST
[GC for 3207 CONS pages..(T=16).GC finished]
DEFUNS-FN1
DEFUNS-FN0
STRIP-NON-HIDDEN-PACKAGE-NAMES
IN-PACKAGE-FN
DEFSTOBJ-FUNCTIONSP
INDEX-OF-NON-NUMBER
MAKE-UDF-INSIGS
INTRO-UDF
[GC for 349 SFUN pages..(T=16).GC finished]
INTRO-UDF-LST1
INTRO-UDF-LST2
INTRO-UDF-LST
DEFUN-CTX
INSTALL-EVENT-DEFUNS
DEFUNS-FN
DEFUN-FN
[GC for 3207 CONS pages..(T=16).GC finished]
ARGS-FN
ARGS
MAKE-VERIFY-TERMINATION-DEF
MAKE-VERIFY-TERMINATION-DEFS-LST
[GC for 3207 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-VERIFY-TERMINATION1
UNIFORM-DEFUN-MODES
CHK-ACCEPTABLE-VERIFY-TERMINATION
VERIFY-TERMINATION1
VERIFY-TERMINATION-BOOT-STRAP-FN
WHEN-LOGIC3
VERIFY-TERMINATION-FN
FNS-USED-IN-AXIOMS
CHECK-OUT-INSTANTIABLEP1
[GC for 349 SFUN pages..(T=16).GC finished]
CHECK-OUT-INSTANTIABLEP
Finished loading "defuns.lisp".
ACL2 loading "proof-builder-a.lisp".
"ACL2"
PC-VALUE
PC-ASSIGN
INITIALIZE-PC-ACL2
STATE-STACK
OLD-SS
SS-ALIST
DEFINE-GLOBAL-NAME
DEFINE-GLOBAL
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
PC-PROMPT
PC-PROMPT-DEPTH-PREFIX
PC-PRINT-MACROEXPANSION-FLG
PC-PRINT-PROMPT-AND-INSTR-FLG
WEAK-PC-STATE-P
*PC-STATE-FIELDS-FOR-PRIMITIVES*
INSTRUCTION
GOALS
ABBREVIATIONS
LOCAL-TAG-TREE
PC-ENS
TAG-TREE
WEAK-GOAL-P
*GOAL-FIELDS*
CONC
HYPS
CURRENT-ADDR
GOAL-NAME
DEPENDS-ON
MAKE-OFFICIAL-PC-COMMAND
INTERN-IN-KEYWORD-PACKAGE
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
MAKE-PRETTY-PC-COMMAND
MAKE-PRETTY-PC-INSTR
CHANGE-PC-STATE
MAKE-OFFICIAL-PC-INSTR
CHECK-FORMALS-LENGTH
CHECK-&OPTIONAL-AND-&REST
[GC for 3207 CONS pages..(T=14).GC finished]
MAKE-LET-PAIRS-FROM-FORMALS
(ALL-SYMBOLS ALL-SYMBOLS-LIST)
MAKE-ACCESS-BINDINGS
LET-FORM-FOR-PC-STATE-VARS
CHECK-FIELD-NAMES
PRINT-NO-CHANGE
PRINT-NO-CHANGE2
[GC for 3217 CONS pages..(T=14).GC finished]
PRINT-NO-CHANGE-FN
MAYBE-UPDATE-INSTRUCTION
PC-PRIMITIVE-DEFUN-FORM
PC-COMMAND-TABLE-GUARD
PC-COMMAND-TABLE
ADD-PC-COMMAND
PC-COMMAND-TYPE
PRINT-NO-CHANGE3
ADD-PC-COMMAND-1
TOGGLE-PC-MACRO-FN
[GC for 349 SFUN pages..(T=14).GC finished]
PC-META-OR-MACRO-DEFUN
GOAL-NAMES
INSTRUCTIONS-OF-STATE-STACK
FMS0
WITH-OUTPUT-FORCED
PRINT-PC-PROMPT
PC-MACROEXPAND
FIND-GOAL
[GC for 3227 CONS pages..(T=14).GC finished]
PRINT-ALL-GOALS-PROVED-MESSAGE
WHEN-GOALS
WHEN-GOALS-TRIP
CURRENT-IMMEDIATE-DEPS
GOAL-DEPENDENT-P
CURRENT-ALL-DEPS
MAYBE-PRINT-PROVED-GOAL-MESSAGE
ACCUMULATE-TTREE-IN-PC-STATE
[GC for 349 SFUN pages..(T=16).GC finished]
PC-PROCESS-ASSUMPTIONS
MAKE-IMPLICATION
CL-SET-TO-IMPLICATIONS
KNOWN-ASSUMPTIONS
ADD-ASSUMPTIONS-TO-TOP-GOAL
UNPROVED-GOALS
MAKE-PC-ENS
[GC for 349 SFUN pages..(T=16).GC finished]
INITIAL-RCNST-FROM-ENS
MAKE-NEW-GOALS-FIXED-HYPS
[GC for 3237 CONS pages..(T=14).GC finished]
[GC for 3247 CONS pages..(T=16).GC finished]
PC-SINGLE-STEP-PRIMITIVE
[GC for 3257 CONS pages..(T=16).GC finished]
MAYBE-PRINT-MACROEXPANSION
PC-SINGLE-STEP-1
UNION-LASTN-PC-TAG-TREES
PC-SINGLE-STEP
*PC-COMPLETE-SIGNAL*
[GC for 408 SYMBOL pages..(T=16).GC finished]
PRINT-RE-ENTERING-PROOF-BUILDER
PC-MAIN-LOOP
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
MAKE-INITIAL-GOAL
INITIAL-STATE-STACK
EVENT-NAME-AND-TYPES-AND-RAW-TERM
INSTALL-INITIAL-STATE-STACK
PC-MAIN1
PC-MAIN
[GC for 349 SFUN pages..(T=16).GC finished]
PC-TOP
(ILLEGAL-FNP ILLEGAL-FNP-LIST)
VERIFY-FN
PRINT-UNPROVED-GOALS-MESSAGE
[GC for 3257 CONS pages..(T=16).GC finished]
STATE-STACK-FROM-INSTRUCTIONS
STATE-FROM-INSTRUCTIONS
PRINT-PC-DEFTHM
PRINT-PC-GOAL
PRINT-PC-STATE
[GC for 3257 CONS pages..(T=16).GC finished]
PROOF-BUILDER
VERIFY
GUARD-MSG-TABLE
(SUBLIS-EXPR-NON-QUOTEPS SUBLIS-EXPR-NON-QUOTEPS-LST)
INVERT-ABBREVIATIONS-ALIST
ABBREVIATE
UNTRANS0
UNTRANS0-LST-FN
[GC for 349 SFUN pages..(T=14).GC finished]
UNTRANS0-LST
Finished loading "proof-builder-a.lisp".
ACL2 loading "defthm.lisp".
"ACL2"
(REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST)
REMOVE-LAMBDAS
INTERPRET-TERM-AS-REWRITE-RULE2
[GC for 3257 CONS pages..(T=14).GC finished]
INTERPRET-TERM-AS-REWRITE-RULE1
INTERPRET-TERM-AS-REWRITE-RULE
(NON-RECURSIVE-FNNAMES-ALIST-REC NON-RECURSIVE-FNNAMES-ALIST-REC-LST)
NON-RECURSIVE-FNNAMES-ALIST
[GC for 349 SFUN pages..(T=16).GC finished]
NON-RECURSIVE-FNNAMES-ALIST-LST
HIDE-LAMBDAS1
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
HIDE-LAMBDAS
VARIANTP
(SURROUNDING-FNS1 SURROUNDING-FNS-LST)
SURROUNDING-FNS
LOOP-STOPPER1
[GC for 349 SFUN pages..(T=14).GC finished]
LOOP-STOPPER
REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS
PUT-MATCH-FREE-VALUE
FREE-VARS-IN-HYPS
FREE-VARS-IN-HYPS-SIMPLE
FREE-VARS-IN-FC-HYPS
[GC for 349 SFUN pages..(T=16).GC finished]
FREE-VARS-IN-HYPS-CONSIDERING-BIND-FREE
ALL-VARS-IN-HYPS
MATCH-FREE-VALUE
MATCH-FREE-FC-VALUE
RULE-BACKCHAIN-LIMIT-LST
[GC for 349 SFUN pages..(T=16).GC finished]
CREATE-REWRITE-RULE
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
HYPS-THAT-INSTANTIATE-FREE-VARS
(MAYBE-ONE-WAY-UNIFY MAYBE-ONE-WAY-UNIFY-LST)
MAYBE-ONE-WAY-UNIFY-WITH-SOME
MAYBE-SUBSUMES
SUBSUMES-REWRITE-RULE
[GC for 349 SFUN pages..(T=14).GC finished]
FIND-SUBSUMED-RULE-NAMES
FIND-SUBSUMING-RULE-NAMES
FORCED-HYPS
STRIP-TOP-LEVEL-NOTS-AND-FORCES
FREE-VARIABLE-ERROR?
[GC for 349 SFUN pages..(T=16).GC finished]
EXTEND-GENEQV-ALIST
(COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST)
UNCOVERED-EQUIVS
(UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST)
[GC for 349 SFUN pages..(T=16).GC finished]
DOUBLE-REWRITE-OPPORTUNITIES
SHOW-DOUBLE-REWRITE-OPPORTUNITIES1
SHOW-DOUBLE-REWRITE-OPPORTUNITIES
IRRELEVANT-LOOP-STOPPER-PAIRS
[GC for 349 SFUN pages..(T=16).GC finished]
NON-REC-DEF-RULES-MSG-1
NON-REC-DEF-RULES-MSG
[GC for 3267 CONS pages..(T=16).GC finished]
CHK-REWRITE-RULE-WARNINGS
CHK-ACCEPTABLE-REWRITE-RULE2
CHK-ACCEPTABLE-REWRITE-RULE1
CHK-ACCEPTABLE-REWRITE-RULE
ADD-REWRITE-RULE2
[GC for 349 SFUN pages..(T=16).GC finished]
ADD-REWRITE-RULE1
ADD-REWRITE-RULE
EXPAND-INEQUALITY-FNCALL1
EXPAND-INEQUALITY-FNCALL
ALL-VARS-IN-POLY-LST
SUBBAGP-EQ
[GC for 349 SFUN pages..(T=16).GC finished]
ALWAYS-BIGGERP-DATA
ALWAYS-BIGGERP-DATA-LST
ALWAYS-BIGGERP
NO-ELEMENT-ALWAYS-BIGGERP
MAXIMAL-TERMS1
[GC for 349 SFUN pages..(T=16).GC finished]
MAXIMAL-TERMS
COLLECT-WHEN-FFNNAMESP
MAKE-FREE-MAX-TERMS-MSG1
MAKE-FREE-MAX-TERMS-MSG
EXTERNAL-LINEARIZE
[GC for 349 SFUN pages..(T=16).GC finished]
BAD-SYNP-HYP-MSG-FOR-LINEAR
SHOW-DOUBLE-REWRITE-OPPORTUNITIES-LINEAR
CHK-ACCEPTABLE-LINEAR-RULE2
CHK-ACCEPTABLE-LINEAR-RULE1
[GC for 349 SFUN pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
CHK-ACCEPTABLE-LINEAR-RULE
ADD-LINEAR-RULE3
ADD-LINEAR-RULE2
ADD-LINEAR-RULE1
ADD-LINEAR-RULE
[GC for 349 SFUN pages..(T=16).GC finished]
[GC for 3277 CONS pages..(T=16).GC finished]
DESTRUCTURE-WELL-FOUNDED-RELATION-RULE
CHK-ACCEPTABLE-WELL-FOUNDED-RELATION-RULE
ADD-WELL-FOUNDED-RELATION-RULE
CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE2
[GC for 349 SFUN pages..(T=16).GC finished]
CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE1
CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE
(FN-AND-MAXIMAL-LEVEL-NO FN-AND-MAXIMAL-LEVEL-NO-LST)
[GC for 349 SFUN pages..(T=14).GC finished]
BUILT-IN-CLAUSE-DISCRIMINATOR-FN
ALL-FNNAMES-SUBSUMER
MAKE-BUILT-IN-CLAUSE-RULES1
CHK-INITIAL-BUILT-IN-CLAUSES
MAKE-BUILT-IN-CLAUSE-RULES
CLASSIFY-AND-STORE-BUILT-IN-CLAUSE-RULES
ADD-BUILT-IN-CLAUSE-RULE
[GC for 3287 CONS pages..(T=16).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=14).GC finished]
DESTRUCTURE-COMPOUND-RECOGNIZER
[GC for 3297 CONS pages..(T=16).GC finished]
MAKE-RECOGNIZER-TUPLE
COMMENT-ON-NEW-RECOG-TUPLE1
[GC for 3297 CONS pages..(T=16).GC finished]
COMMENT-ON-NEW-RECOG-TUPLE
CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE
ADD-COMPOUND-RECOGNIZER-RULE
[GC for 3297 CONS pages..(T=16).GC finished]
CHK-TRIGGERS
DESTRUCTURE-FORWARD-CHAINING-TERM
CHK-ACCEPTABLE-FORWARD-CHAINING-RULE
PUTPROP-FORWARD-CHAINING-RULES-LST
ADD-FORWARD-CHAINING-RULE
EVALUATOR-CLAUSE/ARGLIST
EVALUATOR-CLAUSE
EVALUATOR-CLAUSES1
EVALUATOR-CLAUSES
CDRP
[GC for 3307 CONS pages..(T=16).GC finished]
EXPAND-EQ-AND-ATOM-TERM-LST
NORMALIZE-ALLEGED-EVALUATOR-CLAUSE
NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET
SHALLOW-CLAUSIFY1
SHALLOW-CLAUSIFY
FIND-EVFN-LST-IN-CLAUSE
GUESS-EVFN-LST-FOR-EVFN
[GC for 3307 CONS pages..(T=16).GC finished]
FIND-FN-IN-CLAUSE
GUESS-FN-ARGS-LST-FOR-EVFN
NORMALIZED-EVALUATOR-CL-SET
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
CHK-EVALUATOR
NAMEDP-PREFIX
DEFEVALUATOR-FORM/DEFTHM-NAME
DEFEVALUATOR-FORM/DEFTHM-HINTS
DEFEVALUATOR-FORM/DEFTHM
DEFEVALUATOR-FORM/DEFTHMS
CAR-CADR-CADDR-ETC
DEFEVALUATOR-FORM/FNS-CLAUSES
*DEFEVALUATOR-FORM-BASE-THEORY*
DEFEVALUATOR-FORM
[GC for 359 SFUN pages..(T=16).GC finished]
PAIRS-TO-MACRO-ALIAS-MSGS
DEFEVALUATOR-CHECK-MSG
DEFEVALUATOR-CHECK
DEFEVALUATOR-CHECK-FORM
DEFEVALUATOR
TERM-TABLE
TERM-TABLE
REMOVE-META-EXTRACT-CONTEXTUAL-HYPS
REMOVE-META-EXTRACT-GLOBAL-HYPS
META-RULE-HYPOTHESIS-FUNCTIONS
[GC for 3307 CONS pages..(T=16).GC finished]
META-FN-ARGS
CHK-META-FUNCTION
EV-LST-FROM-EV
ATTACHED-FNS
SIBLINGS
CANONICAL-SIBLING
(CANONICAL-FFN-SYMBS CANONICAL-FFN-SYMBS-LST)
COLLECT-CANONICAL-SIBLINGS
[GC for 3307 CONS pages..(T=16).GC finished]
CONSTRAINTS-LIST
CONSTRAINT-INFO+
IMMEDIATE-CANONICAL-ANCESTORS
CANONICAL-ANCESTORS-REC
CANONICAL-ANCESTORS
CANONICAL-ANCESTORS-LST
CHK-EVALUATOR-USE-IN-RULE
[GC for 3307 CONS pages..(T=16).GC finished]
CHK-RULE-FN-GUARD
ADD-NEW-NEVER-UNTOUCHABLE-FNS
COLLECT-NEVER-UNTOUCHABLE-FNS-ENTRIES
[GC for 3317 CONS pages..(T=16).GC finished]
INTERPRET-TERM-AS-META-RULE
CHK-ACCEPTABLE-META-RULE
ADD-META-RULE1
MAYBE-PUTPROP-LST
MARK-ATTACHMENT-DISALLOWED2
MARK-ATTACHMENT-DISALLOWED1
MARK-ATTACHMENT-DISALLOWED
[GC for 3327 CONS pages..(T=16).GC finished]
ADD-META-RULE
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
(DESTRUCTORS DESTRUCTORS-LST)
STRIP-FFN-SYMBS
CHK-ACCEPTABLE-ELIM-RULE1
CHK-ACCEPTABLE-ELIM-RULE
ADD-ELIM-RULE1
ADD-ELIM-RULE
CHK-ACCEPTABLE-GENERALIZE-RULE
ADD-GENERALIZE-RULE
FIND-TYPE-PRESCRIPTION-PAT
[GC for 3327 CONS pages..(T=16).GC finished]
TYPE-PRESCRIPTION-DISJUNCTP
TYPE-PRESCRIPTION-CONCLP
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT
SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL
UNPRETTYIFY-TP
DESTRUCTURE-TYPE-PRESCRIPTION
ADD-TYPE-PRESCRIPTION-RULE
STRONG-COMPOUND-RECOGNIZER-P1
STRONG-COMPOUND-RECOGNIZER-P
[GC for 3327 CONS pages..(T=16).GC finished]
WARNED-NON-REC-FNS-ALIST-FOR-TP
WARNED-NON-REC-FNS-ALIST-TP-HYPS1
WARNED-NON-REC-FNS-ALIST-TP-HYPS
CHK-ACCEPTABLE-TYPE-PRESCRIPTION-RULE
FIX-PKG
FIX-INTERN$
FIX-INTERN-IN-PKG-OF-SYM
PACK-TO-STRING
GEN-SYM-SYM
BOOLEAN-FN
[GC for 359 SFUN pages..(T=16).GC finished]
REFLEXIVITY
SYMMETRY
TRANSITIVITY
EQUIVALENCE-RELATION-CONDITION
FIND-CANDIDATE-EQUIVALENCE-RELATION
COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES
CHK-ACCEPTABLE-EQUIVALENCE-RULE
[GC for 3327 CONS pages..(T=16).GC finished]
ADD-EQUIVALENCE-RULE
CHK-ACCEPTABLE-REFINEMENT-RULE
COLLECT-COARSENINGS
PUTPROP-COARSENINGS
UNION-VALUES
EXTEND-VALUE-SET
EXTEND-EACH-VALUE-SET
CLOSE-VALUE-SETS
[GC for 359 SFUN pages..(T=16).GC finished]
ADD-REFINEMENT-RULE
CORRESPONDING-ARGS-EQ-EXCEPT
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=22).GC finished]
(DUPLICATE-VARS-1 DUPLICATE-VARS-1-LST)
DUPLICATE-VARS
(REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1
REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1-LST)
REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR
SPLIT-AT-POSITION
MAKE-PEQUIV-PATTERN
MAKE-PEQUIV
[GC for 359 SFUN pages..(T=16).GC finished]
(VAR-ADDRESS VAR-ADDRESS-LST)
INTERPRET-TERM-AS-CONGRUENCE-RULE
SOME-CONGRUENCE-RULE-SAME
SOME-CONGRUENCE-RULE-HAS-REFINEMENT
[GC for 3337 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-CONGRUENCE-RULE
ADD-CONGRUENCE-RULE-TO-CONGRUENCE
CONS-ASSOC-EQ-REC
CONS-ASSOC-EQ
[GC for 3337 CONS pages..(T=16).GC finished]
ADD-CONGRUENCE-RULE
CHK-DESTRUCTURE-DEFINITION
CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY
CHK-ACCEPTABLE-DEFINITION-RULE
CHK-ACCEPTABLE-INDUCTION-RULE
[GC for 3337 CONS pages..(T=16).GC finished]
ADD-INDUCTION-RULE
CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE
ADD-TYPE-SET-INVERTER-RULE
TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG
DESTRUCTURE-CLAUSE-PROCESSOR-RULE
[GC for 3337 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-CLAUSE-PROCESSOR-RULE
ADD-CLAUSE-PROCESSOR-RULE
TRUSTED-CL-PROC-TABLE-GUARD
TRUSTED-CL-PROC-TABLE
DEFINE-TRUSTED-CLAUSE-PROCESSOR
PRIMITIVE-INSTRUCTIONP
NON-PRIMITIVE-INSTRUCTIONS
[GC for 359 SFUN pages..(T=16).GC finished]
CHK-PRIMITIVE-INSTRUCTION-LISTP
TRANSLATE-INSTRUCTIONS
CONTROLLER-ALISTP
ALIST-TO-KEYWORD-ALIST
ELIMINATE-MACRO-ALIASES
FIX-LOOP-STOPPER-ALIST
GUESS-CONTROLLER-ALIST-FOR-DEFINITION-RULE
CHK-LEGAL-LINEAR-TRIGGER-TERMS1
[GC for 359 SFUN pages..(T=16).GC finished]
CHK-LEGAL-LINEAR-TRIGGER-TERMS
BACKCHAIN-LIMIT-LISTP
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
RECOVER-METAFUNCTION-OR-CLAUSE-PROCESSOR-SIGNATURES
EQUAL-EXCEPT-ON-NON-STOBJS
ARITY-ALISTP
COMPATIBLE-ARITY-ALISTSP
COLLECT-DISAGREEING-ARITY-ASSUMPTIONS
[GC for 3347 CONS pages..(T=16).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
[GC for 3357 CONS pages..(T=16).GC finished]
[GC for 3367 CONS pages..(T=18).GC finished]
INTERPRET-TERM-AS-WELL-FORMEDNESS-GUARANTEE-THM
TRANSLATE-WELL-FORMEDNESS-GUARANTEE
[GC for 3377 CONS pages..(T=16).GC finished]
[GC for 3377 CONS pages..(T=16).GC finished]
[GC for 3377 CONS pages..(T=16).GC finished]
[GC for 3387 CONS pages..(T=16).GC finished]
TRANSLATE-RULE-CLASS-ALIST
TRANSLATE-RULE-CLASS1
REASON-FOR-NON-KEYWORD-VALUE-LISTP
TRANSLATE-RULE-CLASS
[GC for 3397 CONS pages..(T=16).GC finished]
TRANSLATE-RULE-CLASSES1
TRANSLATE-RULE-CLASSES
CHK-ACCEPTABLE-X-RULE
CHK-ACCEPTABLE-X-RULES
COLLECT-KEYS-EQ
CHK-ACCEPTABLE-RULES
[GC for 359 SFUN pages..(T=16).GC finished]
ADD-X-RULE
ADD-RULES1
TRUNCATE-CLASS-ALIST
TRUNCATE-CLASSES
MAKE-RUNES1
MAKE-RUNES
[GC for 359 SFUN pages..(T=16).GC finished]
MAKE-RUNIC-MAPPING-PAIRS
ADD-RULES
REDUNDANT-THEOREMP
NON-TAUTOLOGICAL-CLASSES
PROVE-COROLLARIES1
[GC for 359 SFUN pages..(T=16).GC finished]
PROVE-COROLLARIES
ENABLED-RUNEP-STRING
UNTRANSLATE-HYPS
INFO-FOR-LEMMAS
ASSOC-EQ-EQ
INFO-FOR-WELL-FOUNDED-RELATION-RULES
[GC for 359 SFUN pages..(T=16).GC finished]
INFO-FOR-BUILT-IN-CLAUSE-RULES1
INFO-FOR-BUILT-IN-CLAUSE-RULES
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
INFO-FOR-COMPOUND-RECOGNIZER-RULES
INFO-FOR-GENERALIZE-RULES
INFO-FOR-LINEAR-LEMMAS
INFO-FOR-ELIMINATE-DESTRUCTORS-RULE
INFO-FOR-CONGRUENCES
[GC for 359 SFUN pages..(T=16).GC finished]
INFO-FOR-PEQUIVS
INFO-FOR-COARSENINGS
INFO-FOR-FORWARD-CHAINING-RULES
DECODE-TYPE-SET-LST
INFO-FOR-TYPE-PRESCRIPTIONS
INFO-FOR-INDUCTION-RULES
[GC for 359 SFUN pages..(T=16).GC finished]
INFO-FOR-TYPE-SET-INVERTER-RULES
INFO-FOR-X-RULES
INFO-FOR-RULES
PRINT-INFO-FOR-RULES-ENTRY
PRINT-INFO-FOR-RULES
PR-BODY
[GC for 418 SYMBOL pages..(T=16).GC finished]
PR-FN
PRINT-CLAUSE-PROCESSOR-RULES1
PRINT-CLAUSE-PROCESSOR-RULES
NEW-NUMES
WORLD-TO-NEXT-COMMAND
PR!-FN
PR
PR!
DISABLEDP-FN-LST
[GC for 359 SFUN pages..(T=16).GC finished]
DISABLEDP-FN
DISABLEDP
COLLECT-ABBREVIATION-SUBCLASS
RUNES-TO-MONITOR1
*MONITORABLE-RUNE-TYPES*
MONITORABLE-RUNES
MONITORABLE-RUNES-FROM-MAPPING-PAIRS
[GC for 359 SFUN pages..(T=16).GC finished]
RUNES-TO-MONITOR
REMOVE1-ASSOC-EQUAL?
REMOVE1-ASSOC-EQUAL?-LST
MONITOR1
REMOVE1-ASSOC-EQUAL-LST
SET-DIFFERENCE-ASSOC-EQUAL
[GC for 359 SFUN pages..(T=16).GC finished]
UNMONITOR1
MONITOR-FN
[GC for 359 SFUN pages..(T=16).GC finished]
UNMONITOR-FN
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
MONITORED-RUNES-FN
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
BRR-FN
BRR
BRR@
MONITOR
UNMONITOR
MONITORED-RUNES
PROCEED-FROM-BRKPT1
EXIT-BRR
OK-IF-FN
OK-IF
PRINT-RULE-STORAGE-DEPENDENCIES
[GC for 359 SFUN pages..(T=18).GC finished]
DEFAXIOM-SUPPORTERS
DEFAXIOM-FN
WARN-ON-INAPPROPRIATE-DEFUN-MODE
WITH-WATERFALL-PARALLELISM-TIMINGS
TRANSLATE-FOR-DEFTHM
[GC for 3397 CONS pages..(T=18).GC finished]
[GC for 3397 CONS pages..(T=16).GC finished]
DEFTHM-FN1
DEFTHM-FN
[GC for 3407 CONS pages..(T=16).GC finished]
THM-FN
THM
CHK-EXTENSIBLE-RULE-CLASSES
EXTEND-RULE-CLASSES
*DEFEQUIV-PACKAGE-VALUES*
DEFEQUIV-FORM
[GC for 359 SFUN pages..(T=16).GC finished]
DEFEQUIV-FN
DEFEQUIV
*DEFREFINEMENT-PACKAGE-VALUES*
DEFREFINEMENT-FORM
DEFREFINEMENT-FN
DEFREFINEMENT
*DEFCONG-PACKAGE-VALUES*
DEFCONG-FORM
[GC for 359 SFUN pages..(T=16).GC finished]
DEFCONG-FN
DEFCONG
Finished loading "defthm.lisp".
ACL2 loading "other-events.lisp".
"ACL2"
MACRO-VARS-KEY
MACRO-VARS-AFTER-REST
[GC for 359 SFUN pages..(T=16).GC finished]
MACRO-VARS-OPTIONAL
MACRO-VARS
CHK-LEGAL-DEFCONST-NAME
DEFCONST-FN1
WEAK-HCOMP-BOOK-HT-ENTRY-P
[GC for 359 SFUN pages..(T=16).GC finished]
DEFCONST-VAL
LARGE-CONSP
DEFCONST-FN
CHK-LEGAL-INIT-MSG
CHK-LEGAL-INIT
[GC for 3407 CONS pages..(T=16).GC finished]
CHK-MACRO-ARGLIST-KEYS
CHK-MACRO-ARGLIST-AFTER-REST
CHK-MACRO-ARGLIST-OPTIONAL
CHK-MACRO-ARGLIST1
[GC for 359 SFUN pages..(T=16).GC finished]
CHK-MACRO-ARGLIST-MSG
CHK-MACRO-ARGLIST
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
DEFMACRO-FN1
CHK-DEFMACRO-WIDTH
REDUNDANT-DEFMACROP
COLLECT-NON-APPLY$-PRIMPS2
[GC for 359 SFUN pages..(T=18).GC finished]
(COLLECT-NON-APPLY$-PRIMPS1 COLLECT-NON-APPLY$-PRIMPS1-LST)
COLLECT-NON-APPLY$-PRIMPS
CHK-DEFMACRO-UNTOUCHABLE
[GC for 3417 CONS pages..(T=16).GC finished]
DEFMACRO-FN
*INITIAL-EVENT-DEFMACROS*
BOOT-TRANSLATE
PRIMORDIAL-EVENT-MACRO-AND-FN1
PRIMORDIAL-EVENT-MACRO-AND-FN
[GC for 359 SFUN pages..(T=16).GC finished]
PRIMORDIAL-EVENT-MACROS-AND-FNS
*INITIAL-TYPE-PRESCRIPTIONS*
COLLECT-WORLD-GLOBALS
*BOOT-STRAP-INVARIANT-RISK-SYMBOLS*
[GC for 359 SFUN pages..(T=16).GC finished]
PRIMORDIAL-WORLD-GLOBALS
ARGLISTS-TO-NILS
*UNATTACHABLE-PRIMITIVES*
INITIALIZE-INVARIANT-RISK
PUTPROP-RECOGNIZER-ALIST
PRIMORDIAL-WORLD
SAME-NAME-TWICE
CONFLICTING-IMPORTS
CHK-NEW-STRINGP-NAME
CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS
REMOVE-LISP-SUFFIX
CONVERT-BOOK-NAME-TO-CERT-NAME
[GC for 3417 CONS pages..(T=16).GC finished]
UNRELATIVIZE-BOOK-PATH
TILDE-@-DEFPKG-ERROR-PHRASE
*1*-PKG-PREFIX*
CHK-ACCEPTABLE-DEFPKG
[GC for 3427 CONS pages..(T=16).GC finished]
DEFPKG-FN
THEORY-FN-CALLP
INTERSECTION-AUGMENTED-THEORIES-FN1
CHECK-THEORY-MSG1
CHECK-THEORY-MSG
CHECK-THEORY-ACTION
CHECK-THEORY
MAYBE-CHECK-THEORY
INTERSECTION-THEORIES-FN
INTERSECTION-THEORIES
UNION-AUGMENTED-THEORIES-FN1
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
UNION-THEORIES-FN1
UNION-THEORIES-FN
UNION-AUGMENTED-THEORIES-FN1+
SET-DIFFERENCE-AUGMENTED-THEORIES-FN1
SET-DIFFERENCE-AUGMENTED-THEORIES-FN1+
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
SET-DIFFERENCE-THEORIES-FN1
SET-DIFFERENCE-THEORIES-FN
NO-AUGMENTED-RUNE-BASED-ON
REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS1
REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS
CURRENT-THEORY-FN
CURRENT-THEORY1-AUGMENTED
UNION-CURRENT-THEORY-FN
UNION-THEORIES
SET-DIFFERENCE-CURRENT-THEORY-FN
SET-DIFFERENCE-THEORIES
[GC for 3427 CONS pages..(T=16).GC finished]
UNIVERSAL-THEORY-FN1
UNIVERSAL-THEORY-FN
UNIVERSAL-THEORY
FUNCTION-THEORY-FN1
FUNCTION-THEORY-FN
FUNCTION-THEORY
EXECUTABLE-COUNTERPART-THEORY-FN
EXECUTABLE-COUNTERPART-THEORY
STANDARD-THEORIES
CURRENT-THEORY
END-PREHISTORIC-WORLD
THEORY-NAMEP
THEORY-FN
THEORY
REDUNDANT-DEFTHEORY-P
[GC for 3437 CONS pages..(T=18).GC finished]
DEFTHEORY-FN
:REDUNDANT
SET-IN-THEORY-REDUNDANT-OKP
IN-THEORY-FN
[GC for 3437 CONS pages..(T=16).GC finished]
IN-ARITHMETIC-THEORY-FN
DISABLE
ENABLE
THEORY-INVARIANT-TABLE
[GC for 3447 CONS pages..(T=16).GC finished]
THEORY-INVARIANT-FN
THEORY-INVARIANT
INCOMPATIBLE
INCOMPATIBLE!
*GENERIC-BAD-SIGNATURE-STRING*
*SIGNATURE-KEYWORDS*
DUPLICATE-KEY-IN-KEYWORD-VALUE-LISTP
[GC for 3447 CONS pages..(T=16).GC finished]
FORMALS-PRETTY-FLAGS-MISMATCH-MSG
[GC for 3447 CONS pages..(T=18).GC finished]
CHK-SIGNATURE
CHK-SIGNATURES
CHK-ACCEPTABLE-ENCAPSULATE1
NAME-INTRODUCED
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
CHK-EMBEDDED-EVENT-FORM-ORIG-FORM-MSG
*ACL2-DEFAULTS-TABLE-MACROS*
CHK-EMBEDDED-EVENT-FORM
DESTRUCTURE-EXPANSION
[GC for 3457 CONS pages..(T=18).GC finished]
REBUILD-EXPANSION
SET-RAW-MODE-ON
SET-RAW-MODE-OFF
SET-RAW-MODE-ON!
SET-RAW-MODE
ADD-RAW-ARITY
REMOVE-RAW-ARITY
ALIST-TO-BINDINGS
ACL2-RAW-EVAL
GET-AND-CHK-LAST-MAKE-EVENT-EXPANSION
*LOCAL-VALUE-TRIPLE-ELIDED*
ELIDE-LOCALS
(ELIDE-LOCALS-REC ELIDE-LOCALS-LST)
MAKE-RECORD-EXPANSION?
ACL2-SYSTEM-TABLE
[GC for 369 SFUN pages..(T=16).GC finished]
MAYBE-ADD-EVENT-LANDMARK
[GC for 3457 CONS pages..(T=18).GC finished]
EVAL-EVENT-LST
EQUAL-INSIG
BAD-SIGNATURE-ALIST
IF-NS
TILDE-*-BAD-INSIGS-PHRASE1
TILDE-*-BAD-INSIGS-PHRASE
UNION-EQ-CARS
CHK-ACCEPTABLE-ENCAPSULATE2
[GC for 369 SFUN pages..(T=18).GC finished]
CONJOIN-INTO-ALIST
CLASSES-THEOREMS
CONSTRAINTS-INTRODUCED1
NEW-TRIPS-REC
NEW-TRIPS
CONSTRAINTS-INTRODUCED
PUTPROP-CONSTRAINTS
MAYBE-INSTALL-ACL2-DEFAULTS-TABLE
UPDATE-FOR-REDO-FLAT
REDO-FLAT
[GC for 369 SFUN pages..(T=18).GC finished]
CERT-OP
EVAL-EVENT-LST-ENVIRONMENT
[GC for 3467 CONS pages..(T=18).GC finished]
PROCESS-EMBEDDED-EVENTS
CONSTRAINED-FUNCTIONS
COLLECT-LOGICALS
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
EXPORTED-FUNCTION-NAMES
GET-SUBVERSIVES
ANCESTRAL-FFN-SYMBS-LST
ENCAPSULATE-CONSTRAINT
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
BOGUS-EXPORTED-COMPLIANTS
REMOVE-TYPE-PRESCRIPTION-CERT-DATA
ENCAPSULATE-PASS-2
TILDE-@-ABBREVIATE-OBJECT-PHRASE
ENCAPSULATE-CTX
[GC for 3477 CONS pages..(T=16).GC finished]
PRINT-ENCAPSULATE-MSG1
PRINT-ENCAPSULATE-MSG2
PRINT-ENCAPSULATE-MSG3/EXPORTED-NAMES
PRINT-ENCAPSULATE-MSG3/CONSTRAINTS
PRINT-ENCAPSULATE-MSG3
[GC for 3477 CONS pages..(T=16).GC finished]
(FIND-FIRST-NON-LOCAL-NAME FIND-FIRST-NON-LOCAL-NAME-LST)
EQUAL-MOD-ELIDE-LOCALS1
(EQUAL-MOD-ELIDE-LOCALS EQUAL-MOD-ELIDE-LOCALS-LST)
CORRESPONDING-ENCAP-EVENTS
CORRESPONDING-ENCAPS
[GC for 3477 CONS pages..(T=18).GC finished]
REDUNDANT-ENCAPSULATE-TUPLEP
REDUNDANT-ENCAPSULATEP
[GC for 3477 CONS pages..(T=18).GC finished]
MARK-MISSING-AS-HIDDEN-P
KNOWN-PACKAGE-ALIST-INCLUDED-P
ENCAPSULATE-FIX-KNOWN-PACKAGE-ALIST
SUBST-BY-POSITION1
SUBST-BY-POSITION
INTRO-UDF-GUARDS
INTRO-UDF-NON-CLASSICALP
ASSOC-PROOF-SUPPORTERS-ALIST
UPDATE-PROOF-SUPPORTERS-ALIST-3
[GC for 369 SFUN pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
POSN-FIRST-NON-EVENT
UPDATE-PROOF-SUPPORTERS-ALIST-2
UPDATE-PROOF-SUPPORTERS-ALIST-1
UPDATE-PROOF-SUPPORTERS-ALIST
INSTALL-PROOF-SUPPORTERS-ALIST
EMPTY-ENCAPSULATE
CERT-DATA-TP-FROM-RUNIC-TYPE-PRESCRIPTION
CERT-DATA-TPS-FROM-FNS
CERT-DATA-FOR-CERTIFICATE
[GC for 369 SFUN pages..(T=18).GC finished]
NEWLY-DEFINED-TOP-LEVEL-FNS-REC
NEWLY-DEFINED-TOP-LEVEL-FNS
CERT-DATA-TPS-1
CERT-DATA-TPS
CERT-DATA-PASS1-SAVED
FUNCTIONAL-SUBSTITUTION-P
NEW-PROVED-FUNCTIONAL-INSTANCES-ALIST
FAST-ALIST-FREE-CERT-DATA-ON-EXIT
[GC for 3477 CONS pages..(T=16).GC finished]
[GC for 3487 CONS pages..(T=16).GC finished]
ENCAPSULATE-FN
[GC for 3497 CONS pages..(T=16).GC finished]
PROGN-FN1
PROGN-FN
PROGN!-FN
CHK-BOOK-NAME
INCLUDE-BOOK-ALIST-SUBSETP
CBD-FN
CBD
[GC for 369 SFUN pages..(T=16).GC finished]
GET-PORTCULLIS-CMDS
OUR-MERGE-PATHNAMES
EXPAND-TILDE-TO-USER-HOME-DIR
T
CANONICAL-DIRNAME!
DIRECTORY-OF-ABSOLUTE-PATHNAME
EXTEND-PATHNAME
MAYBE-ADD-SEPARATOR
[GC for 369 SFUN pages..(T=16).GC finished]
SET-CBD-FN
SET-CBD
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
SET-CBD-STATE
PARSE-BOOK-NAME
SYSFILE-P
SYSFILE-FILENAME
FILENAME-TO-SYSFILE
SYSFILE-TO-FILENAME
[GC for 369 SFUN pages..(T=16).GC finished]
(MAKE-INCLUDE-BOOKS-ABSOLUTE-1 MAKE-INCLUDE-BOOKS-ABSOLUTE-LST)
MAKE-INCLUDE-BOOKS-ABSOLUTE
FIRST-KNOWN-PACKAGE-ALIST
DEFPKG-ITEMS-REC
NEW-DEFPKG-P
DEFPKG-ITEMS
[GC for 369 SFUN pages..(T=18).GC finished]
NEW-DEFPKG-LIST2
MAKE-HIDDEN-DEFPKG
NEW-DEFPKG-LIST1
NEW-DEFPKG-LIST
(TERM-IGNORE-OKP TERM-LIST-IGNORE-OKP)
HIDDEN-DEFPKG-EVENTS1
[GC for 369 SFUN pages..(T=16).GC finished]
HIDDEN-DEFPKG-EVENTS
FIX-PORTCULLIS-CMDS1
FIX-PORTCULLIS-CMDS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
COLLECT-UNCERTIFIED-BOOKS
CHK-IN-PACKAGE
ILL-FORMED-CERTIFICATE-ER
INCLUDE-BOOK-ER-WARNING-SUMMARY
INCLUDE-BOOK-ER1
INCLUDE-BOOK-ER
POST-ALIST-FROM-CHANNEL
[GC for 369 SFUN pages..(T=18).GC finished]
CERTIFICATE-FILE-AND-INPUT-CHANNEL1
PCERT-OP-P
CERTIFICATE-FILE-AND-INPUT-CHANNEL
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
CERT-ANNOTATIONS-AND-CHECKSUM-FROM-CERT-FILE
TILDE-@-CERT-POST-ALIST-PHRASE
ASSOC-FAMILIAR-NAME
TILDE-*-BOOK-HASH-PHRASE1
TILDE-*-BOOK-HASH-PHRASE
GET-CMDS-FROM-PORTCULLIS1
[GC for 369 SFUN pages..(T=16).GC finished]
HIDDEN-DEFPKG-EVENTS-SIMPLE
GET-CMDS-FROM-PORTCULLIS
CONVERT-BOOK-NAME-TO-PORT-NAME
CHK-RAISE-PORTCULLIS2
CHK-RAISE-PORTCULLIS1
[GC for 369 SFUN pages..(T=18).GC finished]
MARK-LOCAL-INCLUDED-BOOKS
UNMARK-AND-DELETE-LOCAL-INCLUDED-BOOKS
EARLIER-ACL2-VERSIONP
ACL2-VERSION-R-P
SYSFILE-OR-STRING-LISTP
TTAG-ALISTP
[GC for 369 SFUN pages..(T=16).GC finished]
CERT-ANNOTATIONSP
WEAK-CERT-OBJ-P
*TRIVIAL-BOOK-HASH*
CERT-HASH
INCLUDE-BOOK-ALIST-ENTRY-P
SYSFILE-TO-FILENAME-TTAG-ALIST-VAL
SYSFILE-TO-FILENAME-TTAG-ALISTP
[GC for 369 SFUN pages..(T=18).GC finished]
SYSFILE-TO-FILENAME-CERT-ANNOTATIONS
SYSFILE-TO-FILENAME-INCLUDE-BOOK-ENTRY
SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST1
SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST
FILENAME-TO-SYSFILE-TTAG-ALIST-VAL
FILENAME-TO-SYSFILE-TTAG-ALISTP
[GC for 369 SFUN pages..(T=18).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
FILENAME-TO-SYSFILE-CERT-ANNOTATIONS
FILENAME-TO-SYSFILE-INCLUDE-BOOK-ENTRY
FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST1
FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST
KEYWORD-LISTP
READ-FILE-INTO-TEMPLATE
[GC for 369 SFUN pages..(T=18).GC finished]
FAST-CERT-DATA
CHK-RAISE-PORTCULLIS
[GC for 428 SYMBOL pages..(T=18).GC finished]
CHK-CERTIFICATE-FILE1
CERTIFICATE-FILE
CHK-CERTIFICATE-FILE
[GC for 3507 CONS pages..(T=16).GC finished]
EQUAL-MODULO-HIDDEN-DEFPKGS
CERT-OBJ-FOR-CONVERT
CHK-ACCEPTABLE-CERTIFY-BOOK1
TRANSLATE-BOOK-NAMES
[GC for 369 SFUN pages..(T=18).GC finished]
FIX-TTAGS
CHK-WELL-FORMED-TTAGS
CHECK-CERTIFICATE-FILE-EXISTS
CHK-ACCEPTABLE-CERTIFY-BOOK
PRINT-OBJECTS
[GC for 369 SFUN pages..(T=16).GC finished]
REPLACE-INITIAL-SUBSTRING
REPLACE-STRING-PREFIX-IN-TREE
WITH-OUTPUT-OBJECT-CHANNEL-SHARING
ELIDE-LOCALS-AND-SPLIT-EXPANSION-ALIST
[GC for 3517 CONS pages..(T=18).GC finished]
MAKE-CERTIFICATE-FILE1
MAKE-CERTIFICATE-FILE
MAKE-CERTIFICATE-FILES
[GC for 369 SFUN pages..(T=16).GC finished]
OPEN-INPUT-OBJECT-FILE
READ-OBJECT-FILE1
READ-OBJECT-FILE
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
CHK-CERT-ANNOTATIONS
CHK-CERT-ANNOTATIONS-POST-ALIST
CHK-INPUT-OBJECT-FILE
[GC for 369 SFUN pages..(T=18).GC finished]
INCLUDE-BOOK-DIR
INCLUDE-BOOK-DIR-WITH-CHK
ACCUMULATE-POST-ALIST
SKIPPED-PROOFSP-IN-POST-ALIST
BOOK-HASH-ALIST
BOOK-HASH
WITH-HCOMP-BINDINGS
WITH-HCOMP-HT-BINDINGS
[GC for 369 SFUN pages..(T=16).GC finished]
GET-DECLAIM-LIST
TILDE-@-BOOK-STACK-MSG
CONVERT-BOOK-NAME-TO-ACL2X-NAME
ACL2X-ALISTP
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
READ-ACL2X-FILE
EVAL-PORT-FILE
[GC for 3527 CONS pages..(T=16).GC finished]
GETENV!
UPDATE-PCERT-BOOKS
CONVERT-NON-NIL-SYMBOLS-TO-KEYWORDS
[GC for 3537 CONS pages..(T=18).GC finished]
[GC for 3547 CONS pages..(T=16).GC finished]
INCLUDE-BOOK-FN1
CHK-INCLUDE-BOOK-INPUTS
[GC for 3557 CONS pages..(T=18).GC finished]
INCLUDE-BOOK-FN
SPONTANEOUS-DECERTIFICATIONP1
SPONTANEOUS-DECERTIFICATIONP
REMOVE-DUPLICATES-EQUAL-FROM-END
INCLUDE-BOOK-ALIST-SUBSETP-FAILURE-WITNESSES
[GC for 369 SFUN pages..(T=16).GC finished]
EXPANSION-FILENAME
TOP-LEVEL-LOOP$-ALIST-REC
TOP-LEVEL-LOOP$-ALIST
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
WRITE-EXPANSION-FILE
COLLECT-IDEAL-USER-DEFUNS1
COLLECT-IDEAL-USER-DEFUNS
SET-DIFFERENCE-EQ-SORTED
PKG-NAMES0
HONS-UNION-ORDERED-STRING-LISTS
PKG-NAMES-MEMOIZE
PKG-NAMES
DELETE-NAMES-FROM-KPA-REC
DELETE-NAMES-FROM-KPA
PRINT-CERTIFY-BOOK-STEP-2
[GC for 3557 CONS pages..(T=16).GC finished]
PRINT-CERTIFY-BOOK-STEP-3
PRINT-CERTIFY-BOOK-GUARDS-WARNING
CHK-CERTIFY-BOOK-STEP-3
PRINT-CERTIFY-BOOK-STEP-4
PRINT-CERTIFY-BOOK-STEP-5
HCOMP-BUILD-FROM-STATE
[GC for 3557 CONS pages..(T=16).GC finished]
T
HONS-COPY-WITH-STATE
IDENTITY-WITH-STATE
:ATTACHMENTS-RECORDED
WRITE-ACL2X-FILE
[GC for 3557 CONS pages..(T=18).GC finished]
MERGE-INTO-EXPANSION-ALIST1
ACL2X-ALISTP-DOMAINS-SUBSETP
MERGE-INTO-EXPANSION-ALIST
RESTRICT-EXPANSION-ALIST
ELIDE-LOCALS-FROM-EXPANSION-ALIST
[GC for 3557 CONS pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
WRITE-PORT-FILE
SAVE-PARALLELISM-SETTINGS
INCLUDE-BOOK-ALIST-EQUAL-MODULO-LOCAL
COPY-OBJECT-CHANNEL-UNTIL-MARKER
COPY-PCERT0-TO-PCERT1
TOUCH?
[GC for 3567 CONS pages..(T=18).GC finished]
CONVERT-BOOK-NAME-TO-COMPILED-NAME
CERTIFY-BOOK-FINISH-CONVERT
INCLUDE-BOOK-ALIST-UNCERTIFIED-BOOKS
COUNT-FORMS-IN-CHANNEL
SKIP-FORMS-IN-CHANNEL
POST-ALIST-FROM-PCERT1-1
POST-ALIST-FROM-PCERT1
CERTIFICATE-POST-ALIST
CERTIFY-BOOK-FINISH-COMPLETE
EXPANSION-ALIST-CONFLICT
CHK-ABSSTOBJ-INVARIANTS
[GC for 379 SFUN pages..(T=18).GC finished]
SYMBOL-PACKAGE-NAME-SET
NAMES-OF-SYMBOLS-IN-PACKAGE
SYMBOL-LIST-TO-PACKAGE-ALIST1
SYMBOL-LIST-TO-PACKAGE-ALIST
BOOKDATA-ALIST1
BOOKDATA-ALIST
MAYBE-WRITE-BOOKDATA
FROMTO
REMOVE-SMALLER-KEYS-FROM-SORTED-ALIST
[GC for 3567 CONS pages..(T=16).GC finished]
CERT-INCLUDE-EXPANSION-ALIST
[GC for 3567 CONS pages..(T=18).GC finished]
[GC for 3577 CONS pages..(T=18).GC finished]
[GC for 3587 CONS pages..(T=16).GC finished]
[GC for 3587 CONS pages..(T=16).GC finished]
[GC for 3597 CONS pages..(T=16).GC finished]
CERTIFY-BOOK-FN
[GC for 3597 CONS pages..(T=18).GC finished]
CERTIFY-BOOK
CERTIFY-BOOK!
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=24).GC finished]
REDUNDANT-DEFCHOOSEP
CHK-ARGLIST-FOR-DEFCHOOSE
WITHOUT-WARNINGS-FN
WITHOUT-WARNINGS
TRANSLATE-IGNORE-OK
TRANSLATE-WITHOUT-WARNINGS-IGNORE-OK
DEFCHOOSE-CONSTRAINT-BASIC
GENERATE-VARIABLE-LST-SIMPLE
DEFCHOOSE-CONSTRAINT-EXTRA
[GC for 379 SFUN pages..(T=16).GC finished]
DEFCHOOSE-CONSTRAINT
DEFCHOOSE-FN
*DEFUN-SK-KEYWORDS*
NON-ACCEPTABLE-DEFUN-SK-P
DEFINITION-RULE-NAME
VERIFY-GUARDS?
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
PARSE-DEFUN-SK-DCLS
DEFUN-SK-FN
DEFUN-SK
DOUBLET-STYLE-SYMBOL-TO-SYMBOL-ALISTP
CHK-LEGAL-DEFSTOBJ-NAME
CHK-UNRESTRICTED-GUARDS-FOR-USER-FNS
[GC for 3597 CONS pages..(T=16).GC finished]
CHK-STOBJ-FIELD-DESCRIPTOR
CHK-ACCEPTABLE-DEFSTOBJ-RENAMING
[GC for 3597 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-DEFSTOBJ1
DEFSTOBJ-REDUNDANCY-BUNDLE
OLD-DEFSTOBJ-REDUNDANCY-BUNDLE
REDUNDANT-DEFSTOBJP
CONGRUENT-STOBJ-FIELDS
[GC for 3597 CONS pages..(T=18).GC finished]
CHK-ACCEPTABLE-DEFSTOBJ
[GC for 3597 CONS pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
DEFSTOBJ-FIELD-FNS-AXIOMATIC-DEFS
DEFSTOBJ-AXIOMATIC-INIT-FIELDS
DEFSTOBJ-CREATOR-FN
DEFSTOBJ-AXIOMATIC-DEFS
[GC for 3607 CONS pages..(T=18).GC finished]
PUT-STOBJS-IN-AND-OUTS1
PUT-STOBJS-IN-AND-OUTS
DEFCONST-NAME-ALIST
ACCESSOR-ARRAY
PUT-DEFSTOBJ-INVARIANT-RISK
DEFSTOBJ-FN
[GC for 3607 CONS pages..(T=16).GC finished]
DEFABSSTOBJ
CONCRETE-STOBJ
DEFABSSTOBJ-MISSING-EVENTS
REDUNDANT-DEFABSSTOBJP
ABSSTOBJ-CORRESPONDENCE-CONCL-LST
FLATTEN-ANDS-IN-LIT!
ABSSTOBJ-CORRESPONDENCE-FORMULA
ABSSTOBJ-PRESERVED-FORMULA
WEAK-ABSSTOBJ-METHOD-P
[GC for 3607 CONS pages..(T=16).GC finished]
(FN-STOBJ-UPDATES-P STOBJ-UPDATES-P STOBJ-UPDATES-LISTP)
UNPROTECTED-EXPORT-P
[GC for 3607 CONS pages..(T=18).GC finished]
TRANSLATE-ABSSTOBJ-FIELD
SIMPLE-TRANSLATE-ABSSTOBJ-FIELDS
ONE-WAY-UNIFY-P
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
OBVIOUSLY-EQUAL-LAMBDA-ARGS
(OBVIOUSLY-EQUIV-TERMS OBVIOUSLY-EQUIV-TERMS-LST)
OBVIOUSLY-IFF-EQUIV-TERMS
CHK-DEFABSSTOBJ-METHOD-LEMMAS
CHK-DEFABSSTOBJ-METHOD
[GC for 3617 CONS pages..(T=16).GC finished]
CHK-ACCEPTABLE-DEFABSSTOBJ1
FIRST-KEYWORD
CHK-ACCEPTABLE-DEFABSSTOBJ
DEFABSSTOBJ-AXIOMATIC-DEFS
[GC for 3617 CONS pages..(T=16).GC finished]
DEFABSSTOBJ-RAW-DEF
DEFABSSTOBJ-RAW-DEFS-REC
[GC for 379 SFUN pages..(T=18).GC finished]
DEFABSSTOBJ-RAW-DEFS
EXPAND-RECOGNIZER
PUT-ABSSTOBJS-IN-AND-OUTS
METHOD-EXEC
DEFABSSTOBJ-RAW-INIT
DEFABSSTOBJ-MISSING-MSG
UPDATE-GUARD-POST
DEFABSSTOBJ-LOGIC-SUBST
[GC for 379 SFUN pages..(T=18).GC finished]
CHK-DEFABSSTOBJ-GUARD
CHK-DEFABSSTOBJ-GUARDS1
CHK-DEFABSSTOBJ-GUARDS
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
MAKE-ABSSTOBJ-LOGIC-EXEC-PAIRS
PUT-DEFABSSTOBJ-INVARIANT-RISK
[GC for 3627 CONS pages..(T=18).GC finished]
DEFABSSTOBJ-FN1
DEFABSSTOBJ-FN
CREATE-STATE
WITH-LOCAL-STATE
STOBJ-LET
[GC for 782 RELOCATABLE-BLOCKS pages..(T=16).GC finished]
COLLECT-BADGED-FNS
COLLECT-MACROS
PUSH-UNTOUCHABLE-FN
REMOVE-UNTOUCHABLE-FN
DEF-BODY-LEMMAS
SHOW-BODIES
SET-BODY-FN1
[GC for 3637 CONS pages..(T=18).GC finished]
SET-BODY-FN
TRACE-MULTIPLICITY
*1*DEFP
TRACE$-ER-MSG
DECLS-AND-DOC
TRACE$-WHEN-GCOND
STOBJ-EVISCERATION-ALIST
TRACE-EVISCERATION-ALIST
[GC for 379 SFUN pages..(T=16).GC finished]
SET-TRACE-EVISC-TUPLE
CHK-TRACE-OPTIONS-AUX
TRACE$-VALUE-MSGP
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
CHK-TRACE-OPTIONS
MEMOIZE-OFF-TRACE-ERROR
UNTRACE$-FN1
UNTRACE$-REC
UNTRACE$-FN
[GC for 379 SFUN pages..(T=18).GC finished]
MAYBE-UNTRACE$-FN
MAYBE-UNTRACE$
TRACE$-FN-GENERAL
TRACE$-FN-SIMPLE
*TRACE-KEYWORDS*
*TRACE-KEYWORDS-NEEDING-TTAG*
FIRST-ASSOC-KEYWORD
*ILLEGAL-TRACE-SPEC-FMT-STRING*
TRACE$-FN
TRACE$-LST
TRACE$
WITH-UBT!
TRACE!
UNTRACE$
OPEN-TRACE-FILE-FN
OPEN-TRACE-FILE
[GC for 379 SFUN pages..(T=18).GC finished]
CLOSE-TRACE-FILE-FN
CLOSE-TRACE-FILE
BREAK-ON-ERROR
DEFEXEC-EXTRACT-KEY
PARSE-DEFEXEC-DCLS-1
FIX-EXEC-XARGS
PARSE-DEFEXEC-DCLS
DEFEXEC
[GC for 3637 CONS pages..(T=18).GC finished]
WEAK-SAR-P
APPLICABLE-REWRITE-RULES1
APPLICABLE-LINEAR-RULES1
PC-RELIEVE-HYP
[GC for 3647 CONS pages..(T=16).GC finished]
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
(PC-RELIEVE-HYPS1-ITER PC-RELIEVE-HYPS1)
PC-RELIEVE-HYPS
REMOVE-TRIVIAL-LITS
UNRELIEVED-HYPS
UNTRANSLATE-SUBST-ABB
[GC for 379 SFUN pages..(T=18).GC finished]
SHOW-REWRITE-LINEAR
SHOW-REWRITES-LINEARS
EXPAND-ASSUMPTIONS-1
EXPAND-ASSUMPTIONS
[GC for 3657 CONS pages..(T=16).GC finished]
HYPS-TYPE-ALIST
SHOW-REWRITES-LINEARS-FN
SHOW-META-LEMMAS1
SHOW-META-LEMMAS
DECODED-TYPE-SET-FROM-TP-RULE
[GC for 379 SFUN pages..(T=16).GC finished]
SHOW-TYPE-PRESCRIPTION-RULE
SHOW-TYPE-PRESCRIPTION-RULES1
SHOW-TYPE-PRESCRIPTION-RULES
PL2-FN
PL-FN
PL
PL2
[GC for 379 SFUN pages..(T=18).GC finished]
ACL2-DEFAULTS-TABLE-LOCAL-CTX-P
[GC for 12800 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
CHANGE-INCLUDE-BOOK-DIR
ADD-CUSTOM-KEYWORD-HINT-FN
RESET-PREHISTORY
CHECKPOINT-WORLD
RESET-KILL-RING
[GC for 3657 CONS pages..(T=16).GC finished]
RESET-PREHISTORY-FN
MEMOIZE-TABLE-CHK-COMMUTATIVE
NON-MEMOIZABLE-STOBJS
FILTER-ABSSTOBJS
[GC for 3667 CONS pages..(T=18).GC finished]
MEMOIZE-TABLE-CHK
MEMOIZE-TABLE
[GC for 379 SFUN pages..(T=16).GC finished]
REMOVE-STOBJS-IN-BY-POSITION
ADD-SUFFIX-TO-FN
(FSUBCOR-VAR FSUBCOR-VAR-LST)
[GC for 379 SFUN pages..(T=18).GC finished]
(PRINT-GV-SUBSTITUTE-P1 PRINT-GV-SUBSTITUTE-P1-LST)
PRINT-GV-SUBSTITUTE-P
PRINT-GV-FORM
PRINT-GV-CONJUNCT
PRINT-GV1
[GC for 379 SFUN pages..(T=18).GC finished]
PRINT-GV-FN
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
SET-PRINT-GV-DEFAULTS-FN
SET-PRINT-GV-DEFAULTS
PRINT-GV-EVISC-TUPLE
PRINT-GV-DEFAULT
PRINT-GV
DISABLE-IPRINT-AR
ENABLE-IPRINT-AR
*IPRINT-ACTIONS*
SET-IPRINT-FN1
[GC for 379 SFUN pages..(T=18).GC finished]
INIT-IPRINT-FAL+
SET-IPRINT-FN
SET-IPRINT
*EVISC-TUPLE-SITES*
SET-SITE-EVISC-TUPLE
[GC for 379 SFUN pages..(T=18).GC finished]
CHK-EVISC-TUPLE
SET-EVISC-TUPLE-LST
[GC for 438 SYMBOL pages..(T=18).GC finished]
SET-EVISC-TUPLE-FN1
IPRINT-VIRGINP
SET-EVISC-TUPLE-FN
SET-EVISC-TUPLE
TOP-LEVEL
[GC for 379 SFUN pages..(T=18).GC finished]
TAMENESS-CONDITIONS
[GC for 13056 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
SUCCESSIVE-CADRS
NECC-NAME-ARGS-INSTANCE
DEFWARRANT-EVENT
[GC for 3677 CONS pages..(T=18).GC finished]
TRANSLATE-DEFATTACH-HELPERS
*DEFATTACH-KEYS*
DEFATTACH-UNKNOWN-CONSTRAINTS-ERROR
INTERSECTION-DOMAINS
[GC for 3687 CONS pages..(T=18).GC finished]
PROCESS-DEFATTACH-ARGS1
[GC for 379 SFUN pages..(T=18).GC finished]
DUPLICATE-KEYSP-EQ
SPLIT-AT-FIRST-KEYWORD
MAYBE-REMOVE1-EQ
FILTER-FOR-ATTACHMENT
*DEFATTACH-KEYS-EXTENDED*
PROCESS-DEFATTACH-ARGS
[GC for 3697 CONS pages..(T=18).GC finished]
PROVE-DEFATTACH-GUARDS1
[GC for 3697 CONS pages..(T=18).GC finished]
PROVE-DEFATTACH-GUARDS
TRUE-APPLY$-WARRANT
DEFATTACH-CONSTRAINT-REC
DEFATTACH-CONSTRAINT
[GC for 3697 CONS pages..(T=16).GC finished]
PROVE-DEFATTACH-CONSTRAINT
ATTACHMENT-COMPONENT-OWNER
DEFATTACH-COMPONENT-HAS-OWNER
[GC for 3707 CONS pages..(T=18).GC finished]
DEFATTACH-MERGE-INTO-COMPONENT
DEFATTACH-MERGE-COMPONENTS
DEFATTACH-MERGE
DEFATTACH-MERGE-LST
DEFATTACH-MERGE-LST-LST
DEFATTACH-LOOP-ERROR-MSG
DEFATTACH-LOOP-ERROR
DEFATTACH-CLOSE
DEFATTACH-ERASE-COMPONENTS
DEFATTACH-ERASE-P
[GC for 3707 CONS pages..(T=16).GC finished]
DEFATTACH-ERASE1
DEFATTACH-ERASE
COLLECT-EXT-ANC
[GC for 13056 CONTIGUOUS-BLOCKS pages..(T=26).GC finished]
EXTEND-ATTACHMENT-COMPONENTS
COMPONENT-PATH-EXTENSION
EXTEND-ATTACHMENT-RECORD
UPDATE-ATTACHMENT-RECORDS1
UPDATE-ATTACHMENT-RECORDS
ATTACHMENT-RECORDS
[GC for 3707 CONS pages..(T=18).GC finished]
CHK-DEFATTACH-LOOP
DEFAXIOM-SUPPORTER-MSG-LIST
CHK-ACCEPTABLE-DEFATTACH
ATTACHMENT-CLTL-CMD
[GC for 3707 CONS pages..(T=16).GC finished]
DEFATTACH-FN
DEFATTACH-SYSTEM
[GC for 3717 CONS pages..(T=18).GC finished]
CHK-RETURN-LAST-ENTRY
RETURN-LAST-TABLE
DEFMACRO-LAST
*FMT-CONTROL-DEFAULTS*
*FIXED-FMT-CONTROLS*
FMT-CONTROL-BINDINGS1
FMT-CONTROL-BINDINGS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
SET-IPRINT-AR
CHANNEL-TO-STRING
[GC for 3717 CONS pages..(T=18).GC finished]
[GC for 3727 CONS pages..(T=18).GC finished]
[GC for 3737 CONS pages..(T=18).GC finished]
FMS-TO-STRING-FN
FMS-TO-STRING
[GC for 3747 CONS pages..(T=18).GC finished]
[GC for 3747 CONS pages..(T=18).GC finished]
FMS!-TO-STRING-FN
FMS!-TO-STRING
[GC for 3757 CONS pages..(T=18).GC finished]
[GC for 3757 CONS pages..(T=18).GC finished]
[GC for 389 SFUN pages..(T=16).GC finished]
FMT-TO-STRING-FN
FMT-TO-STRING
[GC for 3767 CONS pages..(T=18).GC finished]
[GC for 3767 CONS pages..(T=18).GC finished]
FMT!-TO-STRING-FN
FMT!-TO-STRING
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
[GC for 389 SFUN pages..(T=18).GC finished]
FMT1-TO-STRING-FN
FMT1-TO-STRING
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 389 SFUN pages..(T=18).GC finished]
FMT1!-TO-STRING-FN
FMT1!-TO-STRING
[GC for 13056 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
ATTACHMENT-PAIRS
SIBLING-ATTACHMENTS
EXT-ANCESTORS-ATTACHMENTS4
EXT-ANCESTORS-ATTACHMENTS3
EXT-ANCESTORS-ATTACHMENTS2
CANONICAL-CDRS
EXT-ANCESTORS-ATTACHMENTS1
ATTACHMENT-RECORDS-FAL
EXT-ANCESTORS-ATTACHMENTS
EXT-ANC-ATTACHMENT-MISSING
EXT-ANC-ATTACHMENTS-VALID-P-1
[GC for 389 SFUN pages..(T=18).GC finished]
EXT-ANC-ATTACHMENTS-VALID-P
*INLINE-SUFFIX-LEN-MINUS-1*
*NOTINLINE-SUFFIX*
*NOTINLINE-SUFFIX-LEN-MINUS-1*
*NON-STOBJ-VAR-ROOT*
DEFUN-INLINE-FORM
DEFUN-INLINE
DEFUND-INLINE
DEFUN-NOTINLINE
DEFUND-NOTINLINE
REGENERATE-TAU-DATABASE-FN0
REGENERATE-TAU-DATABASE-FN1
REGENERATE-TAU-DATABASE-FN
RATIONAL-TO-DECIMAL-STRING
DEFUND
T
MAKE-EVENT-CTX
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 3777 CONS pages..(T=16).GC finished]
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 78 STRUCTURE pages..(T=18).GC finished]
[GC for 3777 CONS pages..(T=18).GC finished]
[GC for 3787 CONS pages..(T=18).GC finished]
[GC for 3797 CONS pages..(T=18).GC finished]
[GC for 13056 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PROTECTED-EVAL
MAKE-EVENT-DEBUG-PRE
MAKE-EVENT-DEBUG-POST
DO-PROOFS?
MAKE-EVENT-FN2
MAKE-EVENT-FN2-LST
MAKE-EVENT-FN1
ULTIMATE-EXPANSION
[GC for 3807 CONS pages..(T=18).GC finished]
MAKE-EVENT-FN
GET-CHECK-INVARIANT-RISK
SET-CHECK-INVARIANT-RISK
SET-CHECK-INVARIANT-RISK-FN
GET-REGISTER-INVARIANT-RISK
SET-REGISTER-INVARIANT-RISK
SORT-FBOUNDPS
T
T
APPLY$-LAMBDA-LOGICAL
Finished loading "other-events.lisp".
ACL2 loading "ld.lisp".
"ACL2"
WEAK-LD-PROMPT-MEMO-P
[GC for 389 SFUN pages..(T=18).GC finished]
DEFAULT-PRINT-PROMPT
PRINT-PROMPT
INITIALIZE-TIMERS
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
MAYBE-ADD-COMMAND-LANDMARK
REPLACE-LAST-CDR
LD-STANDARD-OI-MISSING
CHK-ACCEPTABLE-LD-FN1-PAIR
CLOSE-CHANNELS
CHK-ACCEPTABLE-LD-FN1
[GC for 389 SFUN pages..(T=18).GC finished]
CHK-ACCEPTABLE-LD-FN
F-PUT-LD-SPECIALS
F-GET-LD-SPECIALS
LD-READ-KEYWORD-COMMAND1
EXIT-LD
LD-READ-KEYWORD-COMMAND
LD-FIX-COMMAND
[GC for 389 SFUN pages..(T=18).GC finished]
LD-READ-COMMAND
LD-PRINT-COMMAND
LD-FILTER-COMMAND
LD-PRINT-RESULTS
LD-PRINT-PROMPT
LD-RETURN-ERROR
INITIALIZE-ACCUMULATED-WARNINGS
[GC for 389 SFUN pages..(T=18).GC finished]
LD-READ-EVAL-PRINT
LD-LOOP
GET-DIRECTORY-OF-FILE
UPDATE-CBD
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
LD-FN-BODY
LD-FN1
LD-FN-ALIST
LD-FN0
LD-FN
LD
QUICK-TEST
[GC for 389 SFUN pages..(T=18).GC finished]
WORMHOLE-PROMPT
RESET-LD-SPECIALS-FN
RESET-LD-SPECIALS
MAYBE-RESET-DEFAULTS-TABLE1
MAYBE-RESET-DEFAULTS-TABLE2
MAYBE-RESET-DEFAULTS-TABLE
DELETE-SOMETHING
STORE-IN-KILL-RING
ROTATE-KILL-RING1
ROTATE-KILL-RING
[GC for 389 SFUN pages..(T=18).GC finished]
UBT-UBU-FN1
UBT?-UBU?-FN
UBT-UBU-FN
UBT!-UBU!-FN
UBT-PREHISTORY
UBT-PREHISTORY-FN
OOPS-WARNING
[GC for 389 SFUN pages..(T=18).GC finished]
OOPS-FN
OOPS
I-AM-HERE
REBUILD-FN-READ-FILTER
REBUILD-FN
REBUILD
*BASIC-SWEEP-ERROR-STR*
SWEEP-SYMBOL-BINDING-FOR-BAD-SYMBOL
SWEEP-GLOBAL-LST
SWEEP-STACK-ENTRY-FOR-BAD-SYMBOL
[GC for 389 SFUN pages..(T=18).GC finished]
SWEEP-T-STACK
SWEEP-ACL2-ORACLE
SWEEP-GLOBAL-STATE-FOR-LISP-OBJECTS
WET
DISASSEMBLE$
NEAR-MISSES
COMPILE-FUNCTION
KEEP-TMP-FILES
COMP-FN
COMP
COMP-GCL
SCAN-PAST-DEEPER-EVENT-LANDMARKS
[GC for 389 SFUN pages..(T=18).GC finished]
PUFFABLE-ENCAPSULATE-P
PUFFABLE-COMMAND-BLOCKP
PUFFABLE-COMMAND-NUMBERP
PUFF-INCLUDE-BOOK
PUFF-COMMAND-BLOCK1
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PUFF-COMMAND-BLOCK
COMMANDS-BACK-TO-1
COMMANDS-BACK-TO
PUFFED-COMMAND-SEQUENCE
LD-READ-EVAL-PRINT-SIMPLE
LD-LOOP-SIMPLE
[GC for 389 SFUN pages..(T=18).GC finished]
LD-SIMPLE
PUFF-FN1
PUFF-REPORT
PUFF-FN
PUFF*-FN11
[GC for 389 SFUN pages..(T=18).GC finished]
PUFF*-FN1
PUFF*-FN
PUFF
PUFF*
MINI-PROVEALL
SET-GUARD-CHECKING
DMR-STOP-FN
DMR-STOP
DMR-START-FN
DMR-START
*META-LEVEL-FUNCTION-PROBLEM-1*
*META-LEVEL-FUNCTION-PROBLEM-1A*
*META-LEVEL-FUNCTION-PROBLEM-1B*
*META-LEVEL-FUNCTION-PROBLEM-1C*
*META-LEVEL-FUNCTION-PROBLEM-1D*
*META-LEVEL-FUNCTION-PROBLEM-1E*
*META-LEVEL-FUNCTION-PROBLEM-2*
*META-LEVEL-FUNCTION-PROBLEM-3*
T
MFC-TS
MFC-RW
MFC-RW+
MFC-RELIEVE-HYP
MFC-AP
CONGRUENCE-RULE-LISTP
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
TERM-ALISTP-FAILURE-MSG
FIND-RUNED-LINEAR-LEMMA
MFC-FORCE-FLG
UPDATE-RNCST-FOR-FORCEP
PRINT-SAVED-OUTPUT-LST
[GC for 3807 CONS pages..(T=18).GC finished]
PRINT-SAVED-OUTPUT
CONVERT-IO-MARKERS-LST
CONVERT-IO-MARKERS
PSO
PSOG
PSO!
SET-RAW-PROOF-FORMAT
SET-RAW-WARNING-FORMAT
[GC for 389 SFUN pages..(T=18).GC finished]
SET-STANDARD-CO-STATE
SET-PROOFS-CO-STATE
WITH-STANDARD-CO-AND-PROOFS-CO-TO-FILE
WOF
PSOF
DEFUN-FOR-STATE-NAME
DEFUN-FOR-STATE
SET-LD-EVISC-TUPLE
SET-LD-EVISC-TUPLE-STATE
SET-ABBREV-EVISC-TUPLE
SET-ABBREV-EVISC-TUPLE-STATE
[GC for 389 SFUN pages..(T=18).GC finished]
SET-GAG-MODE-EVISC-TUPLE
SET-GAG-MODE-EVISC-TUPLE-STATE
SET-TERM-EVISC-TUPLE
SET-TERM-EVISC-TUPLE-STATE
WITHOUT-EVISC-FN
WITHOUT-EVISC
Finished loading "ld.lisp".
ACL2 loading "proof-builder-b.lisp".
"ACL2"
INSTALL-NEW-PC-META-OR-MACRO
DEFINE-PC-META-OR-MACRO-FN
DEFINE-PC-META
DEFINE-PC-MACRO
DEFINE-PC-ATOMIC-MACRO
TOGGLE-PC-MACRO
DEFINE-PC-PRIMITIVE
[GC for 389 SFUN pages..(T=18).GC finished]
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
NON-BOUNDED-NUMS
DELETE-BY-POSITION
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
CHK-ASSUMPTION-FREE-TTREE-1
PUT-CDR-ASSOC-QUERY-ID
[GC for 389 SFUN pages..(T=18).GC finished]
SET-QUERY-VAL
QUERY-ON-EXIT
REPLAY-QUERY
[GC for 3817 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
[GC for 3827 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3827 CONS pages..(T=18).GC finished]
PRINT-COMMANDS
MAKE-PRETTY-START-INSTR
RAW-INDEXED-INSTRS
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
DEFINE-PC-HELP
EVISC-INDEXED-INSTRS-1
EVISC-INDEXED-INSTRS-REC
MARK-UNFINISHED-INSTRS
EVISC-INDEXED-INSTRS
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
PROMOTE-GUTS
PC-COMMAND-TABLE
REMOVE-BY-INDICES
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
BOUNDED-INTEGER-LISTP
FETCH-TERM-AND-CL
FETCH-TERM
GOVERNORS
TERM-ID-IFF
?
T
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
ABBREVIATIONS-ALIST
(CHK-?S CHK-?S-LST)
REMOVE-?S
TRANSLATE-ABB
TRANS0
[GC for 389 SFUN pages..(T=20).GC finished]
P-BODY
[GC for 448 SYMBOL pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
TAKE-BY-INDICES
[GC for 3827 CONS pages..(T=18).GC finished]
PRINT-HYPS
SOME->
PRINT-HYPS-TOP
PRINT-GOVERNORS-TOP
[GC for 389 SFUN pages..(T=18).GC finished]
PAIR-INDICES
[GC for 3837 CONS pages..(T=18).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
PAIR-KEYWORDS
NULL-POOL
INITIAL-PSPV
PC-PROVE
[GC for 389 SFUN pages..(T=18).GC finished]
SUBLIS-EQUAL
ABBREVIATIONS-ALIST-?
FIND-?-FN
UNPROVED-PC-PROVE-CLAUSES
[GC for 389 SFUN pages..(T=18).GC finished]
PROVER-CALL
MAKE-NEW-GOALS
SAME-GOAL
REMOVE-BYES-FROM-TAG-TREE
[GC for 389 SFUN pages..(T=20).GC finished]
PC-COMMAND-TABLE
ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST-1
ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST
ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST!
*BASH-SKIP-FORCING-ROUND-HINTS*
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
NOT-IN-DOMAIN-EQ
PC-COMMAND-TABLE
[GC for 3847 CONS pages..(T=18).GC finished]
PRINT-ABBREVIATIONS
[GC for 3857 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
DROP-FROM-END
PC-COMMAND-TABLE
[GC for 389 SFUN pages..(T=20).GC finished]
PC-COMMAND-TABLE
EXPAND-ADDRESS-RECURSE
DIVE-ONCE-MORE-ERROR
ABBREVIATION-RAW-TERM-P
ADDR-RECUR
OR-ADDR
AND-ADDR
DIVE-INTO-MACROS-TABLE
ADD-DIVE-INTO-MACRO
REMOVE-DIVE-INTO-MACRO
DIVE-INTO-MACROS-TABLE
RASSOC-EQ-AS-CAR
*CA<D^N>R-ALIST*
CAR/CDR^N
[GC for 3857 CONS pages..(T=18).GC finished]
[GC for 3857 CONS pages..(T=18).GC finished]
EXPAND-ADDRESS
DV-ERROR
PC-COMMAND-TABLE
(DEPOSIT-TERM DEPOSIT-TERM-LST)
GENEQV-AT-SUBTERM
GENEQV-AT-SUBTERM-TOP
[GC for 3867 CONS pages..(T=18).GC finished]
MAYBE-TRUNCATE-CURRENT-ADDRESS
DEPOSIT-TERM-IN-GOAL
SPLIT-IMPLIES
FIND-EQUIVALENCE-HYP-TERM
[GC for 3867 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PRINT-ON-SEPARATE-LINES
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=20).GC finished]
MODIFIED-ERROR-TRIPLE-FOR-SEQUENCE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
EXTRACT-GOAL
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=18).GC finished]
CHANGE-BY-POSITION
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
DEFINE-PC-BIND*
[GC for 3877 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3877 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
FIND-EQUIVALENCE-HYP-TERM-NO-TARGET
PC-COMMAND-TABLE
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
APPLICABLE-REWRITE-RULES
[GC for 3887 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3897 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
TRANSLATE-SUBST-ABB1
SINGLE-VALUED-SYMBOLP-ALISTP
[GC for 3897 CONS pages..(T=20).GC finished]
CHECK-CARS-ARE-VARIABLES
TRANSLATE-SUBST-ABB
MAKE-REWRITE-INSTR
[GC for 3897 CONS pages..(T=18).GC finished]
[GC for 3897 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
APPLICABLE-LINEAR-RULES
MAKE-LINEAR-INSTR
[GC for 3907 CONS pages..(T=18).GC finished]
[GC for 3907 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3917 CONS pages..(T=18).GC finished]
PC-REWRITE*-1
PC-REWRITE*
MAKE-GOALS-FROM-ASSUMPTIONS
MAKE-NEW-GOALS-FROM-ASSUMPTIONS
*DEFAULT-S-REPEAT-LIMIT*
HYPS-TYPE-ALIST-AND-POT-LST
[GC for 3917 CONS pages..(T=20).GC finished]
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
BUILD-PC-ENABLED-STRUCTURE-FROM-ENS
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
CHANGE-LAST
[GC for 3917 CONS pages..(T=18).GC finished]
ASSIGN-EVENT-NAME-AND-RULE-CLASSES
SAVE-FN
PC-COMMAND-TABLE
RETRIEVE
PC-COMMAND-TABLE
UNSAVE-FN
UNSAVE
[GC for 3917 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
SHOW-RETRIEVED-GOAL
[GC for 3917 CONS pages..(T=18).GC finished]
RETRIEVE-FN
PRINT-ALL-GOALS
PC-COMMAND-TABLE
PRINT-CONC
PRINT-ALL-CONCS
[GC for 3927 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
GEN-VAR-MARKER
TRANSLATE-GENERALIZE-ALIST-1
NON-GEN-VAR-MARKERS
FIND-DUPLICATE-GENERALIZE-ENTRIES
TRANSLATE-GENERALIZE-ALIST-2
TRANSLATE-GENERALIZE-ALIST
ALL-VARS-GOALS
[GC for 399 SFUN pages..(T=20).GC finished]
PC-STATE-VARS
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3927 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
RUN-INSTR-ON-GOALS-GUTS
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 399 SFUN pages..(T=18).GC finished]
PC-COMMAND-TABLE
INSTR-NAME
PC-FREE-INSTR-P
FIND-POSSIBLE-PUT
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 399 SFUN pages..(T=20).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
SAVE-FC-REPORT-SETTINGS
RESTORE-FC-REPORT-SETTINGS
[GC for 3927 CONS pages..(T=18).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
ACL2-WRAP
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3937 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
GOAL-TERMS
WRAP1-AUX1
[GC for 399 SFUN pages..(T=18).GC finished]
WRAP1-AUX2
PC-COMMAND-TABLE
PC-COMMAND-TABLE
PC-COMMAND-TABLE
[GC for 3947 CONS pages..(T=20).GC finished]
PC-COMMAND-TABLE
PC-COMMAND-TABLE
SHOW-GENEQV
PC-COMMAND-TABLE
GOALS-TO-CLAUSE-LIST
[GC for 782 RELOCATABLE-BLOCKS pages..(T=20).GC finished]
PROOF-BUILDER-CLAUSE-LIST
TTREE-TO-SUMMARY-DATA
[GC for 3947 CONS pages..(T=18).GC finished]
PROOF-BUILDER-CL-PROC-1
PROOF-BUILDER-CL-PROC
T
((:INSTRUCTIONS
(SPLICE-KEYWORD-ALIST :INSTRUCTIONS
(LIST :CLAUSE-PROCESSOR (LIST :FUNCTION # :HINT #))
KEYWORD-ALIST)
(VALUE T)))
Finished loading "proof-builder-b.lisp".
ACL2 loading "defpkgs.lisp".
"ACL2"
*ACL2-EXPORTS*
[GC for 3957 CONS pages..(T=18).GC finished]
[GC for 3957 CONS pages..(T=20).GC finished]
"ACL2-USER"
Finished loading "defpkgs.lisp".
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(RUNES AVOID-FNS WRLD ANS)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# ANS) (T #)))
(DEFCONST *APPLY$-USERFN-CALLERS*
'(APPLY$ EV$ APPLY$-USERFN))
(DEFCONST *BLACKLISTED-APPLY$-FNS*
'(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL
SYS-CALL HONS-CLEAR! HONS-WASH! ...))
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES
(WORLD)
(DECLARE (XARGS :MODE :PROGRAM))
(FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(FUNCTION-THEORY :HERE)
*BLACKLISTED-APPLY$-FNS* WORLD NIL))
(WHEN-PASS-2 (MAKE-EVENT (CONS # #)))
(DEFUN COMPUTE-BADGE-OF-PRIMITIVES
(TERMS-AND-OUT-ARITIES)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# NIL) (T #)))
...).
"ACL2"
FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
*APPLY$-USERFN-CALLERS*
*BLACKLISTED-APPLY$-FNS*
FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES
NIL
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
COMPUTE-BADGE-OF-PRIMITIVES
NIL
APPLY$-BADGEP
N-CAR-CADR-CADDR-ETC
MAKE-APPLY$-PRIM-BODY-FN
NIL
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(RUNES AVOID-FNS WRLD ANS)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# ANS) (T #)))
(DEFCONST *APPLY$-USERFN-CALLERS*
'(APPLY$ EV$ APPLY$-USERFN))
(DEFCONST *BLACKLISTED-APPLY$-FNS*
'(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL
SYS-CALL HONS-CLEAR! HONS-WASH! ...))
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES
(WORLD)
(DECLARE (XARGS :MODE :PROGRAM))
(FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(FUNCTION-THEORY :HERE)
*BLACKLISTED-APPLY$-FNS* WORLD NIL))
(WHEN-PASS-2 (MAKE-EVENT (CONS # #)))
(DEFUN COMPUTE-BADGE-OF-PRIMITIVES
(TERMS-AND-OUT-ARITIES)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# NIL) (T #)))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (ENCAPSULATE (#)
(LOCAL #)
(DEFTHM BADGE-USERFN-TYPE #
:RULE-CLASSES #))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
:RULE-CLASSES NIL))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
:RULE-CLASSES #))
(DEFSTUB UNTAME-EV$ (X A) T)
(DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
(CONS # #)))).
"ACL2"
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (ENCAPSULATE (#)
(LOCAL #)
(DEFTHM BADGE-USERFN-TYPE #
:RULE-CLASSES #))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
:RULE-CLASSES NIL))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
:RULE-CLASSES #))
(DEFSTUB UNTAME-EV$ (X A) T)
(DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
(CONS # #)))).
ACL2 loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (DEFUN BADGE (FN)
(DECLARE #)
(COND # # # # # # ...))
(IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
(IN-THEORY (DISABLE BADGE))
(DEFABBREV TAMEP-LAMBDAP (FN)
(AND # # #))
(MUTUAL-RECURSION (DEFUN TAMEP # # #)
(DEFUN TAMEP-FUNCTIONP # # #)
(DEFUN SUITABLY-TAMEP-LISTP # # #))
(MUTUAL-RECURSION (DEFUN APPLY$ # # #)
(DEFUN APPLY$-LAMBDA # # #)
(DEFUN EV$ # # #)
(DEFUN EV$-LIST # # #))
...)).
"ACL2"
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (DEFUN BADGE (FN)
(DECLARE #)
(COND # # # # # # ...))
(IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
(IN-THEORY (DISABLE BADGE))
(DEFABBREV TAMEP-LAMBDAP (FN)
(AND # # #))
(MUTUAL-RECURSION (DEFUN TAMEP # # #)
(DEFUN TAMEP-FUNCTIONP # # #)
(DEFUN SUITABLY-TAMEP-LISTP # # #))
(MUTUAL-RECURSION (DEFUN APPLY$ # # #)
(DEFUN APPLY$-LAMBDA # # #)
(DEFUN EV$ # # #)
(DEFUN EV$-LIST # # #))
...)).
[GC for 13312 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
[GC for 782 RELOCATABLE-BLOCKS pages..(T=18).GC finished]
ACL2 loading '((LOGIC)).
Finished loading '((LOGIC)).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
'(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
&AUX *PRINT-PPRINT-DISPATCH*
&BODY *PRINT-PRETTY* &ENVIRONMENT ...))
(DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
'(* ** *** *BREAK-ON-SIGNALS*
*COMPILE-FILE-PATHNAME*
*COMPILE-FILE-TRUENAME*
*COMPILE-PRINT* ...))
(DEFCONST
NIL 'NIL
" NIL, a symbol, represents in Common Lisp both the false truth value
and the empty list.")
(DEFCONST T 'T
"T, a symbol, represents the true truth value in Common Lisp.")
(DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
(DEFMACRO MAKE-PACKAGE-ENTRY
(&KEY NAME IMPORTS HIDDEN-P
BOOK-PATH DEFPKG-EVENT-FORM TTERM)
(CONS 'LIST* (CONS NAME #)))
...).
"ACL2"
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 977 RELOCATABLE-BLOCKS pages..(T=22).GC finished]
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
IFF
XOR
:REDUNDANT
:REDUNDANT
IFF-IS-AN-EQUIVALENCE
:REDUNDANT
IFF-IMPLIES-EQUAL-IMPLIES-1
IFF-IMPLIES-EQUAL-IMPLIES-2
:REDUNDANT
IFF-IMPLIES-EQUAL-NOT
HIDE
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
LIST-MACRO
:REDUNDANT
AND-MACRO
:REDUNDANT
OR-MACRO
:REDUNDANT
:REDUNDANT
BOOLEANP-COMPOUND-RECOGNIZER
(:NUMBER-OF-ENABLED-RUNES 724)
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
COND-CLAUSESP
COND-MACRO
:REDUNDANT
:REDUNDANT
EQLABLEP-RECOG
(:NUMBER-OF-ENABLED-RUNES 732)
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=20).GC finished]
MAKE-CHARACTER-LIST
:REDUNDANT
:REDUNDANT
ALISTP-FORWARD-TO-TRUE-LISTP
EQLABLE-ALISTP-FORWARD-TO-ALISTP
ACONS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP
SYMBOL-DOUBLET-LISTP
REVERSE-STRIP-CARS
:REDUNDANT
REVERSE-STRIP-CDRS
STRIP-CDRS
:REDUNDANT
[GC for 399 SFUN pages..(T=20).GC finished]
ILLEGAL
:REDUNDANT
RETURN-LAST-FN
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
TRUE-LISTP-APPEND
CAR-CDR-ELIM
CAR-CONS
CDR-CONS
CONS-EQUAL
APPEND-TO-NIL
:REDUNDANT
:REDUNDANT
STRING-LISTP
STRING-APPEND-LST
GUARD-CHECK-FN
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
MEMBER-EQ-EXEC
:REDUNDANT
:REDUNDANT
:REDUNDANT
MEMBER-EQ-EXEC-IS-MEMBER-EQUAL
MEMBER-EQL-EXEC-IS-MEMBER-EQUAL
:REDUNDANT
[GC for 399 SFUN pages..(T=20).GC finished]
SUBSETP-EQ-EXEC
:REDUNDANT
:REDUNDANT
:REDUNDANT
SUBSETP-EQ-EXEC-IS-SUBSETP-EQUAL
SUBSETP-EQL-EXEC-IS-SUBSETP-EQUAL
:REDUNDANT
:REDUNDANT
SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP
CHARACTER-ALISTP
CHARACTER-ALISTP-FORWARD-TO-EQLABLE-ALISTP
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
ASSOC-EQ-EXEC-IS-ASSOC-EQUAL
ASSOC-EQL-EXEC-IS-ASSOC-EQUAL
:REDUNDANT
ASSOC-EQ-EQUAL-ALISTP
ASSOC-EQ-EQUAL
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
ZP-COMPOUND-RECOGNIZER
ZP-OPEN
(:NUMBER-OF-ENABLED-RUNES 816)
:REDUNDANT
ZIP-COMPOUND-RECOGNIZER
ZIP-OPEN
[GC for 3957 CONS pages..(T=20).GC finished]
(:NUMBER-OF-ENABLED-RUNES 817)
:REDUNDANT
:REDUNDANT
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=28).GC finished]
SLEEP
PROPER-CONSP
IMPROPER-CONSP
:REDUNDANT
CONJUGATE
ADD-SUFFIX
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
CLOSURE
ASSOCIATIVITY-OF-+
COMMUTATIVITY-OF-+
FIX
UNICITY-OF-0
INVERSE-OF-+
ASSOCIATIVITY-OF-*
COMMUTATIVITY-OF-*
UNICITY-OF-1
INVERSE-OF-*
DISTRIBUTIVITY
<-ON-OTHERS
ZERO
TRICHOTOMY
POSITIVE
RATIONAL-IMPLIES1
RATIONAL-IMPLIES2
INTEGER-IMPLIES-RATIONAL
COMPLEX-IMPLIES1
COMPLEX-DEFINITION
(:NUMBER-OF-ENABLED-RUNES 845)
NONZERO-IMAGPART
REALPART-IMAGPART-ELIM
REALPART-COMPLEX
IMAGPART-COMPLEX
COMPLEX-EQUAL
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 3967 CONS pages..(T=20).GC finished]
(:NUMBER-OF-ENABLED-RUNES 849)
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
EXTRA-INFO
(:NUMBER-OF-ENABLED-RUNES 849)
:REDUNDANT
:REDUNDANT
:REDUNDANT
(:NUMBER-OF-ENABLED-RUNES 849)
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
NONNEGATIVE-PRODUCT
INTEGER-0
INTEGER-1
INTEGER-STEP
LOWEST-TERMS
BASIC-TAU-RULES
BOOLEANP-CHARACTERP
CHARACTERP-PAGE
CHARACTERP-TAB
CHARACTERP-RUBOUT
CHARACTERP-RETURN
NO-DUPLICATESP-EQ-EXEC
[GC for 3977 CONS pages..(T=22).GC finished]
NO-DUPLICATESP-EQL-EXEC
NO-DUPLICATESP-EQUAL
:REDUNDANT
NO-DUPLICATESP-EQ-EXEC-IS-NO-DUPLICATESP-EQUAL
NO-DUPLICATESP-EQL-EXEC-IS-NO-DUPLICATESP-EQUAL
:REDUNDANT
CHK-NO-DUPLICATESP
R-EQLABLE-ALISTP
R-SYMBOL-ALISTP
[GC for 399 SFUN pages..(T=22).GC finished]
RASSOC-EQ-EXEC
RASSOC-EQL-EXEC
RASSOC-EQUAL
:REDUNDANT
RASSOC-EQ-EXEC-IS-RASSOC-EQUAL
RASSOC-EQL-EXEC-IS-RASSOC-EQUAL
:REDUNDANT
:REDUNDANT
STANDARD-CHAR-P
[GC for 399 SFUN pages..(T=20).GC finished]
STANDARD-CHAR-P+
STANDARD-CHAR-LISTP
CHARACTER-LISTP
CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP
STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP
COERCE-INVERSE-1
COERCE-INVERSE-2
CHARACTER-LISTP-COERCE
(:NUMBER-OF-ENABLED-RUNES 919)
STRING
ALPHA-CHAR-P
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=30).GC finished]
UPPER-CASE-P
LOWER-CASE-P
CHAR-UPCASE
CHAR-DOWNCASE
LOWER-CASE-P-CHAR-DOWNCASE
UPPER-CASE-P-CHAR-UPCASE
LOWER-CASE-P-FORWARD-TO-ALPHA-CHAR-P
UPPER-CASE-P-FORWARD-TO-ALPHA-CHAR-P
ALPHA-CHAR-P-FORWARD-TO-STANDARD-CHAR-P
[GC for 3987 CONS pages..(T=22).GC finished]
STANDARD-CHAR-P-FORWARD-TO-CHARACTERP
CHARACTERP-CHAR-DOWNCASE
CHARACTERP-CHAR-UPCASE
(:NUMBER-OF-ENABLED-RUNES 940)
STRING-DOWNCASE1
CHARACTER-LISTP-STRING-DOWNCASE-1
STRING-DOWNCASE
STRING-UPCASE1
CHARACTER-LISTP-STRING-UPCASE1-1
STRING-UPCASE
[GC for 399 SFUN pages..(T=22).GC finished]
OUR-DIGIT-CHAR-P
:REDUNDANT
CHAR-EQUAL
ATOM-LISTP
ATOM-LISTP-FORWARD-TO-TRUE-LISTP
EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP
GOOD-ATOM-LISTP
GOOD-ATOM-LISTP-FORWARD-TO-ATOM-LISTP
CHARACTERP-NTH
:REDUNDANT
RFIX
REALFIX
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
NATP-COMPOUND-RECOGNIZER
NAT-ALISTP
NAT-ALISTP-FORWARD-TO-EQLABLE-ALISTP
[GC for 3997 CONS pages..(T=22).GC finished]
STANDARD-STRING-P1
STANDARD-STRING-P
STANDARD-STRING-LISTP
:REDUNDANT
:REDUNDANT
:REDUNDANT
STANDARD-STRING-ALISTP
STANDARD-STRING-ALISTP-FORWARD-TO-ALISTP
:REDUNDANT
:REDUNDANT
BITP-COMPOUND-RECOGNIZER
BITP-AS-INEQUALITY
:REDUNDANT
POSP-COMPOUND-RECOGNIZER
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
O-P
O-P-IMPLIES-O<G
[GC for 4007 CONS pages..(T=22).GC finished]
O-P
MAKE-ORD
LIST*-MACRO
:REDUNDANT
THROW-OR-ATTACH-CALL
NULL-BODY-ER
:REDUNDANT
:REDUNDANT
STRINGP-SYMBOL-PACKAGE-NAME
SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL
SYMBOLP-PKG-WITNESS
:REDUNDANT
:REDUNDANT
KEYWORDP
KEYWORDP-FORWARD-TO-SYMBOLP
INTERN-IN-PACKAGE-OF-SYMBOL-SYMBOL-NAME
SYMBOL-PACKAGE-NAME-OF-SYMBOL-IS-NOT-EMPTY-STRING
:REDUNDANT
SYMBOL-NAME-PKG-WITNESS
SYMBOL-PACKAGE-NAME-PKG-WITNESS-NAME
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=30).GC finished]
MEMBER-SYMBOL-NAME
(:NUMBER-OF-ENABLED-RUNES 1036)
SYMBOL-EQUALITY
SYMBOL-NAME-INTERN-IN-PACKAGE-OF-SYMBOL
SYMBOL-PACKAGE-NAME-INTERN-IN-PACKAGE-OF-SYMBOL
INTERN-IN-PACKAGE-OF-SYMBOL-IS-IDENTITY
SYMBOL-LISTP-PKG-IMPORTS
NO-DUPLICATESP-EQ-PKG-IMPORTS
[GC for 458 SYMBOL pages..(T=20).GC finished]
COMPLETION-OF-PKG-IMPORTS
DEFAULT-PKG-IMPORTS
ACL2-INPUT-CHANNEL-PACKAGE
ACL2-OUTPUT-CHANNEL-PACKAGE
ACL2-PACKAGE
KEYWORD-PACKAGE
STRING-IS-NOT-CIRCULAR
NIL-IS-NOT-CIRCULAR
STANDARD-CHAR-LISTP-APPEND
CHARACTER-LISTP-APPEND
CONS-WITH-HINT
REMOVE-EQ-EXEC
[GC for 4017 CONS pages..(T=20).GC finished]
REMOVE-EQL-EXEC
REMOVE-EQUAL
:REDUNDANT
REMOVE-EQ-EXEC-IS-REMOVE-EQUAL
REMOVE-EQL-EXEC-IS-REMOVE-EQUAL
:REDUNDANT
REMOVE1-EQ-EXEC
[GC for 4027 CONS pages..(T=22).GC finished]
REMOVE1-EQL-EXEC
REMOVE1-EQUAL
:REDUNDANT
REMOVE1-EQ-EXEC-IS-REMOVE1-EQUAL
REMOVE1-EQL-EXEC-IS-REMOVE1-EQUAL
:REDUNDANT
REMOVE-DUPLICATES-EQ-EXEC
REMOVE-DUPLICATES-EQL-EXEC
[GC for 399 SFUN pages..(T=22).GC finished]
REMOVE-DUPLICATES-EQUAL
:REDUNDANT
REMOVE-DUPLICATES-EQ-EXEC-IS-REMOVE-DUPLICATES-EQUAL
REMOVE-DUPLICATES-EQL-EXEC-IS-REMOVE-DUPLICATES-EQUAL
:REDUNDANT
:REDUNDANT
CHARACTER-LISTP-REMOVE-DUPLICATES
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
IDENTITY
:REDUNDANT
TRUE-LISTP-REVAPPEND-TYPE-PRESCRIPTION
CHARACTER-LISTP-REVAPPEND
REVERSE
PAIRLIS$-TAILREC
[GC for 4037 CONS pages..(T=20).GC finished]
PAIRLIS$
PAIRLIS$-TAILREC-IS-PAIRLIS$
PAIRLIS$
SET-DIFFERENCE-EQ-EXEC
SET-DIFFERENCE-EQL-EXEC
[GC for 399 SFUN pages..(T=22).GC finished]
SET-DIFFERENCE-EQUAL
:REDUNDANT
SET-DIFFERENCE-EQ-EXEC-IS-SET-DIFFERENCE-EQUAL
SET-DIFFERENCE-EQL-EXEC-IS-SET-DIFFERENCE-EQUAL
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
LAST
:REDUNDANT
TRUE-LISTP-FIRST-N-AC-TYPE-PRESCRIPTION
:REDUNDANT
T
TRUE-LISTP-TAKE
BUTLAST
:REDUNDANT
:REDUNDANT
MUTUAL-RECURSION-GUARDP
COLLECT-CADRS-WHEN-CAR-EQ
:REDUNDANT
VALUE-TRIPLE-FN
:REDUNDANT
:REDUNDANT
[GC for 4047 CONS pages..(T=22).GC finished]
XD-NAME
DEFUND-NAME-LIST
THROW-NONEXEC-ERROR
DEFUN-NX-FN
:REDUNDANT
:REDUNDANT
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1
[GC for 4057 CONS pages..(T=22).GC finished]
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
KEYWORD-VALUE-LISTP
KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP
ASSOC-KEYWORD
PROGRAM-DECLARED-P2
PROGRAM-DECLARED-P1
PROGRAM-DECLARED-P
[GC for 399 SFUN pages..(T=22).GC finished]
TRUE-LIST-LISTP
TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP
SOME-PROGRAM-DECLARED-P
:REDUNDANT
:REDUNDANT
PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP
:EMPTY-ENCAPSULATE
PSEUDO-TERM-LIST-LISTP
:REDUNDANT
ADD-TO-SET-EQ-EXEC
[GC for 399 SFUN pages..(T=20).GC finished]
ADD-TO-SET-EQL-EXEC
ADD-TO-SET-EQUAL
:REDUNDANT
:REDUNDANT
ADD-TO-SET-EQ-EXEC-IS-ADD-TO-SET-EQUAL
ADD-TO-SET-EQL-EXEC-IS-ADD-TO-SET-EQUAL
(:NUMBER-OF-ENABLED-RUNES 1238)
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
QUOTEP
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
KWOTE
MAYBE-KWOTE
KWOTE-LST
:REDUNDANT
[GC for 977 RELOCATABLE-BLOCKS pages..(T=22).GC finished]
LAMBDA-OBJECT-FORMALS
LAMBDA-OBJECT-DCL
LAMBDA-OBJECT-BODY
LAMBDA-OBJECT-SHAPEP
MAKE-LAMBDA-OBJECT
:REDUNDANT
FN-SYMB
:REDUNDANT
:REDUNDANT
[GC for 4067 CONS pages..(T=22).GC finished]
(ALL-VARS1 ALL-VARS1-LST)
ALL-VARS
:REDUNDANT
INTERSECTP-EQ-EXEC
[GC for 4077 CONS pages..(T=22).GC finished]
INTERSECTP-EQL-EXEC
INTERSECTP-EQUAL
:REDUNDANT
INTERSECTP-EQ-EXEC-IS-INTERSECTP-EQUAL
INTERSECTP-EQL-EXEC-IS-INTERSECTP-EQUAL
:REDUNDANT
MAKE-FMT-BINDINGS
:REDUNDANT
:REDUNDANT
:REDUNDANT
CHECK-VARS-NOT-FREE-TEST
:REDUNDANT
ER-PROGN-FN
:REDUNDANT
[GC for 4087 CONS pages..(T=20).GC finished]
LEGAL-CASE-CLAUSESP
CASE-TEST
CASE-LIST
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
CASE-LIST-CHECK
:REDUNDANT
POSITION-AC-EQ-EXEC
POSITION-AC-EQL-EXEC
POSITION-EQUAL-AC
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=22).GC finished]
POSITION-AC-EQ-EXEC-IS-POSITION-EQUAL-AC
POSITION-AC-EQL-EXEC-IS-POSITION-EQUAL-AC
:REDUNDANT
POSITION-EQ-EXEC
POSITION-EQL-EXEC
POSITION-EQUAL
:REDUNDANT
POSITION-EQ-EXEC-IS-POSITION-EQUAL
POSITION-EQL-EXEC-IS-POSITION-EQUAL
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=22).GC finished]
LEGAL-LET*-P
WELL-FORMED-TYPE-DECLS-P
SYMBOL-LIST-LISTP
GET-TYPE-DECLS
[GC for 4097 CONS pages..(T=22).GC finished]
LET*-MACRO
COLLECT-CDRS-WHEN-CAR-EQ
APPEND-LST
[GC for 4107 CONS pages..(T=22).GC finished]
RESTRICT-ALIST
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=22).GC finished]
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=30).GC finished]
[GC for 399 SFUN pages..(T=22).GC finished]
LOGNOT
T
STANDARD-CHAR-P-NTH
STRING-EQUAL
ASSOC-STRING-EQUAL
[GC for 399 SFUN pages..(T=22).GC finished]
MEMBER-STRING-EQUAL
XXXJOIN
:REDUNDANT
EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE
RATIONALP-EXPT-TYPE-PRESCRIPTION
[GC for 4117 CONS pages..(T=22).GC finished]
LOGBITP
ASH
CHAR-CODE-LINEAR
CODE-CHAR-TYPE
CODE-CHAR-CHAR-CODE-IS-IDENTITY
CHAR-CODE-CODE-CHAR-IS-IDENTITY
CHAR<
CHAR>
CHAR<=
CHAR>=
[GC for 399 SFUN pages..(T=22).GC finished]
STRING<-L
STRING<
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
STRING>
STRING<=
STRING>=
SYMBOL-<
STRING<-L-IRREFLEXIVE
STRING<-IRREFLEXIVE
SUBSTITUTE-AC
[GC for 4127 CONS pages..(T=22).GC finished]
SUBSTITUTE
STRINGP-SUBSTITUTE-TYPE-PRESCRIPTION
TRUE-LISTP-SUBSTITUTE-TYPE-PRESCRIPTION
:REDUNDANT
SUBST
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
PLIST-WORLDP-FORWARD-TO-ASSOC-EQ-EQUAL-ALISTP
[GC for 4137 CONS pages..(T=22).GC finished]
PUTPROP
:REDUNDANT
GETPROP-DEFAULT
:REDUNDANT
:REDUNDANT
ORDERED-SYMBOL-ALISTP
(:NUMBER-OF-ENABLED-RUNES 1532)
ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP
ADD-PAIR
[GC for 399 SFUN pages..(T=22).GC finished]
REMOVE1-ASSOC-EQ-EXEC
REMOVE1-ASSOC-EQL-EXEC
REMOVE1-ASSOC-EQUAL
:REDUNDANT
REMOVE1-ASSOC-EQ-EXEC-IS-REMOVE1-ASSOC-EQUAL
REMOVE1-ASSOC-EQL-EXEC-IS-REMOVE1-ASSOC-EQUAL
:REDUNDANT
REMOVE-ASSOC-EQ-EXEC
[GC for 399 SFUN pages..(T=22).GC finished]
REMOVE-ASSOC-EQL-EXEC
REMOVE-ASSOC-EQUAL
:REDUNDANT
REMOVE-ASSOC-EQ-EXEC-IS-REMOVE-ASSOC-EQUAL
REMOVE-ASSOC-EQL-EXEC-IS-REMOVE-ASSOC-EQUAL
:REDUNDANT
GETPROPS1
:REDUNDANT
[GC for 4147 CONS pages..(T=22).GC finished]
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
GETPROPS
(:NUMBER-OF-ENABLED-RUNES 1584)
EQUAL-CHAR-CODE
HAS-PROPSP1
HAS-PROPSP
EXTEND-WORLD
RETRACT-WORLD
[GC for 4157 CONS pages..(T=22).GC finished]
GLOBAL-VAL
:REDUNDANT
:REDUNDANT
CONJOIN2
CONJOIN
CONJOIN-UNTRANSLATED-TERMS
DISJOIN2
[GC for 399 SFUN pages..(T=22).GC finished]
DISJOIN
DISJOIN-LST
KWOTE?
CONJOIN?
<=?
>?
[GC for 399 SFUN pages..(T=22).GC finished]
DISJOIN?
:REDUNDANT
:REDUNDANT
WEAK-SATISFIES-TYPE-SPEC-P
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
THE-CHECK
:REDUNDANT
:REDUNDANT
THE-CHECK-FOR-*1*
:REDUNDANT
:REDUNDANT
:REDUNDANT
BOUNDED-INTEGER-ALISTP
BOUNDED-INTEGER-ALISTP-FORWARD-TO-EQLABLE-ALISTP
KEYWORD-VALUE-LISTP-ASSOC-KEYWORD
CONSP-ASSOC-EQUAL
:REDUNDANT
ARRAY1P
ARRAY1P-FORWARD
[GC for 4167 CONS pages..(T=22).GC finished]
ARRAY1P-LINEAR
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
BOUNDED-INTEGER-ALISTP2
ASSOC2
ARRAY2P
ARRAY2P-FORWARD
ARRAY2P-LINEAR
HEADER
DIMENSIONS
[GC for 4177 CONS pages..(T=22).GC finished]
MAXIMUM-LENGTH
DEFAULT
AREF1
COMPRESS11
[GC for 977 RELOCATABLE-BLOCKS pages..(T=22).GC finished]
ARRAY-ORDER
COMPRESS1
ARRAY1P-CONS
ASET1
AREF2
COMPRESS211
[GC for 399 SFUN pages..(T=22).GC finished]
COMPRESS21
COMPRESS2
ARRAY2P-CONS
ASET2
FLUSH-COMPRESS
MAYBE-FLUSH-AND-COMPRESS1
[GC for 399 SFUN pages..(T=22).GC finished]
CDRN
MV-NTH
MAKE-MV-NTHS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
UPDATE-NTH
UPDATE-NTH-ARRAY
:REDUNDANT
:REDUNDANT
32-BIT-INTEGERP
32-BIT-INTEGERP-FORWARD-TO-INTEGERP
ACL2-NUMBER-LISTP
ACL2-NUMBER-LISTP-FORWARD-TO-TRUE-LISTP
RATIONAL-LISTP
RATIONAL-LISTP-FORWARD-TO-ACL2-NUMBER-LISTP
INTEGER-LISTP
INTEGER-LISTP-FORWARD-TO-RATIONAL-LISTP
[GC for 399 SFUN pages..(T=22).GC finished]
NAT-LISTP
NAT-LISTP-FORWARD-TO-INTEGER-LISTP
32-BIT-INTEGER-LISTP
32-BIT-INTEGER-LISTP-FORWARD-TO-INTEGER-LISTP
OPEN-INPUT-CHANNELS
UPDATE-OPEN-INPUT-CHANNELS
OPEN-OUTPUT-CHANNELS
UPDATE-OPEN-OUTPUT-CHANNELS
[GC for 399 SFUN pages..(T=22).GC finished]
GLOBAL-TABLE
UPDATE-GLOBAL-TABLE
T-STACK
UPDATE-T-STACK
32-BIT-INTEGER-STACK
[GC for 4187 CONS pages..(T=22).GC finished]
UPDATE-32-BIT-INTEGER-STACK
BIG-CLOCK-ENTRY
UPDATE-BIG-CLOCK-ENTRY
IDATES
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
UPDATE-IDATES
ACL2-ORACLE
UPDATE-ACL2-ORACLE
FILE-CLOCK
UPDATE-FILE-CLOCK
READABLE-FILES
[GC for 399 SFUN pages..(T=22).GC finished]
WRITTEN-FILES
UPDATE-WRITTEN-FILES
READ-FILES
UPDATE-READ-FILES
WRITEABLE-FILES
[GC for 399 SFUN pages..(T=22).GC finished]
LIST-ALL-PACKAGE-NAMES-LST
UPDATE-LIST-ALL-PACKAGE-NAMES-LST
USER-STOBJ-ALIST1
UPDATE-USER-STOBJ-ALIST1
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
UNTOUCHABLE-MARKER
:REDUNDANT
:REDUNDANT
[GC for 4197 CONS pages..(T=24).GC finished]
INIT-IPRINT-AR
:REDUNDANT
:REDUNDANT
DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
:REDUNDANT
:REDUNDANT
:REDUNDANT
T
:REDUNDANT
ALL-BOUNDP
KNOWN-PACKAGE-ALISTP
KNOWN-PACKAGE-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
TIMER-ALISTP
TIMER-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-SYMBOL-ALISTP
[GC for 4207 CONS pages..(T=22).GC finished]
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
TYPED-IO-LISTP
TYPED-IO-LISTP-FORWARD-TO-TRUE-LISTP
:REDUNDANT
OPEN-CHANNEL1
OPEN-CHANNEL1-FORWARD-TO-TRUE-LISTP-AND-CONSP
OPEN-CHANNEL-LISTP
OPEN-CHANNELS-P
OPEN-CHANNELS-P-FORWARD
FILE-CLOCK-P
FILE-CLOCK-P-FORWARD-TO-INTEGERP
READABLE-FILE
READABLE-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP
[GC for 399 SFUN pages..(T=22).GC finished]
READABLE-FILES-LISTP
READABLE-FILES-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
READABLE-FILES-P
READABLE-FILES-P-FORWARD-TO-READABLE-FILES-LISTP
WRITTEN-FILE
WRITTEN-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP
WRITTEN-FILE-LISTP
WRITTEN-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP
WRITTEN-FILES-P
WRITTEN-FILES-P-FORWARD-TO-WRITTEN-FILE-LISTP
[GC for 4217 CONS pages..(T=22).GC finished]
READ-FILE-LISTP1
READ-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP
READ-FILE-LISTP
READ-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP
READ-FILES-P
READ-FILES-P-FORWARD-TO-READ-FILE-LISTP
WRITABLE-FILE-LISTP1
WRITABLE-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP
WRITABLE-FILE-LISTP
WRITABLE-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP
[GC for 4227 CONS pages..(T=22).GC finished]
WRITEABLE-FILES-P
WRITEABLE-FILES-P-FORWARD-TO-WRITABLE-FILE-LISTP
STATE-P1
STATE-P1-FORWARD
STATE-P
(:NUMBER-OF-ENABLED-RUNES 1959)
STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
:REDUNDANT
:REDUNDANT
[GC for 4237 CONS pages..(T=22).GC finished]
BUILD-STATE1
COERCE-STATE-TO-OBJECT
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
COERCE-OBJECT-TO-STATE
CREATE-STATE
GLOBAL-TABLE-CARS1
GLOBAL-TABLE-CARS
BOUNDP-GLOBAL1
[GC for 399 SFUN pages..(T=22).GC finished]
BOUNDP-GLOBAL
:REDUNDANT
MAKUNBOUND-GLOBAL
GET-GLOBAL
PUT-GLOBAL
:REDUNDANT
:REDUNDANT
[GC for 4247 CONS pages..(T=22).GC finished]
ALWAYS-BOUNDP-GLOBAL
STATE-GLOBAL-LET*-BINDINGS-P
STATE-GLOBAL-LET*-GET-GLOBALS
STATE-GLOBAL-LET*-PUT-GLOBALS
[GC for 4257 CONS pages..(T=22).GC finished]
STATE-GLOBAL-LET*-CLEANUP
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
INTEGER-RANGE-P
NIL
SIGNED-BYTE-P
UNSIGNED-BYTE-P
INTEGER-RANGE-P-FORWARD
SIGNED-BYTE-P-FORWARD-TO-INTEGERP
UNSIGNED-BYTE-P-FORWARD-TO-NONNEGATIVE-INTEGERP
:REDUNDANT
ZPF
NIL
SUBSTITUTE
NIL
ALL-VARS1
ALL-VARS
NIL
CHECK-VARS-NOT-FREE-TEST
[GC for 4267 CONS pages..(T=22).GC finished]
T
NIL
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
INTEGER-LENGTH
BINARY-LOGAND
LOGNAND
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
BINARY-LOGIOR
LOGORC1
LOGORC2
LOGANDC1
LOGANDC2
[GC for 399 SFUN pages..(T=24).GC finished]
BINARY-LOGEQV
BINARY-LOGXOR
LOGNOR
LOGTEST
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 4277 CONS pages..(T=24).GC finished]
BOOLE$
SET-FORMS-FROM-BINDINGS
:REDUNDANT
ALIST-DIFFERENCE-EQ
:REDUNDANT
:REDUNDANT
DIGIT-TO-CHAR
[GC for 399 SFUN pages..(T=22).GC finished]
PRINT-BASE-P
:REDUNDANT
EXPLODE-NONNEGATIVE-INTEGER
TRUE-LISTP-EXPLODE-NONNEGATIVE-INTEGER
NIL
NIL
EXPLODE-NONNEGATIVE-INTEGER
:REDUNDANT
EXPLODE-ATOM
:REDUNDANT
[GC for 4287 CONS pages..(T=22).GC finished]
EXPLODE-ATOM+
TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP-ASSOC-EQUAL
TRUE-LISTP-CADR-ASSOC-EQ-FOR-OPEN-CHANNELS-P
NIL
OPEN-INPUT-CHANNEL-P1
OPEN-OUTPUT-CHANNEL-P1
OPEN-INPUT-CHANNEL-P
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
OPEN-OUTPUT-CHANNEL-P
OPEN-OUTPUT-CHANNEL-ANY-P1
OPEN-OUTPUT-CHANNEL-ANY-P
OPEN-INPUT-CHANNEL-ANY-P1
[GC for 399 SFUN pages..(T=24).GC finished]
OPEN-INPUT-CHANNEL-ANY-P
NON-FREE-VAR-RUNES
FREE-VAR-RUNES
NATP-POSITION-AC
:REDUNDANT
:REDUNDANT
:REDUNDANT
OS
[GC for 4297 CONS pages..(T=24).GC finished]
ABSOLUTE-PATHNAME-STRING-P
ILLEGAL-RULER-EXTENDERS-VALUES
:REDUNDANT
RULER-EXTENDERS-MSG-AUX
RULER-EXTENDERS-MSG
[GC for 399 SFUN pages..(T=22).GC finished]
STRICT-SYMBOL-<-SORTEDP
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 977 RELOCATABLE-BLOCKS pages..(T=22).GC finished]
INCLUDE-BOOK-DIR-ALIST-ENTRY-P
INCLUDE-BOOK-DIR-ALISTP
:REDUNDANT
TTAG
GET-REGISTER-INVARIANT-RISK-WORLD
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=24).GC finished]
SET-PRINT-CASE
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
CHECK-PRINT-BASE
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
SET-PRINT-BASE
:REDUNDANT
SET-PRINT-CIRCLE
SET-PRINT-ESCAPE
SET-PRINT-PRETTY
SET-PRINT-RADIX
[GC for 399 SFUN pages..(T=22).GC finished]
SET-PRINT-READABLY
CHECK-NULL-OR-NATP
SET-PRINT-LENGTH
SET-PRINT-LEVEL
SET-PRINT-LINES
[GC for 399 SFUN pages..(T=22).GC finished]
SET-PRINT-RIGHT-MARGIN
PRINC$
[GC for 4307 CONS pages..(T=22).GC finished]
WRITE-BYTE$
W
GET-SERIALIZE-CHARACTER
HONS-ENABLEDP
[GC for 399 SFUN pages..(T=22).GC finished]
SET-SERIALIZE-CHARACTER-FN
SET-SERIALIZE-CHARACTER
SET-SERIALIZE-CHARACTER-SYSTEM
[GC for 4317 CONS pages..(T=24).GC finished]
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
PRINT-OBJECT$-SER
ALL-BOUNDP-PRESERVES-ASSOC-EQUAL
NIL
PRINT-OBJECT$
PRINT-OBJECT$-PRESERVING-CASE
MAKE-INPUT-CHANNEL
[GC for 399 SFUN pages..(T=22).GC finished]
MAKE-OUTPUT-CHANNEL
OPEN-INPUT-CHANNEL
NTH-UPDATE-NTH
TRUE-LISTP-UPDATE-NTH
NIL
NTH-UPDATE-NTH-ARRAY
CLOSE-INPUT-CHANNEL
[GC for 4327 CONS pages..(T=22).GC finished]
OPEN-OUTPUT-CHANNEL
OPEN-OUTPUT-CHANNEL!
:REDUNDANT
:REDUNDANT
FMT-TO-COMMENT-WINDOW
FMT-TO-COMMENT-WINDOW!
[GC for 399 SFUN pages..(T=22).GC finished]
PAIRLIS2
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
LOCK-SYMBOL-NAME-P
ASSIGN-LOCK
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
GET-OUTPUT-STREAM-STRING$-FN
:REDUNDANT
[GC for 4337 CONS pages..(T=24).GC finished]
CLOSE-OUTPUT-CHANNEL
MAYBE-FINISH-OUTPUT$
READ-CHAR$
[GC for 399 SFUN pages..(T=24).GC finished]
PEEK-CHAR$
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
READ-BYTE$
RAW-MODE-P
READ-OBJECT
READ-OBJECT-WITH-CASE
[GC for 399 SFUN pages..(T=22).GC finished]
READ-OBJECT-SUPPRESS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
SOME-SLASHABLE
PRIN1-WITH-SLASHES1
PRIN1-WITH-SLASHES
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=22).GC finished]
MAY-NEED-SLASHES1
NIL
MAY-NEED-SLASHES-FN
:REDUNDANT
[GC for 4347 CONS pages..(T=22).GC finished]
NEEDS-SLASHES
T-STACK-LENGTH1
T-STACK-LENGTH
MAKE-LIST-AC
:REDUNDANT
[GC for 399 SFUN pages..(T=22).GC finished]
EXTEND-T-STACK
T
STRINGP-SUBSEQ-TYPE-PRESCRIPTION
TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION
NIL
W
HONS-ENABLEDP
SET-SERIALIZE-CHARACTER-FN
SET-SERIALIZE-CHARACTER
SET-SERIALIZE-CHARACTER-SYSTEM
:REDUNDANT
:REDUNDANT
SHRINK-T-STACK
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
AREF-T-STACK
ASET-T-STACK
32-BIT-INTEGER-STACK-LENGTH1
32-BIT-INTEGER-STACK-LENGTH
[GC for 399 SFUN pages..(T=22).GC finished]
EXTEND-32-BIT-INTEGER-STACK
SHRINK-32-BIT-INTEGER-STACK
AREF-32-BIT-INTEGER-STACK
ASET-32-BIT-INTEGER-STACK
:REDUNDANT
:REDUNDANT
[GC for 399 SFUN pages..(T=24).GC finished]
BIG-CLOCK-NEGATIVE-P
DECREMENT-BIG-CLOCK
LIST-ALL-PACKAGE-NAMES
USER-STOBJ-ALIST
[GC for 399 SFUN pages..(T=22).GC finished]
UPDATE-USER-STOBJ-ALIST
POWER-EVAL
READ-IDATE
READ-RUN-TIME
[GC for 399 SFUN pages..(T=22).GC finished]
READ-ACL2-ORACLE
READ-ACL2-ORACLE@PAR
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=32).GC finished]
GETENV$
SETENV$
RANDOM$
NATP-RANDOM$
RANDOM$-LINEAR
(:NUMBER-OF-ENABLED-RUNES 2420)
SYS-CALL
(:NUMBER-OF-ENABLED-RUNES 2422)
[GC for 4357 CONS pages..(T=22).GC finished]
SYS-CALL-STATUS
T
UPDATE-ACL2-ORACLE-PRESERVES-STATE-P1
(:NUMBER-OF-ENABLED-RUNES 2426)
SYS-CALL+
[GC for 4367 CONS pages..(T=22).GC finished]
SYS-CALL*
NIL
READ-RUN-TIME-PRESERVES-STATE-P1
READ-ACL2-ORACLE-PRESERVES-STATE-P1
(:NUMBER-OF-ENABLED-RUNES 2433)
NIL
NTH-0-READ-RUN-TIME-TYPE-PRESCRIPTION
(:NUMBER-OF-ENABLED-RUNES 2433)
NIL
MAIN-TIMER
[GC for 4377 CONS pages..(T=22).GC finished]
PUT-ASSOC-EQ-EXEC
PUT-ASSOC-EQL-EXEC
PUT-ASSOC-EQUAL
:REDUNDANT
:REDUNDANT
PUT-ASSOC-EQ-EXEC-IS-PUT-ASSOC-EQUAL
PUT-ASSOC-EQL-EXEC-IS-PUT-ASSOC-EQUAL
:REDUNDANT
NIL
NIL
NIL
[GC for 399 SFUN pages..(T=24).GC finished]
SET-TIMER
GET-TIMER
NIL
PUSH-TIMER
RATIONALP-+
RATIONALP-*
RATIONALP-UNARY--
RATIONALP-UNARY-/
RATIONALP-IMPLIES-ACL2-NUMBERP
[GC for 399 SFUN pages..(T=24).GC finished]
POP-TIMER
[GC for 14336 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
ADD-TIMERS
NTH-0-CONS
NIL
NTH-ADD1
MAIN-TIMER-TYPE-PRESCRIPTION
ORDERED-SYMBOL-ALISTP-ADD-PAIR-FORWARD
ASSOC-ADD-PAIR
ADD-PAIR-PRESERVES-ALL-BOUNDP
STATE-P1-UPDATE-MAIN-TIMER
INCREMENT-TIMER
PRINT-RATIONAL-AS-DECIMAL
[GC for 4387 CONS pages..(T=22).GC finished]
PRINT-TIMER
STATE-P1-UPDATE-PRINT-BASE
SET-PRINT-BASE-RADIX
KNOWN-PACKAGE-ALIST
SYMBOL-IN-CURRENT-PACKAGE-P
[GC for 4397 CONS pages..(T=22).GC finished]
PRIN1$
NIL
CURRENT-PACKAGE
STATE-P1-UPDATE-NTH-2-WORLD
:REDUNDANT
:REDUNDANT
LD-SKIP-PROOFSP
:REDUNDANT
:REDUNDANT
:REDUNDANT
T
MAKE-VAR-LST
[GC for 4407 CONS pages..(T=22).GC finished]
UNION-EQ-EXEC
UNION-EQL-EXEC
UNION-EQUAL
:REDUNDANT
UNION-EQ-EXEC-IS-UNION-EQUAL
UNION-EQL-EXEC-IS-UNION-EQUAL
[GC for 977 RELOCATABLE-BLOCKS pages..(T=24).GC finished]
PARSE-ARGS-AND-TEST
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
INTERSECTION-EQ-EXEC
INTERSECTION-EQL-EXEC
INTERSECTION-EQUAL
[GC for 4417 CONS pages..(T=24).GC finished]
:REDUNDANT
INTERSECTION-EQ-EXEC-IS-INTERSECTION-EQUAL
INTERSECTION-EQL-EXEC-IS-INTERSECTION-EQUAL
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
GET-ENFORCE-REDUNDANCY
:REDUNDANT
DEFAULT-VERIFY-GUARDS-EAGERNESS
:REDUNDANT
DEFAULT-COMPILE-FNS
:REDUNDANT
SET-COMPILER-ENABLED
SET-PORT-FILE-ENABLED
[GC for 4427 CONS pages..(T=24).GC finished]
DEFAULT-MEASURE-FUNCTION
:REDUNDANT
DEFAULT-WELL-FOUNDED-RELATION
:REDUNDANT
:REDUNDANT
DEFAULT-DEFUN-MODE
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
DEFAULT-DEFUN-MODE-FROM-STATE
:REDUNDANT
:REDUNDANT
INVISIBLE-FNS-TABLE
:REDUNDANT
UNARY-FUNCTION-SYMBOL-LISTP
INVISIBLE-FNS-ENTRYP
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
BACKCHAIN-LIMIT
:REDUNDANT
[GC for 4437 CONS pages..(T=24).GC finished]
DEFAULT-BACKCHAIN-LIMIT
STEP-LIMIT-FROM-TABLE
:REDUNDANT
:REDUNDANT
:REDUNDANT
REWRITE-STACK-LIMIT
CASE-SPLIT-LIMITATIONS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
UNTRANS-TABLE
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
MATCH-FREE-DEFAULT
:REDUNDANT
:REDUNDANT
[GC for 4447 CONS pages..(T=22).GC finished]
MATCH-FREE-OVERRIDE
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
RAW-INCLUDE-BOOK-DIR-P
:REDUNDANT
:REDUNDANT
:REDUNDANT
NON-LINEARP
:REDUNDANT
:REDUNDANT
TAU-AUTO-MODEP
:REDUNDANT
GET-IN-THEORY-REDUNDANT-OKP
:REDUNDANT
:REDUNDANT
MACRO-ALIASES-TABLE
MACRO-ALIASES
:REDUNDANT
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
[GC for 4457 CONS pages..(T=24).GC finished]
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
:REDUNDANT
MACRO-ALIASES-TABLE
:REDUNDANT
MACRO-ALIASES-TABLE
:REDUNDANT
MACRO-ALIASES-TABLE
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
NTH-ALIASES
:REDUNDANT
:REDUNDANT
DEFAULT-HINTS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
T
[GC for 4467 CONS pages..(T=24).GC finished]
(:NUMBER-OF-ENABLED-RUNES 2642)
:REDUNDANT
MACRO-ALIASES-TABLE
PAIRLIS$-TRUE-LIST-FIX
BOOLEAN-LISTP
BOOLEAN-LISTP-CONS
BOOLEAN-LISTP-FORWARD
BOOLEAN-LISTP-FORWARD-TO-SYMBOL-LISTP
COMPLETION-OF-+
DEFAULT-+-1
DEFAULT-+-2
COMPLETION-OF-*
DEFAULT-*-1
DEFAULT-*-2
COMPLETION-OF-UNARY-MINUS
DEFAULT-UNARY-MINUS
COMPLETION-OF-UNARY-/
DEFAULT-UNARY-/
COMPLETION-OF-<
DEFAULT-<-1
DEFAULT-<-2
COMPLETION-OF-CAR
DEFAULT-CAR
COMPLETION-OF-CDR
DEFAULT-CDR
CONS-CAR-CDR
COMPLETION-OF-CHAR-CODE
DEFAULT-CHAR-CODE
COMPLETION-OF-CODE-CHAR
DEFAULT-CODE-CHAR
COMPLETION-OF-COMPLEX
DEFAULT-COMPLEX-1
DEFAULT-COMPLEX-2
COMPLEX-0
ADD-DEF-COMPLEX
REALPART-+
IMAGPART-+
COMPLETION-OF-COERCE
DEFAULT-COERCE-1
MAKE-CHARACTER-LIST-MAKE-CHARACTER-LIST
DEFAULT-COERCE-2
DEFAULT-COERCE-3
COMPLETION-OF-DENOMINATOR
DEFAULT-DENOMINATOR
COMPLETION-OF-IMAGPART
DEFAULT-IMAGPART
COMPLETION-OF-INTERN-IN-PACKAGE-OF-SYMBOL
DEFAULT-INTERN-IN-PACKAGE-OF-SYMBOL
COMPLETION-OF-NUMERATOR
DEFAULT-NUMERATOR
COMPLETION-OF-REALPART
DEFAULT-REALPART
COMPLETION-OF-SYMBOL-NAME
DEFAULT-SYMBOL-NAME
COMPLETION-OF-SYMBOL-PACKAGE-NAME
DEFAULT-SYMBOL-PACKAGE-NAME
[GC for 4477 CONS pages..(T=22).GC finished]
DOUBLE-REWRITE
CHK-WITH-PROVER-TIME-LIMIT-ARG
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
TIME-LIMIT5-REACHED-P
:REDUNDANT
:REDUNDANT
CHK-WITH-GUARD-CHECKING-ARG
:REDUNDANT
WITH-GUARD-CHECKING-GATE
:REDUNDANT
:REDUNDANT
:REDUNDANT
ABORT!
:REDUNDANT
P!
(:NUMBER-OF-ENABLED-RUNES 2695)
:REDUNDANT
:REDUNDANT
WORMHOLE1
WORMHOLE-P
[GC for 4487 CONS pages..(T=22).GC finished]
DUPLICATES
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
EVENS
ODDS
SET-EQUALP-EQUAL
:REDUNDANT
:REDUNDANT
:REDUNDANT
RECORD-ACCESSOR-FUNCTION-NAME
:REDUNDANT
MFC-CLAUSE
MFC-RDEPTH
TYPE-ALIST-ENTRYP
TYPE-ALISTP
MFC-TYPE-ALIST
MFC-ANCESTORS
MFC-UNIFY-SUBST
MFC-WORLD
[GC for 4497 CONS pages..(T=24).GC finished]
PSEUDO-TERM-LISTP-MFC-CLAUSE
TYPE-ALISTP-MFC-TYPE-ALIST
BAD-ATOM
BAD-ATOM-COMPOUND-RECOGNIZER
(:NUMBER-OF-ENABLED-RUNES 2748)
BOOLEANP-BAD-ATOM<=
BAD-ATOM<=-ANTISYMMETRIC
BAD-ATOM<=-TRANSITIVE
BAD-ATOM<=-TOTAL
ALPHORDER
LEXORDER
NIL
NIL
NIL
ALPHORDER-REFLEXIVE
NIL
ALPHORDER-TRANSITIVE
ALPHORDER-ANTI-SYMMETRIC
ALPHORDER-TOTAL
(:NUMBER-OF-ENABLED-RUNES 2760)
LEXORDER-REFLEXIVE
LEXORDER-ANTI-SYMMETRIC
LEXORDER-TRANSITIVE
LEXORDER-TOTAL
(:NUMBER-OF-ENABLED-RUNES 2762)
MERGE-LEXORDER
NIL
NIL
TRUE-LISTP-MERGE-SORT-LEXORDER
[GC for 4507 CONS pages..(T=24).GC finished]
MERGE-SORT-LEXORDER
:REDUNDANT
RESIZE-LIST-EXEC
RESIZE-LIST
RESIZE-LIST-EXEC-IS-RESIZE-LIST
RESIZE-LIST
E/D-FN
:REDUNDANT
<state>
To verify that the 30 encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 !>>(LOGIC)
The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant. See :DOC
redundant-events.
:INVISIBLE
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP)
The event ( DEFUN ALISTP ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN ALISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP)
The event ( DEFUN SYMBOL-ALISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SYMBOL-ALISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP)
The event ( DEFUN TRUE-LISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN TRUE-LISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN)
The event ( DEFUN LEN ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN LEN ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH)
The event ( DEFUN LENGTH ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN LENGTH ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH)
The event ( DEFUN NTH ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN NTH ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR)
The event ( DEFUN CHAR ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN CHAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP)
The event ( DEFUN EQLABLE-ALISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN EQLABLE-ALISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC)
The event ( DEFUN ASSOC-EQL-EXEC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ASSOC-EQL-EXEC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK)
The event ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL)
The event ( DEFUN ASSOC-EQUAL ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ASSOC-EQUAL ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS)
The event ( DEFUN SUBLIS ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN SUBLIS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX)
The event ( DEFUN NFIX ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN NFIX ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX)
The event ( DEFUN IFIX ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN IFIX ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS)
The event ( DEFUN INTEGER-ABS ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN INTEGER-ABS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT)
The event ( DEFUN ACL2-COUNT ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ACL2-COUNT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT)
The event ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR)
The event ( DEFUN FLOOR ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN FLOOR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP)
The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SYMBOL-LISTP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND)
The event ( DEFUN BINARY-APPEND ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN BINARY-APPEND ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND)
The event ( DEFUN STRING-APPEND ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN STRING-APPEND ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP)
The event ( DEFUN PLIST-WORLDP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN PLIST-WORLDP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP)
The event ( DEFUN FGETPROP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN FGETPROP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP)
The event ( DEFUN SGETPROP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SGETPROP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP)
The event ( DEFUN FUNCTION-SYMBOLP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN FUNCTION-SYMBOLP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS)
The event ( DEFUN STRIP-CARS ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN STRIP-CARS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK)
The event ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC)
The event ( DEFUN ASSOC-EQ-EXEC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ASSOC-EQ-EXEC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST)
The event ( DEFUN TABLE-ALIST ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN TABLE-ALIST ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
End of Encapsulated Events.
[GC for 4517 CONS pages..(T=24).GC finished]
ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...): The submitted
encapsulate event has created no new ACL2 events, and thus is leaving
the ACL2 logical world unchanged. See :DOC encapsulate.
Summary
Form: ( ENCAPSULATE NIL (LOGIC) ...)
Rules: NIL
Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26)
:EMPTY-ENCAPSULATE
Since MOD-EXPT is non-recursive, its admission is trivial. We observe
that the type of MOD-EXPT is described by the theorem
(ACL2-NUMBERP (MOD-EXPT BASE EXP MOD)). We used the :type-prescription
rule MOD.
Computing the guard conjecture for MOD-EXPT....
The guard conjecture for MOD-EXPT is trivial to prove, given the :executable-
counterpart of EQLABLEP and the :type-prescription rules
EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION.
MOD-EXPT is compliant with Common Lisp.
Summary
Form: ( DEFUN MOD-EXPT ...)
Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP)
(:TYPE-PRESCRIPTION EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE)
(:TYPE-PRESCRIPTION MOD)
(:TYPE-PRESCRIPTION RATIONALP-EXPT-TYPE-PRESCRIPTION))
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
MOD-EXPT
Since CONJOIN-CLAUSES is non-recursive, its admission is trivial.
We could deduce no constraints on the type of CONJOIN-CLAUSES.
Computing the guard conjecture for CONJOIN-CLAUSES....
The guard conjecture for CONJOIN-CLAUSES is trivial to prove, given
the :type-prescription rule DISJOIN-LST. CONJOIN-CLAUSES is compliant
with Common Lisp.
Summary
Form: ( DEFUN CONJOIN-CLAUSES ...)
Rules: ((:TYPE-PRESCRIPTION DISJOIN-LST))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
CONJOIN-CLAUSES
The event ( DEFCONST *TRUE-CLAUSE* ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFCONST *TRUE-CLAUSE* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *FALSE-CLAUSE* ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFCONST *FALSE-CLAUSE* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since CLAUSES-RESULT is non-recursive, its admission is trivial. We
could deduce no constraints on the type of CLAUSES-RESULT.
Computing the guard conjecture for CLAUSES-RESULT....
The guard conjecture for CLAUSES-RESULT is trivial to prove, given
primitive type reasoning. CLAUSES-RESULT is compliant with Common
Lisp.
Summary
Form: ( DEFUN CLAUSES-RESULT ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
CLAUSES-RESULT
The event ( TABLE EVISC-TABLE ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( TABLE EVISC-TABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *TOP-HINT-KEYWORDS* ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFCONST *TOP-HINT-KEYWORDS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *HINT-KEYWORDS* ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFCONST *HINT-KEYWORDS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( TABLE CUSTOM-KEYWORDS-TABLE ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( TABLE CUSTOM-KEYWORDS-TABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
For the admission of SPLICE-KEYWORD-ALIST we will use the relation
O< (which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT KEYWORD-ALIST). The non-trivial part of
the measure conjecture is
Goal
(IMPLIES (AND (NOT (ENDP KEYWORD-ALIST))
(NOT (EQ KEY (CAR KEYWORD-ALIST))))
(O< (ACL2-COUNT (CDDR KEYWORD-ALIST))
(ACL2-COUNT KEYWORD-ALIST))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
Goal'
(IMPLIES (AND (CONSP KEYWORD-ALIST)
(NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
(O< (ACL2-COUNT (CDDR KEYWORD-ALIST))
(ACL2-COUNT KEYWORD-ALIST))).
This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<,
primitive type reasoning and the :type-prescription rule ACL2-COUNT,
to
Goal''
(IMPLIES (AND (CONSP KEYWORD-ALIST)
(NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
(< (ACL2-COUNT (CDDR KEYWORD-ALIST))
(+ 1 (ACL2-COUNT (CAR KEYWORD-ALIST))
(ACL2-COUNT (CDR KEYWORD-ALIST))))).
[GC for 4527 CONS pages..(T=24).GC finished]
The destructor terms (CAR KEYWORD-ALIST) and (CDR KEYWORD-ALIST) can
be eliminated. Furthermore, those terms are at the root of a chain
of two rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace
KEYWORD-ALIST by (CONS KEYWORD-ALIST1 KEYWORD-ALIST2), (CAR KEYWORD-ALIST)
by KEYWORD-ALIST1 and (CDR KEYWORD-ALIST) by KEYWORD-ALIST2. (2) Use
CAR-CDR-ELIM, again, to replace KEYWORD-ALIST2 by
(CONS KEYWORD-ALIST3 KEYWORD-ALIST4), (CAR KEYWORD-ALIST2) by KEYWORD-ALIST3
and (CDR KEYWORD-ALIST2) by KEYWORD-ALIST4. These steps produce the
following two goals.
Subgoal 2
(IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2))
(CONSP (CONS KEYWORD-ALIST1 KEYWORD-ALIST2))
(NOT (EQUAL KEY KEYWORD-ALIST1)))
(< (ACL2-COUNT (CDR KEYWORD-ALIST2))
(+ 1 (ACL2-COUNT KEYWORD-ALIST1)
(ACL2-COUNT KEYWORD-ALIST2)))).
This simplifies, using the :executable-counterpart of ACL2-COUNT, primitive
type reasoning and the :rewrite rule DEFAULT-CDR, to
Subgoal 2'
(IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2))
(NOT (EQUAL KEY KEYWORD-ALIST1)))
(< 0
(+ 1 (ACL2-COUNT KEYWORD-ALIST1)
(ACL2-COUNT KEYWORD-ALIST2)))).
But simplification reduces this to T, using primitive type reasoning
and the :type-prescription rule ACL2-COUNT.
Subgoal 1
(IMPLIES (AND (CONSP (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))
(CONSP (LIST* KEYWORD-ALIST1
KEYWORD-ALIST3 KEYWORD-ALIST4))
(NOT (EQUAL KEY KEYWORD-ALIST1)))
(< (ACL2-COUNT KEYWORD-ALIST4)
(+ 1 (ACL2-COUNT KEYWORD-ALIST1)
(ACL2-COUNT (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))))).
This simplifies, using the :definition ACL2-COUNT, primitive type reasoning
and the :rewrite rules CAR-CONS and CDR-CONS, to
Subgoal 1'
(IMPLIES (NOT (EQUAL KEY KEYWORD-ALIST1))
(< (ACL2-COUNT KEYWORD-ALIST4)
(+ 1 (ACL2-COUNT KEYWORD-ALIST1)
1 (ACL2-COUNT KEYWORD-ALIST3)
(ACL2-COUNT KEYWORD-ALIST4)))).
But simplification reduces this to T, using linear arithmetic, primitive
type reasoning and the :type-prescription rule ACL2-COUNT.
Q.E.D.
That completes the proof of the measure theorem for SPLICE-KEYWORD-ALIST.
Thus, we admit this function under the principle of definition. We
could deduce no constraints on the type of SPLICE-KEYWORD-ALIST.
Computing the guard conjecture for SPLICE-KEYWORD-ALIST....
The non-trivial part of the guard conjecture for SPLICE-KEYWORD-ALIST,
given primitive type reasoning, the :forward-chaining rules
KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP and KEYWORDP-FORWARD-TO-SYMBOLP
and the :type-prescription rules KEYWORD-VALUE-LISTP and KEYWORDP,
is
Goal
(IMPLIES (AND (TRUE-LISTP NEW-SEGMENT)
(KEYWORD-VALUE-LISTP KEYWORD-ALIST)
(KEYWORDP KEY)
(NOT (ENDP KEYWORD-ALIST))
(NOT (EQ KEY (CAR KEYWORD-ALIST))))
(KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))).
[GC for 4537 CONS pages..(T=24).GC finished]
By the simple :definitions ENDP, EQ and KEYWORDP we reduce the conjecture
to
Goal'
(IMPLIES (AND (TRUE-LISTP NEW-SEGMENT)
(KEYWORD-VALUE-LISTP KEYWORD-ALIST)
(SYMBOLP KEY)
(EQUAL (SYMBOL-PACKAGE-NAME KEY)
"KEYWORD")
(CONSP KEYWORD-ALIST)
(NOT (EQUAL KEY (CAR KEYWORD-ALIST))))
(KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))).
But simplification reduces this to T, using the :definitions
KEYWORD-VALUE-LISTP and KEYWORDP.
Q.E.D.
That completes the proof of the guard theorem for SPLICE-KEYWORD-ALIST.
SPLICE-KEYWORD-ALIST is compliant with Common Lisp.
Summary
Form: ( DEFUN SPLICE-KEYWORD-ALIST ...)
Rules: ((:DEFINITION ACL2-COUNT)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION KEYWORD-VALUE-LISTP)
(:DEFINITION KEYWORDP)
(:DEFINITION NOT)
(:DEFINITION O-FINP)
(:DEFINITION O<)
(:ELIM CAR-CDR-ELIM)
(:EXECUTABLE-COUNTERPART ACL2-COUNT)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP)
(:FORWARD-CHAINING KEYWORDP-FORWARD-TO-SYMBOLP)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:REWRITE DEFAULT-CDR)
(:TYPE-PRESCRIPTION ACL2-COUNT)
(:TYPE-PRESCRIPTION KEYWORD-VALUE-LISTP)
(:TYPE-PRESCRIPTION KEYWORDP))
Time: 0.70 seconds (prove: 0.48, print: 0.00, other: 0.22)
Prover steps counted: 1836
SPLICE-KEYWORD-ALIST
The event ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since SEARCH-FN-GUARD is non-recursive, its admission is trivial.
We observe that the type of SEARCH-FN-GUARD is described by the theorem
(OR (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
T)
(EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
NIL)).
We used primitive type reasoning and the :type-prescription rules HARD-ERROR
and STANDARD-CHAR-LISTP.
Computing the guard conjecture for SEARCH-FN-GUARD....
The non-trivial part of the guard conjecture for SEARCH-FN-GUARD, given
the :executable-counterpart of HARD-ERROR, is
Goal
(AND
(LET ((X TEST) (L '(EQUAL CHAR-EQUAL)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L))))
(IMPLIES
(COND
((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
(HARD-ERROR
'SEARCH
"For the macro ~x0, only the :test values ~x1 and ~x2 are ~
supported; ~x3 is not. If you need other tests supported, ~
please contact the ACL2 implementors."
(LIST '(#\0 . SEARCH)
'(#\1 . EQUAL)
'(#\2 . CHAR-EQUAL)
(CONS #\3 TEST))))
((AND (STRINGP SEQ1) (STRINGP SEQ2))
(OR
(EQ TEST 'EQUAL)
(AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(HARD-ERROR
'SEARCH
"When ~x0 is called on two strings, they must both ~
consist of standard characters. However, this is not ~
the case for ~x1."
(LIST '(#\0 . SEARCH)
(CONS #\1
(IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
SEQ2 SEQ1))))))
((EQ TEST 'CHAR-EQUAL) NIL)
((AND (TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2))
T)
(T NIL))
(LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(RATIONALP END1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(RATIONALP START1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(RATIONALP END2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(RATIONALP START2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(RATIONALP (LENGTH SEQ1)))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(RATIONALP END1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(RATIONALP (LENGTH SEQ2)))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(RATIONALP END2)))))
(IMPLIES
(AND
(COND
((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
(HARD-ERROR
'SEARCH
"For the macro ~x0, only the :test values ~x1 and ~x2 are ~
supported; ~x3 is not. If you need other tests supported, ~
please contact the ACL2 implementors."
(LIST '(#\0 . SEARCH)
'(#\1 . EQUAL)
'(#\2 . CHAR-EQUAL)
(CONS #\3 TEST))))
((AND (STRINGP SEQ1) (STRINGP SEQ2))
(OR
(EQ TEST 'EQUAL)
(AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(HARD-ERROR
'SEARCH
"When ~x0 is called on two strings, they must both ~
consist of standard characters. However, this is not ~
the case for ~x1."
(LIST '(#\0 . SEARCH)
(CONS #\1
(IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
SEQ2 SEQ1))))))
((EQ TEST 'CHAR-EQUAL) NIL)
((AND (TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2))
T)
(T NIL))
(NOT END1P)
(NOT (TRUE-LISTP SEQ1)))
(STRINGP SEQ1))
(IMPLIES
(AND
(COND
((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)))
(HARD-ERROR
'SEARCH
"For the macro ~x0, only the :test values ~x1 and ~x2 are ~
supported; ~x3 is not. If you need other tests supported, ~
please contact the ACL2 implementors."
(LIST '(#\0 . SEARCH)
'(#\1 . EQUAL)
'(#\2 . CHAR-EQUAL)
(CONS #\3 TEST))))
((AND (STRINGP SEQ1) (STRINGP SEQ2))
(OR
(EQ TEST 'EQUAL)
(AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(HARD-ERROR
'SEARCH
"When ~x0 is called on two strings, they must both ~
consist of standard characters. However, this is not ~
the case for ~x1."
(LIST '(#\0 . SEARCH)
(CONS #\1
(IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
SEQ2 SEQ1))))))
((EQ TEST 'CHAR-EQUAL) NIL)
((AND (TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2))
T)
(T NIL))
(NOT END2P)
(NOT (TRUE-LISTP SEQ2)))
(STRINGP SEQ2))).
[GC for 4547 CONS pages..(T=24).GC finished]
[GC for 4557 CONS pages..(T=24).GC finished]
[GC for 4557 CONS pages..(T=24).GC finished]
By the simple :definitions EQ and HARD-ERROR, the :executable-counterparts
of IF, SYMBOL-LISTP, TAU-SYSTEM and TRUE-LISTP and the simple :rewrite
rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
Goal'
(IMPLIES (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))
(COND ((AND (STRINGP SEQ1) (STRINGP SEQ2))
(OR (EQUAL TEST 'EQUAL)
(AND (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))))
((EQUAL TEST 'CHAR-EQUAL) NIL)
((TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2))
(T NIL)))
(LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(RATIONALP END1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(RATIONALP START1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(RATIONALP END2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(RATIONALP START2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(RATIONALP (LENGTH SEQ1)))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(RATIONALP END1))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(RATIONALP (LENGTH SEQ2)))
(OR (NOT (NATP START1))
(NOT (NATP START2))
(NOT (NATP END1))
(NOT (NATP END2))
(< END1 START1)
(< END2 START2)
(< (LENGTH SEQ1) END1)
(RATIONALP END2))))).
[GC for 4557 CONS pages..(T=22).GC finished]
[GC for 4557 CONS pages..(T=22).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definition MEMBER-EQUAL, the :executable-
counterparts of CAR, CDR, CONSP and EQUAL, primitive type reasoning
and the :type-prescription rules LENGTH and STANDARD-CHAR-LISTP.
Q.E.D.
That completes the proof of the guard theorem for SEARCH-FN-GUARD.
SEARCH-FN-GUARD is compliant with Common Lisp.
Summary
Form: ( DEFUN SEARCH-FN-GUARD ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION EQ)
(:DEFINITION HARD-ERROR)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART HARD-ERROR)
(:EXECUTABLE-COUNTERPART IF)
(:EXECUTABLE-COUNTERPART SYMBOL-LISTP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION HARD-ERROR)
(:TYPE-PRESCRIPTION LENGTH)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP))
Time: 1.32 seconds (prove: 1.22, print: 0.00, other: 0.10)
Prover steps counted: 1480
SEARCH-FN-GUARD
For the admission of SEARCH-FROM-START we will use the relation O<
(which is known to be well-founded on the domain recognized by O-P)
and the measure (NFIX (+ 1 END2 (- START2))). The non-trivial part
of the measure conjecture is
Goal
(AND
(O-P (NFIX (+ 1 END2 (- START2))))
(IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2))))
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1)))))
(< (+ START2 (LENGTH SEQ1)) END2))
(O< (NFIX (+ 1 END2 (- (+ 1 START2))))
(NFIX (+ 1 END2 (- START2)))))).
[GC for 4557 CONS pages..(T=24).GC finished]
By case analysis we reduce the conjecture to the following two conjectures.
Subgoal 2
(O-P (NFIX (+ 1 END2 (- START2)))).
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
and primitive type reasoning.
Subgoal 1
(IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2))))
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1)))))
(< (+ START2 (LENGTH SEQ1)) END2))
(O< (NFIX (+ 1 END2 (- (+ 1 START2))))
(NFIX (+ 1 END2 (- START2))))).
This simplifies, using the :definitions LENGTH (if-intro), NFIX (if-
intro), NOT (if-intro), O-FINP and O< (if-intro), the :executable-
counterpart of NOT and primitive type reasoning, to the following six
conjectures.
Subgoal 1.6
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))))
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.5
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))))
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(< (+ 1 END2 (- (+ 1 START2))) 0))
(< 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.4
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))))
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= 0 (+ 1 END2 (- (+ 1 START2)))))
(< (+ 1 END2 (- (+ 1 START2)))
(+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.3
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1)))))
(< (+ START2 (LEN SEQ1)) END2))
(<= 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.2
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1)))))
(< (+ START2 (LEN SEQ1)) END2)
(< (+ 1 END2 (- (+ 1 START2))) 0))
(< 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.1
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(NOT (EQUAL SEQ1
(SUBSEQ SEQ2 START2 (+ START2 (LEN SEQ1)))))
(< (+ START2 (LEN SEQ1)) END2)
(<= 0 (+ 1 END2 (- (+ 1 START2)))))
(< (+ 1 END2 (- (+ 1 START2)))
(+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the measure theorem for SEARCH-FROM-START.
Thus, we admit this function under the principle of definition. We
observe that the type of SEARCH-FROM-START is described by the theorem
(OR (INTEGERP (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))
(EQUAL (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)
NIL)).
Computing the guard conjecture for SEARCH-FROM-START....
[GC for 4557 CONS pages..(T=24).GC finished]
The non-trivial part of the guard conjecture for SEARCH-FROM-START,
given primitive type reasoning and the :type-prescription rule LENGTH,
is
Goal
(AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2)))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2)))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2)))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NULL BOUND2)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2)))))).
[GC for 4557 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=22).GC finished]
TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.20 secs; see
:DOC time-tracker-tau.
[GC for 4567 CONS pages..(T=22).GC finished]
By the simple :definition NULL and the simple :rewrite rule
ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures.
Subgoal 4
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))).
[GC for 4567 CONS pages..(T=22).GC finished]
[GC for 4567 CONS pages..(T=22).GC finished]
This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rule LEN, to the following three conjectures.
Subgoal 4.3
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(<= (+ START2 (LEN SEQ1)) (LEN SEQ2))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 4.2
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(<= START2 (+ START2 (LEN SEQ1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 4.1
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1)
(NOT (EQUAL SEQ1
(TAKE (+ (- START2) START2 (LEN SEQ1))
(NTHCDR START2 SEQ2))))
(< (+ START2 (LEN SEQ1)) END2))
(<= (+ 1 START2 (LEN SEQ1)) END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))).
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=22).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rules LEN and TRUE-LISTP-TAKE, to the following three conjectures.
Subgoal 3.3
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
(LEN SEQ2))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3.2
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(<= START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3.1
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))).
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=22).GC finished]
This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rule LEN, to the following three conjectures.
Subgoal 2.3
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(<= (+ START2 (LEN SEQ1))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2.2
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(<= START2 (+ START2 (LEN SEQ1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2.1
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1)
(< (+ START2 (LEN SEQ1)) END2))
(<= (+ 1 START2 (LEN SEQ1)) END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(<= 0 START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(INTEGERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(NOT BOUND2)
(<= START2 BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
BOUND2 (<= START2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP BOUND2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(RATIONALP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))
(EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2))
(<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))).
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ
and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rule LEN, to the following three conjectures.
Subgoal 1.3
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.2
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(<= START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.1
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1)
(NOT (EQUAL SEQ1
(COERCE (TAKE (+ (- START2)
START2 (LEN (COERCE SEQ1 'LIST)))
(NTHCDR START2 (COERCE SEQ2 'LIST)))
'STRING)))
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for SEARCH-FROM-START.
SEARCH-FROM-START is compliant with Common Lisp.
Summary
Form: ( DEFUN SEARCH-FROM-START ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION LENGTH)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION NULL)
(:DEFINITION O-FINP)
(:DEFINITION O-P)
(:DEFINITION O<)
(:DEFINITION SUBSEQ)
(:DEFINITION SUBSEQ-LIST)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE ASSOCIATIVITY-OF-+)
(:REWRITE COMMUTATIVITY-OF-+)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION LENGTH)
(:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION LENGTH)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION O<))
Time: 4.68 seconds (prove: 4.16, print: 0.02, other: 0.50)
Prover steps counted: 11094
TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent
in the tau system was 2.88 seconds. See :DOC time-tracker-tau.
SEARCH-FROM-START
For the admission of SEARCH-FROM-END we will use the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (NFIX (+ 1 END2 (- START2))). The non-trivial part of the
measure conjecture is
Goal
(AND (O-P (NFIX (+ 1 END2 (- START2))))
(IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2))))
(< (+ START2 (LENGTH SEQ1)) END2))
(O< (NFIX (+ 1 END2 (- (+ 1 START2))))
(NFIX (+ 1 END2 (- START2)))))).
[GC for 4567 CONS pages..(T=24).GC finished]
By case analysis we reduce the conjecture to the following two conjectures.
Subgoal 2
(O-P (NFIX (+ 1 END2 (- START2)))).
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
and primitive type reasoning.
Subgoal 1
(IMPLIES (AND (NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2))))
(< (+ START2 (LENGTH SEQ1)) END2))
(O< (NFIX (+ 1 END2 (- (+ 1 START2))))
(NFIX (+ 1 END2 (- START2))))).
This simplifies, using the :definitions LENGTH (if-intro), NFIX (if-
intro), NOT (if-intro), O-FINP and O< (if-intro), the :executable-
counterpart of NOT and primitive type reasoning, to the following six
conjectures.
Subgoal 1.6
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.5
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(< (+ 1 END2 (- (+ 1 START2))) 0))
(< 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.4
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= 0 (+ 1 END2 (- (+ 1 START2)))))
(< (+ 1 END2 (- (+ 1 START2)))
(+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.3
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(< (+ START2 (LEN SEQ1)) END2))
(<= 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.2
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(< (+ START2 (LEN SEQ1)) END2)
(< (+ 1 END2 (- (+ 1 START2))) 0))
(< 0 (+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.1
(IMPLIES (AND (INTEGERP END2)
(INTEGERP START2)
(NOT (STRINGP SEQ1))
(< (+ START2 (LEN SEQ1)) END2)
(<= 0 (+ 1 END2 (- (+ 1 START2)))))
(< (+ 1 END2 (- (+ 1 START2)))
(+ 1 END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the measure theorem for SEARCH-FROM-END.
Thus, we admit this function under the principle of definition. We
observe that the type of SEARCH-FROM-END is described by the theorem
(OR (OR (INTEGERP (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC))
(EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
NIL))
(EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
ACC)
(EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)
START2)).
We used primitive type reasoning.
Computing the guard conjecture for SEARCH-FROM-END....
The non-trivial part of the guard conjecture for SEARCH-FROM-END, given
primitive type reasoning and the :type-prescription rule LENGTH, is
Goal
(AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (NULL BOUND2) (INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (NULL BOUND2) (INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (NULL BOUND2) (INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))))
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (NULL BOUND2)
(<= BOUND2 (LENGTH SEQ2)))
(OR (NULL BOUND2) (INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ (+ 1 START2) (LENGTH SEQ1))
END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))))).
[GC for 4567 CONS pages..(T=22).GC finished]
[GC for 4567 CONS pages..(T=22).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
By the simple :definition NULL and the simple :rewrite rule
ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures.
Subgoal 4
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))).
[GC for 4567 CONS pages..(T=24).GC finished]
TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.22 secs; see
:DOC time-tracker-tau.
This simplifies, using the :definitions LENGTH and NOT (if-intro),
the :executable-counterpart of NOT, primitive type reasoning and the
:type-prescription rule LEN, to the following three conjectures.
Subgoal 4.3
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(<= (+ START2 (LEN SEQ1)) (LEN SEQ2))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 4.2
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1))
(<= START2 (+ START2 (LEN SEQ1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 4.1
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(TRUE-LISTP SEQ1)
(< (+ START2 (LEN SEQ1)) END2))
(<= (+ 1 START2 (LEN SEQ1)) END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))).
[GC for 4567 CONS pages..(T=22).GC finished]
[GC for 4567 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions LENGTH and NOT (if-intro),
the :executable-counterpart of NOT, primitive type reasoning and the
:type-prescription rule LEN, to the following three conjectures.
Subgoal 3.3
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
(LEN SEQ2))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3.2
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1))
(<= START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3.1
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))).
[GC for 4567 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions LENGTH and NOT (if-intro),
the :executable-counterpart of NOT, primitive type reasoning and the
:type-prescription rule LEN, to the following three conjectures.
Subgoal 2.3
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(<= (+ START2 (LEN SEQ1))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2.2
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1))
(<= START2 (+ START2 (LEN SEQ1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2.1
(IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(TRUE-LISTP SEQ1)
(< (+ START2 (LEN SEQ1)) END2))
(<= (+ 1 START2 (LEN SEQ1)) END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2)
(<= END2 (LENGTH SEQ2))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1)
(NOT (OR (NOT (INTEGERP END2))
(NOT (INTEGERP START2)))))
(LET ((BOUND2 (+ START2 (LENGTH SEQ1))))
(AND (<= 0 START2)
(INTEGERP START2)
(OR (EQUAL BOUND2 NIL)
(<= BOUND2 (LENGTH SEQ2)))
(OR (EQUAL BOUND2 NIL)
(INTEGERP BOUND2))
(OR (TRUE-LISTP SEQ2) (STRINGP SEQ2))
(OR (NOT BOUND2) (<= START2 BOUND2))
(OR BOUND2 (<= START2 (LENGTH SEQ2)))
(LET NIL
(AND (RATIONALP BOUND2)
(RATIONALP END2)
(OR (<= END2 BOUND2)
(ACL2-NUMBERP START2))
(OR (<= END2 BOUND2) (INTEGERP END2))
(OR (<= END2 BOUND2)
(INTEGERP (+ 1 START2)))
(OR (<= END2 BOUND2)
(<= (+ 1 START2 (LENGTH SEQ1)) END2))
(OR (<= END2 BOUND2)
(<= END2 (LENGTH SEQ2)))
(OR (<= END2 BOUND2)
(<= 0 (+ 1 START2)))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (<= END2 BOUND2)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))).
[GC for 4567 CONS pages..(T=22).GC finished]
This simplifies, using the :definitions LENGTH and NOT (if-intro),
the :executable-counterpart of NOT, primitive type reasoning and the
:type-prescription rule LEN, to the following three conjectures.
Subgoal 1.3
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.2
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1))
(<= START2
(+ START2 (LEN (COERCE SEQ1 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.1
(IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2)
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(INTEGERP END2)
(<= 0 START2)
(INTEGERP START2)
(STRINGP SEQ2)
(STRINGP SEQ1)
(< (+ START2 (LEN (COERCE SEQ1 'LIST)))
END2))
(<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST)))
END2)).
[GC for 4567 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for SEARCH-FROM-END.
SEARCH-FROM-END is compliant with Common Lisp.
Summary
Form: ( DEFUN SEARCH-FROM-END ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION LENGTH)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION NULL)
(:DEFINITION O-FINP)
(:DEFINITION O-P)
(:DEFINITION O<)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE ASSOCIATIVITY-OF-+)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION LENGTH))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION LENGTH)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION O<))
Time: 2.94 seconds (prove: 2.68, print: 0.02, other: 0.24)
Prover steps counted: 5254
TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent
in the tau system was 1.72 seconds. See :DOC time-tracker-tau.
SEARCH-FROM-END
To verify that the 18 encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 !>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1
(EQUAL (LEN (STRING-DOWNCASE1 X))
(LEN X))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. These merge into one derived induction scheme.
We will induct according to a scheme suggested by (LEN X). This suggestion
was produced using the :induction rules LEN and STRING-DOWNCASE1.
If we let (:P X) denote *1 above then the induction scheme we'll use
is
(AND (IMPLIES (NOT (CONSP X)) (:P X))
(IMPLIES (AND (CONSP X) (:P (CDR X)))
(:P X))).
This induction is justified by the same argument used to admit LEN.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (NOT (CONSP X))
(EQUAL (LEN (STRING-DOWNCASE1 X))
(LEN X))).
But simplification reduces this to T, using the :definitions LEN and
STRING-DOWNCASE1 and the :executable-counterparts of EQUAL and LEN.
Subgoal *1/1
(IMPLIES (AND (CONSP X)
(EQUAL (LEN (STRING-DOWNCASE1 (CDR X)))
(LEN (CDR X))))
(EQUAL (LEN (STRING-DOWNCASE1 X))
(LEN X))).
But simplification reduces this to T, using the :definitions LEN and
STRING-DOWNCASE1, primitive type reasoning, the :rewrite rule CDR-CONS
and the :type-prescription rule STRING-DOWNCASE1.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM LEN-STRING-DOWNCASE1 ...)
Rules: ((:DEFINITION LEN)
(:DEFINITION STRING-DOWNCASE1)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART LEN)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION LEN)
(:INDUCTION STRING-DOWNCASE1)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION STRING-DOWNCASE1))
Time: 0.02 seconds (prove: 0.02, print: 0.00, other: 0.00)
Prover steps counted: 190
LEN-STRING-DOWNCASE1
ACL2 !>>(LOCAL (DEFTHM STRINGP-SUBSEQ
(IMPLIES (STRINGP STR)
(STRINGP (SUBSEQ STR START END)))))
ACL2 Warning [Non-rec] in ( DEFTHM STRINGP-SUBSEQ ...): A :REWRITE
rule generated from STRINGP-SUBSEQ will be triggered only by terms
containing the function symbol SUBSEQ, which has a non-recursive definition.
Unless this definition is disabled, this rule is unlikely ever to be
used.
But we reduce the conjecture to T, by the :type-prescription rule
STRINGP-SUBSEQ-TYPE-PRESCRIPTION.
Q.E.D.
Summary
Form: ( DEFTHM STRINGP-SUBSEQ ...)
Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION))
Warnings: Non-rec
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
STRINGP-SUBSEQ
ACL2 !>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-NTHCDR
(IMPLIES (STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP (NTHCDR N X)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
Name the formula above *1.
[GC for 4567 CONS pages..(T=24).GC finished]
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. These merge into one derived induction scheme.
We will induct according to a scheme suggested by (NTHCDR N X). This
suggestion was produced using the :induction rules NTHCDR and
STANDARD-CHAR-LISTP. If we let (:P N X) denote *1 above then the induction
scheme we'll use is
(AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X)))
(:P N X))
(IMPLIES (ZP N) (:P N X))).
This induction is justified by the same argument used to admit NTHCDR.
Note, however, that the unmeasured variable X is being instantiated.
When applied to the goal at hand the above induction scheme produces
three nontautological subgoals.
Subgoal *1/3
(IMPLIES (AND (NOT (ZP N))
(STANDARD-CHAR-LISTP (NTHCDR (+ N -1) (CDR X)))
(STANDARD-CHAR-LISTP X))
(STANDARD-CHAR-LISTP (NTHCDR N X))).
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :definitions NTHCDR and STANDARD-CHAR-LISTP, the :executable-counterparts
of CDR and CONSP, primitive type reasoning, the :rewrite rule
COMMUTATIVITY-OF-+ and the :type-prescription rule STANDARD-CHAR-LISTP,
to
Subgoal *1/3'
(IMPLIES (AND (NOT (ZP N))
(STANDARD-CHAR-LISTP (NTHCDR (+ N -1) NIL))
(NOT X))
(STANDARD-CHAR-LISTP (NTHCDR (+ -1 N) NIL))).
But simplification reduces this to T, using the :rewrite rule
COMMUTATIVITY-OF-+.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (STANDARD-CHAR-LISTP (CDR X)))
(STANDARD-CHAR-LISTP X))
(STANDARD-CHAR-LISTP (NTHCDR N X))).
But simplification reduces this to T, using the :definition
STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP and
STANDARD-CHAR-LISTP and primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ZP N) (STANDARD-CHAR-LISTP X))
(STANDARD-CHAR-LISTP (NTHCDR N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions NTHCDR and STANDARD-CHAR-LISTP,
the :executable-counterparts of CONSP and STANDARD-CHAR-LISTP, primitive
type reasoning and the :type-prescription rules STANDARD-CHAR-LISTP
and STANDARD-CHAR-P.
That completes the proof of *1.
Q.E.D.
The storage of STANDARD-CHAR-LISTP-NTHCDR depends upon the :type-prescription
rule STANDARD-CHAR-LISTP.
Summary
Form: ( DEFTHM STANDARD-CHAR-LISTP-NTHCDR ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION NTHCDR)
(:DEFINITION STANDARD-CHAR-LISTP)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION NTHCDR)
(:INDUCTION STANDARD-CHAR-LISTP)
(:REWRITE COMMUTATIVITY-OF-+)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
(:TYPE-PRESCRIPTION STANDARD-CHAR-P))
Time: 0.26 seconds (prove: 0.26, print: 0.00, other: 0.00)
Prover steps counted: 555
STANDARD-CHAR-LISTP-NTHCDR
ACL2 !>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-REVAPPEND
(IMPLIES (AND (STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
[GC for 4567 CONS pages..(T=22).GC finished]
Name the formula above *1.
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. These merge into two derived induction
schemes. However, one of these is flawed and so we are left with one
viable candidate.
We will induct according to a scheme suggested by (REVAPPEND X AC).
This suggestion was produced using the :induction rules REVAPPEND and
STANDARD-CHAR-LISTP. If we let (:P AC X) denote *1 above then the
induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ENDP X))
(:P (CONS (CAR X) AC) (CDR X)))
(:P AC X))
(IMPLIES (ENDP X) (:P AC X))).
This induction is justified by the same argument used to admit REVAPPEND.
Note, however, that the unmeasured variable AC is being instantiated.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ENDP X))
(STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/4'
(IMPLIES (AND (CONSP X)
(STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
But simplification reduces this to T, using the :definitions REVAPPEND
and STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP.
Subgoal *1/3
(IMPLIES (AND (NOT (ENDP X))
(NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/3'
(IMPLIES (AND (CONSP X)
(NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
But simplification reduces this to T, using the :definition
STANDARD-CHAR-LISTP, primitive type reasoning, the :forward-chaining
rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP,
CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP,
EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and
STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP, the :rewrite rules
CAR-CONS and CDR-CONS and the :type-prescription rules ATOM-LISTP,
CHARACTER-LISTP, EQLABLE-LISTP, STANDARD-CHAR-LISTP and STANDARD-CHAR-P.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP X))
(NOT (STANDARD-CHAR-LISTP (CDR X)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP X)
(NOT (STANDARD-CHAR-LISTP (CDR X)))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
But simplification reduces this to T, using the :definition
STANDARD-CHAR-LISTP.
Subgoal *1/1
(IMPLIES (AND (ENDP X)
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (AND (NOT (CONSP X))
(STANDARD-CHAR-LISTP X)
(STANDARD-CHAR-LISTP AC))
(STANDARD-CHAR-LISTP (REVAPPEND X AC))).
But simplification reduces this to T, using the :definitions REVAPPEND
and STANDARD-CHAR-LISTP, the :executable-counterpart of CONSP, primitive
type reasoning and the :type-prescription rule STANDARD-CHAR-LISTP.
That completes the proof of *1.
Q.E.D.
The storage of STANDARD-CHAR-LISTP-REVAPPEND depends upon the :type-
prescription rule STANDARD-CHAR-LISTP.
Summary
Form: ( DEFTHM STANDARD-CHAR-LISTP-REVAPPEND ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION NOT)
(:DEFINITION REVAPPEND)
(:DEFINITION STANDARD-CHAR-LISTP)
(:EXECUTABLE-COUNTERPART CONSP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
(:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
(:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
(:FORWARD-CHAINING STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP)
(:INDUCTION REVAPPEND)
(:INDUCTION STANDARD-CHAR-LISTP)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION ATOM-LISTP)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION EQLABLE-LISTP)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
(:TYPE-PRESCRIPTION STANDARD-CHAR-P))
Time: 0.24 seconds (prove: 0.24, print: 0.00, other: 0.00)
Prover steps counted: 760
STANDARD-CHAR-LISTP-REVAPPEND
ACL2 !>>(LOCAL
(DEFTHM STANDARD-CHAR-LISTP-OF-TAKE
(IMPLIES (AND (STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X)))
:HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP)))))
[GC for 4567 CONS pages..(T=24).GC finished]
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
Name the formula above *1.
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
These merge into one derived induction scheme.
We will induct according to a scheme suggested by (TAKE N X). This
suggestion was produced using the :induction rules LEN, STANDARD-CHAR-LISTP
and TAKE. If we let (:P N X) denote *1 above then the induction scheme
we'll use is
(AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X)))
(:P N X))
(IMPLIES (ZP N) (:P N X))).
This induction is justified by the same argument used to admit TAKE.
Note, however, that the unmeasured variable X is being instantiated.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ZP N))
(STANDARD-CHAR-LISTP (TAKE (+ -1 N) (CDR X)))
(STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP
and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive
type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type-
prescription rules STANDARD-CHAR-LISTP, STANDARD-CHAR-P and TRUE-LISTP-TAKE.
Subgoal *1/3
(IMPLIES (AND (NOT (ZP N))
(< (LEN (CDR X)) (+ -1 N))
(STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN and STANDARD-CHAR-LISTP,
the :executable-counterparts of CDR, CONSP and LEN, primitive type
reasoning and the :type-prescription rule LEN.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (STANDARD-CHAR-LISTP (CDR X)))
(STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X))).
[GC for 4567 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition
STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP, LEN
and STANDARD-CHAR-LISTP and primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ZP N)
(STANDARD-CHAR-LISTP X)
(<= N (LEN X)))
(STANDARD-CHAR-LISTP (TAKE N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP
and TAKE, the :executable-counterparts of CONSP, LEN and STANDARD-CHAR-LISTP
and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
The storage of STANDARD-CHAR-LISTP-OF-TAKE depends upon the :type-
prescription rule STANDARD-CHAR-LISTP.
Summary
Form: ( DEFTHM STANDARD-CHAR-LISTP-OF-TAKE ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION LEN)
(:DEFINITION NOT)
(:DEFINITION STANDARD-CHAR-LISTP)
(:DEFINITION TAKE)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART LEN)
(:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION LEN)
(:INDUCTION STANDARD-CHAR-LISTP)
(:INDUCTION TAKE)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
(:TYPE-PRESCRIPTION STANDARD-CHAR-P)
(:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
Time: 0.50 seconds (prove: 0.24, print: 0.02, other: 0.24)
Prover steps counted: 587
STANDARD-CHAR-LISTP-OF-TAKE
ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE
(IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X)))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. These merge into one derived induction
scheme.
We will induct according to a scheme suggested by (TAKE N X). This
suggestion was produced using the :induction rules CHARACTER-LISTP,
LEN and TAKE. If we let (:P N X) denote *1 above then the induction
scheme we'll use is
(AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X)))
(:P N X))
(IMPLIES (ZP N) (:P N X))).
This induction is justified by the same argument used to admit TAKE.
Note, however, that the unmeasured variable X is being instantiated.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ZP N))
(CHARACTER-LISTP (TAKE (+ -1 N) (CDR X)))
(CHARACTER-LISTP X)
(<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN
and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive
type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type-
prescription rules CHARACTER-LISTP and TRUE-LISTP-TAKE.
Subgoal *1/3
(IMPLIES (AND (NOT (ZP N))
(< (LEN (CDR X)) (+ -1 N))
(CHARACTER-LISTP X)
(<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and LEN,
the :executable-counterparts of CDR, CONSP and LEN, primitive type
reasoning and the :type-prescription rule LEN.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (CHARACTER-LISTP (CDR X)))
(CHARACTER-LISTP X)
(<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X))).
But simplification reduces this to T, using the :definition CHARACTER-LISTP,
the :executable-counterparts of CDR, CHARACTER-LISTP, CONSP and LEN
and primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ZP N)
(CHARACTER-LISTP X)
(<= N (LEN X)))
(CHARACTER-LISTP (TAKE N X))).
[GC for 4567 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN
and TAKE, the :executable-counterparts of CHARACTER-LISTP, CONSP and
LEN and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
The storage of CHARACTER-LISTP-OF-TAKE depends upon the :type-prescription
rule CHARACTER-LISTP.
Summary
Form: ( DEFTHM CHARACTER-LISTP-OF-TAKE ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION CHARACTER-LISTP)
(:DEFINITION LEN)
(:DEFINITION NOT)
(:DEFINITION TAKE)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART LEN)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION CHARACTER-LISTP)
(:INDUCTION LEN)
(:INDUCTION TAKE)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
Time: 0.26 seconds (prove: 0.02, print: 0.24, other: 0.00)
Prover steps counted: 532
CHARACTER-LISTP-OF-TAKE
ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR
(IMPLIES (CHARACTER-LISTP X)
(CHARACTER-LISTP (NTHCDR N X)))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. These merge into one derived induction scheme.
We will induct according to a scheme suggested by (NTHCDR N X). This
suggestion was produced using the :induction rules CHARACTER-LISTP
and NTHCDR. If we let (:P N X) denote *1 above then the induction
scheme we'll use is
(AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X)))
(:P N X))
(IMPLIES (ZP N) (:P N X))).
This induction is justified by the same argument used to admit NTHCDR.
Note, however, that the unmeasured variable X is being instantiated.
When applied to the goal at hand the above induction scheme produces
three nontautological subgoals.
Subgoal *1/3
(IMPLIES (AND (NOT (ZP N))
(CHARACTER-LISTP (NTHCDR (+ N -1) (CDR X)))
(CHARACTER-LISTP X))
(CHARACTER-LISTP (NTHCDR N X))).
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts
of CDR and CONSP, primitive type reasoning, the :rewrite rule
COMMUTATIVITY-OF-+ and the :type-prescription rule CHARACTER-LISTP,
to
Subgoal *1/3'
(IMPLIES (AND (NOT (ZP N))
(CHARACTER-LISTP (NTHCDR (+ N -1) NIL))
(NOT X))
(CHARACTER-LISTP (NTHCDR (+ -1 N) NIL))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (CHARACTER-LISTP (CDR X)))
(CHARACTER-LISTP X))
(CHARACTER-LISTP (NTHCDR N X))).
But simplification reduces this to T, using the :definition CHARACTER-LISTP,
the :executable-counterparts of CDR, CHARACTER-LISTP and CONSP and
primitive type reasoning.
Subgoal *1/1
(IMPLIES (AND (ZP N) (CHARACTER-LISTP X))
(CHARACTER-LISTP (NTHCDR N X))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR,
the :executable-counterparts of CHARACTER-LISTP and CONSP, primitive
type reasoning and the :type-prescription rule CHARACTER-LISTP.
That completes the proof of *1.
Q.E.D.
The storage of CHARACTER-LISTP-NTHCDR depends upon the :type-prescription
rule CHARACTER-LISTP.
Summary
Form: ( DEFTHM CHARACTER-LISTP-NTHCDR ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION CHARACTER-LISTP)
(:DEFINITION NOT)
(:DEFINITION NTHCDR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION CHARACTER-LISTP)
(:INDUCTION NTHCDR)
(:REWRITE COMMUTATIVITY-OF-+)
(:TYPE-PRESCRIPTION CHARACTER-LISTP))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
Prover steps counted: 442
CHARACTER-LISTP-NTHCDR
ACL2 !>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL)))
By case analysis we reduce the conjecture to
Goal'
(NOT (NTHCDR N NIL)).
Name the formula above *1.
Perhaps we can prove *1 by induction. One induction scheme is suggested
by this conjecture.
We will induct according to a scheme suggested by (NTHCDR N NIL).
This suggestion was produced using the :induction rule NTHCDR. If
we let (:P N) denote *1 above then the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1)))
(:P N))
(IMPLIES (ZP N) (:P N))).
This induction is justified by the same argument used to admit NTHCDR.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (NTHCDR (+ N -1) NIL)))
(NOT (NTHCDR N NIL))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR.
Subgoal *1/1
(IMPLIES (ZP N) (NOT (NTHCDR N NIL))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM NTHCDR-NIL ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION NOT)
(:DEFINITION NTHCDR)
(:INDUCTION NTHCDR))
Time: 0.02 seconds (prove: 0.00, print: 0.02, other: 0.00)
Prover steps counted: 135
NTHCDR-NIL
ACL2 !>>(LOCAL (DEFTHM LEN-NTHCDR
(EQUAL (LEN (NTHCDR N X))
(NFIX (- (LEN X) (NFIX N))))))
This simplifies, using the :definition NFIX (if-intro), to the following
three conjectures.
Subgoal 3
(IMPLIES (NOT (INTEGERP N))
(EQUAL (LEN (NTHCDR N X))
(NFIX (+ (LEN X) 0)))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, NFIX and NTHCDR,
primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and
UNICITY-OF-0 and the :type-prescription rule LEN.
Subgoal 2
(IMPLIES (AND (INTEGERP N) (<= 0 N))
(EQUAL (LEN (NTHCDR N X))
(NFIX (+ (LEN X) (- N))))).
This simplifies, using the :definition NFIX (if-intro), primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rule LEN, to the following two conjectures.
Subgoal 2.2
(IMPLIES (AND (INTEGERP N)
(<= 0 N)
(< (+ (- N) (LEN X)) 0))
(EQUAL (LEN (NTHCDR N X)) 0)).
[GC for 4567 CONS pages..(T=24).GC finished]
Name the formula above *1.
Subgoal 2.1
(IMPLIES (AND (INTEGERP N)
(<= 0 N)
(<= 0 (+ (- N) (LEN X))))
(EQUAL (LEN (NTHCDR N X))
(+ (- N) (LEN X)))).
Normally we would attempt to prove Subgoal 2.1 by induction. However,
we prefer in this instance to focus on the original input conjecture
rather than this simplified special case. We therefore abandon our
previous work on this conjecture and reassign the name *1 to the original
conjecture. (See :DOC otf-flg.)
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. These merge into one derived induction scheme.
We will induct according to a scheme suggested by (LEN X), but modified
to accommodate (NTHCDR N X). These suggestions were produced using
the :induction rules LEN and NTHCDR. If we let (:P N X) denote *1
above then the induction scheme we'll use is
(AND (IMPLIES (NOT (CONSP X)) (:P N X))
(IMPLIES (AND (CONSP X) (:P (+ N -1) (CDR X)))
(:P N X))).
This induction is justified by the same argument used to admit LEN.
Note, however, that the unmeasured variable N is being instantiated.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (NOT (CONSP X))
(EQUAL (LEN (NTHCDR N X))
(NFIX (+ (LEN X) (- (NFIX N)))))).
This simplifies, using the :definitions FIX (if-intro), LEN, NFIX (if-
intro) and NTHCDR (if-intro), primitive type reasoning and the :rewrite
rule UNICITY-OF-0, to the following two conjectures.
Subgoal *1/2.2
(IMPLIES (AND (NOT (CONSP X)) (ZP N))
(EQUAL (LEN X) 0)).
But simplification reduces this to T, using the :definition LEN and
the :executable-counterpart of EQUAL.
Subgoal *1/2.1
(IMPLIES (AND (NOT (CONSP X)) (NOT (ZP N)))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
0)).
But simplification reduces this to T, using the :executable-counterparts
of EQUAL and LEN and the :rewrite rules COMMUTATIVITY-OF-+, DEFAULT-CDR
and NTHCDR-NIL.
Subgoal *1/1
(IMPLIES (AND (CONSP X)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) (- (NFIX (+ N -1)))))))
(EQUAL (LEN (NTHCDR N X))
(NFIX (+ (LEN X) (- (NFIX N)))))).
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :definitions FIX, LEN, NFIX (if-intro) and NTHCDR (if-intro), the
:executable-counterpart of UNARY--, primitive type reasoning, the :rewrite
rules ASSOCIATIVITY-OF-+, COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the
:type-prescription rule LEN, to the following eight conjectures.
Subgoal *1/1.8
(IMPLIES (AND (CONSP X)
(INTEGERP (+ -1 N))
(<= 0 (+ -1 N))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) (- (+ -1 N)))))
(< (+ (- N) 1 (LEN (CDR X))) 0))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
0)).
[GC for 4567 CONS pages..(T=22).GC finished]
This simplifies, using the :definition NFIX, the :executable-counterpart
of EQUAL, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+
and the :type-prescription rule LEN, to
Subgoal *1/1.8'
(IMPLIES (AND (CONSP X)
(INTEGERP (+ -1 N))
(<= 0 (+ -1 N))
(<= 0 (+ (- (+ -1 N)) (LEN (CDR X))))
(EQUAL (LEN (NTHCDR (+ -1 N) (CDR X)))
(+ (- (+ -1 N)) (LEN (CDR X))))
(< (+ (- N) 1 (LEN (CDR X))) 0))
(EQUAL (LEN (NTHCDR (+ -1 N) (CDR X)))
0)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.7
(IMPLIES (AND (CONSP X)
(INTEGERP (+ -1 N))
(<= 0 (+ -1 N))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) (- (+ -1 N)))))
(<= 0 (+ (- N) 1 (LEN (CDR X)))))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(+ (- N) 1 (LEN (CDR X))))).
This simplifies, using the :definition NFIX (if-intro), primitive type
reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription
rule LEN, to the following two conjectures.
Subgoal *1/1.7.2
(IMPLIES (AND (CONSP X)
(INTEGERP (+ -1 N))
(<= 0 (+ -1 N))
(< (+ (- (+ -1 N)) (LEN (CDR X))) 0)
(EQUAL (LEN (NTHCDR (+ -1 N) (CDR X)))
0)
(<= 0 (+ (- N) 1 (LEN (CDR X)))))
(EQUAL 0 (+ (- N) 1 (LEN (CDR X))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.7.1
(IMPLIES (AND (CONSP X)
(INTEGERP (+ -1 N))
(<= 0 (+ -1 N))
(<= 0 (+ (- (+ -1 N)) (LEN (CDR X))))
(EQUAL (LEN (NTHCDR (+ -1 N) (CDR X)))
(+ (- (+ -1 N)) (LEN (CDR X))))
(<= 0 (+ (- N) 1 (LEN (CDR X)))))
(EQUAL (LEN (NTHCDR (+ -1 N) (CDR X)))
(+ (- N) 1 (LEN (CDR X))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.6
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(ZP N)
(NOT (INTEGERP N)))
(EQUAL (LEN X)
(NFIX (+ 1 (LEN (CDR X)) 0)))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive
type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0
and the :type-prescription rule LEN.
Subgoal *1/1.5
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(NOT (ZP N))
(NOT (INTEGERP N)))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ 1 (LEN (CDR X)) 0)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.4
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(NOT (ZP N))
(INTEGERP N)
(<= 0 N))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ 1 (LEN (CDR X)) (- N))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.3
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(ZP N)
(INTEGERP N)
(<= 0 N))
(EQUAL (LEN X)
(NFIX (+ 1 (LEN (CDR X)) (- N))))).
[GC for 4567 CONS pages..(T=22).GC finished]
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :executable-counterparts of <, BINARY-+, INTEGERP, NOT, UNARY--
and ZP and linear arithmetic, to
Subgoal *1/1.3'
(IMPLIES (AND (CONSP X)
(EQUAL (LEN (NTHCDR -1 (CDR X)))
(NFIX (+ (LEN (CDR X)) 0))))
(EQUAL (LEN X)
(NFIX (+ 1 (LEN (CDR X)) 0)))).
But simplification reduces this to T, using the :definitions FIX, LEN,
NFIX and NTHCDR, the :executable-counterpart of ZP, primitive type
reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and
the :type-prescription rule LEN.
Subgoal *1/1.2
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(ZP N)
(< N 0))
(EQUAL (LEN X)
(NFIX (+ 1 (LEN (CDR X)) 0)))).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive
type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0
and the :type-prescription rule LEN.
Subgoal *1/1.1
(IMPLIES (AND (CONSP X)
(< (+ -1 N) 0)
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ (LEN (CDR X)) 0)))
(NOT (ZP N))
(< N 0))
(EQUAL (LEN (NTHCDR (+ N -1) (CDR X)))
(NFIX (+ 1 (LEN (CDR X)) 0)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM LEN-NTHCDR ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION FIX)
(:DEFINITION LEN)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION NTHCDR)
(:EXECUTABLE-COUNTERPART <)
(:EXECUTABLE-COUNTERPART BINARY-+)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART INTEGERP)
(:EXECUTABLE-COUNTERPART LEN)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART UNARY--)
(:EXECUTABLE-COUNTERPART ZP)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION LEN)
(:INDUCTION NTHCDR)
(:REWRITE ASSOCIATIVITY-OF-+)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE DEFAULT-CDR)
(:REWRITE NTHCDR-NIL)
(:REWRITE UNICITY-OF-0)
(:TYPE-PRESCRIPTION LEN))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION FIX)
(:DEFINITION NFIX)
(:DEFINITION NTHCDR))
Time: 0.76 seconds (prove: 0.72, print: 0.04, other: 0.00)
Prover steps counted: 2873
LEN-NTHCDR
ACL2 !>>(LOCAL
(DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
(IMPLIES (AND (STRINGP SEQ)
(NATP START)
(NATP END)
(<= START END)
(<= END (LENGTH SEQ))
(STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END)
'LIST)))))
ACL2 Warning [Non-rec] in ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
...): A :REWRITE rule generated from SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
will be triggered only by terms containing the function symbol SUBSEQ,
which has a non-recursive definition. Unless this definition is disabled,
this rule is unlikely ever to be used.
By the simple :definition NATP we reduce the conjecture to
Goal'
(IMPLIES (AND (STRINGP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END)
(<= END (LENGTH SEQ))
(STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))).
This simplifies, using the :definitions LENGTH, SUBSEQ and SUBSEQ-LIST,
to
Goal''
(IMPLIES (AND (STRINGP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END)
(<= END (LEN (COERCE SEQ 'LIST)))
(STANDARD-CHAR-LISTP (COERCE SEQ 'LIST)))
(STANDARD-CHAR-LISTP
(COERCE (COERCE (TAKE (+ END (- START))
(NTHCDR START (COERCE SEQ 'LIST)))
'STRING)
'LIST))).
[GC for 4567 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition NFIX, linear
arithmetic, primitive type reasoning, the :forward-chaining rule
CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR,
CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR,
STANDARD-CHAR-LISTP-NTHCDR and STANDARD-CHAR-LISTP-OF-TAKE and the
:type-prescription rules CHARACTER-LISTP, LEN and STANDARD-CHAR-LISTP.
Q.E.D.
The storage of SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP depends upon the
:type-prescription rule STANDARD-CHAR-LISTP.
Summary
Form: ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ...)
Rules: ((:DEFINITION LENGTH)
(:DEFINITION NATP)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION SUBSEQ)
(:DEFINITION SUBSEQ-LIST)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
(:REWRITE CHARACTER-LISTP-NTHCDR)
(:REWRITE CHARACTER-LISTP-OF-TAKE)
(:REWRITE COERCE-INVERSE-1)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE LEN-NTHCDR)
(:REWRITE STANDARD-CHAR-LISTP-NTHCDR)
(:REWRITE STANDARD-CHAR-LISTP-OF-TAKE)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP))
Warnings: Non-rec
Time: 0.24 seconds (prove: 0.24, print: 0.00, other: 0.00)
Prover steps counted: 582
SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP
ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. However, one of these is flawed and so we are
left with one viable candidate.
We will induct according to a scheme suggested by (REVAPPEND X Y).
This suggestion was produced using the :induction rule REVAPPEND.
If we let (:P X Y) denote *1 above then the induction scheme we'll
use is
(AND (IMPLIES (AND (NOT (ENDP X))
(:P (CDR X) (CONS (CAR X) Y)))
(:P X Y))
(IMPLIES (ENDP X) (:P X Y))).
This induction is justified by the same argument used to admit REVAPPEND.
Note, however, that the unmeasured variable Y is being instantiated.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP X))
(EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(TRUE-LISTP (CONS (CAR X) Y))))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP X)
(EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(TRUE-LISTP (CONS (CAR X) Y))))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
But simplification reduces this to T, using the :definitions REVAPPEND
and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS.
Subgoal *1/1
(IMPLIES (ENDP X)
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (NOT (CONSP X))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
But simplification reduces this to T, using the :definition REVAPPEND
and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM TRUE-LISTP-REVAPPEND ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION NOT)
(:DEFINITION REVAPPEND)
(:DEFINITION TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION REVAPPEND)
(:REWRITE CDR-CONS))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
Prover steps counted: 311
TRUE-LISTP-REVAPPEND
ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
(IMPLIES (TRUE-LISTP X)
(TRUE-LISTP (NTHCDR N X)))))
But we reduce the conjecture to T, by the :type-prescription rule
TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION.
Q.E.D.
The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription
rule TRUE-LISTP.
Summary
Form: ( DEFTHM TRUE-LISTP-NTHCDR ...)
Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
(:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRUE-LISTP-NTHCDR
ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ
(IMPLIES (TRUE-LISTP SEQ)
(TRUE-LISTP (SUBSEQ SEQ START END)))
:RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION)))
ACL2 Observation in ( DEFTHM TRUE-LISTP-SUBSEQ ...): Our heuristics
choose (SUBSEQ SEQ START END) as the :TYPED-TERM.
ACL2 Warning [Non-rec] in ( DEFTHM TRUE-LISTP-SUBSEQ ...): A :REWRITE
rule generated from TRUE-LISTP-SUBSEQ will be triggered only by terms
containing the function symbol SUBSEQ, which has a non-recursive definition.
Unless this definition is disabled, this rule is unlikely ever to be
used.
But we reduce the conjecture to T, by the :type-prescription rule
TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION.
Q.E.D.
The storage of TRUE-LISTP-SUBSEQ depends upon the :type-prescription
rule TRUE-LISTP.
Summary
Form: ( DEFTHM TRUE-LISTP-SUBSEQ ...)
Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
(:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION))
Warnings: Non-rec
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRUE-LISTP-SUBSEQ
ACL2 !>>(LOCAL (DEFTHM LEN-REVAPPEND
(EQUAL (LEN (REVAPPEND X Y))
(+ (LEN X) (LEN Y)))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. These merge into two derived induction
schemes. However, one of these is flawed and so we are left with one
viable candidate.
We will induct according to a scheme suggested by (LEN X), but modified
to accommodate (REVAPPEND X Y). These suggestions were produced using
the :induction rules LEN and REVAPPEND. If we let (:P X Y) denote
*1 above then the induction scheme we'll use is
(AND (IMPLIES (NOT (CONSP X)) (:P X Y))
(IMPLIES (AND (CONSP X)
(:P (CDR X) (CONS (CAR X) Y)))
(:P X Y))).
This induction is justified by the same argument used to admit LEN.
Note, however, that the unmeasured variable Y is being instantiated.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (NOT (CONSP X))
(EQUAL (LEN (REVAPPEND X Y))
(+ (LEN X) (LEN Y)))).
[GC for 4567 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definitions FIX, LEN
and REVAPPEND, primitive type reasoning, the :rewrite rule UNICITY-OF-0
and the :type-prescription rule LEN.
Subgoal *1/1
(IMPLIES (AND (CONSP X)
(EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(+ (LEN (CDR X))
(LEN (CONS (CAR X) Y)))))
(EQUAL (LEN (REVAPPEND X Y))
(+ (LEN X) (LEN Y)))).
This simplifies, using the :definitions LEN and REVAPPEND, primitive
type reasoning and the :rewrite rules CDR-CONS and COMMUTATIVITY-OF-+,
to
Subgoal *1/1'
(IMPLIES (AND (CONSP X)
(EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(+ (LEN (CDR X)) 1 (LEN Y))))
(EQUAL (+ (LEN (CDR X)) 1 (LEN Y))
(+ (LEN Y) 1 (LEN (CDR X))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM LEN-REVAPPEND ...)
Rules: ((:DEFINITION FIX)
(:DEFINITION LEN)
(:DEFINITION NOT)
(:DEFINITION REVAPPEND)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION LEN)
(:INDUCTION REVAPPEND)
(:REWRITE CDR-CONS)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE UNICITY-OF-0)
(:TYPE-PRESCRIPTION LEN))
Time: 0.24 seconds (prove: 0.24, print: 0.00, other: 0.00)
Prover steps counted: 385
LEN-REVAPPEND
ACL2 !>>(LOCAL (DEFTHM LEN-OF-TAKE
(EQUAL (LEN (TAKE N LST)) (NFIX N))))
This simplifies, using the :definition NFIX (if-intro), to the following
three conjectures.
Subgoal 3
(IMPLIES (NOT (INTEGERP N))
(EQUAL (LEN (TAKE N LST)) 0)).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable-
counterparts of EQUAL and LEN.
Subgoal 2
(IMPLIES (AND (INTEGERP N) (<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
Name the formula above *1.
Subgoal 1
(IMPLIES (< N 0)
(EQUAL (LEN (TAKE N LST)) 0)).
But simplification reduces this to T, using the :compound-recognizer
rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable-
counterparts of EQUAL and LEN.
So we now return to *1, which is
(IMPLIES (AND (INTEGERP N) (<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
Perhaps we can prove *1 by induction. One induction scheme is suggested
by this conjecture.
We will induct according to a scheme suggested by (TAKE N LST). This
suggestion was produced using the :induction rule TAKE. If we let
(:P LST N) denote *1 above then the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ZP N))
(:P (CDR LST) (+ -1 N)))
(:P LST N))
(IMPLIES (ZP N) (:P LST N))).
This induction is justified by the same argument used to admit TAKE.
Note, however, that the unmeasured variable LST is being instantiated.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ZP N))
(EQUAL (LEN (TAKE (+ -1 N) (CDR LST)))
(+ -1 N))
(INTEGERP N)
(<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :definitions LEN and TAKE, primitive type reasoning, the :rewrite
rule CDR-CONS and the :type-prescription rule TRUE-LISTP-TAKE, to
Subgoal *1/4'
(IMPLIES (AND (NOT (ZP N))
(EQUAL (LEN (TAKE (+ -1 N) (CDR LST)))
(+ -1 N))
(<= 0 N))
(EQUAL (+ 1 -1 N) N)).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/3
(IMPLIES (AND (NOT (ZP N))
(< (+ -1 N) 0)
(INTEGERP N)
(<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
But we reduce the conjecture to T, by the :compound-recognizer rule
ZP-COMPOUND-RECOGNIZER and primitive type reasoning.
Subgoal *1/2
(IMPLIES (AND (NOT (ZP N))
(NOT (INTEGERP (+ -1 N)))
(INTEGERP N)
(<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
But we reduce the conjecture to T, by the :compound-recognizer rule
ZP-COMPOUND-RECOGNIZER.
Subgoal *1/1
(IMPLIES (AND (ZP N) (INTEGERP N) (<= 0 N))
(EQUAL (LEN (TAKE N LST)) N)).
This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER,
the :executable-counterparts of <, INTEGERP, NOT and ZP and linear
arithmetic, to
Subgoal *1/1'
(EQUAL (LEN (TAKE 0 LST)) 0).
But simplification reduces this to T, using the :definition TAKE and
the :executable-counterparts of EQUAL, LEN and ZP.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM LEN-OF-TAKE ...)
Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION LEN)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION TAKE)
(:EXECUTABLE-COUNTERPART <)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART INTEGERP)
(:EXECUTABLE-COUNTERPART LEN)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART ZP)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION TAKE)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION TRUE-LISTP-TAKE))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION NFIX))
Time: 0.02 seconds (prove: 0.02, print: 0.00, other: 0.00)
Prover steps counted: 413
LEN-OF-TAKE
ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ
(IMPLIES (AND (TRUE-LISTP SEQ)
(NATP START)
(NATP END)
(<= START END))
(EQUAL (LEN (SUBSEQ SEQ START END))
(- END START)))))
ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ ...): A :REWRITE rule
generated from LEN-SUBSEQ will be triggered only by terms containing
the function symbol SUBSEQ, which has a non-recursive definition.
Unless this definition is disabled, this rule is unlikely ever to be
used.
By the simple :definition NATP we reduce the conjecture to
Goal'
(IMPLIES (AND (TRUE-LISTP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END))
(EQUAL (LEN (SUBSEQ SEQ START END))
(+ END (- START)))).
[GC for 4567 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST,
primitive type reasoning and the :rewrite rule LEN-OF-TAKE, to
Goal''
(IMPLIES (AND (TRUE-LISTP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END)
(< (+ END (- START)) 0))
(EQUAL 0 (+ END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
Summary
Form: ( DEFTHM LEN-SUBSEQ ...)
Rules: ((:DEFINITION NATP)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION SUBSEQ)
(:DEFINITION SUBSEQ-LIST)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE LEN-OF-TAKE))
Warnings: Non-rec
Time: 0.24 seconds (prove: 0.24, print: 0.00, other: 0.00)
Prover steps counted: 286
LEN-SUBSEQ
ACL2 !>>(LOCAL
(DEFTHM LEN-SUBSEQ-STRING
(IMPLIES (AND (STRINGP SEQ)
(NATP START)
(NATP END)
(<= START END)
(<= END (LEN (COERCE SEQ 'LIST))))
(EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
(- END START)))
:HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ)))))
ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ-STRING ...): A :REWRITE
rule generated from LEN-SUBSEQ-STRING will be triggered only by terms
containing the function symbol SUBSEQ, which has a non-recursive definition.
Unless this definition is disabled, this rule is unlikely ever to be
used.
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
By the simple :definition NATP we reduce the conjecture to
Goal'
(IMPLIES (AND (STRINGP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END)
(<= END (LEN (COERCE SEQ 'LIST))))
(EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST))
(+ END (- START)))).
This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST,
linear arithmetic, primitive type reasoning, the :forward-chaining
rule CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR,
CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR
and LEN-OF-TAKE and the :type-prescription rules CHARACTER-LISTP and
LEN, to
Goal''
(IMPLIES (AND (STRINGP SEQ)
(INTEGERP START)
(<= 0 START)
(INTEGERP END)
(<= 0 END)
(<= START END)
(<= END (LEN (COERCE SEQ 'LIST)))
(< (+ END (- START)) 0))
(EQUAL 0 (+ END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
Summary
Form: ( DEFTHM LEN-SUBSEQ-STRING ...)
Rules: ((:DEFINITION NATP)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION SUBSEQ)
(:DEFINITION SUBSEQ-LIST)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
(:REWRITE CHARACTER-LISTP-NTHCDR)
(:REWRITE CHARACTER-LISTP-OF-TAKE)
(:REWRITE COERCE-INVERSE-1)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE LEN-NTHCDR)
(:REWRITE LEN-OF-TAKE)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION LEN))
Warnings: Non-rec
Time: 0.02 seconds (prove: 0.02, print: 0.00, other: 0.00)
Prover steps counted: 384
LEN-SUBSEQ-STRING
ACL2 !>>(DEFUN
SEARCH-FN
(SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
(DECLARE
(XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
:GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ)))))
(LET*
((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2)))
(SEQ1 (SUBSEQ SEQ1 START1 END1)))
(MV-LET
(SEQ1 SEQ2)
(COND ((EQ TEST 'CHAR-EQUAL)
(MV (STRING-DOWNCASE SEQ1)
(STRING-DOWNCASE SEQ2)))
(T (MV SEQ1 SEQ2)))
(AND (<= (- END1 START1) (- END2 START2))
(COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL))
(T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)))))))
[GC for 4567 CONS pages..(T=24).GC finished]
Since SEARCH-FN is non-recursive, its admission is trivial. We observe
that the type of SEARCH-FN is described by the theorem
(OR (OR (INTEGERP (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P))
(EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
NIL))
(EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
START2)).
We used the :type-prescription rules SEARCH-FROM-END and SEARCH-FROM-START.
Computing the guard conjecture for SEARCH-FN....
The non-trivial part of the guard conjecture for SEARCH-FN is
Goal
(AND
(IMPLIES
(SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
(LET
((END1 (IF END1P END1 (LENGTH SEQ1))))
(AND
(OR END2P (TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(LET ((END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (<= 0 START1)
(INTEGERP START1)
(OR (NULL END1) (<= END1 (LENGTH SEQ1)))
(OR (NULL END1) (INTEGERP END1))
(OR (TRUE-LISTP SEQ1) (STRINGP SEQ1))
(OR (NOT END1) (<= START1 END1))
(OR END1 (<= START1 (LENGTH SEQ1)))
(LET ((SEQ1 (SUBSEQ SEQ1 START1 END1)))
(AND (OR (NOT (EQ TEST 'CHAR-EQUAL))
(STRINGP SEQ1))
(OR (NOT (EQ TEST 'CHAR-EQUAL))
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)))
(OR (NOT (EQ TEST 'CHAR-EQUAL))
(STRINGP SEQ2))
(OR (NOT (EQ TEST 'CHAR-EQUAL))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(MV-LET (SEQ1 SEQ2)
(IF (EQ TEST 'CHAR-EQUAL)
(LIST (STRING-DOWNCASE SEQ1)
(STRING-DOWNCASE SEQ2))
(LIST SEQ1 SEQ2))
(AND (ACL2-NUMBERP START2)
(ACL2-NUMBERP END2)
(ACL2-NUMBERP (- START2))
(ACL2-NUMBERP START1)
(ACL2-NUMBERP END1)
(ACL2-NUMBERP (- START1))
(RATIONALP (+ END2 (- START2)))
(RATIONALP (+ END1 (- START1)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(INTEGERP END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(INTEGERP START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= (+ START2 (LENGTH SEQ1)) END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= END2 (LENGTH SEQ2)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= 0 START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (INTEGERP END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (INTEGERP START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END
(<= (+ START2 (LENGTH SEQ1)) END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (<= END2 (LENGTH SEQ2)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (<= 0 START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (TRUE-LISTP SEQ2)
(STRINGP SEQ2)))))))))))
(IMPLIES (AND (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST
START1 START2 END1 END2 END1P END2P)
(NOT END1P)
(NOT (TRUE-LISTP SEQ1)))
(STRINGP SEQ1))).
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
[GC for 4567 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=22).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
By the simple :definitions EQ, NULL, SEARCH-FN-GUARD and STRING-DOWNCASE
and the :executable-counterpart of TAU-SYSTEM we reduce the conjecture
to
Goal'
(IMPLIES
(AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))
(COND ((STRINGP SEQ1)
(AND (STRINGP SEQ2)
(COND ((EQUAL TEST 'EQUAL)
(LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
((STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(AND (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))))
(T NIL))))
((EQUAL TEST 'CHAR-EQUAL) NIL)
((TRUE-LISTP SEQ1)
(AND (TRUE-LISTP SEQ2)
(LET ((END1 (IF END1P END1 (LENGTH SEQ1)))
(END2 (IF END2P END2 (LENGTH SEQ2))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))))
(T NIL)))
(LET
((END1 (IF END1P END1 (LENGTH SEQ1))))
(AND
(OR END2P (TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(LET
((END2 (IF END2P END2 (LENGTH SEQ2))))
(AND
(<= 0 START1)
(INTEGERP START1)
(OR (EQUAL END1 NIL)
(<= END1 (LENGTH SEQ1)))
(OR (EQUAL END1 NIL) (INTEGERP END1))
(OR (TRUE-LISTP SEQ1) (STRINGP SEQ1))
(OR (NOT END1) (<= START1 END1))
(OR END1 (<= START1 (LENGTH SEQ1)))
(LET
((SEQ1 (SUBSEQ SEQ1 START1 END1)))
(AND (OR (NOT (EQUAL TEST 'CHAR-EQUAL))
(STRINGP SEQ1))
(OR (NOT (EQUAL TEST 'CHAR-EQUAL))
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)))
(OR (NOT (EQUAL TEST 'CHAR-EQUAL))
(STRINGP SEQ2))
(OR (NOT (EQUAL TEST 'CHAR-EQUAL))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)))
(MV-LET (SEQ1 SEQ2)
(IF (EQUAL TEST 'CHAR-EQUAL)
(LIST (COERCE (STRING-DOWNCASE1 (COERCE SEQ1 'LIST))
'STRING)
(COERCE (STRING-DOWNCASE1 (COERCE SEQ2 'LIST))
'STRING))
(LIST SEQ1 SEQ2))
(AND (ACL2-NUMBERP START2)
(ACL2-NUMBERP END2)
(ACL2-NUMBERP (- START2))
(ACL2-NUMBERP START1)
(ACL2-NUMBERP END1)
(ACL2-NUMBERP (- START1))
(RATIONALP (+ END2 (- START2)))
(RATIONALP (+ END1 (- START1)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(INTEGERP END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(INTEGERP START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= (+ START2 (LENGTH SEQ1)) END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= END2 (LENGTH SEQ2)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(<= 0 START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
(NOT FROM-END)
(TRUE-LISTP SEQ2)
(STRINGP SEQ2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (INTEGERP END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (INTEGERP START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END
(<= (+ START2 (LENGTH SEQ1)) END2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (<= END2 (LENGTH SEQ2)))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (<= 0 START2))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (TRUE-LISTP SEQ1)
(STRINGP SEQ1))
(OR (< (+ END2 (- START2))
(+ END1 (- START1)))
FROM-END (TRUE-LISTP SEQ2)
(STRINGP SEQ2))))))))))).
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.24 secs; see
:DOC time-tracker-tau.
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=22).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4577 CONS pages..(T=22).GC finished]
[GC for 4577 CONS pages..(T=24).GC finished]
[GC for 4587 CONS pages..(T=22).GC finished]
[GC for 4587 CONS pages..(T=24).GC finished]
[GC for 4587 CONS pages..(T=24).GC finished]
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH, MEMBER-EQUAL (if-
intro), MV-NTH and NOT (if-intro), the :executable-counterparts of
ACL2-NUMBERP, CAR, CDR, CONSP, EQUAL and NOT, linear arithmetic, primitive
type reasoning, the :rewrite rules CHARACTER-LISTP-STRING-DOWNCASE-1,
COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-STRING-DOWNCASE1, LEN-SUBSEQ,
LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the
:type-prescription rules LEN, STANDARD-CHAR-LISTP,
STRINGP-SUBSEQ-TYPE-PRESCRIPTION and TRUE-LISTP-SUBSEQ, to the following
183 conjectures.
Subgoal 183
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 182
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 181
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 180
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 179
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 178
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 177
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(INTEGERP END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 176
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ END1 (- START1)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 175
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 175'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 174
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
END2)).
By the simple :definition NATP we reduce the conjecture to
Subgoal 174'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
END2)).
[GC for 4587 CONS pages..(T=22).GC finished]
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rule
LEN-SUBSEQ-STRING, to
Subgoal 174''
(IMPLIES (AND (STRINGP SEQ1)
(STRINGP SEQ2)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LEN (COERCE SEQ1 'LIST)))
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2 END1 (- START1)) END2)).
But simplification reduces this to T, using linear arithmetic and primitive
type reasoning.
Subgoal 173
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 172
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 171
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 170
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 169
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 168
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
END1).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 167
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ NIL (- START1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 166
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 165
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 164
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 164'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 163
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 NIL)
'LIST)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 162
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 161
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 160
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 159
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 158
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 157
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 156
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 155
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN (COERCE SEQ1 'LIST))
(LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 154
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 153
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 152
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= (+ START2 (- START1)
(LEN (COERCE SEQ1 'LIST)))
END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 151
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 151'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP (LEN (COERCE SEQ1 'LIST)))
(<= 0 (LEN (COERCE SEQ1 'LIST)))
(INTEGERP END2)
(<= 0 END2)
(<= START1 (LEN (COERCE SEQ1 'LIST)))
(<= START2 END2)
(<= (LEN (COERCE SEQ1 'LIST))
(LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 150
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 149
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 148
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 147
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 146
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END1 (- START1)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 145
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 144
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL)
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 143
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL)
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ (- START2)
(LEN (COERCE SEQ2 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 142
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 141
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 141'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN (COERCE SEQ2 'LIST)))
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LENGTH SEQ1))
(<= (LEN (COERCE SEQ2 'LIST))
(LENGTH SEQ2))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 140
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL)
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 139
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL)
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
END1).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 138
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 137
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 136
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 135
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 135'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN (COERCE SEQ2 'LIST)))
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LENGTH SEQ1))
(<= (LEN (COERCE SEQ2 'LIST))
(LENGTH SEQ2))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule
LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to
Subgoal 135''
(IMPLIES (AND (STRINGP SEQ1)
(STRINGP SEQ2)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LEN (COERCE SEQ1 'LIST)))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2 END1 (- START1))
(LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=22).GC finished]
But simplification reduces this to T, using linear arithmetic, primitive
type reasoning and the :type-prescription rule LEN.
Subgoal 134
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ (- START2)
(LEN (COERCE SEQ2 'LIST))))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 133
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(INTEGERP END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 132
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 131
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 130
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 129
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ (- START2)
(LEN (COERCE SEQ2 'LIST))))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 128
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN (COERCE SEQ1 'LIST))
(LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 127
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 126
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 125
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 124
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 123
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2 (- START1)
(LEN (COERCE SEQ1 'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 122
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 121
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 120
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 119
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END1)).
[GC for 4587 CONS pages..(T=22).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 118
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 117
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 116
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(INTEGERP END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 115
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ END1 (- START1)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 114
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN SEQ2))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 114'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN SEQ2))).
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 113
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
END2)).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 113'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
END2)).
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rule
LEN-SUBSEQ, to
Subgoal 113''
(IMPLIES (AND (NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LEN SEQ1))
(<= END2 (LEN SEQ2))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2 END1 (- START1)) END2)).
But simplification reduces this to T, using linear arithmetic and primitive
type reasoning.
Subgoal 112
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 111
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 110
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2)
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 109
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 108
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN SEQ1))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 107
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
END1).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 106
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ NIL (- START1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 105
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 104
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 103
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN SEQ1))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 103'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
END1)
(<= END1 (LEN SEQ1))).
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 102
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= (+ START2 (LEN (SUBSEQ SEQ1 START1 NIL)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 101
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 100
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 99
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= END2 (LEN SEQ2))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 98
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 97
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 96
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 95
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 94
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN SEQ1) (LEN SEQ1))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 93
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 92
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END2 (- START2)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 91
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(<= (+ START2 (- START1) (LEN SEQ1))
END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 90
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(<= END2 (LEN SEQ2))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 90'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP (LEN SEQ1))
(<= 0 (LEN SEQ1))
(INTEGERP END2)
(<= 0 END2)
(<= START1 (LEN SEQ1))
(<= START2 END2)
(<= (LEN SEQ1) (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(<= END2 (LEN SEQ2))).
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 89
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 88
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 87
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
END2P
(LET ((END1 (LEN SEQ1)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 86
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 85
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END1 (- START1)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 84
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 83
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN SEQ1))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 82
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ (- START2) (LEN SEQ2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 81
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 80
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN SEQ1))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 80'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN SEQ2))
(<= 0 (LEN SEQ2))
(<= START1 END1)
(<= START2 (LEN SEQ2))
(<= END1 (LENGTH SEQ1))
(<= (LEN SEQ2) (LENGTH SEQ2))
END1)
(<= END1 (LEN SEQ1))).
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 79
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 78
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END1 NIL) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
END1).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 77
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 76
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 75
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(<= (LEN SEQ2) (LEN SEQ2))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 74
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
(LEN SEQ2))).
[GC for 4587 CONS pages..(T=22).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 74'
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN SEQ2))
(<= 0 (LEN SEQ2))
(<= START1 END1)
(<= START2 (LEN SEQ2))
(<= END1 (LENGTH SEQ1))
(<= (LEN SEQ2) (LENGTH SEQ2))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1)))
(LEN SEQ2))).
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule
LEN-SUBSEQ and the :type-prescription rule LEN, to
Subgoal 74''
(IMPLIES (AND (NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(<= 0 (LEN SEQ2))
(<= START1 END1)
(<= START2 (LEN SEQ2))
(<= END1 (LEN SEQ1))
(<= (LEN SEQ2) (LEN SEQ2))
(<= (+ END1 (- START1))
(+ (- START2) (LEN SEQ2))))
(<= (+ START2 END1 (- START1))
(LEN SEQ2))).
But simplification reduces this to T, using linear arithmetic, primitive
type reasoning and the :type-prescription rule LEN.
Subgoal 73
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(RATIONALP (+ (- START2) (LEN SEQ2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 72
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(INTEGERP END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 71
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
END1P (NOT END2P)
(LET ((END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(ACL2-NUMBERP START2))
(ACL2-NUMBERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 70
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 69
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 68
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ (- START2) (LEN SEQ2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 67
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN SEQ1) (LEN SEQ1))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 66
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 65
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ (- START2) (LEN SEQ2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 64
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ (- START2) (LEN SEQ2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 63
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ (- START2) (LEN SEQ2))))
(<= (LEN SEQ2) (LEN SEQ2))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 62
(IMPLIES (AND (EQUAL TEST 'EQUAL)
(NOT (STRINGP SEQ1))
(TRUE-LISTP SEQ1)
(TRUE-LISTP SEQ2)
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2)))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN SEQ1))
(+ (- START2) (LEN SEQ2))))
(<= (+ START2 (- START1) (LEN SEQ1))
(LEN SEQ2))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 61
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 60
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 59
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
END1).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 58
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 58'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 57
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 NIL)
'LIST))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 56
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 55
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 54
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 53
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(RATIONALP (+ NIL (- START1)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 52
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 51
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 50
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 NIL)
'LIST)))
END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 49
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 48
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 47
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 46
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET ((END1 NIL))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1)
(<= (+ NIL (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 45
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 44
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(INTEGERP END1))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 44'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2)))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))).
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite
rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription
rule STANDARD-CHAR-LISTP.
Subgoal 43
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(RATIONALP (+ END1 (- START1)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 42
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(ACL2-NUMBERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 41
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 40
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 39
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 38
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= 0 START2)).
[GC for 4587 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 37
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
END2)).
By the simple :definition NATP we reduce the conjecture to
Subgoal 37'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
END2)).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rules
LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the
:type-prescription rule STANDARD-CHAR-LISTP, to
Subgoal 37''
(IMPLIES (AND (STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LEN (COERCE SEQ1 'LIST)))
(<= END2 (LEN (COERCE SEQ2 'LIST)))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= (+ START2 END1 (- START1)) END2)).
But simplification reduces this to T, using linear arithmetic and primitive
type reasoning.
Subgoal 36
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 36'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP END2)
(<= 0 END2)
(<= START1 END1)
(<= START2 END2)
(<= END1 (LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition LENGTH.
Subgoal 35
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P END2P
(LET NIL
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))
(<= (+ END1 (- START1))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 34
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 33
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 32
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 31
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN (COERCE SEQ1 'LIST))
(LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 30
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 29
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END2 (- START2)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 28
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= (+ START2 (- START1)
(LEN (COERCE SEQ1 'LIST)))
END2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 27
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 27'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P (INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP (LEN (COERCE SEQ1 'LIST)))
(<= 0 (LEN (COERCE SEQ1 'LIST)))
(INTEGERP END2)
(<= 0 END2)
(<= START1 (LEN (COERCE SEQ1 'LIST)))
(<= START2 END2)
(<= (LEN (COERCE SEQ1 'LIST))
(LENGTH SEQ1))
(<= END2 (LENGTH SEQ2))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= END2 (LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 26
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 25
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 24
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
END2P
(LET ((END1 (LEN (COERCE SEQ1 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ END2 (- START2))))
(INTEGERP END2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 23
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 22
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 22'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN (COERCE SEQ2 'LIST)))
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LENGTH SEQ1))
(<= (LEN (COERCE SEQ2 'LIST))
(LENGTH SEQ2)))
(STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST))).
[GC for 4587 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite
rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription
rules LEN and STANDARD-CHAR-LISTP.
Subgoal 21
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 20
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ END1 (- START1)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 19
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP END1)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 18
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 17
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ (- START2)
(LEN (COERCE SEQ2 'LIST))))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 16
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END1 NIL)
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(NOT END1))
(<= START1 (LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
NATP.
Subgoal 15
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(INTEGERP END1)).
[GC for 4587 CONS pages..(T=22).GC finished]
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 14
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
By the simple :definition NATP we reduce the conjecture to
Subgoal 14'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN (COERCE SEQ2 'LIST)))
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LENGTH SEQ1))
(<= (LEN (COERCE SEQ2 'LIST))
(LENGTH SEQ2))
END1)
(<= END1 (LEN (COERCE SEQ1 'LIST)))).
But simplification reduces this to T, using the :definition LENGTH
and the :type-prescription rule LEN.
Subgoal 13
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 12
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 11
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 10
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(LET ((END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to
Subgoal 10'
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
END1P (NOT END2P)
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(INTEGERP (LEN (COERCE SEQ2 'LIST)))
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LENGTH SEQ1))
(<= (LEN (COERCE SEQ2 'LIST))
(LENGTH SEQ2))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2
(LEN (COERCE (SUBSEQ SEQ1 START1 END1)
'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule
LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to
Subgoal 10''
(IMPLIES (AND (STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(INTEGERP START1)
(<= 0 START1)
(INTEGERP START2)
(<= 0 START2)
(INTEGERP END1)
(<= 0 END1)
(<= 0 (LEN (COERCE SEQ2 'LIST)))
(<= START1 END1)
(<= START2 (LEN (COERCE SEQ2 'LIST)))
(<= END1 (LEN (COERCE SEQ1 'LIST)))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))
(<= (+ END1 (- START1))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2 END1 (- START1))
(LEN (COERCE SEQ2 'LIST)))).
But simplification reduces this to T, using linear arithmetic, primitive
type reasoning and the :type-prescription rule LEN.
Subgoal 9
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= 0 START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 8
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(INTEGERP START1)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 7
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(RATIONALP (+ (- START2)
(LEN (COERCE SEQ2 'LIST))))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 6
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(<= (LEN (COERCE SEQ1 'LIST))
(LEN (COERCE SEQ1 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 5
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2)))))
(ACL2-NUMBERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 4
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= 0 START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 3
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(INTEGERP START2)).
But we reduce the conjecture to T, by the simple :definition NATP.
Subgoal 2
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (LEN (COERCE SEQ2 'LIST))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL)
(STRINGP SEQ1)
(STRINGP SEQ2)
(STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))
(STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))
(NOT END1P)
(NOT END2P)
(LET ((END1 (LEN (COERCE SEQ1 'LIST)))
(END2 (LEN (COERCE SEQ2 'LIST))))
(AND (NATP START1)
(NATP START2)
(NATP END1)
(NATP END2)
(NOT (< END1 START1))
(NOT (< END2 START2))
(NOT (< (LENGTH SEQ1) END1))
(NOT (< (LENGTH SEQ2) END2))))
(<= (+ (- START1) (LEN (COERCE SEQ1 'LIST)))
(+ (- START2)
(LEN (COERCE SEQ2 'LIST)))))
(<= (+ START2 (- START1)
(LEN (COERCE SEQ1 'LIST)))
(LEN (COERCE SEQ2 'LIST)))).
But we reduce the conjecture to T, by the simple :definition NATP and
the :executable-counterpart of TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for SEARCH-FN. SEARCH-FN
is compliant with Common Lisp.
Summary
Form: ( DEFUN SEARCH-FN ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION EQ)
(:DEFINITION LENGTH)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION MV-NTH)
(:DEFINITION NATP)
(:DEFINITION NOT)
(:DEFINITION NULL)
(:DEFINITION SEARCH-FN-GUARD)
(:DEFINITION STRING-DOWNCASE)
(:EXECUTABLE-COUNTERPART ACL2-NUMBERP)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART NATP)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE CHARACTER-LISTP-STRING-DOWNCASE-1)
(:REWRITE COERCE-INVERSE-1)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE LEN-STRING-DOWNCASE1)
(:REWRITE LEN-SUBSEQ)
(:REWRITE LEN-SUBSEQ-STRING)
(:REWRITE SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION SEARCH-FROM-END)
(:TYPE-PRESCRIPTION SEARCH-FROM-START)
(:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)
(:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION)
(:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT))
Time: 10.56 seconds (prove: 9.90, print: 0.16, other: 0.50)
Prover steps counted: 63875
TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent
in the tau system was 1.98 seconds. See :DOC time-tracker-tau.
SEARCH-FN
End of Encapsulated Events.
[GC for 4587 CONS pages..(T=22).GC finished]
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export SEARCH-FN.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Warnings: Non-rec
Time: 13.88 seconds (prove: 12.16, print: 0.48, other: 1.24)
Prover steps counted: 72310
T
The event ( DEFMACRO SEARCH ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO SEARCH ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
Name the formula above *1.
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. These merge into one derived induction scheme.
We will induct according to a scheme suggested by (NTH N X). This
suggestion was produced using the :induction rules EQLABLE-LISTP and
NTH. If we let (:P N X) denote *1 above then the induction scheme
we'll use is
(AND (IMPLIES (AND (NOT (ENDP X))
(NOT (ZP N))
(:P (+ -1 N) (CDR X)))
(:P N X))
(IMPLIES (AND (NOT (ENDP X)) (ZP N))
(:P N X))
(IMPLIES (ENDP X) (:P N X))).
This induction is justified by the same argument used to admit NTH.
Note, however, that the unmeasured variable X is being instantiated.
When applied to the goal at hand the above induction scheme produces
four nontautological subgoals.
Subgoal *1/4
(IMPLIES (AND (NOT (ENDP X))
(NOT (ZP N))
(EQLABLEP (NTH (+ -1 N) (CDR X)))
(EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/4'
(IMPLIES (AND (CONSP X)
(NOT (ZP N))
(EQLABLEP (NTH (+ -1 N) (CDR X)))
(EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
But simplification reduces this to T, using the :compound-recognizer
rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions
EQLABLE-LISTP and NTH.
Subgoal *1/3
(IMPLIES (AND (NOT (ENDP X))
(NOT (ZP N))
(NOT (EQLABLE-LISTP (CDR X)))
(EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/3'
(IMPLIES (AND (CONSP X)
(NOT (ZP N))
(NOT (EQLABLE-LISTP (CDR X)))
(EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
But simplification reduces this to T, using the :definition EQLABLE-LISTP.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP X))
(ZP N)
(EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP X) (ZP N) (EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
But simplification reduces this to T, using the :compound-recognizer
rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions
EQLABLE-LISTP and NTH.
Subgoal *1/1
(IMPLIES (AND (ENDP X) (EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (AND (NOT (CONSP X)) (EQLABLE-LISTP X))
(EQLABLEP (NTH N X))).
But simplification reduces this to T, using the :definitions EQLABLE-LISTP
and NTH, the :executable-counterparts of CONSP and EQLABLEP and primitive
type reasoning.
That completes the proof of *1.
Q.E.D.
The storage of EQLABLEP-NTH depends upon the :compound-recognizer rule
EQLABLEP-RECOG and the :type-prescription rule EQLABLEP.
Summary
Form: ( DEFTHM EQLABLEP-NTH ...)
Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG)
(:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION ENDP)
(:DEFINITION EQLABLE-LISTP)
(:DEFINITION NOT)
(:DEFINITION NTH)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQLABLEP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION EQLABLE-LISTP)
(:INDUCTION NTH)
(:TYPE-PRESCRIPTION EQLABLEP))
Time: 0.02 seconds (prove: 0.00, print: 0.02, other: 0.00)
Prover steps counted: 481
EQLABLEP-NTH
For the admission of COUNT-STRINGP we will use the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (NFIX (+ (+ 1 END) (- START))). The non-trivial part of the
measure conjecture is
Goal
(AND (O-P (NFIX (+ (+ 1 END) (- START))))
(IMPLIES (NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START)))
(O< (NFIX (+ (+ 1 END) (- (+ 1 START))))
(NFIX (+ (+ 1 END) (- START)))))).
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :rewrite rule ASSOCIATIVITY-OF-+ we reduce the conjecture
to the following two conjectures.
Subgoal 2
(O-P (NFIX (+ 1 END (- START)))).
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P
and primitive type reasoning.
Subgoal 1
(IMPLIES (NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START)))
(O< (NFIX (+ 1 END (- (+ 1 START))))
(NFIX (+ 1 END (- START))))).
This simplifies, using the :definitions NFIX (if-intro), NOT (if-intro),
O-FINP and O< (if-intro), the :executable-counterpart of NOT and primitive
type reasoning, to the following three conjectures.
Subgoal 1.3
(IMPLIES (AND (INTEGERP START)
(INTEGERP END)
(< START END))
(<= 0 (+ 1 END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.2
(IMPLIES (AND (INTEGERP START)
(INTEGERP END)
(< START END)
(< (+ 1 END (- (+ 1 START))) 0))
(< 0 (+ 1 END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1.1
(IMPLIES (AND (INTEGERP START)
(INTEGERP END)
(< START END)
(<= 0 (+ 1 END (- (+ 1 START)))))
(< (+ 1 END (- (+ 1 START)))
(+ 1 END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the measure theorem for COUNT-STRINGP.
Thus, we admit this function under the principle of definition. We
observe that the type of COUNT-STRINGP is described by the theorem
(AND (INTEGERP (COUNT-STRINGP ITEM X START END))
(<= 0 (COUNT-STRINGP ITEM X START END))).
We used primitive type reasoning.
Computing the guard conjecture for COUNT-STRINGP....
The non-trivial part of the guard conjecture for COUNT-STRINGP, given
the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, primitive type
reasoning and the :type-prescription rules COUNT-STRINGP and LENGTH,
is
Goal
(AND (IMPLIES (AND (<= END (LENGTH X))
(NATP END)
(NATP START)
(STRINGP X)
(NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START))))
(< START (LENGTH X)))
(IMPLIES (AND (<= END (LENGTH X))
(NATP END)
(NATP START)
(STRINGP X)
(NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START)))
(NOT (EQLABLEP ITEM)))
(EQLABLEP (CHAR X START)))).
By the simple :definitions CHAR and NATP we reduce the conjecture to
the following two conjectures.
Subgoal 2
(IMPLIES (AND (<= END (LENGTH X))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(STRINGP X)
(NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START))))
(< START (LENGTH X))).
This simplifies, using the :definitions LENGTH and NOT and the :executable-
counterpart of NOT, to
Subgoal 2'
(IMPLIES (AND (<= END (LEN (COERCE X 'LIST)))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(STRINGP X)
(< START END))
(< START (LEN (COERCE X 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (<= END (LENGTH X))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(STRINGP X)
(NOT (OR (NOT (INTEGERP START))
(NOT (INTEGERP END))
(<= END START)))
(NOT (EQLABLEP ITEM)))
(EQLABLEP (NTH START (COERCE X 'LIST)))).
But simplification reduces this to T, using the :definitions LENGTH
and NOT, the :executable-counterpart of NOT, the :forward-chaining
rules CHARACTER-LISTP-COERCE and CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP,
the :rewrite rule EQLABLEP-NTH and the :type-prescription rules
CHARACTER-LISTP and EQLABLE-LISTP.
Q.E.D.
That completes the proof of the guard theorem for COUNT-STRINGP.
COUNT-STRINGP is compliant with Common Lisp.
Summary
Form: ( DEFUN COUNT-STRINGP ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION CHAR)
(:DEFINITION LENGTH)
(:DEFINITION NATP)
(:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION O-FINP)
(:DEFINITION O-P)
(:DEFINITION O<)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING CHARACTER-LISTP-COERCE)
(:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
(:REWRITE ASSOCIATIVITY-OF-+)
(:REWRITE EQLABLEP-NTH)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION COUNT-STRINGP)
(:TYPE-PRESCRIPTION EQLABLE-LISTP)
(:TYPE-PRESCRIPTION LENGTH))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION NFIX)
(:DEFINITION NOT)
(:DEFINITION O<))
Time: 0.44 seconds (prove: 0.24, print: 0.00, other: 0.20)
Prover steps counted: 924
COUNT-STRINGP
[GC for 4587 CONS pages..(T=24).GC finished]
For the admission of COUNT-LISTP we will use the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT X). The non-trivial part of the measure conjecture
is
Goal
(IMPLIES (NOT (OR (ENDP X) (ZP END)))
(O< (ACL2-COUNT (CDR X))
(ACL2-COUNT X))).
By case analysis we reduce the conjecture to
Goal'
(IMPLIES (NOT (OR (ENDP X) (ZP END)))
(O< (ACL2-COUNT (CDR X))
(ACL2-COUNT X))).
This simplifies, using the :definitions ENDP, O-FINP and O< and the
:type-prescription rule ACL2-COUNT, to
Goal''
(IMPLIES (AND (CONSP X) (NOT (ZP END)))
(< (ACL2-COUNT (CDR X))
(ACL2-COUNT X))).
The destructor terms (CAR X) and (CDR X) can be eliminated by using
CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X)
by X2. This produces the following goal.
Goal'''
(IMPLIES (AND (CONSP (CONS X1 X2))
(NOT (ZP END)))
(< (ACL2-COUNT X2)
(ACL2-COUNT (CONS X1 X2)))).
This simplifies, using the :definition ACL2-COUNT, primitive type reasoning
and the :rewrite rules CAR-CONS and CDR-CONS, to
Goal'4'
(IMPLIES (NOT (ZP END))
(< (ACL2-COUNT X2)
(+ 1 (ACL2-COUNT X1) (ACL2-COUNT X2)))).
But simplification reduces this to T, using linear arithmetic, primitive
type reasoning and the :type-prescription rule ACL2-COUNT.
Q.E.D.
That completes the proof of the measure theorem for COUNT-LISTP. Thus,
we admit this function under the principle of definition. We observe
that the type of COUNT-LISTP is described by the theorem
(AND (INTEGERP (COUNT-LISTP ITEM X END)) (<= 0 (COUNT-LISTP ITEM X END))).
We used primitive type reasoning.
Computing the guard conjecture for COUNT-LISTP....
The guard conjecture for COUNT-LISTP is trivial to prove, given the
:compound-recognizer rules NATP-COMPOUND-RECOGNIZER and
ZP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription
rule COUNT-LISTP. COUNT-LISTP is compliant with Common Lisp.
Summary
Form: ( DEFUN COUNT-LISTP ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION ACL2-COUNT)
(:DEFINITION ENDP)
(:DEFINITION O-FINP)
(:DEFINITION O<)
(:ELIM CAR-CDR-ELIM)
(:FAKE-RUNE-FOR-LINEAR NIL)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION ACL2-COUNT)
(:TYPE-PRESCRIPTION COUNT-LISTP))
Time: 0.22 seconds (prove: 0.02, print: 0.00, other: 0.20)
Prover steps counted: 754
COUNT-LISTP
To verify that the two encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR
(IMPLIES (TRUE-LISTP X)
(TRUE-LISTP (NTHCDR N X)))))
But we reduce the conjecture to T, by the :type-prescription rule
TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION.
Q.E.D.
The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription
rule TRUE-LISTP.
Summary
Form: ( DEFTHM TRUE-LISTP-NTHCDR ...)
Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP)
(:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
TRUE-LISTP-NTHCDR
ACL2 !>>(DEFUN
COUNT-FN (ITEM SEQUENCE START END)
(DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE)
T (STRINGP SEQUENCE))
(NATP START)
(OR (NULL END)
(AND (NATP END)
(<= END (LENGTH SEQUENCE)))))))
(LET ((END (OR END (LENGTH SEQUENCE))))
(COND ((<= END START) 0)
((STRINGP SEQUENCE)
(COUNT-STRINGP ITEM SEQUENCE START END))
(T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE)
(- END START))))))
Since COUNT-FN is non-recursive, its admission is trivial. We observe
that the type of COUNT-FN is described by the theorem
(AND (INTEGERP (COUNT-FN ITEM SEQUENCE START END))
(<= 0 (COUNT-FN ITEM SEQUENCE START END))).
We used the :type-prescription rules COUNT-LISTP and COUNT-STRINGP.
Computing the guard conjecture for COUNT-FN....
The non-trivial part of the guard conjecture for COUNT-FN, given the
:compound-recognizer rule NATP-COMPOUND-RECOGNIZER and the :type-prescription
rule LENGTH, is
Goal
(AND (IMPLIES (AND (EQUAL END NIL)
(NATP START)
(STRINGP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START)))))))
(IMPLIES (AND (EQUAL END NIL)
(NATP START)
(TRUE-LISTP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START)))))))
(IMPLIES (AND (<= END (LENGTH SEQUENCE))
(NATP END)
(NATP START)
(TRUE-LISTP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START)))))))
(IMPLIES (AND (<= END (LENGTH SEQUENCE))
(NATP END)
(NATP START)
(STRINGP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START)))))))).
[GC for 4587 CONS pages..(T=24).GC finished]
[GC for 4587 CONS pages..(T=22).GC finished]
[GC for 4587 CONS pages..(T=22).GC finished]
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definition NATP we reduce the conjecture to the following
four conjectures.
Subgoal 4
(IMPLIES (AND (NOT END)
(INTEGERP START)
(<= 0 START)
(STRINGP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START))))))).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :compound-recognizer rule
NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT, the :executable-
counterpart of NOT and the :type-prescription rule LEN, to
Subgoal 4'
(IMPLIES (AND (INTEGERP START)
(<= 0 START)
(STRINGP SEQUENCE)
(< START (LEN (COERCE SEQUENCE 'LIST))))
(<= (LEN (COERCE SEQUENCE 'LIST))
(LEN (COERCE SEQUENCE 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3
(IMPLIES (AND (NOT END)
(INTEGERP START)
(<= 0 START)
(TRUE-LISTP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START))))))).
[GC for 4587 CONS pages..(T=22).GC finished]
TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.22 secs; see
:DOC time-tracker-tau.
This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable-
counterpart of NOT, primitive type reasoning, the :rewrite rule
COMMUTATIVITY-OF-+ and the :type-prescription rules LEN and
TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to
Subgoal 3'
(IMPLIES (AND (INTEGERP START)
(<= 0 START)
(TRUE-LISTP SEQUENCE)
(< START (LEN SEQUENCE)))
(<= 0 (+ (- START) (LEN SEQUENCE)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2
(IMPLIES (AND (<= END (LENGTH SEQUENCE))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(TRUE-LISTP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START))))))).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable-
counterpart of NOT, primitive type reasoning and the :type-prescription
rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to
Subgoal 2'
(IMPLIES (AND (<= END (LEN SEQUENCE))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(TRUE-LISTP SEQUENCE)
(< START END))
(<= 0 (+ END (- START)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (<= END (LENGTH SEQUENCE))
(INTEGERP END)
(<= 0 END)
(INTEGERP START)
(<= 0 START)
(STRINGP SEQUENCE))
(LET ((END (OR END (LENGTH SEQUENCE))))
(AND (RATIONALP START)
(RATIONALP END)
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP END))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(NATP START))
(OR (<= END START)
(NOT (STRINGP SEQUENCE))
(<= END (LENGTH SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(INTEGERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP SEQUENCE))
(OR (<= END START)
(STRINGP SEQUENCE)
(<= 0 START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP START))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP END))
(OR (<= END START)
(STRINGP SEQUENCE)
(ACL2-NUMBERP (- START)))
(OR (<= END START)
(STRINGP SEQUENCE)
(TRUE-LISTP (NTHCDR START SEQUENCE)))
(OR (<= END START)
(STRINGP SEQUENCE)
(NATP (+ END (- START))))))).
[GC for 4587 CONS pages..(T=22).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT and
the :executable-counterpart of NOT.
Q.E.D.
That completes the proof of the guard theorem for COUNT-FN. COUNT-FN
is compliant with Common Lisp.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
Summary
Form: ( DEFUN COUNT-FN ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION LENGTH)
(:DEFINITION NATP)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE COMMUTATIVITY-OF-+)
(:TYPE-PRESCRIPTION COUNT-LISTP)
(:TYPE-PRESCRIPTION COUNT-STRINGP)
(:TYPE-PRESCRIPTION LEN)
(:TYPE-PRESCRIPTION LENGTH)
(:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION))
Time: 2.58 seconds (prove: 1.96, print: 0.02, other: 0.60)
Prover steps counted: 2976
TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent
in the tau system was 1.70 seconds. See :DOC time-tracker-tau.
COUNT-FN
End of Encapsulated Events.
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
We export COUNT-FN.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Time: 2.84 seconds (prove: 1.96, print: 0.02, other: 0.86)
Prover steps counted: 2976
T
The event ( DEFMACRO COUNT ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO COUNT ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since CPU-CORE-COUNT is non-recursive, its admission is trivial. We
observe that the type of CPU-CORE-COUNT is described by the theorem
(AND (CONSP (CPU-CORE-COUNT STATE)) (TRUE-LISTP (CPU-CORE-COUNT STATE))).
We used primitive type reasoning.
(CPU-CORE-COUNT STATE) => (MV * STATE).
Computing the guard conjecture for CPU-CORE-COUNT....
The guard conjecture for CPU-CORE-COUNT is trivial to prove, given
the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P. CPU-CORE-COUNT is compliant
with Common Lisp.
Summary
Form: ( DEFUN CPU-CORE-COUNT ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
CPU-CORE-COUNT
The event ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The admission of DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are trivial,
using the relation O< (which is known to be well-founded on the domain
recognized by O-P) and the measure (ACL2-COUNT TERM) for DUMB-OCCUR-VAR
and (ACL2-COUNT LST) for DUMB-OCCUR-VAR-LST. We observe that the type
of DUMB-OCCUR-VAR is described by the theorem
(OR (EQUAL (DUMB-OCCUR-VAR VAR TERM) T)
(EQUAL (DUMB-OCCUR-VAR VAR TERM) NIL))
and the type of DUMB-OCCUR-VAR-LST is described by the theorem
(OR (EQUAL (DUMB-OCCUR-VAR-LST VAR LST) T)
(EQUAL (DUMB-OCCUR-VAR-LST VAR LST)
NIL)).
Computing the guard conjecture for DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST....
The non-trivial part of the guard conjecture for DUMB-OCCUR-VAR and
DUMB-OCCUR-VAR-LST, given the :forward-chaining rule
PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription
rule PSEUDO-TERM-LISTP, is
Goal
(AND (IMPLIES (AND (PSEUDO-TERM-LISTP LST)
(SYMBOLP VAR)
(NOT (ENDP LST)))
(PSEUDO-TERMP (CAR LST)))
(IMPLIES (AND (PSEUDO-TERM-LISTP LST)
(SYMBOLP VAR)
(NOT (ENDP LST))
(NOT (DUMB-OCCUR-VAR VAR (CAR LST))))
(PSEUDO-TERM-LISTP (CDR LST)))
(IMPLIES (AND (PSEUDO-TERMP TERM)
(SYMBOLP VAR)
(NOT (EQ VAR TERM))
(NOT (ATOM TERM))
(NOT (EQ 'QUOTE (CAR TERM))))
(PSEUDO-TERM-LISTP (CDR TERM)))).
By the simple :definitions ATOM, ENDP and EQ we reduce the conjecture
to the following three conjectures.
Subgoal 3
(IMPLIES (AND (PSEUDO-TERM-LISTP LST)
(SYMBOLP VAR)
(CONSP LST))
(PSEUDO-TERMP (CAR LST))).
But simplification reduces this to T, using the :definition
PSEUDO-TERM-LISTP.
Subgoal 2
(IMPLIES (AND (PSEUDO-TERM-LISTP LST)
(SYMBOLP VAR)
(CONSP LST)
(NOT (DUMB-OCCUR-VAR VAR (CAR LST))))
(PSEUDO-TERM-LISTP (CDR LST))).
But simplification reduces this to T, using the :definition
PSEUDO-TERM-LISTP.
Subgoal 1
(IMPLIES (AND (PSEUDO-TERMP TERM)
(SYMBOLP VAR)
(NOT (EQUAL VAR TERM))
(CONSP TERM)
(NOT (EQUAL 'QUOTE (CAR TERM))))
(PSEUDO-TERM-LISTP (CDR TERM))).
But simplification reduces this to T, using the :definitions PSEUDO-TERMP
and TRUE-LISTP and primitive type reasoning.
Q.E.D.
That completes the proof of the guard theorem for DUMB-OCCUR-VAR and
DUMB-OCCUR-VAR-LST. DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are compliant
with Common Lisp.
Summary
Form: ( MUTUAL-RECURSION ( DEFUN DUMB-OCCUR-VAR ...) ...)
Rules: ((:DEFINITION ATOM)
(:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION NOT)
(:DEFINITION PSEUDO-TERM-LISTP)
(:DEFINITION PSEUDO-TERMP)
(:DEFINITION TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP)
(:TYPE-PRESCRIPTION PSEUDO-TERM-LISTP))
Time: 0.38 seconds (prove: 0.00, print: 0.02, other: 0.36)
Prover steps counted: 299
(DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST)
The event ( DEFUN MAKE-SHARP-ATSIGN ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN MAKE-SHARP-ATSIGN ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFUN SHARP-ATSIGN-ALIST ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SHARP-ATSIGN-ALIST ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO TIME$1 ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO TIME$1 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO TIME$ ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO TIME$ ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
To verify that the five encapsulated events correctly extend the current
theory we will evaluate them. The theory thus constructed is only
ephemeral.
Encapsulated Events:
ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))))
Name the formula above *1.
Perhaps we can prove *1 by induction. Two induction schemes are suggested
by this conjecture. However, one of these is flawed and so we are
left with one viable candidate.
We will induct according to a scheme suggested by (REVAPPEND X Y).
This suggestion was produced using the :induction rule REVAPPEND.
If we let (:P X Y) denote *1 above then the induction scheme we'll
use is
(AND (IMPLIES (AND (NOT (ENDP X))
(:P (CDR X) (CONS (CAR X) Y)))
(:P X Y))
(IMPLIES (ENDP X) (:P X Y))).
This induction is justified by the same argument used to admit REVAPPEND.
Note, however, that the unmeasured variable Y is being instantiated.
When applied to the goal at hand the above induction scheme produces
two nontautological subgoals.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP X))
(EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(TRUE-LISTP (CONS (CAR X) Y))))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP X)
(EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y)))
(TRUE-LISTP (CONS (CAR X) Y))))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
But simplification reduces this to T, using the :definitions REVAPPEND
and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS.
Subgoal *1/1
(IMPLIES (ENDP X)
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
By the simple :definition ENDP we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (NOT (CONSP X))
(EQUAL (TRUE-LISTP (REVAPPEND X Y))
(TRUE-LISTP Y))).
[GC for 4587 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition REVAPPEND
and primitive type reasoning.
That completes the proof of *1.
Q.E.D.
Summary
Form: ( DEFTHM TRUE-LISTP-REVAPPEND ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION NOT)
(:DEFINITION REVAPPEND)
(:DEFINITION TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION REVAPPEND)
(:REWRITE CDR-CONS))
Time: 0.24 seconds (prove: 0.24, print: 0.00, other: 0.00)
Prover steps counted: 311
TRUE-LISTP-REVAPPEND
ACL2 !>>(VERIFY-GUARDS THROW-NONEXEC-ERROR)
Computing the guard conjecture for THROW-NONEXEC-ERROR....
The guard conjecture for THROW-NONEXEC-ERROR is trivial to prove.
THROW-NONEXEC-ERROR is compliant with Common Lisp.
Summary
Form: ( VERIFY-GUARDS THROW-NONEXEC-ERROR)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
THROW-NONEXEC-ERROR
ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FN)
Computing the guard conjecture for DEFUN-NX-FN....
The guard conjecture for DEFUN-NX-FN is trivial to prove, given primitive
type reasoning and the :type-prescription rule BUTLAST. DEFUN-NX-FN
is compliant with Common Lisp.
Summary
Form: ( VERIFY-GUARDS DEFUN-NX-FN)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION BUTLAST))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
DEFUN-NX-FN
ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
Computing the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1....
The non-trivial part of the guard conjecture for
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 is
Goal
(AND (IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (CONSP DEFS)))
(EQ DEFS NIL))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS)))
(MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS))
(EQ (CAR (CAR DEFS)) 'DEFUN-NX))
(TRUE-LISTP (CADDR (CAR DEFS))))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS))
(EQ (CAR (CAR DEFS)) 'DEFUN-NX))
(TRUE-LISTP (CAR DEFS)))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS))
(NOT (CONSP (CAR DEFS))))
(EQUAL (CAR DEFS) NIL))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS))
(EQ (CAR (CAR DEFS)) 'DEFUND-NX))
(TRUE-LISTP (CAR DEFS)))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ENDP DEFS))
(EQ (CAR (CAR DEFS)) 'DEFUND-NX))
(TRUE-LISTP (CADDR (CAR DEFS))))).
By the simple :definitions ENDP and EQ we reduce the conjecture to
the following seven conjectures.
Subgoal 7
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (CONSP DEFS)))
(EQUAL DEFS NIL)).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal 6
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS))
(MUTUAL-RECURSION-GUARDP (CDR DEFS))).
But simplification reduces this to T, using the :definitions MEMBER-EQUAL
and MUTUAL-RECURSION-GUARDP, the :executable-counterparts of CAR, CDR
and CONSP and primitive type reasoning.
Subgoal 5
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS)
(EQUAL (CAR (CAR DEFS)) 'DEFUN-NX))
(TRUE-LISTP (CADDR (CAR DEFS)))).
But simplification reduces this to T, using the :definitions
MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning.
Subgoal 4
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS)
(EQUAL (CAR (CAR DEFS)) 'DEFUN-NX))
(TRUE-LISTP (CAR DEFS))).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal 3
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS)
(NOT (CONSP (CAR DEFS))))
(EQUAL (CAR DEFS) NIL)).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal 2
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS)
(EQUAL (CAR (CAR DEFS)) 'DEFUND-NX))
(TRUE-LISTP (CAR DEFS))).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal 1
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(CONSP DEFS)
(EQUAL (CAR (CAR DEFS)) 'DEFUND-NX))
(TRUE-LISTP (CADDR (CAR DEFS)))).
But simplification reduces this to T, using the :definitions
MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning.
Q.E.D.
That completes the proof of the guard theorem for
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1.
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 is compliant with Common Lisp.
Summary
Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1)
Rules: ((:DEFINITION ENDP)
(:DEFINITION EQ)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION MUTUAL-RECURSION-GUARDP)
(:DEFINITION NOT)
(:DEFINITION TRUE-LISTP)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
Prover steps counted: 829
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1
ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
Computing the guard conjecture for UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX....
The non-trivial part of the guard conjecture for
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX is
Goal
(AND (IMPLIES (MUTUAL-RECURSION-GUARDP DEFS)
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ASSOC-EQUAL 'DEFUN-NX DEFS)))
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))).
By the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce
the conjecture to the following two conjectures.
Subgoal 2
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS)
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))).
This simplifies, using the :executable-counterparts of NOT and SYMBOLP
and the :type-prescription rule ALISTP, to
Subgoal 2'
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS)
(ALISTP DEFS)).
[GC for 4587 CONS pages..(T=22).GC finished]
Name the formula above *1.
Subgoal 1
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ASSOC-EQUAL 'DEFUN-NX DEFS)))
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))).
This simplifies, using the :executable-counterparts of NOT and SYMBOLP
and the :type-prescription rule ALISTP, to
Subgoal 1'
(IMPLIES (AND (MUTUAL-RECURSION-GUARDP DEFS)
(NOT (ASSOC-EQUAL 'DEFUN-NX DEFS)))
(ALISTP DEFS)).
Normally we would attempt to prove Subgoal 1' by induction. However,
we prefer in this instance to focus on the original input conjecture
rather than this simplified special case. We therefore abandon our
previous work on this conjecture and reassign the name *1 to the original
conjecture. (See :DOC otf-flg.)
Perhaps we can prove *1 by induction. Three induction schemes are
suggested by this conjecture. Subsumption reduces that number to two.
These merge into one derived induction scheme.
We will induct according to a scheme suggested by
(ASSOC-EQUAL 'DEFUN-NX DEFS). This suggestion was produced using the
:induction rules ASSOC-EQUAL and MUTUAL-RECURSION-GUARDP. If we let
(:P DEFS) denote *1 above then the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ENDP DEFS))
(NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(:P (CDR DEFS)))
(:P DEFS))
(IMPLIES (AND (NOT (ENDP DEFS))
(EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(:P DEFS))
(IMPLIES (ENDP DEFS) (:P DEFS))).
This induction is justified by the same argument used to admit ASSOC-EQUAL.
When applied to the goal at hand the above induction scheme produces
three nontautological subgoals.
Subgoal *1/3
(IMPLIES (AND (NOT (ENDP DEFS))
(NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(LET ((X 'DEFUN-NX) (ALIST (CDR DEFS)))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ASSOC-EQUAL 'DEFUN-NX (CDR DEFS))
(LET ((X 'DEFUND-NX) (ALIST (CDR DEFS)))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST))))))).
By the simple :definition ENDP and the simple :rewrite rule
ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to
Subgoal *1/3'
(IMPLIES (AND (CONSP DEFS)
(NOT (EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(LET ((X 'DEFUN-NX) (ALIST (CDR DEFS)))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ASSOC-EQUAL 'DEFUN-NX (CDR DEFS))
(LET ((X 'DEFUND-NX) (ALIST (CDR DEFS)))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))))).
But simplification reduces this to T, using the :definitions ALISTP,
ASSOC-EQUAL, MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and NOT, the :executable-
counterparts of CAR, CDR, CONSP, NOT and SYMBOLP, primitive type reasoning
and the :type-prescription rule ALISTP.
Subgoal *1/2
(IMPLIES (AND (NOT (ENDP DEFS))
(EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST))))))).
By the simple :definition ENDP and the simple :rewrite rule
ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to
Subgoal *1/2'
(IMPLIES (AND (CONSP DEFS)
(EQUAL 'DEFUN-NX (CAR (CAR DEFS))))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))))).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions ASSOC-EQUAL, MUTUAL-RECURSION-GUARDP
and NOT, the :executable-counterparts of EQUAL, MEMBER-EQUAL, NOT and
SYMBOLP, primitive type reasoning and the :type-prescription rule ALISTP,
to
Subgoal *1/2''
(IMPLIES (AND (CONSP DEFS)
(EQUAL 'DEFUN-NX (CAR (CAR DEFS)))
(CONSP (CAR DEFS))
(TRUE-LISTP (CAR DEFS))
(TRUE-LISTP (CADDR (CAR DEFS)))
(MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ALISTP DEFS)).
This simplifies, using the :definitions ALISTP and TRUE-LISTP (if-intro),
the :executable-counterparts of CAR, CDR and TRUE-LISTP and primitive
type reasoning, to the following two conjectures.
Subgoal *1/2.2
(IMPLIES (AND (CONSP DEFS)
(EQUAL 'DEFUN-NX (CAR (CAR DEFS)))
(CONSP (CAR DEFS))
(CONSP (CDR (CAR DEFS)))
(TRUE-LISTP (CDDR (CAR DEFS)))
(TRUE-LISTP (CADDR (CAR DEFS)))
(MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ALISTP (CDR DEFS))).
The destructor terms (CAR DEFS) and (CDR DEFS) can be eliminated.
Furthermore, those terms are at the root of a chain of four rounds
of destructor elimination. (1) Use CAR-CDR-ELIM to replace DEFS by
(CONS DEFS1 DEFS2), (CAR DEFS) by DEFS1 and (CDR DEFS) by DEFS2. (2)
Use CAR-CDR-ELIM, again, to replace DEFS1 by (CONS DEFS3 DEFS4), (CAR DEFS1)
by DEFS3 and (CDR DEFS1) by DEFS4 and restrict the type of the new
variable DEFS3 to be that of the term it replaces. (3) Use CAR-CDR-ELIM
to replace DEFS4 by (CONS DEFS5 DEFS6), (CAR DEFS4) by DEFS5 and (CDR DEFS4)
by DEFS6. (4) Finally, use CAR-CDR-ELIM to replace DEFS6 by
(CONS DEFS7 DEFS8), (CAR DEFS6) by DEFS7 and (CDR DEFS6) by DEFS8 and
restrict the type of the new variable DEFS8 to be that of the term
it replaces, as established by primitive type reasoning. These steps
produce the following two goals.
Subgoal *1/2.2.2
(IMPLIES (AND (NOT (CONSP DEFS6))
(CONSP (CONS DEFS5 DEFS6))
(SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
(NOT (EQUAL DEFS3 NIL))
(CONSP (LIST* DEFS3 DEFS5 DEFS6))
(CONSP (CONS (LIST* DEFS3 DEFS5 DEFS6) DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(TRUE-LISTP DEFS6)
(TRUE-LISTP (CAR DEFS6))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By case analysis we reduce the conjecture to
Subgoal *1/2.2.2'
(IMPLIES (AND (NOT (CONSP DEFS6))
(CONSP (CONS DEFS5 DEFS6))
(SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
DEFS3 (CONSP (LIST* DEFS3 DEFS5 DEFS6))
(CONSP (CONS (LIST* DEFS3 DEFS5 DEFS6) DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(TRUE-LISTP DEFS6)
(TRUE-LISTP (CAR DEFS6))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
This simplifies, using the :definition TRUE-LISTP, the :executable-
counterparts of CAR, CONSP, EQUAL, NOT, SYMBOLP and TRUE-LISTP and
primitive type reasoning, to
Subgoal *1/2.2.2''
(IMPLIES (AND (NOT DEFS6)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
[GC for 4587 CONS pages..(T=24).GC finished]
This simplifies, using trivial observations, to
Subgoal *1/2.2.2'''
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
Name the formula above *1.1.
Subgoal *1/2.2.1
(IMPLIES (AND (TRUE-LISTP DEFS8)
(CONSP (CONS DEFS7 DEFS8))
(CONSP (LIST* DEFS5 DEFS7 DEFS8))
(SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
(NOT (EQUAL DEFS3 NIL))
(CONSP (LIST* DEFS3 DEFS5 DEFS7 DEFS8))
(CONSP (CONS (LIST* DEFS3 DEFS5 DEFS7 DEFS8)
DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(TRUE-LISTP (CONS DEFS7 DEFS8))
(TRUE-LISTP DEFS7)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By case analysis we reduce the conjecture to
Subgoal *1/2.2.1'
(IMPLIES (AND (TRUE-LISTP DEFS8)
(CONSP (CONS DEFS7 DEFS8))
(CONSP (LIST* DEFS5 DEFS7 DEFS8))
(SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
DEFS3
(CONSP (LIST* DEFS3 DEFS5 DEFS7 DEFS8))
(CONSP (CONS (LIST* DEFS3 DEFS5 DEFS7 DEFS8)
DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(TRUE-LISTP (CONS DEFS7 DEFS8))
(TRUE-LISTP DEFS7)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
This simplifies, using the :executable-counterparts of EQUAL, NOT and
SYMBOLP and primitive type reasoning, to
Subgoal *1/2.2.1''
(IMPLIES (AND (TRUE-LISTP DEFS8)
(TRUE-LISTP (CONS DEFS7 DEFS8))
(TRUE-LISTP DEFS7)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
We suspect that the terms (TRUE-LISTP DEFS8),
(TRUE-LISTP (CONS DEFS7 DEFS8)) and (TRUE-LISTP DEFS7) are irrelevant
to the truth of this conjecture and throw them out. We will thus try
to prove
Subgoal *1/2.2.1'''
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
Name the formula above *1.2.
Subgoal *1/2.1
(IMPLIES (AND (CONSP DEFS)
(EQUAL 'DEFUN-NX (CAR (CAR DEFS)))
(CONSP (CAR DEFS))
(NOT (CONSP (CDR (CAR DEFS))))
(NOT (CDR (CAR DEFS)))
(MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ALISTP (CDR DEFS))).
This simplifies, using the :executable-counterpart of CONSP, to
Subgoal *1/2.1'
(IMPLIES (AND (CONSP DEFS)
(EQUAL 'DEFUN-NX (CAR (CAR DEFS)))
(CONSP (CAR DEFS))
(NOT (CDR (CAR DEFS)))
(MUTUAL-RECURSION-GUARDP (CDR DEFS)))
(ALISTP (CDR DEFS))).
The destructor terms (CAR DEFS) and (CDR DEFS) can be eliminated.
Furthermore, those terms are at the root of a chain of two rounds of
destructor elimination. (1) Use CAR-CDR-ELIM to replace DEFS by
(CONS DEFS1 DEFS2), (CAR DEFS) by DEFS1 and (CDR DEFS) by DEFS2. (2)
Use CAR-CDR-ELIM, again, to replace DEFS1 by (CONS DEFS3 DEFS4), (CAR DEFS1)
by DEFS3 and (CDR DEFS1) by DEFS4 and restrict the type of the new
variable DEFS3 to be that of the term it replaces. These steps produce
the following goal.
Subgoal *1/2.1''
(IMPLIES (AND (SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
(NOT (EQUAL DEFS3 NIL))
(CONSP (CONS DEFS3 DEFS4))
(CONSP (CONS (CONS DEFS3 DEFS4) DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(NOT DEFS4)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By case analysis we reduce the conjecture to
Subgoal *1/2.1'''
(IMPLIES (AND (SYMBOLP DEFS3)
(NOT (EQUAL DEFS3 T))
DEFS3 (CONSP (CONS DEFS3 DEFS4))
(CONSP (CONS (CONS DEFS3 DEFS4) DEFS2))
(EQUAL 'DEFUN-NX DEFS3)
(NOT DEFS4)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
This simplifies, using the :executable-counterparts of CONS, CONSP,
EQUAL, NOT and SYMBOLP and primitive type reasoning, to
Subgoal *1/2.1'4'
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
[GC for 4587 CONS pages..(T=22).GC finished]
Name the formula above *1.3.
Subgoal *1/1
(IMPLIES (ENDP DEFS)
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST))))))).
By the simple :definition ENDP and the simple :rewrite rule
ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to
Subgoal *1/1'
(IMPLIES (NOT (CONSP DEFS))
(AND (OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(LET ((X 'DEFUN-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST)))))
(OR (NOT (MUTUAL-RECURSION-GUARDP DEFS))
(ASSOC-EQUAL 'DEFUN-NX DEFS)
(LET ((X 'DEFUND-NX) (ALIST DEFS))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X)
(SYMBOL-ALISTP ALIST))))))).
But simplification reduces this to T, using the :definitions
MUTUAL-RECURSION-GUARDP and NOT, the :executable-counterparts of ALISTP,
ASSOC-EQUAL, NOT and SYMBOLP and primitive type reasoning.
So we now return to *1.3, which is
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
But the formula above is subsumed by *1.2, which we'll try to prove
later. We therefore regard *1.3 as proved (pending the proof of the
more general *1.2).
We next consider *1.2, which is
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
But the formula above is subsumed by *1.1, which we'll try to prove
later. We therefore regard *1.2 as proved (pending the proof of the
more general *1.1).
We next consider *1.1, which is
(IMPLIES (MUTUAL-RECURSION-GUARDP DEFS2)
(ALISTP DEFS2)).
Perhaps we can prove *1.1 by induction. Two induction schemes are
suggested by this conjecture. Subsumption reduces that number to one.
We will induct according to a scheme suggested by
(MUTUAL-RECURSION-GUARDP DEFS2). This suggestion was produced using
the :induction rules ALISTP and MUTUAL-RECURSION-GUARDP. If we let
(:P DEFS2) denote *1.1 above then the induction scheme we'll use is
(AND (IMPLIES (AND (NOT (ATOM DEFS2))
(NOT (CONSP (CAR DEFS2))))
(:P DEFS2))
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(NOT (TRUE-LISTP (CAR DEFS2))))
(:P DEFS2))
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(NOT (TRUE-LISTP (CADDR (CAR DEFS2)))))
(:P DEFS2))
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(NOT (MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))))
(:P DEFS2))
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))
(:P (CDR DEFS2)))
(:P DEFS2))
(IMPLIES (ATOM DEFS2) (:P DEFS2))).
This induction is justified by the same argument used to admit
MUTUAL-RECURSION-GUARDP. When applied to the goal at hand the above
induction scheme produces seven nontautological subgoals.
Subgoal *1.1/7
(IMPLIES (AND (NOT (ATOM DEFS2))
(NOT (CONSP (CAR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/7'
(IMPLIES (AND (CONSP DEFS2)
(NOT (CONSP (CAR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal *1.1/6
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(NOT (TRUE-LISTP (CAR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/6'
(IMPLIES (AND (CONSP DEFS2)
(CONSP (CAR DEFS2))
(NOT (TRUE-LISTP (CAR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP.
Subgoal *1.1/5
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(NOT (TRUE-LISTP (CADDR (CAR DEFS2))))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/5'
(IMPLIES (AND (CONSP DEFS2)
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(NOT (TRUE-LISTP (CADDR (CAR DEFS2))))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definitions
MUTUAL-RECURSION-GUARDP and TRUE-LISTP and primitive type reasoning.
Subgoal *1.1/4
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(NOT (MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/4'
(IMPLIES (AND (CONSP DEFS2)
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(NOT (MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definitions MEMBER-EQUAL,
MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable-counterparts
of CAR, CDR, CONSP and TRUE-LISTP and primitive type reasoning.
Subgoal *1.1/3
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))
(ALISTP (CDR DEFS2))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/3'
(IMPLIES (AND (CONSP DEFS2)
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))
(ALISTP (CDR DEFS2))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
[GC for 4587 CONS pages..(T=22).GC finished]
But simplification reduces this to T, using the :definitions ALISTP,
MEMBER-EQUAL, MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable-
counterparts of CAR, CDR, CONSP, MEMBER-EQUAL and TRUE-LISTP, primitive
type reasoning and the :type-prescription rule ALISTP.
Subgoal *1.1/2
(IMPLIES (AND (NOT (ATOM DEFS2))
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))
(NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/2'
(IMPLIES (AND (CONSP DEFS2)
(CONSP (CAR DEFS2))
(TRUE-LISTP (CAR DEFS2))
(TRUE-LISTP (CADDR (CAR DEFS2)))
(MEMBER-EQUAL (CAR (CAR DEFS2))
'(DEFUN DEFUND DEFUN-NX DEFUND-NX))
(NOT (MUTUAL-RECURSION-GUARDP (CDR DEFS2)))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definitions MEMBER-EQUAL,
MUTUAL-RECURSION-GUARDP and TRUE-LISTP, the :executable-counterparts
of CAR, CDR, CONSP, MEMBER-EQUAL and TRUE-LISTP and primitive type
reasoning.
Subgoal *1.1/1
(IMPLIES (AND (ATOM DEFS2)
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
By the simple :definition ATOM we reduce the conjecture to
Subgoal *1.1/1'
(IMPLIES (AND (NOT (CONSP DEFS2))
(MUTUAL-RECURSION-GUARDP DEFS2))
(ALISTP DEFS2)).
But simplification reduces this to T, using the :definition
MUTUAL-RECURSION-GUARDP, the :executable-counterparts of ALISTP and
CONSP and primitive type reasoning.
That completes the proofs of *1.1 and *1.
Q.E.D.
That completes the proof of the guard theorem for
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX. UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
is compliant with Common Lisp.
Summary
Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ASSOC-EQUAL)
(:DEFINITION ATOM)
(:DEFINITION ENDP)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION MUTUAL-RECURSION-GUARDP)
(:DEFINITION NOT)
(:DEFINITION TRUE-LISTP)
(:ELIM CAR-CDR-ELIM)
(:EXECUTABLE-COUNTERPART ALISTP)
(:EXECUTABLE-COUNTERPART ASSOC-EQUAL)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONS)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART MEMBER-EQUAL)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART SYMBOLP)
(:EXECUTABLE-COUNTERPART TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION ALISTP)
(:INDUCTION ASSOC-EQUAL)
(:INDUCTION MUTUAL-RECURSION-GUARDP)
(:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
(:TYPE-PRESCRIPTION ALISTP))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION TRUE-LISTP))
Time: 1.30 seconds (prove: 1.28, print: 0.02, other: 0.00)
Prover steps counted: 10355
UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX
End of Encapsulated Events.
Having verified that the encapsulated events validate the signatures
of the ENCAPSULATE event, we discard the ephemeral theory and extend
the original theory as directed by the signatures and the non-LOCAL
events.
Summary
Form: ( ENCAPSULATE NIL (LOCAL ...) ...)
Rules: NIL
Time: 1.56 seconds (prove: 1.52, print: 0.02, other: 0.02)
Prover steps counted: 11495
T
Since GC$-FN is non-recursive, its admission is trivial. We observe
that the type of GC$-FN is described by the theorem
(EQUAL (GC$-FN ARGS) NIL).
Computing the guard conjecture for GC$-FN....
The guard conjecture for GC$-FN is trivial to prove. GC$-FN is compliant
with Common Lisp.
Summary
Form: ( DEFUN GC$-FN ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
GC$-FN
The event ( DEFMACRO GC$ ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO GC$ ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since GC-VERBOSE-FN is non-recursive, its admission is trivial. We
observe that the type of GC-VERBOSE-FN is described by the theorem
(EQUAL (GC-VERBOSE-FN ARG1 ARG2) NIL).
Computing the guard conjecture for GC-VERBOSE-FN....
The guard conjecture for GC-VERBOSE-FN is trivial to prove. GC-VERBOSE-FN
is compliant with Common Lisp.
Summary
Form: ( DEFUN GC-VERBOSE-FN ...)
Rules: NIL
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
GC-VERBOSE-FN
The event ( DEFMACRO GC-VERBOSE ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO GC-VERBOSE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since GET-WORMHOLE-STATUS is non-recursive, its admission is trivial.
We observe that the type of GET-WORMHOLE-STATUS is described by the
theorem
(AND (CONSP (GET-WORMHOLE-STATUS NAME STATE))
(TRUE-LISTP (GET-WORMHOLE-STATUS NAME STATE))).
We used the :type-prescription rule READ-ACL2-ORACLE.
(GET-WORMHOLE-STATUS * STATE) => (MV * * STATE).
Computing the guard conjecture for GET-WORMHOLE-STATUS....
The guard conjecture for GET-WORMHOLE-STATUS is trivial to prove, given
the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P. GET-WORMHOLE-STATUS is compliant
with Common Lisp.
Summary
Form: ( DEFUN GET-WORMHOLE-STATUS ...)
Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION READ-ACL2-ORACLE)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
GET-WORMHOLE-STATUS
Since FILE-WRITE-DATE$ is non-recursive, its admission is trivial.
We observe that the type of FILE-WRITE-DATE$ is described by the theorem
(AND (CONSP (FILE-WRITE-DATE$ FILE STATE))
(TRUE-LISTP (FILE-WRITE-DATE$ FILE STATE))).
We used primitive type reasoning.
(FILE-WRITE-DATE$ * STATE) => (MV * STATE).
Computing the guard conjecture for FILE-WRITE-DATE$....
The guard conjecture for FILE-WRITE-DATE$ is trivial to prove, given
the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P. FILE-WRITE-DATE$ is compliant
with Common Lisp.
Summary
Form: ( DEFUN FILE-WRITE-DATE$ ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
FILE-WRITE-DATE$
[GC for 4587 CONS pages..(T=24).GC finished]
Since DELETE-FILE$ is non-recursive, its admission is trivial. We
observe that the type of DELETE-FILE$ is described by the theorem
(AND (CONSP (DELETE-FILE$ FILE STATE))
(TRUE-LISTP (DELETE-FILE$ FILE STATE))).
We used primitive type reasoning.
(DELETE-FILE$ * STATE) => (MV * STATE).
Computing the guard conjecture for DELETE-FILE$....
The guard conjecture for DELETE-FILE$ is trivial to prove, given the
:forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
the :type-prescription rule STATE-P. DELETE-FILE$ is compliant with
Common Lisp.
Summary
Form: ( DEFUN DELETE-FILE$ ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.40 seconds (prove: 0.00, print: 0.00, other: 0.40)
DELETE-FILE$
Since DEBUGGER-ENABLE is non-recursive, its admission is trivial.
We could deduce no constraints on the type of DEBUGGER-ENABLE.
(DEBUGGER-ENABLE STATE) => *.
Computing the guard conjecture for DEBUGGER-ENABLE....
The non-trivial part of the guard conjecture for DEBUGGER-ENABLE, given
the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P, is
Goal
(IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
(STATE-P STATE))
(BOUNDP-GLOBAL1 'DEBUGGER-ENABLE
STATE)).
But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
BOUNDP-GLOBAL1, GLOBAL-TABLE and STATE-P.
Q.E.D.
That completes the proof of the guard theorem for DEBUGGER-ENABLE.
DEBUGGER-ENABLE is compliant with Common Lisp.
Summary
Form: ( DEFUN DEBUGGER-ENABLE ...)
Rules: ((:DEFINITION BOUNDP-GLOBAL)
(:DEFINITION BOUNDP-GLOBAL1)
(:DEFINITION GLOBAL-TABLE)
(:DEFINITION NOT)
(:DEFINITION STATE-P)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
Prover steps counted: 50
DEBUGGER-ENABLE
Since BREAK$ is non-recursive, its admission is trivial. We observe
that the type of BREAK$ is described by the theorem (EQUAL (BREAK$) NIL).
Computing the guard conjecture for BREAK$....
The guard conjecture for BREAK$ is trivial to prove. BREAK$ is compliant
with Common Lisp.
Summary
Form: ( DEFUN BREAK$ ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
BREAK$
Since PRINT-CALL-HISTORY is non-recursive, its admission is trivial.
We observe that the type of PRINT-CALL-HISTORY is described by the
theorem (EQUAL (PRINT-CALL-HISTORY) NIL).
Computing the guard conjecture for PRINT-CALL-HISTORY....
The guard conjecture for PRINT-CALL-HISTORY is trivial to prove.
PRINT-CALL-HISTORY is compliant with Common Lisp.
Summary
Form: ( DEFUN PRINT-CALL-HISTORY ...)
Rules: NIL
Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06)
PRINT-CALL-HISTORY
The event ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since DEBUGGER-ENABLEDP is non-recursive, its admission is trivial.
We observe that the type of DEBUGGER-ENABLEDP is described by the theorem
(OR (EQUAL (DEBUGGER-ENABLEDP STATE) T)
(EQUAL (DEBUGGER-ENABLEDP STATE) NIL)).
(DEBUGGER-ENABLEDP STATE) => *.
Computing the guard conjecture for DEBUGGER-ENABLEDP....
[GC for 4587 CONS pages..(T=24).GC finished]
The non-trivial part of the guard conjecture for DEBUGGER-ENABLEDP,
given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P, is
Goal
(AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
(STATE-P STATE))
(BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE))
(IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
(STATE-P STATE))
(LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE))
(L '(T :BREAK :BREAK-BT :BT-BREAK)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))).
But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable-
counterpart of TAU-SYSTEM and the simple :rewrite rule
MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for DEBUGGER-ENABLEDP.
DEBUGGER-ENABLEDP is compliant with Common Lisp.
Summary
Form: ( DEFUN DEBUGGER-ENABLEDP ...)
Rules: ((:DEFINITION BOUNDP-GLOBAL)
(:DEFINITION BOUNDP-GLOBAL1)
(:DEFINITION GET-GLOBAL)
(:DEFINITION GLOBAL-TABLE)
(:DEFINITION NOT)
(:DEFINITION STATE-P)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.46 seconds (prove: 0.00, print: 0.00, other: 0.46)
Prover steps counted: 129
DEBUGGER-ENABLEDP
Since MAYBE-PRINT-CALL-HISTORY is non-recursive, its admission is trivial.
We observe that the type of MAYBE-PRINT-CALL-HISTORY is described by
the theorem (EQUAL (MAYBE-PRINT-CALL-HISTORY STATE) NIL). We used
the :type-prescription rule PRINT-CALL-HISTORY.
(MAYBE-PRINT-CALL-HISTORY STATE) => *.
Computing the guard conjecture for MAYBE-PRINT-CALL-HISTORY....
The non-trivial part of the guard conjecture for MAYBE-PRINT-CALL-HISTORY,
given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rule STATE-P, is
Goal
(AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
(STATE-P STATE))
(BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE))
(IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE)
(STATE-P STATE))
(LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE))
(L '(:BT :BREAK-BT :BT-BREAK)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))).
But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL,
BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable-
counterpart of TAU-SYSTEM and the simple :rewrite rule
MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for MAYBE-PRINT-CALL-HISTORY.
MAYBE-PRINT-CALL-HISTORY is compliant with Common Lisp.
Summary
Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...)
Rules: ((:DEFINITION BOUNDP-GLOBAL)
(:DEFINITION BOUNDP-GLOBAL1)
(:DEFINITION GET-GLOBAL)
(:DEFINITION GLOBAL-TABLE)
(:DEFINITION NOT)
(:DEFINITION STATE-P)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION PRINT-CALL-HISTORY)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
Prover steps counted: 129
MAYBE-PRINT-CALL-HISTORY
The event ( DEFMACRO WITH-RECKLESS-READTABLE ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO SET-DEBUGGER-ENABLE ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since SET-DEBUGGER-ENABLE-FN is non-recursive, its admission is trivial.
We observe that the type of SET-DEBUGGER-ENABLE-FN is described by
the theorem (CONSP (SET-DEBUGGER-ENABLE-FN VAL STATE)). We used the
:type-prescription rule PUT-GLOBAL.
(SET-DEBUGGER-ENABLE-FN * STATE) => STATE.
[GC for 4587 CONS pages..(T=24).GC finished]
Computing the guard conjecture for SET-DEBUGGER-ENABLE-FN....
The non-trivial part of the guard conjecture for SET-DEBUGGER-ENABLE-FN,
given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1
and the :type-prescription rules MEMBER-EQ-EXEC$GUARD-CHECK and STATE-P,
is
Goal
(AND (IMPLIES (STATE-P STATE)
(LET ((X VAL)
(L '(T NIL :NEVER
:BREAK :BT
:BREAK-BT :BT-BREAK)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))
(IMPLIES (AND (LET ((X VAL)
(L '(T NIL :NEVER
:BREAK :BT
:BREAK-BT :BT-BREAK)))
(MEMBER-EQUAL X L))
(STATE-P STATE))
(LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE
VAL STATE)))
(AND (BOUNDP-GLOBAL1 'DMRP STATE)
(STATE-P1 STATE)
(OR (NOT (CONSP (GET-GLOBAL 'DMRP STATE)))
(STATE-P1 STATE)))))).
[Note: A hint was supplied for our processing of the goal above.
Thanks!]
[GC for 4587 CONS pages..(T=24).GC finished]
By the simple :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE,
BIG-CLOCK-ENTRY, FILE-CLOCK, FILE-CLOCK-P, GET-GLOBAL, GLOBAL-TABLE,
IDATES, LIST-ALL-PACKAGE-NAMES-LST, NATP, OPEN-CHANNELS-P,
OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, READ-FILES, READ-FILES-P,
READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK,
USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES
and WRITTEN-FILES-P, the :executable-counterpart of TAU-SYSTEM and
the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the
conjecture to
Goal'
(IMPLIES
(AND
(MEMBER-EQUAL VAL
'(T NIL :NEVER
:BREAK :BT
:BREAK-BT :BT-BREAK))
(TRUE-LISTP STATE)
(EQUAL (LENGTH STATE) 15)
(ORDERED-SYMBOL-ALISTP (NTH 0 STATE))
(OPEN-CHANNEL-LISTP (NTH 0 STATE))
(ORDERED-SYMBOL-ALISTP (NTH 1 STATE))
(OPEN-CHANNEL-LISTP (NTH 1 STATE))
(ORDERED-SYMBOL-ALISTP (NTH 2 STATE))
(ALL-BOUNDP
'((ABBREV-EVISC-TUPLE . :DEFAULT)
(ACCUMULATED-TTREE)
(ACL2-RAW-MODE-P)
(ACL2-SOURCES-DIR)
(ACL2-VERSION . "ACL2 Version 8.3")
(ACL2-WORLD-ALIST)
(ACL2P-CHECKPOINTS-FOR-SUMMARY)
(AXIOMSP)
(BDDNOTES)
(BOOK-HASH-ALISTP)
(BOOT-STRAP-FLG . T)
(BRR-EVISC-TUPLE-INITIALIZED)
(CERT-DATA)
(CERTIFY-BOOK-INFO)
(CHECK-INVARIANT-RISK . :WARNING)
(CHECK-SUM-WEIRDNESS)
(CHECKPOINT-FORCED-GOALS)
(CHECKPOINT-PROCESSORS ELIMINATE-DESTRUCTORS-CLAUSE
FERTILIZE-CLAUSE GENERALIZE-CLAUSE
ELIMINATE-IRRELEVANCE-CLAUSE
PUSH-CLAUSE :INDUCT)
(CHECKPOINT-SUMMARY-LIMIT NIL . 3)
(COMPILED-FILE-EXTENSION)
(COMPILER-ENABLED)
(CONNECTED-BOOK-DIRECTORY)
(CURRENT-ACL2-WORLD)
(CURRENT-PACKAGE . "ACL2")
(DEBUG-PSPV)
(DEBUGGER-ENABLE)
(DEFAXIOMS-OKP-CERT . T)
(DEFERRED-TTAG-NOTES . :NOT-DEFERRED)
(DEFERRED-TTAG-NOTES-SAVED)
(DMRP)
(EVISC-HITP-WITHOUT-IPRINT)
(EVISCERATE-HIDE-TERMS)
(FMT-HARD-RIGHT-MARGIN . 77)
(FMT-SOFT-RIGHT-MARGIN . 65)
(GAG-MODE)
(GAG-MODE-EVISC-TUPLE)
(GAG-STATE)
(GAG-STATE-SAVED)
(GET-INTERNAL-TIME-AS-REALTIME)
(GLOBAL-ENABLED-STRUCTURE)
(GSTACKP)
(GUARD-CHECKING-ON . T)
(HOST-LISP)
(IGNORE-CERT-FILES)
(ILLEGAL-TO-CERTIFY-MESSAGE)
(IN-LOCAL-FLG)
(IN-PROVE-FLG)
(IN-VERIFY-FLG)
(INCLUDING-UNCERTIFIED-P)
(INHIBIT-ER-HARD)
(INHIBIT-OUTPUT-LST SUMMARY)
(INHIBIT-OUTPUT-LST-STACK)
(INHIBITED-SUMMARY-TYPES)
(INSIDE-SKIP-PROOFS)
(IPRINT-AR (:HEADER :DIMENSIONS (10001)
:MAXIMUM-LENGTH 40004
:DEFAULT NIL
:NAME IPRINT-AR
:ORDER :NONE)
(0 0))
(IPRINT-FAL)
(IPRINT-HARD-BOUND . 10000)
(IPRINT-SOFT-BOUND . 1000)
(KEEP-TMP-FILES)
(LAST-EVENT-DATA)
(LAST-MAKE-EVENT-EXPANSION)
(LAST-STEP-LIMIT . -1)
(LD-LEVEL . 0)
(LD-OKP . :DEFAULT)
(LD-REDEFINITION-ACTION)
(LD-SKIP-PROOFSP)
(LOGIC-FNS-WITH-RAW-CODE MOD-EXPT HEADER SEARCH-FN STATE-P1 AREF2
AREF1 FGETPROP GETENV$ WORMHOLE-EVAL
WORMHOLE1 GET-WORMHOLE-STATUS
ASET2 SGETPROP SETENV$
GETPROPS COMPRESS1 TIME-LIMIT5-REACHED-P
FMT-TO-COMMENT-WINDOW LEN CPU-CORE-COUNT
NONNEGATIVE-INTEGER-QUOTIENT
CHECK-PRINT-BASE RETRACT-WORLD
ASET1 ARRAY1P BOOLE$ ARRAY2P STRIP-CDRS
COMPRESS2 STRIP-CARS PLIST-WORLDP
WORMHOLE-P MAY-NEED-SLASHES-FN
FMT-TO-COMMENT-WINDOW!
HAS-PROPSP HARD-ERROR ABORT! P!
FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1
ALPHORDER EXTEND-WORLD
DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT
USER-STOBJ-ALIST
READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR
UPDATE-USER-STOBJ-ALIST
DECREMENT-BIG-CLOCK PUT-GLOBAL
CLOSE-INPUT-CHANNEL MAKUNBOUND-GLOBAL
OPEN-INPUT-CHANNEL OPEN-INPUT-CHANNEL-P1
BOUNDP-GLOBAL1 GLOBAL-TABLE-CARS1
EXTEND-T-STACK LIST-ALL-PACKAGE-NAMES
CLOSE-OUTPUT-CHANNEL WRITE-BYTE$
SHRINK-T-STACK ASET-32-BIT-INTEGER-STACK
GET-GLOBAL 32-BIT-INTEGER-STACK-LENGTH1
EXTEND-32-BIT-INTEGER-STACK
ASET-T-STACK AREF-T-STACK
READ-CHAR$ AREF-32-BIT-INTEGER-STACK
OPEN-OUTPUT-CHANNEL
OPEN-OUTPUT-CHANNEL-P1
PRINC$ READ-OBJECT BIG-CLOCK-NEGATIVE-P
PEEK-CHAR$ SHRINK-32-BIT-INTEGER-STACK
READ-RUN-TIME READ-BYTE$ READ-IDATE
T-STACK-LENGTH1 PRINT-OBJECT$-SER
GET-OUTPUT-STREAM-STRING$-FN
MV-LIST RETURN-LAST ZPF IDENTITY
ENDP NTHCDR LAST REVAPPEND NULL BUTLAST
STRING NOT MOD PLUSP ATOM LISTP ZP
FLOOR CEILING TRUNCATE ROUND REM LOGBITP
ASH LOGCOUNT SIGNUM INTEGER-LENGTH
EXPT SUBSTITUTE ZEROP MINUSP ODDP
EVENP = /= MAX MIN CONJUGATE LOGANDC1
LOGANDC2 LOGNAND LOGNOR LOGNOT LOGORC1
LOGORC2 LOGTEST ABS STRING-EQUAL STRING<
STRING> STRING<= STRING>= STRING-UPCASE
STRING-DOWNCASE KEYWORDP EQ
EQL CHAR SUBST SUBLIS ACONS NTH SUBSEQ
LENGTH REVERSE ZIP STANDARD-CHAR-P
ALPHA-CHAR-P UPPER-CASE-P
LOWER-CASE-P CHAR< CHAR> CHAR<= CHAR>=
CHAR-EQUAL CHAR-UPCASE CHAR-DOWNCASE
RANDOM$ THROW-NONEXEC-ERROR
GC$-FN SET-COMPILER-ENABLED GOOD-BYE-FN
TAKE FILE-WRITE-DATE$ PRINT-CALL-HISTORY
SET-DEBUGGER-ENABLE-FN
BREAK$ PRIN1$ PRIN1-WITH-SLASHES
MEMBER-EQUAL ASSOC-EQUAL
SUBSETP-EQUAL RASSOC-EQUAL REMOVE-EQUAL
POSITION-EQUAL MAYBE-FINISH-OUTPUT$
SYMBOL-IN-CURRENT-PACKAGE-P SLEEP
FAST-ALIST-LEN HONS-COPY-PERSISTENT
HONS-SUMMARY HONS-CLEAR HONS-CLEAR!
HONS-WASH HONS-WASH! FAST-ALIST-CLEAN
FAST-ALIST-FORK HONS-EQUAL-LITE
NUMBER-SUBTREES FAST-ALIST-SUMMARY
HONS-ACONS! CLEAR-MEMOIZE-TABLES
HONS-COPY HONS-ACONS
CLEAR-MEMOIZE-TABLE FAST-ALIST-FREE
HONS-EQUAL HONS-RESIZE-FN HONS-GET
HONS FAST-ALIST-CLEAN! FAST-ALIST-FORK!
MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS
MAKE-FAST-ALIST SERIALIZE-READ-FN
SERIALIZE-WRITE-FN READ-OBJECT-SUPPRESS
READ-OBJECT-WITH-CASE
PRINT-OBJECT$-PRESERVING-CASE
ASSIGN-LOCK
THROW-OR-ATTACH-CALL TIME-TRACKER-FN
GC-VERBOSE-FN SET-ABSSTOBJ-DEBUG-FN
SYS-CALL-STATUS SYS-CALL
SYS-CALL+ SYS-CALL* CANONICAL-PATHNAME
DOPPELGANGER-BADGE-USERFN
DOPPELGANGER-APPLY$-USERFN
EV-FNCALL-W-GUARD1
PRINT-CL-CACHE-FN MFC-ANCESTORS
MFC-CLAUSE MFC-RDEPTH MFC-TYPE-ALIST
MFC-UNIFY-SUBST MFC-WORLD MFC-AP-FN
MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE
MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN
MFC-RW-TTREE MFC-TS-FN MFC-TS-TTREE
MAGIC-EV-FNCALL NEVER-MEMOIZE-FN BIG-N
ZP-BIG-N DECREMENT-BIG-N ANCESTORS-CHECK
ONCEP-TP PRINT-CLAUSE-ID-OKP
TOO-MANY-IFS-POST-REWRITE
TOO-MANY-IFS-PRE-REWRITE
SET-GC-STRATEGY-FN
GC-STRATEGY READ-FILE-INTO-STRING2
CONS-WITH-HINT FILE-LENGTH$
DELETE-FILE$ SET-BAD-LISP-CONSP-MEMOIZE
APPLY$-LAMBDA APPLY$-PRIM)
(MACROS-WITH-RAW-CODE THEORY-INVARIANT SET-LET*-ABSTRACTIONP
DEFAXIOM SET-BOGUS-MUTUAL-RECURSION-OK
SET-RULER-EXTENDERS
DELETE-INCLUDE-BOOK-DIR
DELETE-INCLUDE-BOOK-DIR!
CERTIFY-BOOK PROGN! F-PUT-GLOBAL
PUSH-UNTOUCHABLE SET-BACKCHAIN-LIMIT
SET-DEFAULT-HINTS! SET-RW-CACHE-STATE!
SET-INDUCTION-DEPTH-LIMIT!
SET-OVERRIDE-HINTS-MACRO
DEFTHEORY PSTK VERIFY-GUARDS DEFCHOOSE
SET-DEFAULT-BACKCHAIN-LIMIT SET-STATE-OK
SET-IGNORE-OK SET-NON-LINEARP
SET-TAU-AUTO-MODE WITH-OUTPUT
SET-COMPILE-FNS ADD-INCLUDE-BOOK-DIR
ADD-INCLUDE-BOOK-DIR!
CLEAR-PSTK ADD-CUSTOM-KEYWORD-HINT
INITIAL-GSTACK ACL2-UNWIND-PROTECT
SET-WELL-FOUNDED-RELATION
CATCH-TIME-LIMIT5
CATCH-TIME-LIMIT5@PAR DEFUNS
ADD-DEFAULT-HINTS! LOCAL ENCAPSULATE
REMOVE-DEFAULT-HINTS! INCLUDE-BOOK
PPROGN SET-ENFORCE-REDUNDANCY LOGIC
ER DEFLABEL MV-LET PROGRAM VALUE-TRIPLE
SET-BODY COMP SET-BOGUS-DEFUN-HINTS-OK
DMR-STOP DEFPKG SET-MEASURE-FUNCTION
SET-INHIBIT-WARNINGS! DEFTHM MV
F-BIG-CLOCK-NEGATIVE-P RESET-PREHISTORY
MUTUAL-RECURSION SET-REWRITE-STACK-LIMIT
SET-PROVER-STEP-LIMIT
ADD-MATCH-FREE-OVERRIDE
SET-MATCH-FREE-DEFAULT
THE-MV TABLE IN-ARITHMETIC-THEORY
REGENERATE-TAU-DATABASE
SET-CASE-SPLIT-LIMITATIONS
SET-IRRELEVANT-FORMALS-OK
REMOVE-UNTOUCHABLE
IN-THEORY WITH-OUTPUT-FORCED
DMR-START REWRITE-ENTRY
SKIP-PROOFS F-BOUNDP-GLOBAL
MAKE-EVENT SET-VERIFY-GUARDS-EAGERNESS
WORMHOLE VERIFY-TERMINATION-BOOT-STRAP
START-PROOF-TREE
F-DECREMENT-BIG-CLOCK DEFABSSTOBJ
DEFSTOBJ DEFUND DEFTTAG PUSH-GFRAME
DEFTHMD F-GET-GLOBAL CAAR CADR
CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR
CDADR CDDAR CDDDR CAAAAR CAAADR CAADAR
CAADDR CADAAR CADADR CADDAR CADDDR
CDAAAR CDAADR CDADAR CDADDR CDDAAR
CDDADR CDDDAR CDDDDR REST MAKE-LIST LIST
OR AND * LOGIOR LOGXOR LOGAND SEARCH
LOGEQV CONCATENATE LET* DEFUN THE > <=
>= + - / 1+ 1- PROGN DEFMACRO COND CASE
LIST* APPEND DEFCONST IN-PACKAGE INTERN
FIRST SECOND THIRD FOURTH FIFTH SIXTH
SEVENTH EIGHTH NINTH TENTH DIGIT-CHAR-P
UNMEMOIZE MEMOIZE DEFUNS-STD
DEFTHM-STD DEFUN-STD POR PAND PLET
PARGS SPEC-MV-LET TRACE! WITH-LIVE-STATE
WITH-OUTPUT-OBJECT-CHANNEL-SHARING
WITH-HCOMP-BINDINGS
WITH-HCOMP-HT-BINDINGS REDEF+
REDEF- BIND-ACL2-TIME-LIMIT DEFATTACH
DEFPROXY COUNT MEMBER ASSOC SUBSETP
RASSOC REMOVE REMOVE-DUPLICATES POSITION
CATCH-STEP-LIMIT STEP-LIMIT-ERROR
WATERFALL-PRINT-CLAUSE-ID@PAR
DEFLOCK F-PUT-GLOBAL@PAR
SET-WATERFALL-PARALLELISM
WITH-PROVER-STEP-LIMIT
WATERFALL1-WRAPPER@PAR
WITH-WATERFALL-PARALLELISM-TIMINGS
WITH-PARALLELISM-HAZARD-WARNINGS
WARN-ABOUT-PARALLELISM-HAZARD
WITH-ENSURED-PARALLELISM-FINISHING
STATE-GLOBAL-LET*
WITH-RECKLESS-READTABLE
WITH-LOCK CATCH-THROW-TO-LOCAL-TOP-LEVEL
WITH-FAST-ALIST-RAW
WITH-STOLEN-ALIST-RAW
FAST-ALIST-FREE-ON-EXIT-RAW
STOBJ-LET ADD-LD-KEYWORD-ALIAS!
SET-LD-KEYWORD-ALIASES!
WITH-GUARD-CHECKING-EVENT WHEN-PASS-2
LOOP$ OUR-WITH-TERMINAL-INPUT)
(MAIN-TIMER . 0)
(MAKE-EVENT-DEBUG)
(MAKE-EVENT-DEBUG-DEPTH . 0)
(MATCH-FREE-ERROR)
(MODIFYING-INCLUDE-BOOK-DIR-ALIST)
(PARALLEL-EXECUTION-ENABLED)
(PARALLELISM-HAZARDS-ACTION)
(PC-ERP)
(PC-OUTPUT)
(PC-PRINT-MACROEXPANSION-FLG)
(PC-PRINT-PROMPT-AND-INSTR-FLG . T)
(PC-PROMPT . "->: ")
(PC-PROMPT-DEPTH-PREFIX . "#")
(PC-SS-ALIST)
(PC-VAL)
(PORT-FILE-ENABLED . T)
(PPR-FLAT-RIGHT-MARGIN . 40)
(PRINT-BASE . 10)
(PRINT-CASE . :UPCASE)
(PRINT-CIRCLE)
(PRINT-CIRCLE-FILES . T)
(PRINT-CLAUSE-IDS)
(PRINT-ESCAPE . T)
(PRINT-GV-DEFAULTS)
(PRINT-LENGTH)
(PRINT-LEVEL)
(PRINT-LINES)
(PRINT-PRETTY)
(PRINT-RADIX)
(PRINT-READABLY)
(PRINT-RIGHT-MARGIN)
(PROGRAM-FNS-WITH-RAW-CODE RELIEVE-HYP-SYNP
EV-W-LST SIMPLIFY-CLAUSE1
EV-REC-ACL2-UNWIND-PROTECT
ALLOCATE-FIXNUM-RANGE TRACE$-FN-GENERAL
EV-FNCALL! OPEN-TRACE-FILE-FN
SET-TRACE-EVISC-TUPLE EV-FNCALL-W-BODY
EV-REC SETUP-SIMPLIFY-CLAUSE-POT-LST1
SAVE-EXEC-FN CW-GSTACK-FN
RECOMPRESS-GLOBAL-ENABLED-STRUCTURE
EV-W VERBOSE-PSTACK COMP-FN
ACL2-RAW-EVAL PSTACK-FN DMR-START-FN
EV-FNCALL-META LD-LOOP PRINT-SUMMARY
EV EV-LST ALLEGRO-ALLOCATE-SLOWLY-FN
CERTIFY-BOOK-FN TRANSLATE11-FLET-ALIST1
INCLUDE-BOOK-FN1 INCLUDE-BOOK-FN
SET-W PROVE-LOOP CHK-VIRGIN-MSG
W-OF-ANY-STATE LD-FN-BODY UNTRANSLATE
LONGEST-COMMON-TAIL-LENGTH-REC
COMPILE-FUNCTION UNTRANSLATE-LST
EV-SYNP ADD-POLYS DMR-STOP-FN
LD-PRINT-RESULTS CLOSE-TRACE-FILE-FN
EV-FNCALL-REC EV-FNCALL LD-FN0
LD-FN WRITE-EXPANSION-FILE LATCH-STOBJS1
CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS
UNTRACE$-FN1
BDD-TOP DEFSTOBJ-FIELD-FNS-RAW-DEFS
TIMES-MOD-M31 IPRINT-AR-AREF1
PROVE MAKE-EVENT-FN OOPS-WARNING
CHECKPOINT-WORLD UBT-PREHISTORY-FN
GET-DECLAIM-LIST PATHNAME-UNIX-TO-OS
HCOMP-BUILD-FROM-STATE
DEFCONST-VAL PUSH-WARNING-FRAME
POP-WARNING-FRAME PUSH-WARNING
INITIALIZE-ACCUMULATED-WARNINGS
EV-REC-RETURN-LAST
CHK-RETURN-LAST-ENTRY FCHECKSUM-ATOM
STEP-LIMIT-ERROR1 WATERFALL1-LST@PAR
WATERFALL1-WRAPPER@PAR-BEFORE
WATERFALL1-WRAPPER@PAR-AFTER
INCREMENT-WATERFALL-PARALLELISM-COUNTER
FLUSH-WATERFALL-PARALLELISM-HASHTABLES
CLEAR-CURRENT-WATERFALL-PARALLELISM-HT
SETUP-WATERFALL-PARALLELISM-HT-FOR-NAME
SET-WATERFALL-PARALLELISM-FN
FIX-STOBJ-ARRAY-TYPE
SET-GC-THRESHOLD$-FN
CERTIFY-BOOK-FINISH-COMPLETE
CHK-ABSSTOBJ-INVARIANTS
GET-STOBJ-CREATOR IPRINT-ORACLE-UPDATES
IPRINT-ORACLE-UPDATES@PAR LD-FIX-COMMAND
UPDATE-ENABLED-STRUCTURE-ARRAY
UPDATE-ENABLED-STRUCTURE
FCHECKSUM-OBJ2 CHECK-SUM-OBJ
VERIFY-GUARDS-FN1 EV-FNCALL+-W
EXTEND-CURRENT-THEORY DEFSTOBJ-FN
APPLY-USER-STOBJ-ALIST-OR-KWOTE)
(PROMPT-FUNCTION . DEFAULT-PRINT-PROMPT)
(PROMPT-MEMO)
(PROOF-TREE)
(PROOF-TREE-BUFFER-WIDTH . 65)
(PROOF-TREE-CTX)
(PROOF-TREE-INDENT . "| ")
(PROOF-TREE-START-PRINTED)
(PROOFS-CO .
ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
(PROTECT-MEMOIZE-STATISTICS)
(RAW-ARITY-ALIST)
(RAW-GUARD-WARNINGP)
(RAW-INCLUDE-BOOK-DIR!-ALIST . :IGNORE)
(RAW-INCLUDE-BOOK-DIR-ALIST . :IGNORE)
(RAW-PROOF-FORMAT)
(RAW-WARNING-FORMAT)
(REDO-FLAT-FAIL)
(REDO-FLAT-SUCC)
(REDUNDANT-WITH-RAW-CODE-OKP)
(RETRACE-P)
(SAFE-MODE)
(SAVE-EXPANSION-FILE)
(SAVED-OUTPUT-P)
(SAVED-OUTPUT-REVERSED)
(SAVED-OUTPUT-TOKEN-LST)
(SCRIPT-MODE)
(SERIALIZE-CHARACTER)
(SERIALIZE-CHARACTER-SYSTEM)
(SHOW-CUSTOM-KEYWORD-HINT-EXPANSION)
(SKIP-NOTIFY-ON-DEFTTAG)
(SKIP-PROOFS-BY-SYSTEM)
(SKIP-PROOFS-OKP-CERT . T)
(SKIP-RESET-PREHISTORY)
(SLOW-APPLY$-ACTION . T)
(SLOW-ARRAY-ACTION . :BREAK)
(SPLITTER-OUTPUT . T)
(STANDARD-CO .
ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
(STANDARD-OI .
ACL2-OUTPUT-CHANNEL::STANDARD-OBJECT-INPUT-0)
(STEP-LIMIT-RECORD)
(SYSTEM-ATTACHMENTS-CACHE)
(SYSTEM-BOOKS-DIR)
(TEMP-TOUCHABLE-FNS)
(TEMP-TOUCHABLE-VARS)
(TERM-EVISC-TUPLE . :DEFAULT)
(TIMER-ALIST)
(TMP-DIR)
(TOTAL-PARALLELISM-WORK-LIMIT . 8000)
(TOTAL-PARALLELISM-WORK-LIMIT-ERROR . T)
(TRACE-CO .
ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0)
(TRACE-SPECS)
(TRIPLE-PRINT-PREFIX . " ")
(TTAGS-ALLOWED . :ALL)
(UNDONE-WORLDS-KILL-RING NIL NIL NIL)
(USER-HOME-DIR)
(VERBOSE-THEORY-WARNING . T)
(VERIFY-TERMINATION-ON-RAW-PROGRAM-OKP APPLY$-LAMBDA)
(WALKABOUT-ALIST)
(WATERFALL-PARALLELISM)
(WATERFALL-PARALLELISM-TIMING-THRESHOLD . 10000)
(WATERFALL-PRINTING . :FULL)
(WATERFALL-PRINTING-WHEN-FINISHED)
(WINDOW-INTERFACE-POSTLUDE
.
"#>\\>#<\\<e(acl2-window-postlude ?~sw ~xt ~xp)#>\\>")
(WINDOW-INTERFACE-PRELUDE
.
"~%#<\\<e(acl2-window-prelude ?~sw ~xc)#>\\>#<\\<~sw")
(WINDOW-INTERFACEP)
(WORMHOLE-NAME)
(WORMHOLE-STATUS)
(WRITE-ACL2X)
(WRITE-BOOKDATA)
(WRITE-FOR-READ)
(WRITES-OKP . T))
(NTH 2 STATE))
(PLIST-WORLDP (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
(NTH 2 STATE))))
(SYMBOL-ALISTP (FGETPROP 'ACL2-DEFAULTS-TABLE
'TABLE-ALIST
NIL
(CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
(NTH 2 STATE)))))
(TIMER-ALISTP (CDR (ASSOC-EQUAL 'TIMER-ALIST
(NTH 2 STATE))))
(KNOWN-PACKAGE-ALISTP (FGETPROP 'KNOWN-PACKAGE-ALIST
'GLOBAL-VALUE
NIL
(CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD
(NTH 2 STATE)))))
(TRUE-LISTP (NTH 3 STATE))
(32-BIT-INTEGER-LISTP (NTH 4 STATE))
(INTEGERP (NTH 5 STATE))
(INTEGER-LISTP (NTH 6 STATE))
(TRUE-LISTP (NTH 7 STATE))
(INTEGERP (NTH 8 STATE))
(<= 0 (NTH 8 STATE))
(READABLE-FILES-LISTP (NTH 9 STATE))
(WRITTEN-FILE-LISTP (NTH 10 STATE))
(READ-FILE-LISTP (NTH 11 STATE))
(WRITABLE-FILE-LISTP (NTH 12 STATE))
(TRUE-LIST-LISTP (NTH 13 STATE))
(SYMBOL-ALISTP (NTH 14 STATE)))
(LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE
VAL STATE)))
(AND (BOUNDP-GLOBAL1 'DMRP STATE)
(STATE-P1 STATE)
(OR (NOT (CONSP (CDR (ASSOC-EQUAL 'DMRP (NTH 2 STATE)))))
(STATE-P1 STATE))))).
[GC for 4587 CONS pages..(T=24).GC finished]
[GC for 4587 CONS pages..(T=22).GC finished]
[GC for 4587 CONS pages..(T=24).GC finished]
[GC for 4597 CONS pages..(T=24).GC finished]
[GC for 4597 CONS pages..(T=24).GC finished]
[GC for 4597 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=22).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4607 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rule NATP-COMPOUND-RECOGNIZER, the :definitions 32-BIT-INTEGER-STACK,
ACL2-ORACLE, ALL-BOUNDP, BIG-CLOCK-ENTRY, BOUNDP-GLOBAL1, FILE-CLOCK,
FILE-CLOCK-P, GLOBAL-TABLE, IDATES, LENGTH, LIST-ALL-PACKAGE-NAMES-LST,
MEMBER-EQUAL, NOT, NTH, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS,
OPEN-OUTPUT-CHANNELS, PUT-GLOBAL, READ-FILES, READ-FILES-P, READABLE-FILES,
READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, UPDATE-GLOBAL-TABLE,
USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES
and WRITTEN-FILES-P, the :executable-counterparts of ALL-BOUNDP, BINARY-+,
CAR, CDR, CONSP, EQLABLE-ALISTP, EQUAL, MAX, NFIX, NTH, OPEN-CHANNEL-LISTP,
ORDERED-SYMBOL-ALISTP and ZP, primitive type reasoning, the :forward-
chaining rules CONSP-ASSOC-EQUAL, EQLABLE-ALISTP-FORWARD-TO-ALISTP,
ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP and
SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP, the :rewrite rules
ADD-PAIR-PRESERVES-ALL-BOUNDP, ASSOC-ADD-PAIR, LEN-UPDATE-NTH,
NTH-UPDATE-NTH, ORDERED-SYMBOL-ALISTP-ADD-PAIR and
STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription
rules 32-BIT-INTEGER-LISTP, ALISTP, CONSP-ASSOC-EQUAL, EQLABLE-ALISTP,
INTEGER-LISTP, KNOWN-PACKAGE-ALISTP, OPEN-CHANNEL-LISTP,
ORDERED-SYMBOL-ALISTP, PLIST-WORLDP, READ-FILE-LISTP, READABLE-FILES-LISTP,
SYMBOL-ALISTP, TIMER-ALISTP, TRUE-LIST-LISTP, TRUE-LISTP-UPDATE-NTH,
UPDATE-NTH, WRITABLE-FILE-LISTP and WRITTEN-FILE-LISTP.
Q.E.D.
That completes the proof of the guard theorem for SET-DEBUGGER-ENABLE-FN.
SET-DEBUGGER-ENABLE-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:DEFINITION 32-BIT-INTEGER-STACK)
(:DEFINITION ACL2-ORACLE)
(:DEFINITION ALL-BOUNDP)
(:DEFINITION BIG-CLOCK-ENTRY)
(:DEFINITION BOUNDP-GLOBAL1)
(:DEFINITION FILE-CLOCK)
(:DEFINITION FILE-CLOCK-P)
(:DEFINITION GET-GLOBAL)
(:DEFINITION GLOBAL-TABLE)
(:DEFINITION IDATES)
(:DEFINITION LENGTH)
(:DEFINITION LIST-ALL-PACKAGE-NAMES-LST)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION NATP)
(:DEFINITION NOT)
(:DEFINITION NTH)
(:DEFINITION OPEN-CHANNELS-P)
(:DEFINITION OPEN-INPUT-CHANNELS)
(:DEFINITION OPEN-OUTPUT-CHANNELS)
(:DEFINITION PUT-GLOBAL)
(:DEFINITION READ-FILES)
(:DEFINITION READ-FILES-P)
(:DEFINITION READABLE-FILES)
(:DEFINITION READABLE-FILES-P)
(:DEFINITION STATE-P)
(:DEFINITION STATE-P1)
(:DEFINITION T-STACK)
(:DEFINITION UPDATE-GLOBAL-TABLE)
(:DEFINITION USER-STOBJ-ALIST1)
(:DEFINITION WRITEABLE-FILES)
(:DEFINITION WRITEABLE-FILES-P)
(:DEFINITION WRITTEN-FILES)
(:DEFINITION WRITTEN-FILES-P)
(:EXECUTABLE-COUNTERPART ALL-BOUNDP)
(:EXECUTABLE-COUNTERPART BINARY-+)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQLABLE-ALISTP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART MAX)
(:EXECUTABLE-COUNTERPART NFIX)
(:EXECUTABLE-COUNTERPART NTH)
(:EXECUTABLE-COUNTERPART OPEN-CHANNEL-LISTP)
(:EXECUTABLE-COUNTERPART ORDERED-SYMBOL-ALISTP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART ZP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING CONSP-ASSOC-EQUAL)
(:FORWARD-CHAINING EQLABLE-ALISTP-FORWARD-TO-ALISTP)
(:FORWARD-CHAINING ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:FORWARD-CHAINING SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP)
(:REWRITE ADD-PAIR-PRESERVES-ALL-BOUNDP)
(:REWRITE ASSOC-ADD-PAIR)
(:REWRITE LEN-UPDATE-NTH)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:REWRITE NTH-UPDATE-NTH)
(:REWRITE ORDERED-SYMBOL-ALISTP-ADD-PAIR)
(:REWRITE STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION 32-BIT-INTEGER-LISTP)
(:TYPE-PRESCRIPTION ALISTP)
(:TYPE-PRESCRIPTION CONSP-ASSOC-EQUAL)
(:TYPE-PRESCRIPTION EQLABLE-ALISTP)
(:TYPE-PRESCRIPTION INTEGER-LISTP)
(:TYPE-PRESCRIPTION KNOWN-PACKAGE-ALISTP)
(:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK)
(:TYPE-PRESCRIPTION OPEN-CHANNEL-LISTP)
(:TYPE-PRESCRIPTION ORDERED-SYMBOL-ALISTP)
(:TYPE-PRESCRIPTION PLIST-WORLDP)
(:TYPE-PRESCRIPTION PUT-GLOBAL)
(:TYPE-PRESCRIPTION READ-FILE-LISTP)
(:TYPE-PRESCRIPTION READABLE-FILES-LISTP)
(:TYPE-PRESCRIPTION STATE-P)
(:TYPE-PRESCRIPTION SYMBOL-ALISTP)
(:TYPE-PRESCRIPTION TIMER-ALISTP)
(:TYPE-PRESCRIPTION TRUE-LIST-LISTP)
(:TYPE-PRESCRIPTION TRUE-LISTP-UPDATE-NTH)
(:TYPE-PRESCRIPTION UPDATE-NTH)
(:TYPE-PRESCRIPTION WRITABLE-FILE-LISTP)
(:TYPE-PRESCRIPTION WRITTEN-FILE-LISTP))
Time: 63.24 seconds (prove: 62.80, print: 0.02, other: 0.42)
Prover steps counted: 281062
SET-DEBUGGER-ENABLE-FN
Summary
Form: ( IN-THEORY (DISABLE ...))
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
(:NUMBER-OF-ENABLED-RUNES 2866)
[GC for 4617 CONS pages..(T=24).GC finished]
Summary
Form: ( IN-THEORY (DISABLE ...))
Rules: NIL
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
(:NUMBER-OF-ENABLED-RUNES 2865)
Summary
Form: ( IN-THEORY (DISABLE ...))
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
(:NUMBER-OF-ENABLED-RUNES 2864)
Since ADD-@PAR-SUFFIX is non-recursive, its admission is trivial.
We observe that the type of ADD-@PAR-SUFFIX is described by the theorem
(SYMBOLP (ADD-@PAR-SUFFIX SYMBOL)). We used the :type-prescription
rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL.
Computing the guard conjecture for ADD-@PAR-SUFFIX....
The guard conjecture for ADD-@PAR-SUFFIX is trivial to prove, given
primitive type reasoning and the :type-prescription rule STRING-APPEND.
ADD-@PAR-SUFFIX is compliant with Common Lisp.
Summary
Form: ( DEFUN ADD-@PAR-SUFFIX ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:TYPE-PRESCRIPTION STRING-APPEND)
(:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
ADD-@PAR-SUFFIX
The admission of GENERATE-@PAR-MAPPINGS is trivial, using the relation
O< (which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT SYMBOLS). We observe that the type of
GENERATE-@PAR-MAPPINGS is described by the theorem
(TRUE-LISTP (GENERATE-@PAR-MAPPINGS SYMBOLS)). We used primitive type
reasoning.
Computing the guard conjecture for GENERATE-@PAR-MAPPINGS....
The non-trivial part of the guard conjecture for GENERATE-@PAR-MAPPINGS,
given the :forward-chaining rule SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP
and the :type-prescription rule SYMBOL-LISTP, is
Goal
(AND (IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
(NOT (ENDP SYMBOLS)))
(SYMBOLP (CAR SYMBOLS)))
(IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
(NOT (ENDP SYMBOLS)))
(SYMBOL-LISTP (CDR SYMBOLS)))).
By the simple :definition ENDP we reduce the conjecture to the following
two conjectures.
Subgoal 2
(IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
(CONSP SYMBOLS))
(SYMBOLP (CAR SYMBOLS))).
But simplification reduces this to T, using the :definition SYMBOL-LISTP.
Subgoal 1
(IMPLIES (AND (SYMBOL-LISTP SYMBOLS)
(CONSP SYMBOLS))
(SYMBOL-LISTP (CDR SYMBOLS))).
But simplification reduces this to T, using the :definition SYMBOL-LISTP.
Q.E.D.
That completes the proof of the guard theorem for GENERATE-@PAR-MAPPINGS.
GENERATE-@PAR-MAPPINGS is compliant with Common Lisp.
Summary
Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...)
Rules: ((:DEFINITION ENDP)
(:DEFINITION NOT)
(:DEFINITION SYMBOL-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-TRUE-LISTP)
(:TYPE-PRESCRIPTION SYMBOL-LISTP))
Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20)
Prover steps counted: 115
GENERATE-@PAR-MAPPINGS
The event ( DEFCONST *@PAR-MAPPINGS* ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFCONST *@PAR-MAPPINGS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The admission of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is trivial, using
the relation O< (which is known to be well-founded on the domain recognized
by O-P) and the measure (ACL2-COUNT MAPPINGS). We observe that the
type of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is described by the theorem
(TRUE-LISTP (MAKE-IDENTITY-FOR-@PAR-MAPPINGS MAPPINGS)). We used primitive
type reasoning.
Computing the guard conjecture for MAKE-IDENTITY-FOR-@PAR-MAPPINGS....
The non-trivial part of the guard conjecture for
MAKE-IDENTITY-FOR-@PAR-MAPPINGS, given the :forward-chaining rule
ALISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule ALISTP,
is
Goal
(AND (IMPLIES (AND (ALISTP MAPPINGS)
(NOT (ENDP MAPPINGS)))
(ALISTP (CDR MAPPINGS)))
(IMPLIES (AND (ALISTP MAPPINGS)
(NOT (ENDP MAPPINGS))
(NOT (CONSP (CAR MAPPINGS))))
(EQUAL (CAR MAPPINGS) NIL))).
By the simple :definition ENDP we reduce the conjecture to the following
two conjectures.
Subgoal 2
(IMPLIES (AND (ALISTP MAPPINGS) (CONSP MAPPINGS))
(ALISTP (CDR MAPPINGS))).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 1
(IMPLIES (AND (ALISTP MAPPINGS)
(CONSP MAPPINGS)
(NOT (CONSP (CAR MAPPINGS))))
(EQUAL (CAR MAPPINGS) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Q.E.D.
That completes the proof of the guard theorem for
MAKE-IDENTITY-FOR-@PAR-MAPPINGS. MAKE-IDENTITY-FOR-@PAR-MAPPINGS is
compliant with Common Lisp.
Summary
Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION NOT)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP)
(:TYPE-PRESCRIPTION ALISTP))
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
Prover steps counted: 127
MAKE-IDENTITY-FOR-@PAR-MAPPINGS
The event ( DEFMACRO DEFINE-@PAR-MACROS ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO DEFINE-@PAR-MACROS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CATCH-TIME-LIMIT5@PAR (&REST RST)
(CONS 'CATCH-TIME-LIMIT5 RST))
The event ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR
(&REST RST)
(CONS 'CMP-AND-VALUE-TO-ERROR-QUADRUPLE
RST))
The event ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CMP-TO-ERROR-TRIPLE@PAR (&REST RST)
(CONS 'CMP-TO-ERROR-TRIPLE RST))
The event ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ER@PAR (&REST RST)
(CONS 'ER RST))
The event ( DEFMACRO ER@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO ER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ER-LET*@PAR (&REST RST)
(CONS 'ER-LET* RST))
The event ( DEFMACRO ER-LET*@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO ER-LET*@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ER-PROGN@PAR (&REST RST)
(CONS 'ER-PROGN RST))
The event ( DEFMACRO ER-PROGN@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO ER-PROGN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ERROR-FMS@PAR (&REST RST)
(CONS 'ERROR-FMS RST))
The event ( DEFMACRO ERROR-FMS@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO ERROR-FMS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR
(&REST RST)
(CONS 'ERROR-IN-PARALLELISM-MODE RST))
The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ERROR1@PAR (&REST RST)
(CONS 'ERROR1 RST))
The event ( DEFMACRO ERROR1@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO ERROR1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST)
(CONS 'F-PUT-GLOBAL RST))
The event ( DEFMACRO F-PUT-GLOBAL@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO F-PUT-GLOBAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO IO?@PAR (&REST RST)
(CONS 'IO? RST))
The event ( DEFMACRO IO?@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO IO?@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO IO?-PROVE@PAR (&REST RST)
(CONS 'IO?-PROVE RST))
The event ( DEFMACRO IO?-PROVE@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO IO?-PROVE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO MV@PAR (&REST RST)
(CONS 'MV RST))
The event ( DEFMACRO MV@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO MV@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO MV-LET@PAR (&REST RST)
(CONS 'MV-LET RST))
The event ( DEFMACRO MV-LET@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO MV-LET@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST)
(CONS 'PARALLEL-ONLY RST))
The event ( DEFMACRO PARALLEL-ONLY@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO PARALLEL-ONLY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO PPROGN@PAR (&REST RST)
(CONS 'PPROGN RST))
The event ( DEFMACRO PPROGN@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO PPROGN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR
(&REST RST)
(CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM
RST))
The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
is redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST)
(CONS 'SERIAL-ONLY RST))
The event ( DEFMACRO SERIAL-ONLY@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO SERIAL-ONLY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO SL-LET@PAR (&REST RST)
(CONS 'SL-LET RST))
The event ( DEFMACRO SL-LET@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO SL-LET@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO STATE-MAC@PAR (&REST RST)
(CONS 'STATE-MAC RST))
The event ( DEFMACRO STATE-MAC@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO STATE-MAC@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO VALUE@PAR (&REST RST)
(CONS 'VALUE RST))
The event ( DEFMACRO VALUE@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
[GC for 4617 CONS pages..(T=22).GC finished]
:REDUNDANT
ACL2 !>>(DEFMACRO WARNING$@PAR (&REST RST)
(CONS 'WARNING$ RST))
The event ( DEFMACRO WARNING$@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO WARNING$@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST)
(CONS 'ADD-CUSTOM-KEYWORD-HINT RST))
The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:REDUNDANT
ACL2 !>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST)
(CONS 'EVAL-CLAUSE-PROCESSOR RST))
The event ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO EVAL-THEORY-EXPR@PAR (&REST RST)
(CONS 'EVAL-THEORY-EXPR RST))
The event ( DEFMACRO EVAL-THEORY-EXPR@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO EVAL-THEORY-EXPR@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO FORMAL-VALUE-TRIPLE@PAR (&REST RST)
(CONS 'FORMAL-VALUE-TRIPLE RST))
The event ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO INCREMENT-TIMER@PAR (&REST RST)
(CONS 'INCREMENT-TIMER RST))
The event ( DEFMACRO INCREMENT-TIMER@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO INCREMENT-TIMER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR
(&REST RST)
(CONS 'SIMPLE-TRANSLATE-AND-EVAL RST))
The event ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-IN-THEORY-HINT RST))
The event ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR
(&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE-ID RST))
The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR
(&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL
RST))
The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR
(&REST RST)
(CONS 'WATERFALL-UPDATE-GAG-STATE RST))
The event ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL1-LST@PAR (&REST RST)
(CONS 'WATERFALL1-LST RST))
The event ( DEFMACRO WATERFALL1-LST@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO WATERFALL1-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL1-WRAPPER@PAR (&REST RST)
(CONS 'WATERFALL1-WRAPPER RST))
The event ( DEFMACRO WATERFALL1-WRAPPER@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL1-WRAPPER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO XTRANS-EVAL@PAR (&REST RST)
(CONS 'XTRANS-EVAL RST))
The event ( DEFMACRO XTRANS-EVAL@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO XTRANS-EVAL@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
(&REST RST)
(CONS 'ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE
RST))
The event ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR
...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR
(&REST RST)
(CONS 'ADD-CUSTOM-KEYWORD-HINT-FN RST))
The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINT RST))
The event ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT1@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINT1 RST))
The event ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST)
(CONS 'APPLY-OVERRIDE-HINTS RST))
The event ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST)
(CONS 'APPLY-REORDER-HINT RST))
The event ( DEFMACRO APPLY-REORDER-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO APPLY-REORDER-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST)
(CONS 'APPLY-TOP-HINTS-CLAUSE RST))
The event ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR
(&REST RST)
(CONS 'CHECK-TRANSLATED-OVERRIDE-HINT
RST))
The event ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST)
(CONS 'CHK-ARGLIST RST))
The event ( DEFMACRO CHK-ARGLIST@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO CHK-ARGLIST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST)
(CONS 'CHK-DO-NOT-EXPR-VALUE RST))
The event ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST)
(CONS 'CHK-EQUAL-ARITIES RST))
The event ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST)
(CONS 'CHK-EQUIV-CLASSICALP RST))
The event ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST)
(CONS 'CHK-THEORY-EXPR-VALUE RST))
The event ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST)
(CONS 'CHK-THEORY-EXPR-VALUE1 RST))
The event ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST)
(CONS 'CHK-THEORY-INVARIANT RST))
The event ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST)
(CONS 'CHK-THEORY-INVARIANT1 RST))
The event ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR
(&REST RST)
(CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER
RST))
The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR
(&REST RST)
(CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1
RST))
The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR
(&REST RST)
(CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION
RST))
The event ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR
(&REST RST)
(CONS 'FIND-APPLICABLE-HINT-SETTINGS
RST))
The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR
(&REST RST)
(CONS 'FIND-APPLICABLE-HINT-SETTINGS1
RST))
The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST)
(CONS 'GAG-STATE-EXITING-CL-ID RST))
The event ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR
(&REST RST)
(CONS 'LOAD-HINT-SETTINGS-INTO-PSPV
RST))
The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR
(&REST RST)
(CONS 'LOAD-HINT-SETTINGS-INTO-RCNST
RST))
The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR
(&REST RST)
(CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE
RST))
The event ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:REDUNDANT
ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY RST))
The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR
(&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS
RST))
The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR
(&REST RST)
(CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE
RST))
The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST)
(CONS 'MAYBE-WARN-FOR-USE-HINT RST))
The event ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR
(&REST RST)
(CONS 'PAIR-CL-ID-WITH-HINT-SETTING
RST))
The event ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST)
(CONS 'PROCESS-BACKTRACK-HINT RST))
The event ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST)
(CONS 'PUSH-CLAUSE RST))
The event ( DEFMACRO PUSH-CLAUSE@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO PUSH-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO
PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
(&REST RST)
(CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM
RST))
The event ( DEFMACRO
PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR
...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST)
(CONS 'RECORD-GAG-STATE RST))
The event ( DEFMACRO RECORD-GAG-STATE@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST)
(CONS 'THANKS-FOR-THE-HINT RST))
The event ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE@PAR (&REST RST)
(CONS 'TRANSLATE RST))
The event ( DEFMACRO TRANSLATE@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO TRANSLATE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE1@PAR (&REST RST)
(CONS 'TRANSLATE1 RST))
The event ( DEFMACRO TRANSLATE1@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO TRANSLATE1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT
RST))
The event ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BACKTRACK-HINT RST))
The event ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BDD-HINT RST))
The event ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-BDD-HINT1 RST))
The event ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-BY-HINT RST))
The event ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT
RST))
The event ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
is redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-CASES-HINT RST))
The event ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT
RST))
The event ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT
RST))
The event ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-DO-NOT-HINT RST))
The event ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-DO-NOT-INDUCT-HINT
RST))
The event ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-ERROR-HINT RST))
The event ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-HINT RST))
The event ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-HINT1 RST))
The event ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-TERM RST))
The event ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST)
(CONS 'TRANSLATE-EXPAND-TERM1 RST))
The event ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR
(&REST RST)
(CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION
RST))
The event ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-HANDS-OFF-HINT RST))
The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR
(&REST RST)
(CONS 'TRANSLATE-HANDS-OFF-HINT1 RST))
The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-HINT RST))
The event ( DEFMACRO TRANSLATE-HINT@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS RST))
The event ( DEFMACRO TRANSLATE-HINTS@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS1 RST))
The event ( DEFMACRO TRANSLATE-HINTS1@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS2 RST))
The event ( DEFMACRO TRANSLATE-HINTS2@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST)
(CONS 'TRANSLATE-HINTS+1 RST))
The event ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR
(&REST RST)
(CONS 'TRANSLATE-HINT-EXPRESSION RST))
The event ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR
(&REST RST)
(CONS 'TRANSLATE-HINT-EXPRESSIONS RST))
The event ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST)
(CONS 'TRANSLATE-HINT-SETTINGS RST))
The event ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-INDUCT-HINT RST))
The event ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST)
(CONS 'TRANSLATE-LMI RST))
The event ( DEFMACRO TRANSLATE-LMI@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-LMI@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR
(&REST RST)
(CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE
RST))
The event ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST)
(CONS 'TRANSLATE-LMI/INSTANCE RST))
The event ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-NO-OP-HINT RST))
The event ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-NO-THANKS-HINT RST))
The event ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-NONLINEARP-HINT RST))
The event ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-OR-HINT RST))
The event ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-REORDER-HINT RST))
The event ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-RESTRICT-HINT RST))
The event ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR
(&REST RST)
(CONS 'TRANSLATE-RW-CACHE-STATE-HINT
RST))
The event ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR
(&REST RST)
(CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE
RST))
The event ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST)
(CONS 'TRANSLATE-SUBSTITUTION RST))
The event ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR
(&REST RST)
(CONS 'TRANSLATE-SUBSTITUTION-LST RST))
The event ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST)
(CONS 'TRANSLATE-TERM-LST RST))
The event ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST)
(CONS 'TRANSLATE-USE-HINT RST))
The event ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST)
(CONS 'TRANSLATE-USE-HINT1 RST))
The event ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST)
(CONS 'TRANSLATE-X-HINT-VALUE RST))
The event ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR
(&REST RST)
(CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS
RST))
The event ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST)
(CONS 'WATERFALL-MSG RST))
The event ( DEFMACRO WATERFALL-MSG@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-MSG@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST)
(CONS 'WATERFALL-PRINT-CLAUSE RST))
The event ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST)
(CONS 'WATERFALL-STEP RST))
The event ( DEFMACRO WATERFALL-STEP@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-STEP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST)
(CONS 'WATERFALL-STEP1 RST))
The event ( DEFMACRO WATERFALL-STEP1@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-STEP1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST)
(CONS 'WATERFALL-STEP-CLEANUP RST))
The event ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL0@PAR (&REST RST)
(CONS 'WATERFALL0 RST))
The event ( DEFMACRO WATERFALL0@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO WATERFALL0@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST)
(CONS 'WATERFALL0-OR-HIT RST))
The event ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL0-OR-HIT@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR
(&REST RST)
(CONS 'WATERFALL0-WITH-HINT-SETTINGS
RST))
The event ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(DEFMACRO WATERFALL1@PAR (&REST RST)
(CONS 'WATERFALL1 RST))
The event ( DEFMACRO WATERFALL1@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO WATERFALL1@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Summary
Form: ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...)
Rules: NIL
Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30)
:REDUNDANT
The admission of REPLACE-DEFUN@PAR-WITH-DEFUN is trivial, using the
relation O< (which is known to be well-founded on the domain recognized
by O-P) and the measure (ACL2-COUNT FORMS). We observe that the type
of REPLACE-DEFUN@PAR-WITH-DEFUN is described by the theorem
(TRUE-LISTP (REPLACE-DEFUN@PAR-WITH-DEFUN FORMS)). We used primitive
type reasoning.
Computing the guard conjecture for REPLACE-DEFUN@PAR-WITH-DEFUN....
The non-trivial part of the guard conjecture for
REPLACE-DEFUN@PAR-WITH-DEFUN, given the :forward-chaining rule
ALISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule ALISTP,
is
Goal
(AND (IMPLIES (AND (ALISTP FORMS) (NOT (ENDP FORMS)))
(ALISTP (CDR FORMS)))
(IMPLIES (AND (ALISTP FORMS)
(NOT (ENDP FORMS))
(NOT (CONSP (CAR FORMS))))
(EQUAL (CAR FORMS) NIL))).
By the simple :definition ENDP we reduce the conjecture to the following
two conjectures.
Subgoal 2
(IMPLIES (AND (ALISTP FORMS) (CONSP FORMS))
(ALISTP (CDR FORMS))).
But simplification reduces this to T, using the :definition ALISTP.
Subgoal 1
(IMPLIES (AND (ALISTP FORMS)
(CONSP FORMS)
(NOT (CONSP (CAR FORMS))))
(EQUAL (CAR FORMS) NIL)).
But simplification reduces this to T, using the :definition ALISTP.
Q.E.D.
That completes the proof of the guard theorem for
REPLACE-DEFUN@PAR-WITH-DEFUN. REPLACE-DEFUN@PAR-WITH-DEFUN is compliant
with Common Lisp.
Summary
Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...)
Rules: ((:DEFINITION ALISTP)
(:DEFINITION ENDP)
(:DEFINITION NOT)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP)
(:TYPE-PRESCRIPTION ALISTP))
Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20)
Prover steps counted: 127
REPLACE-DEFUN@PAR-WITH-DEFUN
The event ( DEFMACRO MUTUAL-RECURSION@PAR ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO MUTUAL-RECURSION@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO DEFUN@PAR ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO DEFUN@PAR ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) is
redundant. See :DOC redundant-events.
Summary
Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO SERIAL-ONLY ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO SERIAL-ONLY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO PARALLEL-ONLY ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO PARALLEL-ONLY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO STATE-MAC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO STATE-MAC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *WATERFALL-PRINTING-VALUES* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
[GC for 4617 CONS pages..(T=24).GC finished]
Since SYMBOL-CONSTANT-FN is non-recursive, its admission is trivial.
We observe that the type of SYMBOL-CONSTANT-FN is described by the
theorem (SYMBOLP (SYMBOL-CONSTANT-FN PREFIX SYM)). We used the :type-
prescription rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL.
Computing the guard conjecture for SYMBOL-CONSTANT-FN....
The non-trivial part of the guard conjecture for SYMBOL-CONSTANT-FN,
given the :type-prescription rule STRING-APPEND-LST, is
Goal
(IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX))
(STRING-LISTP (LIST (SYMBOL-NAME PREFIX)
"-" (SYMBOL-NAME SYM)))).
By case analysis we reduce the conjecture to
Goal'
(IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX))
(STRING-LISTP (LIST (SYMBOL-NAME PREFIX)
"-" (SYMBOL-NAME SYM)))).
But simplification reduces this to T, using the :definition STRING-LISTP,
the :executable-counterparts of STRING-LISTP and STRINGP, primitive
type reasoning and the :rewrite rules CAR-CONS and CDR-CONS.
Q.E.D.
That completes the proof of the guard theorem for SYMBOL-CONSTANT-FN.
SYMBOL-CONSTANT-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN SYMBOL-CONSTANT-FN ...)
Rules: ((:DEFINITION NOT)
(:DEFINITION STRING-LISTP)
(:EXECUTABLE-COUNTERPART STRING-LISTP)
(:EXECUTABLE-COUNTERPART STRINGP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:TYPE-PRESCRIPTION STRING-APPEND-LST)
(:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL))
Time: 0.42 seconds (prove: 0.00, print: 0.00, other: 0.42)
Prover steps counted: 122
SYMBOL-CONSTANT-FN
Since STOBJS-IN is non-recursive, its admission is trivial. We could
deduce no constraints on the type of STOBJS-IN.
Computing the guard conjecture for STOBJS-IN....
The guard conjecture for STOBJS-IN is trivial to prove. STOBJS-IN
is compliant with Common Lisp.
Summary
Form: ( DEFUN STOBJS-IN ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
STOBJS-IN
The event ( DEFUN ALL-NILS ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ALL-NILS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *TTAG-FNS* ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFCONST *TTAG-FNS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since LOGICP is non-recursive, its admission is trivial. We observe
that the type of LOGICP is described by the theorem
(OR (EQUAL (LOGICP FN WRLD) T) (EQUAL (LOGICP FN WRLD) NIL)). We used
primitive type reasoning.
Computing the guard conjecture for LOGICP....
The guard conjecture for LOGICP is trivial to prove. LOGICP is compliant
with Common Lisp.
Summary
Form: ( DEFUN LOGICP ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
LOGICP
The event ( DEFMACRO LOGICALP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO LOGICALP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO PROGRAMP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO PROGRAMP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *STOBJS-OUT-INVALID* ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFCONST *STOBJS-OUT-INVALID* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since STOBJS-OUT is non-recursive, its admission is trivial. We could
deduce no constraints on the type of STOBJS-OUT. However, in normalizing
the definition we used the :type-prescription rule ILLEGAL.
Computing the guard conjecture for STOBJS-OUT....
The non-trivial part of the guard conjecture for STOBJS-OUT, given
the :type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is
Goal
(AND (IMPLIES (AND (SYMBOLP FN) (PLIST-WORLDP W))
(LET ((X FN) (L '(IF RETURN-LAST)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))
(IMPLIES (AND (NOT (LET ((X FN) (L '(IF RETURN-LAST)))
(MEMBER-EQUAL X L)))
(PLIST-WORLDP W)
(SYMBOLP FN)
(NOT (EQ FN 'CONS)))
(NOT (MEMBER-EQUAL FN '(IF RETURN-LAST))))).
But we reduce the conjecture to T, by the simple :definition EQ, the
:executable-counterpart of TAU-SYSTEM and the simple :rewrite rule
MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for STOBJS-OUT. STOBJS-OUT
is compliant with Common Lisp.
Summary
Form: ( DEFUN STOBJS-OUT ...)
Rules: ((:DEFINITION EQ)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION ILLEGAL)
(:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK))
Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24)
Prover steps counted: 98
STOBJS-OUT
Since EV-FNCALL-W-GUARD1 is non-recursive, its admission is trivial.
We observe that the type of EV-FNCALL-W-GUARD1 is described by the
theorem
(OR (CONSP (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS))
(EQUAL (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS)
NIL)).
We used primitive type reasoning.
Computing the guard conjecture for EV-FNCALL-W-GUARD1....
The non-trivial part of the guard conjecture for EV-FNCALL-W-GUARD1
is
Goal
(AND
(IMPLIES
(AND (PLIST-WORLDP WRLD)
(SYMBOLP FN)
(NOT (EQ FN 'IF)))
(LET
((X FN)
(ALIST
'((HONS-WASH!)
(HONS-CLEAR!)
(OPEN-OUTPUT-CHANNEL!)
(REMOVE-UNTOUCHABLE-FN
" Note that the same restriction applies to the macro ~x0, whose ~
expansions generate calls of ~x1."
(#\0 . REMOVE-UNTOUCHABLE)
(#\1 . REMOVE-UNTOUCHABLE-FN))
(SET-RAW-MODE-ON
" If you do not plan to certify books in this session, then ~
instead you may want to call ~x0; see :DOC ~x0."
(#\0 . SET-RAW-MODE-ON!))
(SET-TEMP-TOUCHABLE-FNS)
(SET-TEMP-TOUCHABLE-VARS)
(SYS-CALL)
(SYS-CALL*)
(SYS-CALL+))))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))
(IMPLIES
(AND
(PLIST-WORLDP WRLD)
(SYMBOLP FN)
(NOT (EQ FN 'IF))
(NOT
(ASSOC-EQUAL
FN
'((HONS-WASH!)
(HONS-CLEAR!)
(OPEN-OUTPUT-CHANNEL!)
(REMOVE-UNTOUCHABLE-FN
" Note that the same restriction applies to the macro ~x0, whose ~
expansions generate calls of ~x1."
(#\0 . REMOVE-UNTOUCHABLE)
(#\1 . REMOVE-UNTOUCHABLE-FN))
(SET-RAW-MODE-ON
" If you do not plan to certify books in this session, then ~
instead you may want to call ~x0; see :DOC ~x0."
(#\0 . SET-RAW-MODE-ON!))
(SET-TEMP-TOUCHABLE-FNS)
(SET-TEMP-TOUCHABLE-VARS)
(SYS-CALL)
(SYS-CALL*)
(SYS-CALL+)))))
(LET
((FORMALS (FGETPROP FN 'FORMALS T WRLD)))
(AND
(SYMBOLP FN)
(PLIST-WORLDP WRLD)
(LET
((STOBJS-IN (STOBJS-IN FN WRLD)))
(AND
(PLIST-WORLDP WRLD)
(LET
((UNTOUCHABLE-FNS (GLOBAL-VAL 'UNTOUCHABLE-FNS WRLD)))
(AND
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(LET ((X FN) (L UNTOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(MEMBER-EQUAL FN UNTOUCHABLE-FNS)
(LET ((X FN) (L UNTOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS))
(LET ((X FN) (L TEMP-TOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L)))))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(NOT (NULL FORMALS))
(SYMBOLP FN))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(NOT (NULL FORMALS))
(PLIST-WORLDP WRLD))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (NULL FORMALS)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(PLIST-WORLDP WRLD))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (NULL FORMALS)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(SYMBOLP FN))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (NULL FORMALS)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQ FN 'RETURN-LAST)
(SYMBOLP FN))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (NULL FORMALS)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQ FN 'RETURN-LAST)
(NOT (LET ((X FN) (L '(IF RETURN-LAST)))
(MBE :LOGIC (PROG2$ (MEMBER-EQ-EXEC$GUARD-CHECK X L)
(MEMBER-EQUAL X L))
:EXEC (MEMBER-EQ-EXEC X L)))))
(OR (EQ FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQ T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (NULL FORMALS)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQ FN 'RETURN-LAST)
(PLIST-WORLDP WRLD)))))))))).
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
By the simple :definitions EQ, GLOBAL-VAL, MEMBER-EQ-EXEC$GUARD-CHECK,
NULL and RETURN-LAST, the :executable-counterpart of TAU-SYSTEM and
the simple :rewrite rules ASSOC-EQ-EXEC-IS-ASSOC-EQUAL and
MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
Goal'
(IMPLIES
(AND
(PLIST-WORLDP WRLD)
(SYMBOLP FN)
(NOT (EQUAL FN 'IF))
(NOT
(ASSOC-EQUAL
FN
'((HONS-WASH!)
(HONS-CLEAR!)
(OPEN-OUTPUT-CHANNEL!)
(REMOVE-UNTOUCHABLE-FN
" Note that the same restriction applies to the macro ~x0, whose ~
expansions generate calls of ~x1."
(#\0 . REMOVE-UNTOUCHABLE)
(#\1 . REMOVE-UNTOUCHABLE-FN))
(SET-RAW-MODE-ON
" If you do not plan to certify books in this session, then ~
instead you may want to call ~x0; see :DOC ~x0."
(#\0 . SET-RAW-MODE-ON!))
(SET-TEMP-TOUCHABLE-FNS)
(SET-TEMP-TOUCHABLE-VARS)
(SYS-CALL)
(SYS-CALL*)
(SYS-CALL+)))))
(LET
((FORMALS (FGETPROP FN 'FORMALS T WRLD)))
(AND
(SYMBOLP FN)
(PLIST-WORLDP WRLD)
(LET
((STOBJS-IN (STOBJS-IN FN WRLD)))
(AND
(PLIST-WORLDP WRLD)
(LET
((UNTOUCHABLE-FNS
(FGETPROP
'UNTOUCHABLE-FNS
'GLOBAL-VALUE
'(:ERROR
"GLOBAL-VAL didn't find a value. Initialize this ~
symbol in PRIMORDIAL-WORLD-GLOBALS.")
WRLD)))
(AND (OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(LET ((X FN) (L UNTOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L)))))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(MEMBER-EQUAL FN UNTOUCHABLE-FNS)
(LET ((X FN) (L UNTOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L)))))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS))
(LET ((X FN) (L TEMP-TOUCHABLE-FNS))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L)))))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(NOT (EQUAL FORMALS NIL))
(SYMBOLP FN))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(NOT (EQUAL FORMALS NIL))
(PLIST-WORLDP WRLD))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (EQUAL FORMALS NIL)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(PLIST-WORLDP WRLD))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (EQUAL FORMALS NIL)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(SYMBOLP FN))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (EQUAL FORMALS NIL)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQUAL FN 'RETURN-LAST)
(SYMBOLP FN))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (EQUAL FORMALS NIL)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQUAL FN 'RETURN-LAST)
(NOT (MEMBER-EQUAL FN '(IF RETURN-LAST))))
(OR (EQUAL FORMALS T)
(NOT (TRUE-LISTP UNTOUCHABLE-FNS))
(NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS))
(EQUAL T TEMP-TOUCHABLE-FNS)
(AND (TRUE-LISTP TEMP-TOUCHABLE-FNS)
(MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS))))
(AND (EQUAL FORMALS NIL)
(FGETPROP FN 'STOBJ-FUNCTION NIL WRLD))
(NOT (TRUE-LISTP STOBJS-IN))
(NOT (ALL-NILS STOBJS-IN))
(EQUAL FN 'RETURN-LAST)
(PLIST-WORLDP WRLD))))))))).
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=22).GC finished]
But simplification reduces this to T, using the :definitions ASSOC-EQUAL,
MEMBER-EQUAL, NOT and STOBJS-IN, the :executable-counterparts of CAR,
CDR, CONSP and NOT, primitive type reasoning and the :type-prescription
rule PLIST-WORLDP.
Q.E.D.
That completes the proof of the guard theorem for EV-FNCALL-W-GUARD1.
EV-FNCALL-W-GUARD1 is compliant with Common Lisp.
Summary
Form: ( DEFUN EV-FNCALL-W-GUARD1 ...)
Rules: ((:DEFINITION ASSOC-EQUAL)
(:DEFINITION EQ)
(:DEFINITION GLOBAL-VAL)
(:DEFINITION MEMBER-EQ-EXEC$GUARD-CHECK)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT)
(:DEFINITION NULL)
(:DEFINITION RETURN-LAST)
(:DEFINITION STOBJS-IN)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION PLIST-WORLDP))
Time: 1.10 seconds (prove: 0.98, print: 0.04, other: 0.08)
Prover steps counted: 3573
EV-FNCALL-W-GUARD1
Since EV-FNCALL-W-GUARD is non-recursive, its admission is trivial.
We could deduce no constraints on the type of EV-FNCALL-W-GUARD.
Computing the guard conjecture for EV-FNCALL-W-GUARD....
The guard conjecture for EV-FNCALL-W-GUARD is trivial to prove, given
the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription
rules EV-FNCALL-W-GUARD1 and LENGTH. EV-FNCALL-W-GUARD is compliant
with Common Lisp.
Summary
Form: ( DEFUN EV-FNCALL-W-GUARD ...)
Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG)
(:TYPE-PRESCRIPTION EV-FNCALL-W-GUARD1)
(:TYPE-PRESCRIPTION LENGTH))
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
EV-FNCALL-W-GUARD
Since TIME-TRACKER-FN is non-recursive, its admission is trivial.
We observe that the type of TIME-TRACKER-FN is described by the theorem
(EQUAL (TIME-TRACKER-FN TAG KWD KWDP TIMES INTERVAL MIN-TIME MSG) NIL).
We used the :compound-recognizer rule BOOLEANP-COMPOUND-RECOGNIZER,
the :executable-counterpart of EQUAL, primitive type reasoning and
the :type-prescription rule HARD-ERROR.
Computing the guard conjecture for TIME-TRACKER-FN....
The non-trivial part of the guard conjecture for TIME-TRACKER-FN is
Goal
(IMPLIES (AND (NOT (AND (BOOLEANP TAG) KWDP))
(NOT (BOOLEANP TAG))
(SYMBOLP TAG))
(LET ((X KWD)
(L '(:INIT :END
:PRINT? :STOP
:START :START!)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for TIME-TRACKER-FN.
TIME-TRACKER-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN TIME-TRACKER-FN ...)
Rules: ((:COMPOUND-RECOGNIZER BOOLEANP-COMPOUND-RECOGNIZER)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION HARD-ERROR))
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
Prover steps counted: 51
TIME-TRACKER-FN
The event ( DEFMACRO TIME-TRACKER ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO TIME-TRACKER ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since SET-ABSSTOBJ-DEBUG-FN is non-recursive, its admission is trivial.
We observe that the type of SET-ABSSTOBJ-DEBUG-FN is described by the
theorem (EQUAL (SET-ABSSTOBJ-DEBUG-FN VAL ALWAYS) VAL).
Computing the guard conjecture for SET-ABSSTOBJ-DEBUG-FN....
The guard conjecture for SET-ABSSTOBJ-DEBUG-FN is trivial to prove.
SET-ABSSTOBJ-DEBUG-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
SET-ABSSTOBJ-DEBUG-FN
The event ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFMACRO SET-ABSSTOBJ-DEBUG ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:REDUNDANT
Since <? is non-recursive, its admission is trivial. We observe that
the type of <? is described by the theorem
(OR (EQUAL (<? REL X Y) T) (EQUAL (<? REL X Y) NIL)).
Computing the guard conjecture for <?....
The non-trivial part of the guard conjecture for <? is
Goal
(AND (IMPLIES (AND (RATIONALP X)
(NOT (OR (NULL X) (NULL Y))))
(LET ((X (FIX X)) (Y (FIX Y)))
(AND (OR (NOT (RATIONALP X))
(RATIONALP Y)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP X))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (= X (REALPART Y)))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (= X (REALPART Y)))
(RATIONALP (IMAGPART Y)))
(OR (RATIONALP X) (ACL2-NUMBERP X))
(OR (RATIONALP X)
(RATIONALP (REALPART X)))
(OR (RATIONALP X) (RATIONALP Y))
(OR (RATIONALP X)
(<= Y (REALPART X))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP (REALPART X)))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP (REALPART X)))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (= (REALPART X) Y))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (= (REALPART X) Y))
(RATIONALP (IMAGPART X))))))
(IMPLIES (AND (RATIONALP Y)
(NOT (OR (NULL X) (NULL Y))))
(LET ((X (FIX X)) (Y (FIX Y)))
(AND (OR (NOT (RATIONALP X))
(RATIONALP Y)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP X))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (= X (REALPART Y)))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (= X (REALPART Y)))
(RATIONALP (IMAGPART Y)))
(OR (RATIONALP X) (ACL2-NUMBERP X))
(OR (RATIONALP X)
(RATIONALP (REALPART X)))
(OR (RATIONALP X) (RATIONALP Y))
(OR (RATIONALP X)
(<= Y (REALPART X))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP (REALPART X)))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP (REALPART X)))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (= (REALPART X) Y))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (= (REALPART X) Y))
(RATIONALP (IMAGPART X))))))).
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
[GC for 4617 CONS pages..(T=24).GC finished]
By the simple :definitions = and NULL we reduce the conjecture to the
following two conjectures.
Subgoal 2
(IMPLIES (AND (RATIONALP X)
(NOT (OR (EQUAL X NIL) (EQUAL Y NIL))))
(LET ((X (FIX X)) (Y (FIX Y)))
(AND (OR (NOT (RATIONALP X))
(RATIONALP Y)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP X))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (EQUAL X (REALPART Y)))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (EQUAL X (REALPART Y)))
(RATIONALP (IMAGPART Y)))
(OR (RATIONALP X) (ACL2-NUMBERP X))
(OR (RATIONALP X)
(RATIONALP (REALPART X)))
(OR (RATIONALP X) (RATIONALP Y))
(OR (RATIONALP X)
(<= Y (REALPART X))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP (REALPART X)))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP (REALPART X)))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (EQUAL (REALPART X) Y))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (EQUAL (REALPART X) Y))
(RATIONALP (IMAGPART X)))))).
[GC for 4617 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definitions FIX and
NOT, the :executable-counterpart of NOT and primitive type reasoning.
Subgoal 1
(IMPLIES (AND (RATIONALP Y)
(NOT (OR (EQUAL X NIL) (EQUAL Y NIL))))
(LET ((X (FIX X)) (Y (FIX Y)))
(AND (OR (NOT (RATIONALP X))
(RATIONALP Y)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(<= (REALPART Y) X)
(RATIONALP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP X))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(ACL2-NUMBERP (REALPART Y)))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (EQUAL X (REALPART Y)))
(ACL2-NUMBERP Y))
(OR (NOT (RATIONALP X))
(RATIONALP Y)
(< X (REALPART Y))
(NOT (EQUAL X (REALPART Y)))
(RATIONALP (IMAGPART Y)))
(OR (RATIONALP X) (ACL2-NUMBERP X))
(OR (RATIONALP X)
(RATIONALP (REALPART X)))
(OR (RATIONALP X) (RATIONALP Y))
(OR (RATIONALP X)
(<= Y (REALPART X))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP (REALPART X)))
(OR (RATIONALP X)
(<= Y (REALPART X))
(RATIONALP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP (REALPART X)))
(OR (RATIONALP X)
(< (REALPART X) Y)
(ACL2-NUMBERP Y))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (EQUAL (REALPART X) Y))
(ACL2-NUMBERP X))
(OR (RATIONALP X)
(< (REALPART X) Y)
(NOT (EQUAL (REALPART X) Y))
(RATIONALP (IMAGPART X)))))).
[GC for 4617 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definitions FIX and
NOT, the :executable-counterpart of EQUAL and primitive type reasoning.
Q.E.D.
That completes the proof of the guard theorem for <?. <? is compliant
with Common Lisp.
[GC for 4617 CONS pages..(T=24).GC finished]
Summary
Form: ( DEFUN <? ...)
Rules: ((:DEFINITION =)
(:DEFINITION FIX)
(:DEFINITION NOT)
(:DEFINITION NULL)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART NOT)
(:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 1.72 seconds (prove: 1.22, print: 0.02, other: 0.48)
Prover steps counted: 2057
<?
Since TAU-INTERVAL-DOMAINP is non-recursive, its admission is trivial.
We observe that the type of TAU-INTERVAL-DOMAINP is described by the
theorem
(OR (EQUAL (TAU-INTERVAL-DOMAINP DOM X) T)
(EQUAL (TAU-INTERVAL-DOMAINP DOM X)
NIL)).
Computing the guard conjecture for TAU-INTERVAL-DOMAINP....
The guard conjecture for TAU-INTERVAL-DOMAINP is trivial to prove.
TAU-INTERVAL-DOMAINP is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVAL-DOMAINP ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.02, other: 0.08)
TAU-INTERVAL-DOMAINP
Since TAU-INTERVAL-DOM is non-recursive, its admission is trivial.
We could deduce no constraints on the type of TAU-INTERVAL-DOM.
Computing the guard conjecture for TAU-INTERVAL-DOM....
The guard conjecture for TAU-INTERVAL-DOM is trivial to prove.
TAU-INTERVAL-DOM is compliant with Common Lisp.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=36).GC finished]
Summary
Form: ( DEFUN TAU-INTERVAL-DOM ...)
Rules: NIL
Time: 0.48 seconds (prove: 0.00, print: 0.00, other: 0.48)
TAU-INTERVAL-DOM
Since TAU-INTERVAL-LO-REL is non-recursive, its admission is trivial.
We could deduce no constraints on the type of TAU-INTERVAL-LO-REL.
Computing the guard conjecture for TAU-INTERVAL-LO-REL....
The guard conjecture for TAU-INTERVAL-LO-REL is trivial to prove.
TAU-INTERVAL-LO-REL is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVAL-LO-REL ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
TAU-INTERVAL-LO-REL
Since TAU-INTERVAL-LO is non-recursive, its admission is trivial.
We could deduce no constraints on the type of TAU-INTERVAL-LO.
Computing the guard conjecture for TAU-INTERVAL-LO....
The guard conjecture for TAU-INTERVAL-LO is trivial to prove.
TAU-INTERVAL-LO is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVAL-LO ...)
Rules: NIL
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
TAU-INTERVAL-LO
Since TAU-INTERVAL-HI-REL is non-recursive, its admission is trivial.
We could deduce no constraints on the type of TAU-INTERVAL-HI-REL.
Computing the guard conjecture for TAU-INTERVAL-HI-REL....
The guard conjecture for TAU-INTERVAL-HI-REL is trivial to prove.
TAU-INTERVAL-HI-REL is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVAL-HI-REL ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-HI-REL
Since TAU-INTERVAL-HI is non-recursive, its admission is trivial.
We could deduce no constraints on the type of TAU-INTERVAL-HI.
Computing the guard conjecture for TAU-INTERVAL-HI....
The guard conjecture for TAU-INTERVAL-HI is trivial to prove.
TAU-INTERVAL-HI is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVAL-HI ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
TAU-INTERVAL-HI
Since MAKE-TAU-INTERVAL is non-recursive, its admission is trivial.
We observe that the type of MAKE-TAU-INTERVAL is described by the theorem
(CONSP (MAKE-TAU-INTERVAL DOM LO-REL LO HI-REL HI)). We used primitive
type reasoning.
Computing the guard conjecture for MAKE-TAU-INTERVAL....
The guard conjecture for MAKE-TAU-INTERVAL is trivial to prove.
MAKE-TAU-INTERVAL is compliant with Common Lisp.
Summary
Form: ( DEFUN MAKE-TAU-INTERVAL ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
MAKE-TAU-INTERVAL
Since TAU-INTERVALP is non-recursive, its admission is trivial. We
observe that the type of TAU-INTERVALP is described by the theorem
(OR (EQUAL (TAU-INTERVALP INT) T) (EQUAL (TAU-INTERVALP INT) NIL)).
Computing the guard conjecture for TAU-INTERVALP....
The non-trivial part of the guard conjecture for TAU-INTERVALP is
Goal
(IMPLIES (AND (CONSP INT)
(CONSP (CDR INT))
(CONSP (CADR INT))
(CONSP (CDDR INT)))
(LET ((DOM (TAU-INTERVAL-DOM INT)))
(OR (EQ DOM 'INTEGERP)
(LET ((X DOM)
(L '(RATIONALP ACL2-NUMBERP NIL)))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L))))))).
But we reduce the conjecture to T, by the simple :definitions EQ and
TAU-INTERVAL-DOM, the :executable-counterpart of TAU-SYSTEM and the
simple :rewrite rule MEMBER-EQL-EXEC-IS-MEMBER-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for TAU-INTERVALP.
TAU-INTERVALP is compliant with Common Lisp.
Summary
Form: ( DEFUN TAU-INTERVALP ...)
Rules: ((:DEFINITION EQ)
(:DEFINITION NOT)
(:DEFINITION TAU-INTERVAL-DOM)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:REWRITE MEMBER-EQL-EXEC-IS-MEMBER-EQUAL))
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
Prover steps counted: 112
TAU-INTERVALP
Since IN-TAU-INTERVALP is non-recursive, its admission is trivial.
We observe that the type of IN-TAU-INTERVALP is described by the theorem
(OR (EQUAL (IN-TAU-INTERVALP X INT) T) (EQUAL (IN-TAU-INTERVALP X INT) NIL)).
We used the :type-prescription rule <?.
Computing the guard conjecture for IN-TAU-INTERVALP....
The non-trivial part of the guard conjecture for IN-TAU-INTERVALP,
given the :type-prescription rule FIX, is
Goal
(AND (IMPLIES (TAU-INTERVALP INT)
(CONSP INT))
(IMPLIES (AND (TAU-INTERVALP INT)
(TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
X))
(CONSP (CADR INT)))
(IMPLIES (AND (TAU-INTERVALP INT)
(TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
X))
(CONSP (CDR INT)))
(IMPLIES (AND (TAU-INTERVALP INT)
(TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
X)
(<? (TAU-INTERVAL-LO-REL INT)
(TAU-INTERVAL-LO INT)
(FIX X)))
(CONSP (CDDR INT)))
(IMPLIES (AND (TAU-INTERVALP INT)
(TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
X)
(<? (TAU-INTERVAL-LO-REL INT)
(TAU-INTERVAL-LO INT)
(FIX X))
(FIX X)
(NOT (RATIONALP (FIX X))))
(IMPLIES (TAU-INTERVAL-HI INT)
(RATIONALP (TAU-INTERVAL-HI INT))))
(IMPLIES (AND (TAU-INTERVALP INT)
(TAU-INTERVAL-DOMAINP (TAU-INTERVAL-DOM INT)
X)
(TAU-INTERVAL-LO INT)
(NOT (RATIONALP (TAU-INTERVAL-LO INT))))
(IMPLIES (FIX X) (RATIONALP (FIX X))))).
But we reduce the conjecture to T, by the simple :definitions
TAU-INTERVAL-DOM, TAU-INTERVAL-HI, TAU-INTERVAL-HI-REL, TAU-INTERVAL-LO,
TAU-INTERVAL-LO-REL and TAU-INTERVALP and the :executable-counterpart
of TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for IN-TAU-INTERVALP.
IN-TAU-INTERVALP is compliant with Common Lisp.
Summary
Form: ( DEFUN IN-TAU-INTERVALP ...)
Rules: ((:DEFINITION NOT)
(:DEFINITION TAU-INTERVAL-DOM)
(:DEFINITION TAU-INTERVAL-HI)
(:DEFINITION TAU-INTERVAL-HI-REL)
(:DEFINITION TAU-INTERVAL-LO)
(:DEFINITION TAU-INTERVAL-LO-REL)
(:DEFINITION TAU-INTERVALP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:TYPE-PRESCRIPTION <?)
(:TYPE-PRESCRIPTION FIX))
Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20)
Prover steps counted: 1045
IN-TAU-INTERVALP
ACL2 Warning [Subsume] in ( DEFTHM COMMUTATIVITY-2-OF-+ ...): The
previously added rule COMMUTATIVITY-OF-+ subsumes a newly proposed
:REWRITE rule generated from COMMUTATIVITY-2-OF-+, in the sense that
the old rule rewrites a more general target. Because the new rule
will be tried first, it may nonetheless find application.
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
Summary
Form: ( DEFTHM COMMUTATIVITY-2-OF-+ ...)
Rules: ((:EXECUTABLE-COUNTERPART TAU-SYSTEM))
Warnings: Subsume
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
Prover steps counted: 11
COMMUTATIVITY-2-OF-+
ACL2 Warning [Subsume] in ( DEFTHM FOLD-CONSTS-IN-+ ...): The previously
added rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ subsume a newly
proposed :REWRITE rule generated from FOLD-CONSTS-IN-+, in the sense
that the old rules rewrite more general targets. Because the new rule
will be tried first, it may nonetheless find application.
But we reduce the conjecture to T, by the :executable-counterparts
of IF and SYNP and the simple :rewrite rule ASSOCIATIVITY-OF-+.
Q.E.D.
Summary
Form: ( DEFTHM FOLD-CONSTS-IN-+ ...)
Rules: ((:EXECUTABLE-COUNTERPART IF)
(:EXECUTABLE-COUNTERPART SYNP)
(:REWRITE ASSOCIATIVITY-OF-+))
Warnings: Subsume
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
Prover steps counted: 31
FOLD-CONSTS-IN-+
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
Summary
Form: ( DEFTHM DISTRIBUTIVITY-OF-MINUS-OVER-+ ...)
Rules: ((:EXECUTABLE-COUNTERPART TAU-SYSTEM))
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
Prover steps counted: 10
DISTRIBUTIVITY-OF-MINUS-OVER-+
[GC for 4617 CONS pages..(T=24).GC finished]
The admission of DECIMAL-STRING-TO-NUMBER is trivial, using the relation
O< (which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT BOUND). We observe that the type of
DECIMAL-STRING-TO-NUMBER is described by the theorem
(RATIONALP (DECIMAL-STRING-TO-NUMBER S BOUND EXPO)). We used the :executable-
counterparts of ACL2-NUMBERP, EQUAL and RATIONALP, primitive type reasoning
and the :type-prescription rules EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE
and RATIONALP-EXPT-TYPE-PRESCRIPTION.
Computing the guard conjecture for DECIMAL-STRING-TO-NUMBER....
The non-trivial part of the guard conjecture for DECIMAL-STRING-TO-NUMBER,
given the :compound-recognizer rules NATP-COMPOUND-RECOGNIZER and
ZP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription
rule LENGTH, is
Goal
(IMPLIES
(AND (<= BOUND (LENGTH S))
(NATP BOUND)
(NATP EXPO)
(STRINGP S)
(NOT (ZP BOUND)))
(LET
((POS (+ -1 BOUND)))
(AND
(STRINGP S)
(<= 0 POS)
(INTEGERP POS)
(< POS (LENGTH S))
(LET
((CH (CHAR S POS)))
(AND
(LET ((X CH)
(L '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQL-EXEC X L))))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQLABLEP CH)
(EQLABLEP #\0))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQLABLEP CH)
(EQLABLEP #\1))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQLABLEP CH)
(EQLABLEP #\2))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQLABLEP CH)
(EQLABLEP #\3))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQL CH #\3)
(EQLABLEP CH)
(EQLABLEP #\4))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQL CH #\3)
(EQL CH #\4)
(EQLABLEP CH)
(EQLABLEP #\5))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQL CH #\3)
(EQL CH #\4)
(EQL CH #\5)
(EQLABLEP CH)
(EQLABLEP #\6))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQL CH #\3)
(EQL CH #\4)
(EQL CH #\5)
(EQL CH #\6)
(EQLABLEP CH)
(EQLABLEP #\7))
(OR (NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(EQL CH #\0)
(EQL CH #\1)
(EQL CH #\2)
(EQL CH #\3)
(EQL CH #\4)
(EQL CH #\5)
(EQL CH #\6)
(EQL CH #\7)
(EQLABLEP CH)
(EQLABLEP #\8))
(OR
(NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(LET
((DIGIT (CASE CH (#\0 0)
(#\1 1)
(#\2 2)
(#\3 3)
(#\4 4)
(#\5 5)
(#\6 6)
(#\7 7)
(#\8 8)
(OTHERWISE 9))))
(AND
(INTEGERP EXPO)
(OR (NOT (EQL 10 0)) (<= 0 EXPO))
(ACL2-NUMBERP (EXPT 10 EXPO))
(ACL2-NUMBERP DIGIT)
(ACL2-NUMBERP EXPO)
(STRINGP S)
(NATP POS)
(NATP (+ 1 EXPO))
(<= POS (LENGTH S))
(ACL2-NUMBERP (* (EXPT 10 EXPO) DIGIT))
(ACL2-NUMBERP (DECIMAL-STRING-TO-NUMBER S POS (+ 1 EXPO))))))))))).
[GC for 4617 CONS pages..(T=24).GC finished]
By the simple :definitions CHAR, EQL and NATP, the :executable-counterparts
of EQL and EQLABLEP and the simple :rewrite rule
MEMBER-EQL-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
Goal'
(IMPLIES
(AND (<= BOUND (LENGTH S))
(INTEGERP BOUND)
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND)))
(LET
((POS (+ -1 BOUND)))
(AND
(STRINGP S)
(<= 0 POS)
(INTEGERP POS)
(< POS (LENGTH S))
(LET
((CH (NTH POS (COERCE S 'LIST))))
(AND
(LET ((X CH)
(L '(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L))
(OR (EQLABLEP X) (EQLABLE-LISTP L))))
(OR
(NOT (MEMBER-EQUAL CH
'(#\0 #\1 #\2 #\3 #\4 #\5 #\6 #\7 #\8 #\9)))
(LET
((DIGIT (CASE CH (#\0 0)
(#\1 1)
(#\2 2)
(#\3 3)
(#\4 4)
(#\5 5)
(#\6 6)
(#\7 7)
(#\8 8)
(OTHERWISE 9))))
(AND
(INTEGERP EXPO)
(ACL2-NUMBERP (EXPT 10 EXPO))
(ACL2-NUMBERP DIGIT)
(ACL2-NUMBERP EXPO)
(STRINGP S)
(NATP POS)
(NATP (+ 1 EXPO))
(<= POS (LENGTH S))
(ACL2-NUMBERP (* (EXPT 10 EXPO) DIGIT))
(ACL2-NUMBERP (DECIMAL-STRING-TO-NUMBER S POS (+ 1 EXPO))))))))))).
[GC for 4617 CONS pages..(T=24).GC finished]
This simplifies, using the :compound-recognizer rules
NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, the :congruence
rule IFF-IMPLIES-EQUAL-NOT, the :definitions LENGTH, MEMBER-EQUAL (if-
intro) and NOT (if-intro), the :executable-counterparts of ACL2-NUMBERP,
CAR, CDR, CONSP, EQLABLE-LISTP, EQUAL, RATIONALP and TRUE-LISTP, primitive
type reasoning and the :type-prescription rules DECIMAL-STRING-TO-NUMBER,
EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION,
to the following eleven conjectures.
Subgoal 11
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND)))
(< (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 10
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\7))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 9
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\3))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
[GC for 4617 CONS pages..(T=24).GC finished]
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 8
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\1))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 7
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\9))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 6
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\5))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 5
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\0))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 4
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\8))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 3
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\4))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 2
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\2))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal 1
(IMPLIES (AND (<= BOUND (LEN (COERCE S 'LIST)))
(<= 0 BOUND)
(INTEGERP EXPO)
(<= 0 EXPO)
(STRINGP S)
(NOT (ZP BOUND))
(EQUAL (NTH (+ -1 BOUND) (COERCE S 'LIST))
#\6))
(<= (+ -1 BOUND)
(LEN (COERCE S 'LIST)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Q.E.D.
That completes the proof of the guard theorem for DECIMAL-STRING-TO-NUMBER.
DECIMAL-STRING-TO-NUMBER is compliant with Common Lisp.
Summary
Form: ( DEFUN DECIMAL-STRING-TO-NUMBER ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:CONGRUENCE IFF-IMPLIES-EQUAL-NOT)
(:DEFINITION CHAR)
(:DEFINITION EQL)
(:DEFINITION LENGTH)
(:DEFINITION MEMBER-EQUAL)
(:DEFINITION NATP)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART ACL2-NUMBERP)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART EQL)
(:EXECUTABLE-COUNTERPART EQLABLE-LISTP)
(:EXECUTABLE-COUNTERPART EQLABLEP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART NOT)
(:EXECUTABLE-COUNTERPART RATIONALP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE MEMBER-EQL-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION DECIMAL-STRING-TO-NUMBER)
(:TYPE-PRESCRIPTION EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE)
(:TYPE-PRESCRIPTION LENGTH)
(:TYPE-PRESCRIPTION RATIONALP-EXPT-TYPE-PRESCRIPTION))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT))
Time: 1.40 seconds (prove: 0.52, print: 0.26, other: 0.62)
Prover steps counted: 4262
DECIMAL-STRING-TO-NUMBER
Since CHECK-DCL-GUARDIAN is non-recursive, its admission is trivial.
We observe that the type of CHECK-DCL-GUARDIAN is described by the
theorem (EQUAL (CHECK-DCL-GUARDIAN VAL TERM) T).
Computing the guard conjecture for CHECK-DCL-GUARDIAN....
The guard conjecture for CHECK-DCL-GUARDIAN is trivial to prove.
CHECK-DCL-GUARDIAN is compliant with Common Lisp.
Summary
Form: ( DEFUN CHECK-DCL-GUARDIAN ...)
Rules: NIL
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
CHECK-DCL-GUARDIAN
The event ( DEFCONST *GC-STRATEGY-ALIST* ...) is redundant. See :DOC
redundant-events.
Summary
Form: ( DEFCONST *GC-STRATEGY-ALIST* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since SET-GC-STRATEGY-FN is non-recursive, its admission is trivial.
We observe that the type of SET-GC-STRATEGY-FN is described by the
theorem (EQUAL (SET-GC-STRATEGY-FN OP THRESHOLD) OP).
Computing the guard conjecture for SET-GC-STRATEGY-FN....
The non-trivial part of the guard conjecture for SET-GC-STRATEGY-FN,
given primitive type reasoning and the :type-prescription rule
ASSOC-EQ-EXEC$GUARD-CHECK, is
Goal
(IMPLIES (NOT (EQ OP :CURRENT))
(LET ((X OP)
(ALIST '((:EGC . SET-GC-STRATEGY-BUILTIN-EGC)
(:DELAY . SET-GC-STRATEGY-BUILTIN-DELAY))))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST))))).
But we reduce the conjecture to T, by the simple :definition EQ, the
:executable-counterpart of TAU-SYSTEM and the simple :rewrite rule
ASSOC-EQ-EXEC-IS-ASSOC-EQUAL.
Q.E.D.
That completes the proof of the guard theorem for SET-GC-STRATEGY-FN.
SET-GC-STRATEGY-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN SET-GC-STRATEGY-FN ...)
Rules: ((:DEFINITION EQ)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
(:TYPE-PRESCRIPTION ASSOC-EQ-EXEC$GUARD-CHECK))
Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12)
Prover steps counted: 38
SET-GC-STRATEGY-FN
The event ( DEFMACRO SET-GC-STRATEGY ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO SET-GC-STRATEGY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since GC-STRATEGY is non-recursive, its admission is trivial. We observe
that the type of GC-STRATEGY is described by the theorem
(AND (CONSP (GC-STRATEGY STATE)) (TRUE-LISTP (GC-STRATEGY STATE))).
We used the :type-prescription rule READ-ACL2-ORACLE.
(GC-STRATEGY STATE) => (MV * * STATE).
Computing the guard conjecture for GC-STRATEGY....
The guard conjecture for GC-STRATEGY is trivial to prove, given the
:forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
the :type-prescription rule STATE-P. GC-STRATEGY is compliant with
Common Lisp.
Summary
Form: ( DEFUN GC-STRATEGY ...)
Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION READ-ACL2-ORACLE)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14)
GC-STRATEGY
The event ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFCONST *DEFINITION-MINIMAL-THEORY-ALIST* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY-ALIST* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since BBODY-FN is non-recursive, its admission is trivial. We could
deduce no constraints on the type of BBODY-FN. However, in normalizing
the definition we used the :type-prescription rule ILLEGAL.
Computing the guard conjecture for BBODY-FN....
The non-trivial part of the guard conjecture for BBODY-FN, given the
:type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is
Goal
(AND
(LET ((X FN)
(L '(MV-NTH IFF NOT IMPLIES
EQ ATOM EQL = /= NULL ENDP ZEROP SYNP
PLUSP MINUSP LISTP RETURN-LAST MV-LIST
CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL
FORCE CASE-SPLIT DOUBLE-REWRITE)))
(AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L))
(OR (SYMBOLP X) (SYMBOL-LISTP L))
(EQUAL (MEMBER-EQUAL X L)
(MEMBER-EQ-EXEC X L))))
(IMPLIES
(LET ((X FN)
(L '(MV-NTH IFF NOT IMPLIES
EQ ATOM EQL = /= NULL ENDP ZEROP SYNP
PLUSP MINUSP LISTP RETURN-LAST MV-LIST
CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL
FORCE CASE-SPLIT DOUBLE-REWRITE)))
(MEMBER-EQUAL X L))
(LET ((PAIR (ASSOC-EQUAL FN
'((/= IF (EQUAL X Y) 'NIL 'T)
(= EQUAL X Y)
(ATOM IF (CONSP X) 'NIL 'T)
(CASE-SPLIT . X)
(CONS-WITH-HINT CONS X Y)
(DOUBLE-REWRITE . X)
(ENDP IF (CONSP X) 'NIL 'T)
(EQ EQUAL X Y)
(EQL EQUAL X Y)
(FORCE . X)
(IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
(IMPLIES IF P (IF Q 'T 'NIL) 'T)
(LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
(MINUSP < X '0)
(MV-LIST . X)
(MV-NTH IF (CONSP L)
(IF (ZP N)
(CAR L)
(MV-NTH (BINARY-+ '-1 N) (CDR L)))
'NIL)
(NOT IF P 'NIL 'T)
(NULL EQUAL X 'NIL)
(PLUSP < '0 X)
(RETURN-LAST . LAST-ARG)
(SYNP QUOTE T)
(THE-CHECK . Y)
(WORMHOLE-EVAL QUOTE NIL)
(ZEROP EQUAL X '0)))))
(AND (OR (NOT PAIR)
(CONSP PAIR)
(EQUAL PAIR NIL))
PAIR)))
(IMPLIES (LET ((X FN)
(L '(MV-NTH IFF NOT IMPLIES
EQ ATOM EQL = /= NULL ENDP ZEROP SYNP
PLUSP MINUSP LISTP RETURN-LAST MV-LIST
CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL
FORCE CASE-SPLIT DOUBLE-REWRITE)))
(MEMBER-EQUAL X L))
(LET ((X FN)
(ALIST '((/= IF (EQUAL X Y) 'NIL 'T)
(= EQUAL X Y)
(ATOM IF (CONSP X) 'NIL 'T)
(CASE-SPLIT . X)
(CONS-WITH-HINT CONS X Y)
(DOUBLE-REWRITE . X)
(ENDP IF (CONSP X) 'NIL 'T)
(EQ EQUAL X Y)
(EQL EQUAL X Y)
(FORCE . X)
(IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
(IMPLIES IF P (IF Q 'T 'NIL) 'T)
(LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
(MINUSP < X '0)
(MV-LIST . X)
(MV-NTH IF (CONSP L)
(IF (ZP N)
(CAR L)
(MV-NTH (BINARY-+ '-1 N) (CDR L)))
'NIL)
(NOT IF P 'NIL 'T)
(NULL EQUAL X 'NIL)
(PLUSP < '0 X)
(RETURN-LAST . LAST-ARG)
(SYNP QUOTE T)
(THE-CHECK . Y)
(WORMHOLE-EVAL QUOTE NIL)
(ZEROP EQUAL X '0))))
(AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST))
(OR (SYMBOLP X) (SYMBOL-ALISTP ALIST))
(EQUAL (ASSOC-EQUAL X ALIST)
(ASSOC-EQ-EXEC X ALIST)))))).
By the :executable-counterparts of IF, SYMBOL-LISTP, TAU-SYSTEM and
TRUE-LISTP and the simple :rewrite rules ASSOC-EQ-EXEC-IS-ASSOC-EQUAL
and MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to
Goal'
(IMPLIES
(MEMBER-EQUAL FN
'(MV-NTH IFF NOT IMPLIES
EQ ATOM EQL = /= NULL ENDP ZEROP SYNP
PLUSP MINUSP LISTP RETURN-LAST MV-LIST
CONS-WITH-HINT THE-CHECK WORMHOLE-EVAL
FORCE CASE-SPLIT DOUBLE-REWRITE))
(LET ((PAIR (ASSOC-EQUAL FN
'((/= IF (EQUAL X Y) 'NIL 'T)
(= EQUAL X Y)
(ATOM IF (CONSP X) 'NIL 'T)
(CASE-SPLIT . X)
(CONS-WITH-HINT CONS X Y)
(DOUBLE-REWRITE . X)
(ENDP IF (CONSP X) 'NIL 'T)
(EQ EQUAL X Y)
(EQL EQUAL X Y)
(FORCE . X)
(IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T))
(IMPLIES IF P (IF Q 'T 'NIL) 'T)
(LISTP IF (CONSP X) 'T (EQUAL X 'NIL))
(MINUSP < X '0)
(MV-LIST . X)
(MV-NTH IF (CONSP L)
(IF (ZP N)
(CAR L)
(MV-NTH (BINARY-+ '-1 N) (CDR L)))
'NIL)
(NOT IF P 'NIL 'T)
(NULL EQUAL X 'NIL)
(PLUSP < '0 X)
(RETURN-LAST . LAST-ARG)
(SYNP QUOTE T)
(THE-CHECK . Y)
(WORMHOLE-EVAL QUOTE NIL)
(ZEROP EQUAL X '0)))))
(AND (OR (NOT PAIR)
(CONSP PAIR)
(EQUAL PAIR NIL))
PAIR))).
[GC for 4617 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :definition MEMBER-EQUAL,
the :executable-counterparts of ASSOC-EQUAL, CAR, CDR and CONSP and
primitive type reasoning.
Q.E.D.
That completes the proof of the guard theorem for BBODY-FN. BBODY-FN
is compliant with Common Lisp.
[GC for 977 RELOCATABLE-BLOCKS pages..(T=24).GC finished]
Summary
Form: ( DEFUN BBODY-FN ...)
Rules: ((:DEFINITION MEMBER-EQUAL)
(:DEFINITION NOT)
(:EXECUTABLE-COUNTERPART ASSOC-EQUAL)
(:EXECUTABLE-COUNTERPART CAR)
(:EXECUTABLE-COUNTERPART CDR)
(:EXECUTABLE-COUNTERPART CONSP)
(:EXECUTABLE-COUNTERPART IF)
(:EXECUTABLE-COUNTERPART SYMBOL-LISTP)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART TRUE-LISTP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL)
(:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL)
(:TYPE-PRESCRIPTION ILLEGAL)
(:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK))
Time: 0.72 seconds (prove: 0.26, print: 0.00, other: 0.46)
Prover steps counted: 668
BBODY-FN
The event ( DEFMACRO BBODY ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO BBODY ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since FILE-LENGTH$ is non-recursive, its admission is trivial. We
observe that the type of FILE-LENGTH$ is described by the theorem
(AND (CONSP (FILE-LENGTH$ FILE STATE))
(TRUE-LISTP (FILE-LENGTH$ FILE STATE))).
We used primitive type reasoning.
(FILE-LENGTH$ * STATE) => (MV * STATE).
Computing the guard conjecture for FILE-LENGTH$....
The guard conjecture for FILE-LENGTH$ is trivial to prove, given the
:forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and
the :type-prescription rule STATE-P. FILE-LENGTH$ is compliant with
Common Lisp.
Summary
Form: ( DEFUN FILE-LENGTH$ ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:TYPE-PRESCRIPTION STATE-P))
Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16)
FILE-LENGTH$
The event ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
To verify that the twelve encapsulated events correctly extend the
current theory we will evaluate them. The theory thus constructed
is only ephemeral.
Encapsulated Events:
ACL2 !>>(LOGIC)
The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant. See :DOC
redundant-events.
:INVISIBLE
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BOOLEANP)
The event ( DEFUN BOOLEANP ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN BOOLEANP ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS)
The event ( DEFUN ALL-NILS ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN ALL-NILS ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC)
The event ( DEFUN MEMBER-EQL-EXEC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN MEMBER-EQL-EXEC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK)
The event ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL)
The event ( DEFUN MEMBER-EQUAL ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN MEMBER-EQUAL ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC)
The event ( DEFUN SUBSETP-EQL-EXEC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SUBSETP-EQL-EXEC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK)
The event ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL)
The event ( DEFUN SUBSETP-EQUAL ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN SUBSETP-EQUAL ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND)
The event ( DEFUN REVAPPEND ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN REVAPPEND ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC)
The event ( DEFUN FIRST-N-AC ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFUN FIRST-N-AC ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE)
The event ( DEFUN TAKE ...) is redundant. See :DOC redundant-events.
Summary
Form: ( DEFUN TAKE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
End of Encapsulated Events.
ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...): The submitted
encapsulate event has created no new ACL2 events, and thus is leaving
the ACL2 logical world unchanged. See :DOC encapsulate.
Summary
Form: ( ENCAPSULATE NIL (LOGIC) ...)
Rules: NIL
Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02)
:EMPTY-ENCAPSULATE
The event ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...) is redundant.
See :DOC redundant-events.
Summary
Form: ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The admission of READ-FILE-INTO-STRING1 is trivial, using the relation
O< (which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT BOUND). We observe that the type of
READ-FILE-INTO-STRING1 is described by the theorem
(AND (CONSP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND))
(TRUE-LISTP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND))).
We used primitive type reasoning.
(READ-FILE-INTO-STRING1 * STATE * *) => (MV * STATE).
Computing the guard conjecture for READ-FILE-INTO-STRING1....
The non-trivial part of the guard conjecture for READ-FILE-INTO-STRING1,
given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :executable-
counterparts of MEMBER-EQ-EXEC, MEMBER-EQ-EXEC$GUARD-CHECK, MEMBER-EQUAL
and RETURN-LAST, primitive type reasoning, the :forward-chaining rule
STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription
rule STATE-P, is
Goal
(AND (IMPLIES (AND (NATP BOUND)
(CHARACTER-LISTP ANS)
(OPEN-INPUT-CHANNEL-P CHANNEL
:CHARACTER STATE)
(SYMBOLP CHANNEL)
(STATE-P STATE)
(NOT (ZP BOUND)))
(MV-LET (VAL STATE)
(READ-CHAR$ CHANNEL STATE)
(AND (OR (CHARACTERP VAL)
(TRUE-LISTP ANS)
(STRINGP ANS))
(OR (CHARACTERP VAL)
(CHARACTER-LISTP (REVERSE ANS)))
(OR (NOT (CHARACTERP VAL))
(ACL2-NUMBERP BOUND))
(OR (NOT (CHARACTERP VAL))
(SYMBOLP CHANNEL))
(OR (NOT (CHARACTERP VAL))
(CHARACTER-LISTP (CONS VAL ANS)))
(OR (NOT (CHARACTERP VAL))
(OPEN-INPUT-CHANNEL-P CHANNEL
:CHARACTER STATE))
(OR (NOT (CHARACTERP VAL))
(NATP (+ -1 BOUND))))))
(IMPLIES (AND (NATP BOUND)
(CHARACTER-LISTP ANS)
(OPEN-INPUT-CHANNEL-P CHANNEL
:CHARACTER STATE)
(SYMBOLP CHANNEL)
(STATE-P STATE)
(NOT (ZP BOUND)))
(OPEN-INPUT-CHANNEL-P1 CHANNEL
:CHARACTER STATE))).
[GC for 4617 CONS pages..(T=24).GC finished]
By the simple :definitions NATP, OPEN-INPUT-CHANNEL-P, OPEN-INPUT-CHANNEL-P1,
OPEN-INPUT-CHANNELS and STATE-P and the :executable-counterpart of
TAU-SYSTEM we reduce the conjecture to
Goal'
(IMPLIES (AND (INTEGERP BOUND)
(<= 0 BOUND)
(CHARACTER-LISTP ANS)
(ASSOC-EQUAL CHANNEL (NTH 0 STATE))
(EQUAL (CADR (CADR (ASSOC-EQUAL CHANNEL (NTH 0 STATE))))
:CHARACTER)
(SYMBOLP CHANNEL)
(STATE-P1 STATE)
(NOT (ZP BOUND)))
(MV-LET (VAL STATE)
(READ-CHAR$ CHANNEL STATE)
(AND (OR (CHARACTERP VAL)
(TRUE-LISTP ANS)
(STRINGP ANS))
(OR (CHARACTERP VAL)
(CHARACTER-LISTP (REVERSE ANS)))
(OR (NOT (CHARACTERP VAL))
(ACL2-NUMBERP BOUND))
(OR (NOT (CHARACTERP VAL))
(SYMBOLP CHANNEL))
(OR (NOT (CHARACTERP VAL))
(CHARACTER-LISTP (CONS VAL ANS)))
(OR (NOT (CHARACTERP VAL))
(LET ((PAIR (ASSOC-EQUAL CHANNEL (NTH 0 STATE)))
(TYP :CHARACTER))
(AND PAIR (EQUAL (CADR (CADR PAIR)) TYP))))
(OR (NOT (CHARACTERP VAL))
(NATP (+ -1 BOUND)))))).
[GC for 4617 CONS pages..(T=24).GC finished]
But simplification reduces this to T, using the :compound-recognizer
rules NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, the :definitions
CHARACTER-LISTP, MV-NTH, NOT, NTH, OPEN-INPUT-CHANNELS, READ-CHAR$,
REVERSE, UPDATE-NTH and UPDATE-OPEN-INPUT-CHANNELS, the :executable-
counterparts of CHARACTER-LISTP, EQUAL and ZP, primitive type reasoning,
the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP,
CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP,
EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and STATE-P1-FORWARD, the :rewrite
rules ASSOC-ADD-PAIR, CAR-CONS, CDR-CONS, CHARACTER-LISTP-REVAPPEND
and NTH-0-CONS and the :type-prescription rules ATOM-LISTP, CHARACTER-LISTP,
EQLABLE-LISTP, LENGTH and STATE-P1.
Q.E.D.
That completes the proof of the guard theorem for READ-FILE-INTO-STRING1.
READ-FILE-INTO-STRING1 is compliant with Common Lisp.
Summary
Form: ( DEFUN READ-FILE-INTO-STRING1 ...)
Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER)
(:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER)
(:DEFINITION CHARACTER-LISTP)
(:DEFINITION MV-NTH)
(:DEFINITION NATP)
(:DEFINITION NOT)
(:DEFINITION NTH)
(:DEFINITION OPEN-INPUT-CHANNEL-P)
(:DEFINITION OPEN-INPUT-CHANNEL-P1)
(:DEFINITION OPEN-INPUT-CHANNELS)
(:DEFINITION READ-CHAR$)
(:DEFINITION REVERSE)
(:DEFINITION STATE-P)
(:DEFINITION UPDATE-NTH)
(:DEFINITION UPDATE-OPEN-INPUT-CHANNELS)
(:EXECUTABLE-COUNTERPART CHARACTER-LISTP)
(:EXECUTABLE-COUNTERPART EQUAL)
(:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC)
(:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC$GUARD-CHECK)
(:EXECUTABLE-COUNTERPART MEMBER-EQUAL)
(:EXECUTABLE-COUNTERPART RETURN-LAST)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:EXECUTABLE-COUNTERPART ZP)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP)
(:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP)
(:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP)
(:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1)
(:FORWARD-CHAINING STATE-P1-FORWARD)
(:REWRITE ASSOC-ADD-PAIR)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:REWRITE CHARACTER-LISTP-REVAPPEND)
(:REWRITE NTH-0-CONS)
(:TYPE-PRESCRIPTION ATOM-LISTP)
(:TYPE-PRESCRIPTION CHARACTER-LISTP)
(:TYPE-PRESCRIPTION EQLABLE-LISTP)
(:TYPE-PRESCRIPTION LENGTH)
(:TYPE-PRESCRIPTION STATE-P)
(:TYPE-PRESCRIPTION STATE-P1))
Time: 0.72 seconds (prove: 0.52, print: 0.00, other: 0.20)
Prover steps counted: 985
READ-FILE-INTO-STRING1
[GC for 4617 CONS pages..(T=24).GC finished]
Since READ-FILE-INTO-STRING2-LOGICAL is non-recursive, its admission
is trivial. We observe that the type of READ-FILE-INTO-STRING2-LOGICAL
is described by the theorem
(OR (EQUAL (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE)
NIL)
(STRINGP (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE))).
We used the :type-prescription rule STRINGP-SUBSEQ-TYPE-PRESCRIPTION.
(READ-FILE-INTO-STRING2-LOGICAL * * * STATE) => *.
Computing the guard conjecture for READ-FILE-INTO-STRING2-LOGICAL....
The guard conjecture for READ-FILE-INTO-STRING2-LOGICAL is trivial
to prove. READ-FILE-INTO-STRING2-LOGICAL is compliant with Common
Lisp.
Summary
Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...)
Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION))
Time: 0.52 seconds (prove: 0.00, print: 0.00, other: 0.52)
READ-FILE-INTO-STRING2-LOGICAL
Since READ-FILE-INTO-STRING2 is non-recursive, its admission is trivial.
We observe that the type of READ-FILE-INTO-STRING2 is described by
the theorem
(OR (EQUAL (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE)
NIL)
(STRINGP (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE))).
We used the :type-prescription rule READ-FILE-INTO-STRING2-LOGICAL.
(READ-FILE-INTO-STRING2 * * * STATE) => *.
Computing the guard conjecture for READ-FILE-INTO-STRING2....
The guard conjecture for READ-FILE-INTO-STRING2 is trivial to prove.
READ-FILE-INTO-STRING2 is compliant with Common Lisp.
Summary
Form: ( DEFUN READ-FILE-INTO-STRING2 ...)
Rules: ((:TYPE-PRESCRIPTION READ-FILE-INTO-STRING2-LOGICAL))
Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18)
READ-FILE-INTO-STRING2
The event ( DEFMACRO READ-FILE-INTO-STRING ...) is redundant. See
:DOC redundant-events.
Summary
Form: ( DEFMACRO READ-FILE-INTO-STRING ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The event ( DEFMACRO WHEN-PASS-2 ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO WHEN-PASS-2 ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
Since PRINT-CL-CACHE-FN is non-recursive, its admission is trivial.
We observe that the type of PRINT-CL-CACHE-FN is described by the theorem
(EQUAL (PRINT-CL-CACHE-FN I J) NIL).
Computing the guard conjecture for PRINT-CL-CACHE-FN....
The guard conjecture for PRINT-CL-CACHE-FN is trivial to prove.
PRINT-CL-CACHE-FN is compliant with Common Lisp.
Summary
Form: ( DEFUN PRINT-CL-CACHE-FN ...)
Rules: NIL
Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10)
PRINT-CL-CACHE-FN
The event ( DEFMACRO PRINT-CL-CACHE ...) is redundant. See :DOC redundant-
events.
Summary
Form: ( DEFMACRO PRINT-CL-CACHE ...)
Rules: NIL
Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00)
:REDUNDANT
The admission of HONS-REMOVE-ASSOC is trivial, using the relation O<
(which is known to be well-founded on the domain recognized by O-P)
and the measure (ACL2-COUNT X). We observe that the type of
HONS-REMOVE-ASSOC is described by the theorem
(TRUE-LISTP (HONS-REMOVE-ASSOC K X)). We used primitive type reasoning.
Computing the guard conjecture for HONS-REMOVE-ASSOC....
The guard conjecture for HONS-REMOVE-ASSOC is trivial to prove.
HONS-REMOVE-ASSOC is compliant with Common Lisp.
Summary
Form: ( DEFUN HONS-REMOVE-ASSOC ...)
Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL))
Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08)
HONS-REMOVE-ASSOC
For the admission of COUNT-KEYS we will use the relation O< (which
is known to be well-founded on the domain recognized by O-P) and the
measure (ACL2-COUNT AL). The non-trivial part of the measure conjecture
is
Goal
(IMPLIES (AND (NOT (ATOM AL)) (CONSP (CAR AL)))
(O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
(CDR AL)))
(ACL2-COUNT AL))).
By the simple :definition ATOM we reduce the conjecture to
Goal'
(IMPLIES (AND (CONSP AL) (CONSP (CAR AL)))
(O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
(CDR AL)))
(ACL2-COUNT AL))).
This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<,
primitive type reasoning and the :type-prescription rule ACL2-COUNT,
to
Goal''
(IMPLIES (AND (CONSP AL) (CONSP (CAR AL)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL))
(CDR AL)))
(+ 1 (ACL2-COUNT (CAR AL))
(ACL2-COUNT (CDR AL))))).
The destructor terms (CAR AL) and (CDR AL) can be eliminated. Furthermore,
those terms are at the root of a chain of two rounds of destructor
elimination. (1) Use CAR-CDR-ELIM to replace AL by (CONS AL1 AL2),
(CAR AL) by AL1 and (CDR AL) by AL2. (2) Use CAR-CDR-ELIM, again,
to replace AL1 by (CONS AL3 AL4), (CAR AL1) by AL3 and (CDR AL1) by
AL4. These steps produce the following goal.
[GC for 4617 CONS pages..(T=22).GC finished]
Goal'''
(IMPLIES (AND (CONSP (CONS AL3 AL4))
(CONSP (CONS (CONS AL3 AL4) AL2)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 1 (ACL2-COUNT (CONS AL3 AL4))
(ACL2-COUNT AL2)))).
This simplifies, using the :definitions ACL2-COUNT and SYNP, the :executable-
counterpart of BINARY-+, primitive type reasoning and the :rewrite
rules CAR-CONS, CDR-CONS, COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+
and FOLD-CONSTS-IN-+, to
Goal'4'
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4))).
Name the formula above *1.
Perhaps we can prove *1 by induction. Four induction schemes are suggested
by this conjecture. These merge into three derived induction schemes.
However, one of these is flawed and so we are left with two viable
candidates. One of these has a score higher than the other.
We will induct according to a scheme suggested by (ACL2-COUNT AL2),
but modified to accommodate (HONS-REMOVE-ASSOC AL3 AL2). These suggestions
were produced using the :induction rules ACL2-COUNT and HONS-REMOVE-ASSOC.
If we let (:P AL2 AL3 AL4) denote *1 above then the induction scheme
we'll use is
(AND (IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(NOT (STRINGP AL2)))
(:P AL2 AL3 AL4))
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(STRINGP AL2))
(:P AL2 AL3 AL4))
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(COMPLEX-RATIONALP AL2)
(:P (REALPART AL2) AL3 AL4)
(:P (IMAGPART AL2) AL3 AL4))
(:P AL2 AL3 AL4))
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(NOT (INTEGERP AL2)))
(:P AL2 AL3 AL4))
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(INTEGERP AL2))
(:P AL2 AL3 AL4))
(IMPLIES (AND (CONSP AL2)
(:P (CAR AL2) AL3 AL4)
(:P (CDR AL2) AL3 AL4))
(:P AL2 AL3 AL4))).
This induction is justified by the same argument used to admit ACL2-COUNT.
When applied to the goal at hand the above induction scheme produces
six nontautological subgoals.
Subgoal *1/6
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(NOT (STRINGP AL2)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
This simplifies, using the :definitions ACL2-COUNT, FIX and
HONS-REMOVE-ASSOC, the :executable-counterpart of ACL2-COUNT, primitive
type reasoning, the :rewrite rule UNICITY-OF-0 and the :type-prescription
rule ACL2-COUNT, to
Subgoal *1/6'
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(NOT (STRINGP AL2)))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/5
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(STRINGP AL2))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
and LENGTH, the :executable-counterpart of ACL2-COUNT and the :rewrite
rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to
Subgoal *1/5'
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(NOT (COMPLEX-RATIONALP AL2))
(STRINGP AL2))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(LEN (COERCE AL2 'LIST))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/4
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(COMPLEX-RATIONALP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2)))
(+ 2 (ACL2-COUNT (REALPART AL2))
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2)))
(+ 2 (ACL2-COUNT (IMAGPART AL2))
(ACL2-COUNT AL3)
(ACL2-COUNT AL4))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
[GC for 4617 CONS pages..(T=22).GC finished]
This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
and SYNP, the :executable-counterparts of ACL2-COUNT and BINARY-+ and
the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and
FOLD-CONSTS-IN-+, to
Subgoal *1/4'
(IMPLIES (AND (NOT (CONSP AL2))
(NOT (RATIONALP AL2))
(COMPLEX-RATIONALP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (REALPART AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (IMAGPART AL2)))))
(< 0
(+ 3 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (IMAGPART AL2))
(ACL2-COUNT (REALPART AL2))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/3
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(NOT (INTEGERP AL2)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
This simplifies, using the :definitions ACL2-COUNT (if-intro),
HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart
of ACL2-COUNT, primitive type reasoning and the :rewrite rules
COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to the following two conjectures.
Subgoal *1/3.2
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(NOT (INTEGERP AL2))
(< (NUMERATOR AL2) 0))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(DENOMINATOR AL2)
(- (NUMERATOR AL2))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/3.1
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(NOT (INTEGERP AL2))
(<= 0 (NUMERATOR AL2)))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(DENOMINATOR AL2)
(NUMERATOR AL2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/2
(IMPLIES (AND (NOT (CONSP AL2))
(RATIONALP AL2)
(INTEGERP AL2))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
[GC for 4617 CONS pages..(T=24).GC finished]
This simplifies, using the :definitions ACL2-COUNT (if-intro),
HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart
of ACL2-COUNT and the :rewrite rules COMMUTATIVITY-2-OF-+ and
COMMUTATIVITY-OF-+, to the following two conjectures.
Subgoal *1/2.2
(IMPLIES (AND (NOT (CONSP AL2))
(INTEGERP AL2)
(< AL2 0))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(- AL2)))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/2.1
(IMPLIES (AND (NOT (CONSP AL2))
(INTEGERP AL2)
(<= 0 AL2))
(< 0
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
AL2))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1
(IMPLIES (AND (CONSP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
(+ 2 (ACL2-COUNT (CAR AL2))
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 2 (ACL2-COUNT (CDR AL2))
(ACL2-COUNT AL3)
(ACL2-COUNT AL4))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2))
(+ 2 (ACL2-COUNT AL2)
(ACL2-COUNT AL3)
(ACL2-COUNT AL4)))).
This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC
(if-intro) and SYNP, the :executable-counterpart of BINARY-+ and the
:rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+,
to the following three conjectures.
Subgoal *1/1.3
(IMPLIES (AND (CONSP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CDR AL2))))
(NOT (CONSP (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 3 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))
(ACL2-COUNT (CDR AL2))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.2
(IMPLIES (AND (CONSP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CDR AL2))))
(CONSP (CAR AL2))
(NOT (EQUAL AL3 (CAR (CAR AL2)))))
(< (ACL2-COUNT (CONS (CAR AL2)
(HONS-REMOVE-ASSOC AL3 (CDR AL2))))
(+ 3 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))
(ACL2-COUNT (CDR AL2))))).
[GC for 4617 CONS pages..(T=22).GC finished]
This simplifies, using the :definition ACL2-COUNT, primitive type reasoning,
the :rewrite rules CAR-CONS and CDR-CONS and the :type-prescription
rule HONS-REMOVE-ASSOC, to
Subgoal *1/1.2'
(IMPLIES (AND (CONSP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CDR AL2))))
(CONSP (CAR AL2))
(NOT (EQUAL AL3 (CAR (CAR AL2)))))
(< (+ 1 (ACL2-COUNT (CAR AL2))
(ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))))
(+ 3 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))
(ACL2-COUNT (CDR AL2))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
Subgoal *1/1.1
(IMPLIES (AND (CONSP AL2)
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 2 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CDR AL2))))
(EQUAL AL3 (CAR (CAR AL2))))
(< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))
(+ 3 (ACL2-COUNT AL3)
(ACL2-COUNT AL4)
(ACL2-COUNT (CAR AL2))
(ACL2-COUNT (CDR AL2))))).
But we reduce the conjecture to T, by the :executable-counterpart of
TAU-SYSTEM.
That completes the proof of *1.
Q.E.D.
That completes the proof of the measure theorem for COUNT-KEYS. Thus,
we admit this function under the principle of definition. We observe
that the type of COUNT-KEYS is described by the theorem
(AND (INTEGERP (COUNT-KEYS AL)) (<= 0 (COUNT-KEYS AL))). We used primitive
type reasoning.
Computing the guard conjecture for COUNT-KEYS....
The guard conjecture for COUNT-KEYS is trivial to prove, given the
:type-prescription rule COUNT-KEYS. COUNT-KEYS is compliant with Common
Lisp.
Summary
Form: ( DEFUN COUNT-KEYS ...)
Rules: ((:DEFINITION ACL2-COUNT)
(:DEFINITION ATOM)
(:DEFINITION FIX)
(:DEFINITION HONS-REMOVE-ASSOC)
(:DEFINITION INTEGER-ABS)
(:DEFINITION LENGTH)
(:DEFINITION NOT)
(:DEFINITION O-FINP)
(:DEFINITION O<)
(:DEFINITION SYNP)
(:ELIM CAR-CDR-ELIM)
(:EXECUTABLE-COUNTERPART ACL2-COUNT)
(:EXECUTABLE-COUNTERPART BINARY-+)
(:EXECUTABLE-COUNTERPART TAU-SYSTEM)
(:FAKE-RUNE-FOR-TYPE-SET NIL)
(:INDUCTION ACL2-COUNT)
(:INDUCTION HONS-REMOVE-ASSOC)
(:REWRITE CAR-CONS)
(:REWRITE CDR-CONS)
(:REWRITE COMMUTATIVITY-2-OF-+)
(:REWRITE COMMUTATIVITY-OF-+)
(:REWRITE FOLD-CONSTS-IN-+)
(:REWRITE UNICITY-OF-0)
(:TYPE-PRESCRIPTION ACL2-COUNT)
(:TYPE-PRESCRIPTION COUNT-KEYS)
(:TYPE-PRESCRIPTION HONS-REMOVE-ASSOC))
Splitter rules (see :DOC splitter):
if-intro: ((:DEFINITION ACL2-COUNT)
(:DEFINITION HONS-REMOVE-ASSOC)
(:DEFINITION INTEGER-ABS))
Time: 1.12 seconds (prove: 0.78, print: 0.24, other: 0.10)
Prover steps counted: 5904
COUNT-KEYS
Finished loading
'((IN-PACKAGE "ACL2")
(DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE*
'(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH*
&AUX *PRINT-PPRINT-DISPATCH*
&BODY *PRINT-PRETTY* &ENVIRONMENT ...))
(DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS*
'(* ** *** *BREAK-ON-SIGNALS*
*COMPILE-FILE-PATHNAME*
*COMPILE-FILE-TRUENAME*
*COMPILE-PRINT* ...))
(DEFCONST
NIL 'NIL
" NIL, a symbol, represents in Common Lisp both the false truth value
and the empty list.")
(DEFCONST T 'T
"T, a symbol, represents the true truth value in Common Lisp.")
(DEFCONST *STOBJ-INLINE-DECLARE* '(DECLARE #))
(DEFMACRO MAKE-PACKAGE-ENTRY
(&KEY NAME IMPORTS HIDDEN-P
BOOK-PATH DEFPKG-EVENT-FORM TTERM)
(CONS 'LIST* (CONS NAME #)))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
(DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
(DEFN MEMOIZE-SUMMARY NIL NIL)
(DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
(DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
(DEFCONST *HONS-PRIMITIVE-FNS*
'(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
...).
"ACL2"
[GC for 4617 CONS pages..(T=24).GC finished]
CLEAR-MEMOIZE-TABLE
CLEAR-MEMOIZE-TABLES
MEMOIZE-SUMMARY
CLEAR-MEMOIZE-STATISTICS
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
MEMOIZE-FORM
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
NEVER-MEMOIZE-FN
:REDUNDANT
:REDUNDANT
:REDUNDANT
SET-BAD-LISP-CONSP-MEMOIZE
:REDUNDANT
:REDUNDANT
Finished loading
'((IN-PACKAGE "ACL2")
(DEFN CLEAR-MEMOIZE-TABLE (FN) FN)
(DEFN CLEAR-MEMOIZE-TABLES NIL NIL)
(DEFN MEMOIZE-SUMMARY NIL NIL)
(DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL)
(DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY))
(DEFCONST *HONS-PRIMITIVE-FNS*
'(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE
HONS-CLEAR HONS-CLEAR! HONS-WASH ...))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFMACRO DEFN (F A &REST R)
(CONS 'DEFUN (CONS F #)))
(DEFMACRO DEFND (F A &REST R)
(CONS 'DEFUND (CONS F #)))
(DEFN HONS-EQUAL (X Y)
(DECLARE (XARGS :MODE :LOGIC))
(EQUAL X Y))
(DEFN HONS-ASSOC-EQUAL (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(COND (# NIL) (# #) (T #)))
(DEFN HONS-GET (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(HONS-ASSOC-EQUAL KEY ALIST))
(DEFN HONS-ACONS (KEY VAL ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(CONS (CONS KEY VAL) ALIST))
...).
"ACL2"
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
HONS-COPY-PERSISTENT
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
HONS
HONS-EQUAL-LITE
HONS-CLEAR
HONS-CLEAR!
HONS-WASH
HONS-WASH!
HONS-SUMMARY
:REDUNDANT
HONS-RESIZE-FN
:REDUNDANT
:REDUNDANT
GET-SLOW-ALIST-ACTION
HONS-ACONS!
MAKE-FAST-ALIST
FAST-ALIST-FORK
FAST-ALIST-FORK!
:REDUNDANT
:REDUNDANT
[GC for 409 SFUN pages..(T=24).GC finished]
MACRO-ALIASES-TABLE
MACRO-ALIASES-TABLE
FAST-ALIST-CLEAN
FAST-ALIST-CLEAN!
FAST-ALIST-LEN
FAST-ALIST-SUMMARY
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
CONS-SUBTREES
NUMBER-SUBTREES
FLUSH-HONS-GET-HASH-TABLE-LINK
(:NUMBER-OF-ENABLED-RUNES 3042)
[GC for 4617 CONS pages..(T=24).GC finished]
REMOVE-KEYWORD
Finished loading
'((IN-PACKAGE "ACL2")
(DEFMACRO DEFN (F A &REST R)
(CONS 'DEFUN (CONS F #)))
(DEFMACRO DEFND (F A &REST R)
(CONS 'DEFUND (CONS F #)))
(DEFN HONS-EQUAL (X Y)
(DECLARE (XARGS :MODE :LOGIC))
(EQUAL X Y))
(DEFN HONS-ASSOC-EQUAL (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(COND (# NIL) (# #) (T #)))
(DEFN HONS-GET (KEY ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(HONS-ASSOC-EQUAL KEY ALIST))
(DEFN HONS-ACONS (KEY VAL ALIST)
(DECLARE (XARGS :MODE :LOGIC))
(CONS (CONS KEY VAL) ALIST))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFMACRO SERIALIZE-WRITE
(FILENAME OBJ &KEY VERBOSEP)
(CONS 'SERIALIZE-WRITE-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-WRITE-FN
(FILENAME OBJ VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME OBJ VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
STATE))
(DEFMACRO SERIALIZE-READ
(FILENAME &KEY (HONS-MODE #) VERBOSEP)
(CONS 'SERIALIZE-READ-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-READ-FN
(FILENAME HONS-MODE VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME HONS-MODE VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
(MV VAL STATE)))
(DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
(DECLARE (XARGS :GUARD #))
(CONS 'STATE-GLOBAL-LET* (CONS # #)))).
"ACL2"
:REDUNDANT
SERIALIZE-WRITE-FN
:REDUNDANT
SERIALIZE-READ-FN
:REDUNDANT
Finished loading
'((IN-PACKAGE "ACL2")
(DEFMACRO SERIALIZE-WRITE
(FILENAME OBJ &KEY VERBOSEP)
(CONS 'SERIALIZE-WRITE-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-WRITE-FN
(FILENAME OBJ VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME OBJ VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
STATE))
(DEFMACRO SERIALIZE-READ
(FILENAME &KEY (HONS-MODE #) VERBOSEP)
(CONS 'SERIALIZE-READ-FN
(CONS FILENAME #)))
(DEFUN SERIALIZE-READ-FN
(FILENAME HONS-MODE VERBOSEP STATE)
(DECLARE (XARGS :GUARD # :STOBJS STATE)
(IGNORABLE FILENAME HONS-MODE VERBOSEP))
(MV-LET (ERP VAL STATE)
(READ-ACL2-ORACLE STATE)
(DECLARE #)
(MV VAL STATE)))
(DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM)
(DECLARE (XARGS :GUARD #))
(CONS 'STATE-GLOBAL-LET* (CONS # #)))).
ACL2 loading
'((IN-PACKAGE "ACL2")
(VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP)
(VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1)
(VERIFY-TERMINATION-BOOT-STRAP CONS-TERM)
(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS)
(VERIFY-TERMINATION-BOOT-STRAP PACKN1)
(ENCAPSULATE NIL
(LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER
#
:RULE-CLASSES #))
(LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM #
:RULE-CLASSES #))
(VERIFY-TERMINATION-BOOT-STRAP PACKN-POS)
(VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL)
(VERIFY-TERMINATION-BOOT-STRAP PACKN)
...)
...).
"ACL2"
QUOTE-LISTP
[GC for 4627 CONS pages..(T=24).GC finished]
[GC for 4637 CONS pages..(T=24).GC finished]
[GC for 4647 CONS pages..(T=24).GC finished]
CONS-TERM1
CONS-TERM
SYMBOL-CLASS
PACKN1
[GC for 4657 CONS pages..(T=24).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=34).GC finished]
T
:REDUNDANT
GUARD-OR-TERMINATION-THEOREM-MSG
ALIST-KEYS-SUBSETP
KEYWORD-LISTP
PAIRLIS-X1
PAIRLIS-X2
[GC for 409 SFUN pages..(T=24).GC finished]
FIRST-KEYWORD
SYMBOL-NAME-LST
T
[GC for 409 SFUN pages..(T=24).GC finished]
[GC for 4667 CONS pages..(T=24).GC finished]
T
:ATTACHMENTS-RECORDED
T
:ATTACHMENTS-RECORDED
(PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST)
MEMBER-CHAR-STRINGP
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=36).GC finished]
TERMINAL-SUBSTRINGP1
TERMINAL-SUBSTRINGP
EVG-OCCUR
MIN-FIXNUM
[GC for 4677 CONS pages..(T=26).GC finished]
FN-COUNT-EVG-REC
FN-COUNT-EVG-REC-TYPE-PRESCRIPTION
FN-COUNT-EVG-REC-BOUND
FN-COUNT-EVG-REC
(OCCUR OCCUR-LST)
[GC for 4687 CONS pages..(T=24).GC finished]
(WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED
BASIC-WORSE-THAN-LST1
BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN
SOME-SUBTERM-WORSE-THAN-OR-EQUAL
SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST
...)
[GC for 409 SFUN pages..(T=24).GC finished]
WORSE-THAN-BUILTIN
WORSE-THAN-OR-EQUAL-BUILTIN
ANCESTOR-LISTP
EARLIER-ANCESTOR-BIGGERP
FN-COUNT-1
FN-COUNT-1-TYPE
FN-COUNT-1
[GC for 4697 CONS pages..(T=24).GC finished]
VAR-FN-COUNT-1
SYMBOL-LISTP-CDR-ASSOC-EQUAL
INTEGERP-NTH-0-VAR-FN-COUNT-1
INTEGERP-NTH-1-VAR-FN-COUNT-1
INTEGERP-NTH-2-VAR-FN-COUNT-1
VAR-FN-COUNT-1
EQUAL-MOD-COMMUTING
ANCESTORS-CHECK1
ANCESTORS-CHECK-BUILTIN
[GC for 4707 CONS pages..(T=26).GC finished]
MEMBER-EQUAL-MOD-COMMUTING
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=36).GC finished]
STRIP-ANCESTOR-LITERALS
T
T
:ATTACHMENTS-RECORDED
:ATTACHMENTS-RECORDED
:ATTACHMENTS-RECORDED
HONS-COPY-WITH-STATE
IDENTITY-WITH-STATE
:ATTACHMENTS-RECORDED
RW-CACHE-DEBUG-BUILTIN
:ATTACHMENTS-RECORDED
RW-CACHE-DEBUG-ACTION-BUILTIN
:ATTACHMENTS-RECORDED
RW-CACHEABLE-FAILURE-REASON-BUILTIN
:ATTACHMENTS-RECORDED
ALL-DIGITS-P
[GC for 409 SFUN pages..(T=24).GC finished]
D-POS-LISTP
POS-LISTP
:REDUNDANT
D-POS-LISTP-FORWARD-TO-TRUE-LISTP
CLAUSE-ID-P
T
PRINT-CLAUSE-ID-OKP-BUILTIN
:ATTACHMENTS-RECORDED
T
:ATTACHMENTS-RECORDED
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES
POS-LISTP-FORWARD-TO-INTEGER-LISTP
[GC for 409 SFUN pages..(T=24).GC finished]
CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE
TRUE-LISTP-CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS
TRUE-LISTP-EXPLODE-ATOM
T
[GC for 977 RELOCATABLE-BLOCKS pages..(T=24).GC finished]
STRICT-MERGE-SYMBOL-<
T
24
32
57
*ACL2-PRIMITIVES*
32
[GC for 4717 CONS pages..(T=24).GC finished]
(:NUMBER-OF-ENABLED-RUNES 3330)
(:NUMBER-OF-ENABLED-RUNES 3329)
FORMALS
CONSTRAINT-INFO
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=36).GC finished]
UNKNOWN-CONSTRAINTS-P
(:DEFUND META-EXTRACT-FORMULA)
TYPE-SET-QUOTE
TYPE-SET-QUOTE
TYPESPEC-CHECK
META-EXTRACT-RW+-TERM
[GC for 409 SFUN pages..(T=24).GC finished]
META-EXTRACT-CONTEXTUAL-FACT
REWRITE-RULE-TERM-EXEC
REWRITE-RULE-TERM
META-EXTRACT-GLOBAL-FACT
FNCALL-TERM
LOGICALLY-EQUIVALENT-STATES
[GC for 4727 CONS pages..(T=26).GC finished]
META-EXTRACT-GLOBAL-FACT+
MACRO-ALIASES-TABLE
Finished loading
'((IN-PACKAGE "ACL2")
(VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP)
(VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1)
(VERIFY-TERMINATION-BOOT-STRAP CONS-TERM)
(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS)
(VERIFY-TERMINATION-BOOT-STRAP PACKN1)
(ENCAPSULATE NIL
(LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER
#
:RULE-CLASSES #))
(LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM #
:RULE-CLASSES #))
(VERIFY-TERMINATION-BOOT-STRAP PACKN-POS)
(VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL)
(VERIFY-TERMINATION-BOOT-STRAP PACKN)
...)
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(RUNES AVOID-FNS WRLD ANS)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# ANS) (T #)))
(DEFCONST *APPLY$-USERFN-CALLERS*
'(APPLY$ EV$ APPLY$-USERFN))
(DEFCONST *BLACKLISTED-APPLY$-FNS*
'(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL
SYS-CALL HONS-CLEAR! HONS-WASH! ...))
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES
(WORLD)
(DECLARE (XARGS :MODE :PROGRAM))
(FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(FUNCTION-THEORY :HERE)
*BLACKLISTED-APPLY$-FNS* WORLD NIL))
(WHEN-PASS-2 (MAKE-EVENT (CONS # #)))
(DEFUN COMPUTE-BADGE-OF-PRIMITIVES
(TERMS-AND-OUT-ARITIES)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# NIL) (T #)))
...).
"ACL2"
:REDUNDANT
:REDUNDANT
:REDUNDANT
:REDUNDANT
NIL
:REDUNDANT
NIL
[GC for 4737 CONS pages..(T=24).GC finished]
APPLY$-BADGEP
N-CAR-CADR-CADDR-ETC
:REDUNDANT
(:NUMBER-OF-ENABLED-RUNES 3369)
[GC for 4747 CONS pages..(T=24).GC finished]
[GC for 4757 CONS pages..(T=26).GC finished]
[GC for 4767 CONS pages..(T=24).GC finished]
[GC for 4777 CONS pages..(T=24).GC finished]
[GC for 4787 CONS pages..(T=24).GC finished]
[GC for 4797 CONS pages..(T=24).GC finished]
[GC for 4807 CONS pages..(T=26).GC finished]
[GC for 4817 CONS pages..(T=24).GC finished]
[GC for 4827 CONS pages..(T=24).GC finished]
[GC for 4837 CONS pages..(T=26).GC finished]
[GC for 4847 CONS pages..(T=24).GC finished]
[GC for 4857 CONS pages..(T=24).GC finished]
[GC for 4867 CONS pages..(T=26).GC finished]
[GC for 4877 CONS pages..(T=26).GC finished]
[GC for 4887 CONS pages..(T=24).GC finished]
[GC for 4897 CONS pages..(T=24).GC finished]
[GC for 4907 CONS pages..(T=26).GC finished]
[GC for 4917 CONS pages..(T=26).GC finished]
[GC for 4927 CONS pages..(T=26).GC finished]
[GC for 4937 CONS pages..(T=26).GC finished]
[GC for 4947 CONS pages..(T=26).GC finished]
[GC for 4957 CONS pages..(T=26).GC finished]
[GC for 4967 CONS pages..(T=26).GC finished]
[GC for 4977 CONS pages..(T=24).GC finished]
[GC for 4987 CONS pages..(T=26).GC finished]
[GC for 4997 CONS pages..(T=26).GC finished]
[GC for 5007 CONS pages..(T=26).GC finished]
[GC for 5017 CONS pages..(T=26).GC finished]
[GC for 5027 CONS pages..(T=26).GC finished]
[GC for 5037 CONS pages..(T=26).GC finished]
[GC for 5047 CONS pages..(T=26).GC finished]
[GC for 5057 CONS pages..(T=24).GC finished]
[GC for 5067 CONS pages..(T=26).GC finished]
[GC for 5077 CONS pages..(T=26).GC finished]
[GC for 5087 CONS pages..(T=26).GC finished]
[GC for 5097 CONS pages..(T=24).GC finished]
[GC for 5107 CONS pages..(T=26).GC finished]
[GC for 5117 CONS pages..(T=26).GC finished]
[GC for 5127 CONS pages..(T=26).GC finished]
[GC for 5137 CONS pages..(T=26).GC finished]
[GC for 5147 CONS pages..(T=26).GC finished]
[GC for 5157 CONS pages..(T=26).GC finished]
[GC for 5167 CONS pages..(T=26).GC finished]
[GC for 5177 CONS pages..(T=26).GC finished]
[GC for 5187 CONS pages..(T=26).GC finished]
[GC for 5197 CONS pages..(T=26).GC finished]
[GC for 5207 CONS pages..(T=28).GC finished]
[GC for 5217 CONS pages..(T=26).GC finished]
[GC for 5227 CONS pages..(T=26).GC finished]
[GC for 5237 CONS pages..(T=28).GC finished]
[GC for 5247 CONS pages..(T=26).GC finished]
[GC for 5257 CONS pages..(T=28).GC finished]
[GC for 5267 CONS pages..(T=26).GC finished]
[GC for 5277 CONS pages..(T=26).GC finished]
[GC for 5287 CONS pages..(T=26).GC finished]
[GC for 5297 CONS pages..(T=26).GC finished]
[GC for 5307 CONS pages..(T=28).GC finished]
[GC for 5317 CONS pages..(T=26).GC finished]
[GC for 5327 CONS pages..(T=26).GC finished]
[GC for 5337 CONS pages..(T=28).GC finished]
[GC for 5347 CONS pages..(T=26).GC finished]
[GC for 5357 CONS pages..(T=26).GC finished]
[GC for 5367 CONS pages..(T=26).GC finished]
[GC for 5377 CONS pages..(T=26).GC finished]
[GC for 5387 CONS pages..(T=28).GC finished]
[GC for 5397 CONS pages..(T=28).GC finished]
[GC for 5407 CONS pages..(T=26).GC finished]
[GC for 5417 CONS pages..(T=26).GC finished]
[GC for 5427 CONS pages..(T=28).GC finished]
[GC for 5437 CONS pages..(T=28).GC finished]
[GC for 5447 CONS pages..(T=26).GC finished]
[GC for 5457 CONS pages..(T=26).GC finished]
[GC for 5467 CONS pages..(T=28).GC finished]
[GC for 5477 CONS pages..(T=28).GC finished]
[GC for 5487 CONS pages..(T=24).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=28).GC finished]
[GC for 5487 CONS pages..(T=24).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
[GC for 5487 CONS pages..(T=28).GC finished]
[GC for 5487 CONS pages..(T=26).GC finished]
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(RUNES AVOID-FNS WRLD ANS)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# ANS) (T #)))
(DEFCONST *APPLY$-USERFN-CALLERS*
'(APPLY$ EV$ APPLY$-USERFN))
(DEFCONST *BLACKLISTED-APPLY$-FNS*
'(SYNP HIDE WORMHOLE1 WORMHOLE-EVAL
SYS-CALL HONS-CLEAR! HONS-WASH! ...))
(DEFUN FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES
(WORLD)
(DECLARE (XARGS :MODE :PROGRAM))
(FIRST-ORDER-LIKE-TERMS-AND-OUT-ARITIES1
(FUNCTION-THEORY :HERE)
*BLACKLISTED-APPLY$-FNS* WORLD NIL))
(WHEN-PASS-2 (MAKE-EVENT (CONS # #)))
(DEFUN COMPUTE-BADGE-OF-PRIMITIVES
(TERMS-AND-OUT-ARITIES)
(DECLARE (XARGS :MODE :PROGRAM))
(COND (# NIL) (T #)))
...).
ACL2 loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (ENCAPSULATE (#)
(LOCAL #)
(DEFTHM BADGE-USERFN-TYPE #
:RULE-CLASSES #))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
:RULE-CLASSES NIL))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
:RULE-CLASSES #))
(DEFSTUB UNTAME-EV$ (X A) T)
(DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
(CONS # #)))).
"ACL2"
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Observation in ( DEFTHM BADGE-USERFN-TYPE ...): The :TRIGGER-
TERMS for the :FORWARD-CHAINING rule BADGE-USERFN-TYPE will consist
of the list containing (BADGE-USERFN FN).
ACL2 Warning [Non-rec] in ( DEFTHM BADGE-USERFN-TYPE ...): The term
(BADGE-USERFN FN) contains the function symbol BADGE-USERFN, which
has a non-recursive definition. Unless this definition is disabled,
(BADGE-USERFN FN) is unlikely ever to occur as a trigger for
BADGE-USERFN-TYPE.
ACL2 Warning [Non-rec] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...):
A :REWRITE rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS will
be triggered only by terms containing the function symbol UNTAME-APPLY$,
which has a non-recursive definition. Unless this definition is disabled,
this rule is unlikely ever to be used.
ACL2 Warning [Subsume] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...):
The previously added rule UNTAME-APPLY$ subsumes a newly proposed :REWRITE
rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS, in the sense that
the old rule rewrites a more general target. Because the new rule
will be tried first, it may nonetheless find application.
[GC for 409 SFUN pages..(T=26).GC finished]
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (ENCAPSULATE (#)
(LOCAL #)
(DEFTHM BADGE-USERFN-TYPE #
:RULE-CLASSES #))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS #
:RULE-CLASSES NIL))
(ENCAPSULATE (#)
(LOCAL #)
(DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS #
:RULE-CLASSES #))
(DEFSTUB UNTAME-EV$ (X A) T)
(DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST*
(CONS # #)))).
ACL2 loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (DEFUN BADGE (FN)
(DECLARE #)
(COND # # # # # # ...))
(IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
(IN-THEORY (DISABLE BADGE))
(DEFABBREV TAMEP-LAMBDAP (FN)
(AND # # #))
(MUTUAL-RECURSION (DEFUN TAMEP # # #)
(DEFUN TAMEP-FUNCTIONP # # #)
(DEFUN SUITABLY-TAMEP-LISTP # # #))
(MUTUAL-RECURSION (DEFUN APPLY$ # # #)
(DEFUN APPLY$-LAMBDA # # #)
(DEFUN EV$ # # #)
(DEFUN EV$-LIST # # #))
...)).
"ACL2"
[GC for 409 SFUN pages..(T=24).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 409 SFUN pages..(T=24).GC finished]
[GC for 468 SYMBOL pages..(T=24).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=24).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 409 SFUN pages..(T=24).GC finished]
NIL
Finished loading
'((IN-PACKAGE "ACL2")
(WHEN-PASS-2 (DEFUN BADGE (FN)
(DECLARE #)
(COND # # # # # # ...))
(IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM))
(IN-THEORY (DISABLE BADGE))
(DEFABBREV TAMEP-LAMBDAP (FN)
(AND # # #))
(MUTUAL-RECURSION (DEFUN TAMEP # # #)
(DEFUN TAMEP-FUNCTIONP # # #)
(DEFUN SUITABLY-TAMEP-LISTP # # #))
(MUTUAL-RECURSION (DEFUN APPLY$ # # #)
(DEFUN APPLY$-LAMBDA # # #)
(DEFUN EV$ # # #)
(DEFUN EV$-LIST # # #))
...)).
ACL2 loading
'((IN-PACKAGE "ACL2")
(VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM)
(VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP)
(MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W)
(DECLARE #)
(COND # # # # #))
(DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W)
(DECLARE #)
(COND # #)))
(DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS
(FNS WRLD ACC)
(DECLARE (XARGS :GUARD #))
(COND (# #) (T #)))
(DEFUN NEW-VERIFY-GUARDS-FNS1
(WRLD INSTALLED-WRLD ACC)
(DECLARE (XARGS :GUARD #))
(COND (# #) (# #) (T #)))
(DEFUN NEW-VERIFY-GUARDS-FNS (STATE)
(DECLARE (XARGS :STOBJS STATE))
(LET (#)
(NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL)))
...).
"ACL2"
SAFE-ACCESS-COMMAND-TUPLE-FORM
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2-SYSTEM-NAMEP
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
(SYSTEM-PSEUDO-TERMP SYSTEM-PSEUDO-TERM-LISTP)
PAIR-FNS-WITH-MEASURED-SUBSETS
NEW-VERIFY-GUARDS-FNS1
[GC for 409 SFUN pages..(T=26).GC finished]
NEW-VERIFY-GUARDS-FNS
:REDUNDANT
*SYSTEM-VERIFY-GUARDS-ALIST*
*LEN-SYSTEM-VERIFY-GUARDS-ALIST*
CHK-NEW-VERIFIED-GUARDS
SYSTEM-VERIFY-GUARDS-AUX
CONS-ABSOLUTE-EVENT-NUMBERS
SORT->-ABSOLUTE-EVENT-NUMBER
SYSTEM-VERIFY-GUARDS
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-CONSTANTP1)
(LEGAL-CONSTANTP1))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LEGAL-CONSTANTP1)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-KEYWORDP)
(LAMBDA-KEYWORDP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LAMBDA-KEYWORDP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLE-OR-CONSTANT-NAMEP)
(LEGAL-VARIABLE-OR-CONSTANT-NAMEP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=24).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLE-OR-CONSTANT-NAMEP)), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLEP)
(LEGAL-VARIABLEP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLEP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP1 (DECLARE (XARGS :MEASURE #)))
(ARGLISTP1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ARGLISTP1)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP) (ARGLISTP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ARGLISTP)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #)))
(FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-FIRST-BAD-ARG)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEWLINE))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS NEWLINE)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WRITE-FOR-READ))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WRITE-FOR-READ)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILLEGAL-FMT-STRING))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ILLEGAL-FMT-STRING)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SCAN-PAST-WHITESPACE (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SCAN-PAST-WHITESPACE)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ZERO-ONE-OR-MORE))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ZERO-ONE-OR-MORE)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FIND-ALTERNATIVE-SKIP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-SKIP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FIND-ALTERNATIVE-START1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START1)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-CHAR))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMT-CHAR)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FIND-ALTERNATIVE-STOP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-STOP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-VAR))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMT-VAR)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STANDARD-EVISC-TUPLEP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STANDARD-EVISC-TUPLEP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WORLD-EVISCERATION-ALIST))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WORLD-EVISCERATION-ALIST)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ABBREV-EVISC-TUPLE))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ABBREV-EVISC-TUPLE)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MSGP))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MSGP)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FMX-CW-MSG-1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG-1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-MSG))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN-GUARD))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN-GUARD)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX!-CW-FN))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FMX!-CW-FN)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PUSH-IO-RECORD))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS PUSH-IO-RECORD)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SAVED-OUTPUT-TOKEN-P))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SAVED-OUTPUT-TOKEN-P)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING-OFF-P1))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WARNING-OFF-P1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OBSERVATION1-CW))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS OBSERVATION1-CW)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STOBJP))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STOBJP)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EQUAL-X-CONSTANT))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS EQUAL-X-CONSTANT)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MATCH-TESTS-AND-BINDINGS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MATCH-TESTS-AND-BINDINGS)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MATCH-CLAUSE-LIST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE-LIST)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FIND-DOT-DOT (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FIND-DOT-DOT)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-CONSTANTP)
(LEGAL-CONSTANTP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LEGAL-CONSTANTP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(COLLECT-NON-X (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT-NON-X)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(DOUBLET-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DOUBLET-LISTP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #)))
(PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS PLIST-WORLDP-WITH-FORMALS)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY) (ARITY))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ARITY)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFUN-MODE))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DEFUN-MODE)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (ARITIES-OKP (DECLARE (XARGS :MEASURE #)))
(ARITIES-OKP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ARITIES-OKP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LATEST-BODY))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LATEST-BODY)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEF-BODY))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DEF-BODY)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (>=-LEN (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS >=-LEN)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (ALL->=-LEN (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ALL->=-LEN)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (STRIP-CADRS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRIP-CADRS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CONS-TERM1-MV2))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CONS-TERM1-MV2)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SUBLIS-VAR1-LST (DECLARE (XARGS :MEASURE #)))
(SUBLIS-VAR1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR1-LST)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR-LST))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR-LST)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SUBCOR-VAR (DECLARE (XARGS :MEASURE #)))
(SUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUMB-NEGATE-LIT))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DUMB-NEGATE-LIT)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (TERMP (DECLARE (XARGS :MEASURE #)))
(TERM-LISTP (DECLARE (XARGS :MEASURE #)))
(TERM-LISTP (DECLARE (XARGS :MEASURE #)))
(TERMP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TERMP)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #)))
(TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TERM-LIST-LISTP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ACCESS-COMMAND-TUPLE-NUMBER))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ACCESS-COMMAND-TUPLE-NUMBER)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SUBST-VAR (DECLARE (XARGS :MEASURE #)))
(SUBST-VAR-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBST-VAR)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(ALL-FNNAMES1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ALL-FNNAMES1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(REMOVE-GUARD-HOLDERS1 (DECLARE (XARGS :MEASURE #)))
(REMOVE-GUARD-HOLDERS1-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS1)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS-WEAK))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS-WEAK)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SILENT-ERROR))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SILENT-ERROR)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ER-CMP-FN))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ER-CMP-FN)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING1-CW))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WARNING1-CW)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(CHK-LENGTH-AND-KEYS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CHK-LENGTH-AND-KEYS)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUPLICATE-KEYS-ACTION))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DUPLICATE-KEYS-ACTION)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-INITP))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LEGAL-INITP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MACRO-ARGLIST-KEYSP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-KEYSP)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-AFTER-RESTP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-AFTER-RESTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MACRO-ARGLIST-OPTIONALP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-OPTIONALP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MACRO-ARGLIST1P (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST1P)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SUBSEQUENCEP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBSEQUENCEP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(COLLECT-LAMBDA-KEYWORDPS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT-LAMBDA-KEYWORDPS)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS-STRUCTUREP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS-STRUCTUREP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FFNNAMEP (DECLARE (XARGS :MEASURE #)))
(FFNNAMEP-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FFNNAMEP)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FORMALIZED-VARLISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FORMALIZED-VARLISTP)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P1))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P1)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEREF-MACRO-NAME))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DEREF-MACRO-NAME)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(WEAK-APPLY$-BADGE-ALISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WEAK-APPLY$-BADGE-ALISTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PLIST-WORLDP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ILKS-PLIST-WORLDP)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PER-ARGUMENT-SLOT))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ILKS-PER-ARGUMENT-SLOT)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(LOGIC-FNSP (DECLARE (XARGS :MEASURE #)))
(LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #)))
(LOGIC-FNSP (DECLARE (XARGS :MEASURE #)))
(LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNSP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERMP) (LOGIC-TERMP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERMP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LISTP)
(LOGIC-TERM-LISTP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LISTP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #)))
(LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LIST-LISTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LIST-LISTP)
(LOGIC-TERM-LIST-LISTP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LIST-LISTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER1))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RUNEP))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS RUNEP)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FNUME))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FNUME)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TRANSLATE-ABBREV-RUNE))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TRANSLATE-ABBREV-RUNE)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-STRUCTURE-P))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ENABLED-STRUCTURE-P)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-NUMEP))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ENABLED-NUMEP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-RUNEP))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ENABLED-RUNEP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENS))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ENS)), in the context of a book or an encapsulate
event. Therefore, no logical claims may be soundly made in this context.
See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (IMPLICATE))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS IMPLICATE)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SUBST-EXPR1 (DECLARE (XARGS :MEASURE #)))
(SUBST-EXPR1-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR-ERROR))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR-ERROR)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(CLEAN-BRR-STACK1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK1)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MERGE-TERM-ORDER (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MERGE-TERM-ORDER)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MERGE-SORT-TERM-ORDER (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-TERM-ORDER)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(COLLECT-BY-POSITION (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT-BY-POSITION)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MAKE-LAMBDA-APPLICATION))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MAKE-LAMBDA-APPLICATION)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(LAMBDA-SUBTERMP (DECLARE (XARGS :MEASURE #)))
(LAMBDA-SUBTERMP-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LAMBDA-SUBTERMP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(TERMIFY-CLAUSE-SET (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=24).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TERMIFY-CLAUSE-SET)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAMEP))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAMEP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(ALIST-TO-DOUBLETS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ALIST-TO-DOUBLETS)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(STRING-PREFIXP-1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP-1)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RELATIVIZE-BOOK-PATH))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS RELATIVIZE-BOOK-PATH)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MERGE-SYMBOL-< (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MERGE-SYMBOL-<)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MERGE-SORT-SYMBOL-< (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-SYMBOL-<)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OVERRIDE-HINTS))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS OVERRIDE-HINTS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SCAN-TO-CLTL-COMMAND (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SCAN-TO-CLTL-COMMAND)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(PLAUSIBLE-DCLSP1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS PLAUSIBLE-DCLSP1)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(PLAUSIBLE-DCLSP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS PLAUSIBLE-DCLSP)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(STRIP-KEYWORD-LIST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRIP-KEYWORD-LIST)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (STRIP-DCLS1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRIP-DCLS1)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (STRIP-DCLS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS STRIP-DCLS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FETCH-DCL-FIELDS2 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS2)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FETCH-DCL-FIELDS1 (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS1)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FETCH-DCL-FIELDS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELDS)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FETCH-DCL-FIELD))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FETCH-DCL-FIELD)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(REMOVE-LAMBDAS1 (DECLARE (XARGS :MEASURE #)))
(REMOVE-LAMBDAS-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=28).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS1)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(BACKCHAIN-LIMIT-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS BACKCHAIN-LIMIT-LISTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(ARITY-ALISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ARITY-ALISTP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(DISABLEDP-FN-LST (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN-LST)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN))), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MACRO-VARS-KEY (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-KEY)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-AFTER-REST))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-AFTER-REST)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(MACRO-VARS-OPTIONAL (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-OPTIONAL)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-P))), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SYSFILE-P)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(SYSFILE-OR-STRING-LISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SYSFILE-OR-STRING-LISTP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (TTAG-ALISTP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TTAG-ALISTP)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CERT-ANNOTATIONSP))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CERT-ANNOTATIONSP)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ADD-SUFFIX-TO-FN))), in
the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ADD-SUFFIX-TO-FN)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FSUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #)))
(FSUBCOR-VAR (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FSUBCOR-VAR-LST)), in the context of a
book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-RW+-TERM))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-RW+-TERM)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-CONTEXTUAL-FACT))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-CONTEXTUAL-FACT)), in the
context of a book or an encapsulate event. Therefore, no logical claims
may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-GLOBAL-FACT+))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-GLOBAL-FACT+)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(TAMEP (DECLARE (XARGS :MEASURE #)))
(SUITABLY-TAMEP-LISTP (DECLARE (XARGS :MEASURE #)))
(TAMEP-FUNCTIONP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TAMEP)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(EV$-LIST (DECLARE (XARGS :MEASURE #)))
(APPLY$ (DECLARE (XARGS :MEASURE #)))
(EV$ (DECLARE (XARGS :MEASURE #)))
(APPLY$-LAMBDA (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS EV$-LIST)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (TAILS-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TAILS-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (TAILS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS TAILS)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(EMPTY-LOOP$-AS-TUPLEP (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS EMPTY-LOOP$-AS-TUPLEP)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(CAR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CAR-LOOP$-AS-TUPLE)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(CDR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS CDR-LOOP$-AS-TUPLE)), in the context of
a book or an encapsulate event. Therefore, no logical claims may be
soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(FROM-TO-BY-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (FROM-TO-BY (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (UNTIL$-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS UNTIL$-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (UNTIL$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS UNTIL$)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS UNTIL$+-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS UNTIL$+)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (WHEN$-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WHEN$-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (WHEN$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WHEN$)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (WHEN$+-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=28).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WHEN$+-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (WHEN$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS WHEN$+)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (SUM$-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUM$-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (SUM$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUM$)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (SUM$+-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUM$+-AC)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (SUM$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS SUM$+)), in the context of a book or an
encapsulate event. Therefore, no logical claims may be soundly made
in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=28).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ALWAYS$)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS ALWAYS$+)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (THEREIS$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS THEREIS$)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (THEREIS$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS THEREIS$+)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (COLLECT$-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT$-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (COLLECT$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT$)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(COLLECT$+-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT$+-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (COLLECT$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
[GC for 409 SFUN pages..(T=26).GC finished]
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS COLLECT$+)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP
(REVAPPEND-TRUE-LIST-FIX (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS REVAPPEND-TRUE-LIST-FIX)), in the context
of a book or an encapsulate event. Therefore, no logical claims may
be soundly made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (APPEND$-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS APPEND$-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (APPEND$ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS APPEND$)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (APPEND$+-AC (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS APPEND$+-AC)), in the context of a book
or an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS
(VERIFY-TERMINATION-BOOT-STRAP (APPEND$+ (DECLARE (XARGS :MEASURE #))))),
in the context of a book or an encapsulate event. Therefore, no logical
claims may be soundly made in this context. See :DOC SKIP-PROOFS.
(See :DOC set-iprint to be able to see elided values in this message.)
ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS
"Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form,
(SKIP-PROOFS (VERIFY-GUARDS APPEND$+)), in the context of a book or
an encapsulate event. Therefore, no logical claims may be soundly
made in this context. See :DOC SKIP-PROOFS.
T
SYSTEM-EVENT
[GC for 409 SFUN pages..(T=26).GC finished]
SYSTEM-EVENTS-FN
SYSTEM-EVENTS
SYSTEM-INCLUDE-BOOK-FORMS
CHECK-SYSTEM-EVENTS
(:NUMBER-OF-ENABLED-RUNES 4148)
(:NUMBER-OF-ENABLED-RUNES 4138)
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
T
FN-EQUAL
FN-EQUAL-IS-AN-EQUIVALENCE
NATP-FROM-TO-BY-MEASURE
MEMPOS
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14592 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 478 SYMBOL pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=28).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
[GC for 14848 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
[GC for 409 SFUN pages..(T=26).GC finished]
NIL
[GC for 409 SFUN pages..(T=28).GC finished]
:SKIPPED
4246
END-OF-PASS-2
Finished loading
'((IN-PACKAGE "ACL2")
(VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM)
(VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP)
(MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W)
(DECLARE #)
(COND # # # # #))
(DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W)
(DECLARE #)
(COND # #)))
(DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS
(FNS WRLD ACC)
(DECLARE (XARGS :GUARD #))
(COND (# #) (T #)))
(DEFUN NEW-VERIFY-GUARDS-FNS1
(WRLD INSTALLED-WRLD ACC)
(DECLARE (XARGS :GUARD #))
(COND (# #) (# #) (T #)))
(DEFUN NEW-VERIFY-GUARDS-FNS (STATE)
(DECLARE (XARGS :STOBJS STATE))
(LET (#)
(NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL)))
...).
ACL2 loading '((COMP-FN :EXEC NIL "1" STATE)).
[GC for 5487 CONS pages..(T=28).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=26).GC finished]
[GC for 147 ARRAY pages..(T=28).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=28).GC finished]
[GC for 147 ARRAY pages..(T=28).GC finished]
[GC for 88 STRUCTURE pages..(T=28).GC finished]
[GC for 157 ARRAY pages..(T=28).GC finished]
[GC for 167 ARRAY pages..(T=28).GC finished]
[GC for 177 ARRAY pages..(T=28).GC finished]
[GC for 98 STRUCTURE pages..(T=28).GC finished]
[GC for 187 ARRAY pages..(T=28).GC finished]
[GC for 197 ARRAY pages..(T=28).GC finished]
[GC for 207 ARRAY pages..(T=28).GC finished]
[GC for 108 STRUCTURE pages..(T=28).GC finished]
[GC for 217 ARRAY pages..(T=28).GC finished]
[GC for 227 ARRAY pages..(T=28).GC finished]
[GC for 237 ARRAY pages..(T=28).GC finished]
[GC for 247 ARRAY pages..(T=28).GC finished]
[GC for 118 STRUCTURE pages..(T=28).GC finished]
[GC for 257 ARRAY pages..(T=28).GC finished]
[GC for 267 ARRAY pages..(T=28).GC finished]
[GC for 277 ARRAY pages..(T=28).GC finished]
[GC for 287 ARRAY pages..(T=28).GC finished]
[GC for 128 STRUCTURE pages..(T=28).GC finished]
[GC for 297 ARRAY pages..(T=30).GC finished]
[GC for 307 ARRAY pages..(T=28).GC finished]
[GC for 317 ARRAY pages..(T=30).GC finished]
[GC for 138 STRUCTURE pages..(T=28).GC finished]
[GC for 327 ARRAY pages..(T=28).GC finished]
[GC for 337 ARRAY pages..(T=30).GC finished]
[GC for 347 ARRAY pages..(T=28).GC finished]
[GC for 357 ARRAY pages..(T=30).GC finished]
[GC for 148 STRUCTURE pages..(T=28).GC finished]
[GC for 367 ARRAY pages..(T=30).GC finished]
[GC for 377 ARRAY pages..(T=30).GC finished]
[GC for 387 ARRAY pages..(T=28).GC finished]
[GC for 397 ARRAY pages..(T=28).GC finished]
[GC for 158 STRUCTURE pages..(T=30).GC finished]
[GC for 407 ARRAY pages..(T=30).GC finished]
[GC for 417 ARRAY pages..(T=30).GC finished]
[GC for 427 ARRAY pages..(T=30).GC finished]
[GC for 437 ARRAY pages..(T=30).GC finished]
[GC for 168 STRUCTURE pages..(T=30).GC finished]
[GC for 447 ARRAY pages..(T=30).GC finished]
[GC for 457 ARRAY pages..(T=30).GC finished]
[GC for 467 ARRAY pages..(T=30).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=32).GC finished]
[GC for 477 ARRAY pages..(T=30).GC finished]
[GC for 178 STRUCTURE pages..(T=30).GC finished]
[GC for 487 ARRAY pages..(T=30).GC finished]
[GC for 5487 CONS pages..(T=30).GC finished]
[GC for 5497 CONS pages..(T=30).GC finished]
[GC for 497 ARRAY pages..(T=30).GC finished]
[GC for 507 ARRAY pages..(T=32).GC finished]
[GC for 188 STRUCTURE pages..(T=34).GC finished]
[GC for 517 ARRAY pages..(T=32).GC finished]
[GC for 527 ARRAY pages..(T=34).GC finished]
[GC for 537 ARRAY pages..(T=32).GC finished]
[GC for 5507 CONS pages..(T=32).GC finished]
[GC for 547 ARRAY pages..(T=32).GC finished]
[GC for 198 STRUCTURE pages..(T=32).GC finished]
[GC for 557 ARRAY pages..(T=32).GC finished]
[GC for 5517 CONS pages..(T=32).GC finished]
[GC for 567 ARRAY pages..(T=32).GC finished]
[GC for 5527 CONS pages..(T=32).GC finished]
[GC for 577 ARRAY pages..(T=34).GC finished]
[GC for 208 STRUCTURE pages..(T=32).GC finished]
[GC for 587 ARRAY pages..(T=32).GC finished]
[GC for 5537 CONS pages..(T=32).GC finished]
[GC for 597 ARRAY pages..(T=32).GC finished]
[GC for 5547 CONS pages..(T=34).GC finished]
[GC for 607 ARRAY pages..(T=32).GC finished]
[GC for 5557 CONS pages..(T=32).GC finished]
[GC for 617 ARRAY pages..(T=32).GC finished]
[GC for 218 STRUCTURE pages..(T=32).GC finished]
[GC for 5567 CONS pages..(T=32).GC finished]
[GC for 627 ARRAY pages..(T=32).GC finished]
[GC for 637 ARRAY pages..(T=32).GC finished]
[GC for 5577 CONS pages..(T=32).GC finished]
[GC for 647 ARRAY pages..(T=32).GC finished]
[GC for 5587 CONS pages..(T=32).GC finished]
[GC for 228 STRUCTURE pages..(T=32).GC finished]
[GC for 657 ARRAY pages..(T=32).GC finished]
[GC for 5597 CONS pages..(T=32).GC finished]
[GC for 667 ARRAY pages..(T=30).GC finished]
[GC for 677 ARRAY pages..(T=32).GC finished]
[GC for 5607 CONS pages..(T=32).GC finished]
[GC for 687 ARRAY pages..(T=32).GC finished]
[GC for 238 STRUCTURE pages..(T=30).GC finished]
[GC for 5617 CONS pages..(T=32).GC finished]
[GC for 697 ARRAY pages..(T=32).GC finished]
[GC for 5627 CONS pages..(T=32).GC finished]
[GC for 707 ARRAY pages..(T=32).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=32).GC finished]
[GC for 717 ARRAY pages..(T=32).GC finished]
[GC for 5637 CONS pages..(T=32).GC finished]
[GC for 248 STRUCTURE pages..(T=32).GC finished]
[GC for 727 ARRAY pages..(T=30).GC finished]
[GC for 5647 CONS pages..(T=30).GC finished]
[GC for 737 ARRAY pages..(T=30).GC finished]
[GC for 5657 CONS pages..(T=32).GC finished]
[GC for 747 ARRAY pages..(T=32).GC finished]
[GC for 258 STRUCTURE pages..(T=32).GC finished]
[GC for 757 ARRAY pages..(T=32).GC finished]
[GC for 5667 CONS pages..(T=32).GC finished]
[GC for 767 ARRAY pages..(T=32).GC finished]
[GC for 5677 CONS pages..(T=32).GC finished]
[GC for 777 ARRAY pages..(T=32).GC finished]
[GC for 5687 CONS pages..(T=32).GC finished]
[GC for 787 ARRAY pages..(T=32).GC finished]
[GC for 268 STRUCTURE pages..(T=32).GC finished]
[GC for 797 ARRAY pages..(T=32).GC finished]
[GC for 5697 CONS pages..(T=34).GC finished]
[GC for 807 ARRAY pages..(T=32).GC finished]
[GC for 5707 CONS pages..(T=32).GC finished]
[GC for 817 ARRAY pages..(T=32).GC finished]
[GC for 5717 CONS pages..(T=32).GC finished]
[GC for 278 STRUCTURE pages..(T=34).GC finished]
[GC for 827 ARRAY pages..(T=32).GC finished]
[GC for 5727 CONS pages..(T=32).GC finished]
[GC for 837 ARRAY pages..(T=32).GC finished]
[GC for 847 ARRAY pages..(T=32).GC finished]
[GC for 5737 CONS pages..(T=32).GC finished]
[GC for 857 ARRAY pages..(T=32).GC finished]
[GC for 288 STRUCTURE pages..(T=34).GC finished]
[GC for 5747 CONS pages..(T=32).GC finished]
[GC for 867 ARRAY pages..(T=32).GC finished]
[GC for 5757 CONS pages..(T=34).GC finished]
[GC for 877 ARRAY pages..(T=32).GC finished]
[GC for 887 ARRAY pages..(T=34).GC finished]
[GC for 5767 CONS pages..(T=32).GC finished]
[GC for 298 STRUCTURE pages..(T=34).GC finished]
[GC for 897 ARRAY pages..(T=32).GC finished]
[GC for 5777 CONS pages..(T=34).GC finished]
[GC for 907 ARRAY pages..(T=34).GC finished]
[GC for 5787 CONS pages..(T=32).GC finished]
[GC for 917 ARRAY pages..(T=34).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=34).GC finished]
[GC for 927 ARRAY pages..(T=32).GC finished]
[GC for 308 STRUCTURE pages..(T=34).GC finished]
[GC for 5797 CONS pages..(T=34).GC finished]
[GC for 937 ARRAY pages..(T=32).GC finished]
[GC for 5807 CONS pages..(T=34).GC finished]
[GC for 947 ARRAY pages..(T=34).GC finished]
[GC for 5817 CONS pages..(T=32).GC finished]
[GC for 957 ARRAY pages..(T=34).GC finished]
[GC for 318 STRUCTURE pages..(T=34).GC finished]
[GC for 967 ARRAY pages..(T=34).GC finished]
[GC for 5827 CONS pages..(T=32).GC finished]
[GC for 977 ARRAY pages..(T=34).GC finished]
[GC for 5837 CONS pages..(T=34).GC finished]
[GC for 987 ARRAY pages..(T=34).GC finished]
[GC for 5847 CONS pages..(T=34).GC finished]
[GC for 328 STRUCTURE pages..(T=34).GC finished]
[GC for 997 ARRAY pages..(T=32).GC finished]
[GC for 5857 CONS pages..(T=32).GC finished]
[GC for 1007 ARRAY pages..(T=34).GC finished]
[GC for 1017 ARRAY pages..(T=34).GC finished]
[GC for 5867 CONS pages..(T=34).GC finished]
[GC for 1027 ARRAY pages..(T=34).GC finished]
[GC for 338 STRUCTURE pages..(T=34).GC finished]
[GC for 5877 CONS pages..(T=34).GC finished]
[GC for 1037 ARRAY pages..(T=34).GC finished]
[GC for 5887 CONS pages..(T=34).GC finished]
[GC for 1047 ARRAY pages..(T=34).GC finished]
[GC for 1057 ARRAY pages..(T=34).GC finished]
[GC for 5897 CONS pages..(T=34).GC finished]
[GC for 348 STRUCTURE pages..(T=34).GC finished]
[GC for 1067 ARRAY pages..(T=34).GC finished]
[GC for 5907 CONS pages..(T=34).GC finished]
[GC for 1077 ARRAY pages..(T=34).GC finished]
[GC for 5917 CONS pages..(T=34).GC finished]
[GC for 1087 ARRAY pages..(T=34).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=34).GC finished]
[GC for 5927 CONS pages..(T=34).GC finished]
[GC for 1097 ARRAY pages..(T=36).GC finished]
[GC for 358 STRUCTURE pages..(T=34).GC finished]
[GC for 1107 ARRAY pages..(T=34).GC finished]
[GC for 5937 CONS pages..(T=34).GC finished]
[GC for 1117 ARRAY pages..(T=34).GC finished]
[GC for 5947 CONS pages..(T=34).GC finished]
[GC for 1127 ARRAY pages..(T=36).GC finished]
[GC for 5957 CONS pages..(T=34).GC finished]
[GC for 5967 CONS pages..(T=34).GC finished]
[GC for 409 SFUN pages..(T=34).GC finished]
[GC for 5977 CONS pages..(T=36).GC finished]
[GC for 5987 CONS pages..(T=34).GC finished]
[GC for 5997 CONS pages..(T=34).GC finished]
[GC for 6007 CONS pages..(T=34).GC finished]
[GC for 6017 CONS pages..(T=34).GC finished]
[GC for 6027 CONS pages..(T=36).GC finished]
[GC for 6037 CONS pages..(T=36).GC finished]
[GC for 6047 CONS pages..(T=34).GC finished]
[GC for 6057 CONS pages..(T=36).GC finished]
[GC for 419 SFUN pages..(T=36).GC finished]
[GC for 6067 CONS pages..(T=36).GC finished]
[GC for 6077 CONS pages..(T=34).GC finished]
[GC for 6087 CONS pages..(T=34).GC finished]
[GC for 6097 CONS pages..(T=34).GC finished]
[GC for 6107 CONS pages..(T=36).GC finished]
[GC for 6117 CONS pages..(T=34).GC finished]
[GC for 6127 CONS pages..(T=36).GC finished]
[GC for 6137 CONS pages..(T=36).GC finished]
[GC for 419 SFUN pages..(T=36).GC finished]
[GC for 419 SFUN pages..(T=34).GC finished]
[GC for 419 SFUN pages..(T=36).GC finished]
[GC for 6147 CONS pages..(T=36).GC finished]
[GC for 419 SFUN pages..(T=36).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=36).GC finished]
[GC for 419 SFUN pages..(T=36).GC finished]
[GC for 6157 CONS pages..(T=36).GC finished]
[GC for 6167 CONS pages..(T=36).GC finished]
[GC for 6177 CONS pages..(T=36).GC finished]
[GC for 6187 CONS pages..(T=36).GC finished]
[GC for 6197 CONS pages..(T=36).GC finished]
[GC for 6207 CONS pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 6217 CONS pages..(T=36).GC finished]
[GC for 6227 CONS pages..(T=36).GC finished]
[GC for 6237 CONS pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 6247 CONS pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 429 SFUN pages..(T=36).GC finished]
[GC for 6257 CONS pages..(T=36).GC finished]
[GC for 6267 CONS pages..(T=36).GC finished]
[GC for 6277 CONS pages..(T=36).GC finished]
[GC for 6287 CONS pages..(T=36).GC finished]
[GC for 6297 CONS pages..(T=36).GC finished]
[GC for 16640 CONTIGUOUS-BLOCKS pages..(T=42).GC finished]
T
Finished loading '((COMP-FN :EXEC NIL "1" STATE)).
[GC for 6307 CONS pages..(T=30).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=30).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=30).GC finished]
[GC for 6307 CONS pages..(T=32).GC finished]
[GC for 6317 CONS pages..(T=32).GC finished]
[GC for 6327 CONS pages..(T=32).GC finished]
[GC for 6337 CONS pages..(T=32).GC finished]
[GC for 6347 CONS pages..(T=32).GC finished]
[GC for 6357 CONS pages..(T=32).GC finished]
[GC for 6367 CONS pages..(T=30).GC finished]
[GC for 6377 CONS pages..(T=32).GC finished]
[GC for 6387 CONS pages..(T=32).GC finished]
[GC for 6397 CONS pages..(T=32).GC finished]
[GC for 6407 CONS pages..(T=34).GC finished]
[GC for 6417 CONS pages..(T=32).GC finished]
[GC for 6427 CONS pages..(T=32).GC finished]
[GC for 6437 CONS pages..(T=34).GC finished]
[GC for 6447 CONS pages..(T=32).GC finished]
[GC for 6457 CONS pages..(T=32).GC finished]
[GC for 6467 CONS pages..(T=32).GC finished]
[GC for 6477 CONS pages..(T=32).GC finished]
[GC for 6487 CONS pages..(T=32).GC finished]
[GC for 6497 CONS pages..(T=32).GC finished]
[GC for 6507 CONS pages..(T=32).GC finished]
[GC for 6517 CONS pages..(T=32).GC finished]
[GC for 6527 CONS pages..(T=34).GC finished]
[GC for 6537 CONS pages..(T=32).GC finished]
[GC for 6547 CONS pages..(T=32).GC finished]
[GC for 6557 CONS pages..(T=32).GC finished]
[GC for 6567 CONS pages..(T=32).GC finished]
[GC for 6577 CONS pages..(T=32).GC finished]
[GC for 6587 CONS pages..(T=32).GC finished]
[GC for 6597 CONS pages..(T=32).GC finished]
[GC for 6607 CONS pages..(T=34).GC finished]
[GC for 6617 CONS pages..(T=32).GC finished]
[GC for 6627 CONS pages..(T=34).GC finished]
[GC for 6637 CONS pages..(T=34).GC finished]
[GC for 6647 CONS pages..(T=32).GC finished]
[GC for 6657 CONS pages..(T=32).GC finished]
[GC for 6667 CONS pages..(T=32).GC finished]
[GC for 6677 CONS pages..(T=32).GC finished]
[GC for 6687 CONS pages..(T=34).GC finished]
[GC for 6697 CONS pages..(T=34).GC finished]
[GC for 6707 CONS pages..(T=32).GC finished]
[GC for 6717 CONS pages..(T=32).GC finished]
[GC for 6727 CONS pages..(T=32).GC finished]
[GC for 6737 CONS pages..(T=34).GC finished]
[GC for 6747 CONS pages..(T=34).GC finished]
[GC for 6757 CONS pages..(T=34).GC finished]
[GC for 6767 CONS pages..(T=32).GC finished]
[GC for 6777 CONS pages..(T=32).GC finished]
[GC for 6787 CONS pages..(T=32).GC finished]
[GC for 6797 CONS pages..(T=32).GC finished]
[GC for 6807 CONS pages..(T=34).GC finished]
[GC for 6817 CONS pages..(T=34).GC finished]
[GC for 6827 CONS pages..(T=34).GC finished]
[GC for 6837 CONS pages..(T=34).GC finished]
[GC for 6847 CONS pages..(T=34).GC finished]
[GC for 6857 CONS pages..(T=34).GC finished]
[GC for 6867 CONS pages..(T=34).GC finished]
[GC for 6877 CONS pages..(T=34).GC finished]
[GC for 6887 CONS pages..(T=34).GC finished]
[GC for 6897 CONS pages..(T=34).GC finished]
[GC for 6907 CONS pages..(T=34).GC finished]
[GC for 6917 CONS pages..(T=34).GC finished]
[GC for 6927 CONS pages..(T=34).GC finished]
[GC for 6937 CONS pages..(T=34).GC finished]
[GC for 6947 CONS pages..(T=34).GC finished]
[GC for 6957 CONS pages..(T=34).GC finished]
[GC for 6967 CONS pages..(T=34).GC finished]
[GC for 6977 CONS pages..(T=34).GC finished]
[GC for 6987 CONS pages..(T=34).GC finished]
[GC for 6997 CONS pages..(T=34).GC finished]
[GC for 7007 CONS pages..(T=34).GC finished]
[GC for 7017 CONS pages..(T=36).GC finished]
[GC for 7027 CONS pages..(T=34).GC finished]
[GC for 7037 CONS pages..(T=34).GC finished]
[GC for 7047 CONS pages..(T=34).GC finished]
[GC for 7057 CONS pages..(T=34).GC finished]
[GC for 7067 CONS pages..(T=36).GC finished]
[GC for 7077 CONS pages..(T=34).GC finished]
[GC for 7087 CONS pages..(T=36).GC finished]
[GC for 7097 CONS pages..(T=34).GC finished]
[GC for 7107 CONS pages..(T=36).GC finished]
[GC for 7117 CONS pages..(T=34).GC finished]
[GC for 7127 CONS pages..(T=36).GC finished]
[GC for 7137 CONS pages..(T=34).GC finished]
[GC for 7147 CONS pages..(T=34).GC finished]
[GC for 7157 CONS pages..(T=36).GC finished]
[GC for 7167 CONS pages..(T=36).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=34).GC finished]
[GC for 7177 CONS pages..(T=36).GC finished]
[GC for 439 SFUN pages..(T=34).GC finished]
[GC for 7187 CONS pages..(T=36).GC finished]
[GC for 7197 CONS pages..(T=36).GC finished]
[GC for 7207 CONS pages..(T=36).GC finished]
[GC for 7217 CONS pages..(T=34).GC finished]
[GC for 7227 CONS pages..(T=36).GC finished]
[GC for 7237 CONS pages..(T=36).GC finished]
[GC for 7247 CONS pages..(T=34).GC finished]
[GC for 7257 CONS pages..(T=34).GC finished]
[GC for 7267 CONS pages..(T=36).GC finished]
[GC for 7277 CONS pages..(T=36).GC finished]
[GC for 7287 CONS pages..(T=36).GC finished]
[GC for 7297 CONS pages..(T=36).GC finished]
[GC for 7307 CONS pages..(T=36).GC finished]
[GC for 7317 CONS pages..(T=34).GC finished]
[GC for 7327 CONS pages..(T=34).GC finished]
[GC for 7337 CONS pages..(T=34).GC finished]
[GC for 7347 CONS pages..(T=34).GC finished]
[GC for 7357 CONS pages..(T=34).GC finished]
[GC for 7367 CONS pages..(T=34).GC finished]
[GC for 7377 CONS pages..(T=34).GC finished]
[GC for 7387 CONS pages..(T=34).GC finished]
[GC for 7397 CONS pages..(T=34).GC finished]
[GC for 7407 CONS pages..(T=36).GC finished]
[GC for 7417 CONS pages..(T=36).GC finished]
[GC for 7427 CONS pages..(T=36).GC finished]
[GC for 7437 CONS pages..(T=36).GC finished]
[GC for 7447 CONS pages..(T=36).GC finished]
[GC for 7457 CONS pages..(T=36).GC finished]
[GC for 7467 CONS pages..(T=36).GC finished]
[GC for 7477 CONS pages..(T=36).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=36).GC finished]
[GC for 7487 CONS pages..(T=36).GC finished]
[GC for 7497 CONS pages..(T=36).GC finished]
[GC for 7507 CONS pages..(T=36).GC finished]
[GC for 7517 CONS pages..(T=36).GC finished]
[GC for 7527 CONS pages..(T=36).GC finished]
[GC for 7537 CONS pages..(T=36).GC finished]
[GC for 7547 CONS pages..(T=36).GC finished]
[GC for 7557 CONS pages..(T=36).GC finished]
[GC for 7567 CONS pages..(T=36).GC finished]
[GC for 7577 CONS pages..(T=36).GC finished]
[GC for 7587 CONS pages..(T=36).GC finished]
[GC for 7597 CONS pages..(T=36).GC finished]
[GC for 7607 CONS pages..(T=36).GC finished]
[GC for 7617 CONS pages..(T=36).GC finished]
[GC for 7627 CONS pages..(T=36).GC finished]
[GC for 7637 CONS pages..(T=36).GC finished]
[GC for 7647 CONS pages..(T=30).GC finished]
[GC for 488 SYMBOL pages..(T=30).GC finished]
******************************************************************************
Initialization complete, beginning the check and save.
******************************************************************************
Warning: SIMPLE-WARNING: TRACE is being redefined.
Warning: SIMPLE-WARNING: UNTRACE is being redefined.
[GC for 17152 CONTIGUOUS-BLOCKS pages..(T=40).GC finished]
[GC for 29952 CONTIGUOUS-BLOCKS pages..(T=38).GC finished]
[GC for 977 RELOCATABLE-BLOCKS pages..(T=28).GC finished]
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
Initialization SUCCEEDED.
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
if [ -f worklispext ]; then /usr/bin/make move-to-old LISPEXT=`cat worklispext` ;\
elif [ -f saved_acl2 ]; then \
mv -f saved_acl2 osaved_acl2 ;\
else \
touch saved_acl2 ;\
mv -f saved_acl2 osaved_acl2 ;\
fi
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
if [ -f saved_acl2 ] && [ -f saved_acl2.gcl ]; then \
echo "Moving " saved_acl2.gcl " to osaved_acl2.gcl"; \
mv -f saved_acl2.gcl osaved_acl2.gcl; \
cat saved_acl2 | sed -e 's/saved_acl2.gcl$/osaved_acl2.gcl/' > osaved_acl2 ;\
chmod 775 osaved_acl2 ;\
rm -f saved_acl2 ; fi
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
mv -f nsaved_acl2 saved_acl2
if [ -f worklispext ]; then /usr/bin/make move-new LISPEXT=`cat worklispext` ; fi
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
if [ -f nsaved_acl2.gcl ]; then \
mv -f nsaved_acl2.gcl saved_acl2.gcl ; fi
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
rm -f worklispext
rm -f workxxx
/usr/bin/make do_saved
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
rm -fr saved
mkdir saved
chmod 775 saved
cp *.lisp acl2-characters GNUmakefile saved/
chmod 666 saved/*
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
rm -f workxxx
/usr/bin/make chmod_image
make[2]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
if [ -f saved_acl2 ]; then \
chmod 775 saved_acl2 ;\
fi
make[2]: Leaving directory '/<<PKGBUILDDIR>>'
Successfully built /<<PKGBUILDDIR>>/saved_acl2.
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
mv *saved_acl2.gcl saved_acl2
HOME=$(pwd) /usr/bin/make mini-proveall
make[1]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
Mini-proveall passed.
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
mv mini-proveall.out debian/mini-proveall.out
echo "(f-put-global 'old-certification-dir \"$(pwd)/books\" state)" \
"(f-put-global 'new-certification-dir \"/usr/share/acl2-8.3dfsg/books\" state)" \
":q #-native-reloc (setq si::*multiply-stacks* 4) :q (in-package :acl2) " \
"#+(or sparc sparc64)(progn (si::sgc-on nil) (fmakunbound 'si::sgc-on))" \
"(save-exec \"saved_acl2.c\" \"Modified to produce final certification files\")" | HOME=$(pwd) ./saved_acl2
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files set to /tmp/
ACL2 Version 8.3 built August 29, 2020 07:44:33.
Copyright (C) 2020, Regents of the University of Texas
ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and you
are welcome to redistribute it under certain conditions. For details,
see the LICENSE file distributed with ACL2.
Initialized with (INITIALIZE-ACL2 'INCLUDE-BOOK *ACL2-PASS-2-FILES*).
See the documentation topic note-8-3 for recent changes.
Note: We have modified the prompt in some underlying Lisps to further
distinguish it from the ACL2 prompt.
ACL2 Version 8.3. Level 1. Cbd "/<<PKGBUILDDIR>>/".
System books directory "/<<PKGBUILDDIR>>/books/".
Type :help for help.
Type (good-bye) to quit completely out of ACL2.
ACL2 !><state>
ACL2 !><state>
ACL2 !>
Exiting the ACL2 read-eval-print loop. To re-enter, execute (LP).
ACL2>
:Q
ACL2>
#<"ACL2" package>
ACL2>[GC for 42752 CONTIGUOUS-BLOCKS pages..(T=36).GC finished]
[GC for 9 RELOCATABLE-BLOCKS pages..(T=30).GC finished]
mv saved_acl2.c.gcl saved_acl2.c
mv saved_acl2 saved_acl2.ori
cp saved_acl2.c saved_acl2
BUILDDIR="$(dirname $(pwd))" \
FINALDIR="/usr/share/acl2-8.3dfsg" \
HOME=$(pwd) \
GCL_MULTIPROCESS_MEMORY_POOL=t \
/usr/bin/make -j 4 -l 2.95 certify-books 2>&1 | tee debian/test.log & j=$! ; \
while sleep 1800; do echo Tick; done & k=$! ; \
wait $j ; kill $k
make[1]: Entering directory '/<<PKGBUILDDIR>>'
ACL2_WD is /<<PKGBUILDDIR>>
ACL2 is /<<PKGBUILDDIR>>/saved_acl2
make[1]: *** No rule to make target 'certify-books'. Stop.
make[1]: Leaving directory '/<<PKGBUILDDIR>>'
mv saved_acl2.ori saved_acl2
[ -f debian/test.log ] && ( ! fgrep '**' debian/test.log || true )
make[1]: *** No rule to make target 'certify-books'. Stop.
# gcl -batch -eval \
# "(bye \
# #-native-reloc 0 \
# #+native-reloc \
# (let ((w (multiple-value-bind (a b c d) (si::heap-report) (/ (- d c) (/ a 8))))) \
# (format t \"certification run with ~s heap words~%\" w) \
# (if (< w ) 0 1)))")
sed -e "s,^DIR = .*,DIR = $(pwd)/books/interface/infix,1" \
-e "s,^LISP = .*,LISP = $(pwd)/saved_acl2,1" books/interface/infix/makefile > books/interface/infix/Makefile
cd books/interface/infix && make -f Makefile compile
make[1]: Entering directory '/<<PKGBUILDDIR>>/books/interface/infix'
rm -f workxxx
echo ':q' > workxxx
echo '(in-package "user")' >> workxxx
echo '(when (find-package "sloop") (use-package "sloop"))' >> workxxx
echo '(compile-file "infix.lisp")' >> workxxx
echo '(load "infix")' >> workxxx
echo '(compile-file "scribe-init.lisp")' >> workxxx
echo '(compile-file "latex-init.lisp")' >> workxxx
/<<PKGBUILDDIR>>/saved_acl2 < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files set to /tmp/
ACL2 Version 8.3 built August 29, 2020 07:44:33.
Copyright (C) 2020, Regents of the University of Texas
ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and you
are welcome to redistribute it under certain conditions. For details,
see the LICENSE file distributed with ACL2.
Initialized with (INITIALIZE-ACL2 'INCLUDE-BOOK *ACL2-PASS-2-FILES*).
See the documentation topic note-8-3 for recent changes.
Note: We have modified the prompt in some underlying Lisps to further
distinguish it from the ACL2 prompt.
ACL2 Error in ACL2-INTERFACE: Unable to obtain the truename of file
"/sbuild-nonexistent/". Note: Calling OUR-TRUENAME from LP.
Error:
Fast links are on: do (si::use-fast-links nil) for debugging
Signalled by LP.
Raw Lisp Break.
SIMPLE-ERROR: ACL2 Halted
Broken at APPLY. Type :H for Help.
1 Return to top level.
ACL2>>
ACL2>
#<"COMMON-LISP-USER" package>
>
T
>
; (DEFUN ACL2-KEYWORDP) is being compiled.
;; Warning: The variable KEY is not used.
; (DEFUN PRINT-STRING ...) is being compiled.
;; Warning: The type of the form (THE STRING STR) is not CHARACTER.
;; Warning: The type of the form (THE STRING STR) is not T.
; (DEFUN PRINT-ATOM ...) is being compiled.
;; Warning: The type of the form (THE STRING STR) is not CHARACTER.
;; Warning: The type of the form (THE STRING STR) is not T.
;; Warning: The type of the form (THE STRING ATM) is not CHARACTER.
;; Warning: The type of the form (THE STRING ATM) is not T.
;; Note: Tail-recursive call of MATCH2-MACRO was replaced by iteration.
;; Note: Tail-recursive call of ACL2-SMASH-FILE-NAME was replaced by iteration.
;; Note: Tail-recursive call of EXTRACT-DECLARE-XARG was replaced by iteration.
;; Note: Tail-recursive call of EXTRACT-DECLARE-XARG was replaced by iteration.
;; Note: Tail-recursive call of COPY-COMMENTS-READ-NET was replaced by iteration.
;; Note: Tail-recursive call of NORMALIZE-LB-COMMENT-LINE was replaced by iteration.
;; Note: Tail-recursive call of NORMALIZE-LB-COMMENT-LINE was replaced by iteration.
;; Note: Tail-recursive call of NORMALIZE-LB-COMMENT-LINE was replaced by iteration.
;; Note: Tail-recursive call of NORMALIZE-LB-COMMENT-LINE was replaced by iteration.
;; Note: Tail-recursive call of NORMALIZE-LB-COMMENT-LINE was replaced by iteration.
;; Note: Tail-recursive call of CHECK-COMMENT-CHARACTER-NET2 was replaced by iteration./<<PKGBUILDDIR>>/books/interface/infix/infix.c: In function 'L93':
/<<PKGBUILDDIR>>/books/interface/infix/infix.c:8892:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
8892 | if((Cnil)==Cnil){
| ^~
/<<PKGBUILDDIR>>/books/interface/infix/infix.c:8909:11: warning: self-comparison always evaluates to true [-Wtautological-compare]
8909 | if((Cnil)==Cnil){
| ^~
#p"/<<PKGBUILDDIR>>/books/interface/infix/infix.o"
>
--- Do (help-infix-settings) for help. ---
241324
>
; (DEFUN INDEX ...) is being compiled.
;; Warning: The type of the form (THE STRING STR) is not CHARACTER.
;; Warning: The type of the form (THE STRING STR) is not T.
;; Note: Tail-recursive call of GET-MARGIN2 was replaced by iteration.
;; Note: Tail-recursive call of POP-MARGIN was replaced by iteration.
#p"/<<PKGBUILDDIR>>/books/interface/infix/scribe-init.o"
>
; (DEFUN INDEX ...) is being compiled.
;; Warning: The type of the form (THE STRING STR) is not CHARACTER.
;; Warning: The type of the form (THE STRING STR) is not T.
;; Note: Tail-recursive call of ADJUST-MARGIN-TO-LAST-TAB-FIRST was replaced by iteration.
;; Note: Tail-recursive call of GET-MARGIN2 was replaced by iteration.
;; Note: Tail-recursive call of ADJUST-MARGIN-TO-FIRST-TAB-LAST was replaced by iteration.
#p"/<<PKGBUILDDIR>>/books/interface/infix/latex-init.o"
>rm -f workxxx
make[1]: Leaving directory '/<<PKGBUILDDIR>>/books/interface/infix'
cd books/interface/infix && make -f Makefile example
make[1]: Entering directory '/<<PKGBUILDDIR>>/books/interface/infix'
rm -f workxxx
echo ':q' > workxxx
echo '(in-package "user")' >> workxxx
echo '(when (find-package "sloop") (use-package "sloop"))' >> workxxx
echo '(load "infix")' >> workxxx
echo '(print-examples "latex")' >> workxxx
/<<PKGBUILDDIR>>/saved_acl2 < workxxx
GCL (GNU Common Lisp) 2.6.12 ANSI Fri Apr 22 15:51:11 UTC 2016
Source License: LGPL(gcl,gmp), GPL(unexec,bfd,xgcl)
Binary License: GPL due to GPL'ed components: (XGCL READLINE UNEXEC)
Modifications of this banner must retain notice of a compatible license
Dedicated to the memory of W. Schelter
Use (help) to get some basic information on how to use GCL.
Temporary directory for compiler files set to /tmp/
ACL2 Version 8.3 built August 29, 2020 07:44:33.
Copyright (C) 2020, Regents of the University of Texas
ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and you
are welcome to redistribute it under certain conditions. For details,
see the LICENSE file distributed with ACL2.
Initialized with (INITIALIZE-ACL2 'INCLUDE-BOOK *ACL2-PASS-2-FILES*).
See the documentation topic note-8-3 for recent changes.
Note: We have modified the prompt in some underlying Lisps to further
distinguish it from the ACL2 prompt.
ACL2 Error in ACL2-INTERFACE: Unable to obtain the truename of file
"/sbuild-nonexistent/". Note: Calling OUR-TRUENAME from LP.
Error:
Fast links are on: do (si::use-fast-links nil) for debugging
Signalled by LP.
Raw Lisp Break.
SIMPLE-ERROR: ACL2 Halted
Broken at APPLY. Type :H for Help.
1 Return to top level.
ACL2>>
ACL2>
#<"COMMON-LISP-USER" package>
>
T
>
--- Do (help-infix-settings) for help. ---
241324
>
Entering latex mode.
Loading the ainfix latex-init file.-
#p"infix-examples.tex"
>if [ "latex" = "scribe" ] ; then \
scribe infix-examples.mss ; scribe infix-examples.mss ; lpr infix-examples.ps;\
else \
rm -f infix-examples.aux ; latex infix-examples ; dvips -o infix-examples.ps infix-examples ; \
fi
This is pdfTeX, Version 3.14159265-2.6-1.40.21 (TeX Live 2020/Debian) (preloaded format=latex)
restricted \write18 enabled.
entering extended mode
(./infix-examples.tex
LaTeX2e <2020-02-02> patch level 5
L3 programming layer <2020-07-17>
(/usr/share/texlive/texmf-dist/tex/latex/base/latex209.def
Entering LaTeX 2.09 COMPATIBILITY MODE
*************************************************************
!!WARNING!! !!WARNING!! !!WARNING!! !!WARNING!!
This mode attempts to provide an emulation of the LaTeX 2.09
author environment so that OLD documents can be successfully
processed. It should NOT be used for NEW documents!
New documents should use Standard LaTeX conventions and start
with the \documentclass command.
Compatibility mode is UNLIKELY TO WORK with LaTeX 2.09 style
files that change any internal macros, especially not with
those that change the FONT SELECTION or OUTPUT ROUTINES.
Therefore such style files MUST BE UPDATED to use
Current Standard LaTeX: LaTeX2e.
If you suspect that you may be using such a style file, which
is probably very, very old by now, then you should attempt to
get it updated by sending a copy of this error message to the
author of that file.
*************************************************************
(/usr/share/texlive/texmf-dist/tex/latex/base/tracefnt.sty)
(/usr/share/texlive/texmf-dist/tex/latex/base/latexsym.sty))
(/usr/share/texlive/texmf-dist/tex/latex/base/article.cls
Document Class: article 2019/12/20 v1.4l Standard LaTeX document class
(/usr/share/texlive/texmf-dist/tex/latex/base/size10.clo))
(/usr/share/texlive/texmf-dist/tex/latex/l3backend/l3backend-dvips.def)
No file infix-examples.aux.
(/usr/share/texlive/texmf-dist/tex/latex/base/ulasy.fd)
Overfull \hbox (5.88658pt too wide) in paragraph at lines 32--33
[]\OT1/cmtt/m/n/10 (case x (key1 answer1) (key2 answer2) (otherwise default)) \
OT1/cmr/m/n/10 is printed
[1] [2] [3] [4] (./infix-examples.aux) )
(see the transcript file for additional information)
Output written on infix-examples.dvi (4 pages, 9072 bytes).
Transcript written on infix-examples.log.
This is dvips(k) 2020.1 Copyright 2020 Radical Eye Software (www.radicaleye.com)
' TeX output 2020.08.29:0828' -> infix-examples.ps
</usr/share/texlive/texmf-dist/dvips/base/tex.pro>
</usr/share/texlive/texmf-dist/dvips/l3backend/l3backend-dvips.pro>
</usr/share/texlive/texmf-dist/dvips/base/texps.pro>
</usr/share/texlive/texmf-dist/dvips/base/special.pro>.
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi7.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmmi10.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmsy10.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmbx10.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt8.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmti10.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmtt10.pfb>
</usr/share/texlive/texmf-dist/fonts/type1/public/amsfonts/cm/cmr10.pfb>[1]
[2] [3] [4]
make[1]: Leaving directory '/<<PKGBUILDDIR>>/books/interface/infix'
touch infix-stamp
dh_testdir
touch build-stamp
fakeroot debian/rules binary-arch
echo debian/acl2.sh usr/bin >>debian/acl2.install
echo saved_acl2 usr/lib/acl2-8.3dfsg >>debian/acl2.install
find * -name "*.lisp" -maxdepth 0 | grep -v TMP1.lisp | awk '{printf("%s usr/share/acl2-8.3dfsg\n",$1);}' >debian/acl2-source.install
find * -name "TAGS" -maxdepth 0 | awk '{printf("%s usr/share/acl2-8.3dfsg\n",$1);}' >>debian/acl2-source.install
find books/interface/emacs -name "*.el" | awk '{printf("%s usr/share/emacs/site-lisp/acl2\n",$1);}' >>debian/acl2-emacs.install
find emacs -name "*.el" | awk '{printf("%s usr/share/emacs/site-lisp/acl2\n",$1);}' >>debian/acl2-emacs.install
echo doc usr/share/doc/acl2-doc >debian/acl2-doc.install
find books -name "README*" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/textbook -name "*.txt" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/textbook -name "*.html" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/bdd/be/ -type f | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/misc -name "simplify-defuns.txt" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/interface/infix -name "README*" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/interface/infix -name "*.ps" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/interface/infix -name "*.dvi" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/interface/emacs -name "README*" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books/arithmetic-2/pass1/arithmetic-axioms.txt | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/doc/acl2-doc/%s\n",$1,a);}' >>debian/acl2-doc.install
find books -name "*.o" | grep -v interface/ | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/lib/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books.install
find books -name "*.lisp" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books-source.install
find books -name "*.acl2" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books-source.install
find books/bdd -name "bit-vector-reader.lsp" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books-source.install
find books -name "*.cert" | grep -v fix-cert/moved | grep -v system/pcert | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books-certs.install
find books -name "*.pcert0.final" | \
awk '{a=$1;sub(".pcert0.final",".cert",a);printf("%s usr/share/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-books-certs.install
find books/interface/infix -name "*.o" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/lib/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-infix.install
find books/interface/infix -name "*.sty" | \
awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/share/texmf/tex/latex\n",$1);}' >>debian/acl2-infix.install
find books/interface/infix -name "*.lisp" | awk '{a=$1;sub("/[^/]*$","",a);printf("%s usr/lib/acl2-8.3dfsg/%s\n",$1,a);}' >>debian/acl2-infix-source.install
echo usr/lib/acl2-8.3dfsg/saved_acl2 usr/share/acl2-8.3dfsg/saved_acl2 >debian/acl2.links
find books -name "*.o" | grep -v interface/ | awk '{printf("usr/lib/acl2-8.3dfsg/%s usr/share/acl2-8.3dfsg/%s\n",$1,$1);}' >>debian/acl2-books.links
find books/interface/infix -name "*.o" | awk '{printf("usr/lib/acl2-8.3dfsg/%s usr/share/acl2-8.3dfsg/%s\n",$1,$1);}' >>debian/acl2-infix.links
echo "#!/bin/bash" >debian/acl2.sh
echo >>debian/acl2.sh
echo "export ACL2_SYSTEM_BOOKS=/usr/share/acl2-8.3dfsg/books" >>debian/acl2.sh
echo "exec /usr/lib/acl2-8.3dfsg/saved_acl2 -dir /usr/share/acl2-8.3dfsg" >>debian/acl2.sh
chmod 755 debian/acl2.sh
cat debian/acl2-emacs.emacsen-startup.in | sed "s,@VR@,8.3dfsg,g" > debian/acl2-emacs.emacsen-startup
awk '/@PLIST@/ {exit 0} {print}' debian/README.Debian.in >debian/README.Debian
for i in debian/acl2.install debian/acl2-source.install debian/acl2-emacs.install debian/acl2-doc.install debian/acl2-books.install debian/acl2-books-source.install debian/acl2-books-certs.install debian/acl2-infix.install debian/acl2-infix-source.install; do\
awk '/^debian\// {next} {sub(".final$","",$1);$2="/" $2;print $0 " " p}' \
p=$(basename ${i%.install}) $i >>debian/README.Debian ; done
for i in ; do\
awk '/^debian\// {next} {print $0 " /usr/share/info " p}' p=$(basename ${i%.info}) $i >>debian/README.Debian ; done
for i in debian/acl2-infix.examples; do\
awk '/^debian\// {next} {print $0 " /usr/share/doc/" p "/examples " p}' \
p=$(basename ${i%.examples}) $i >>debian/README.Debian ; done
for i in debian/acl2.docs; do\
awk '/^debian\// {next} {print $0 " /usr/share/doc/" p " " p}' p=$(basename ${i%.docs}) $i >>debian/README.Debian ; done
awk '/@PLIST@/ {i=1;next} {if (i) print}' debian/README.Debian.in >>debian/README.Debian
cat debian/acl2-books-certs.lintian-overrides.in | sed "s,@PD@,acl2-8.3dfsg,g" > debian/acl2-books-certs.lintian-overrides
cat debian/acl2.lintian-overrides.in | sed "s,@PD@,acl2-8.3dfsg,g" > debian/acl2.lintian-overrides
dh_testdir
dh_testroot
dh_prep -XTAGS
dh_installdirs
dh_installdirs: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_install
dh_install: warning: Compatibility levels before 10 are deprecated (level 9 in use)
rm -f debian/acl2-doc/usr/share/doc/acl2-doc/doc/manual/LICENSE
rm -f debian/acl2-doc/usr/share/doc/acl2-doc/doc/.gitignore
find debian/acl2-books-source/usr/share/acl2-8.3dfsg/books/quicklisp/bundle/software/ -type f -name release.lisp -exec rm {} \;
find debian/acl2-doc/usr/share/doc/acl2-doc// -type f -size 0 -exec rm {} \;
for i in $(find debian -name "*.final"); do mv $i ${i%.final} ; done
find debian/acl2-source -name "*.lisp" -type f -exec chmod 444 {} \;
find debian/acl2-source -name "*.acl2" -type f -exec chmod 444 {} \;
find debian/acl2-source -name "*.lsp" -type f -exec chmod 444 {} \;
find debian/acl2-books-source -name "*.lisp" -type f -exec chmod 444 {} \;
find debian/acl2-books-source -name "*.acl2" -type f -exec chmod 444 {} \;
find debian/acl2-books-source -name "*.lsp" -type f -exec chmod 444 {} \;
mv debian/acl2/usr/bin/acl2.sh debian/acl2/usr/bin/acl2
dh_testdir
dh_testroot
dh_installdocs
dh_installdocs: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_installexamples
dh_installexamples: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_installmenu
dh_installemacsen
dh_installcron
dh_installman
dh_installman: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_installinfo
dh_installinfo: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_installchangelogs
dh_installchangelogs: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_strip
dh_strip: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_strip: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_strip: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_link
dh_link: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_compress
dh_compress: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_compress: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_compress: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_lintian
dh_lintian: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_fixperms
dh_installdeb
dh_installdeb: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_shlibdeps
dh_shlibdeps: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_shlibdeps: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_shlibdeps: warning: Compatibility levels before 10 are deprecated (level 9 in use)
dh_gencontrol
dh_md5sums
dh_builddeb
dpkg-deb: building package 'acl2' in '../acl2_8.3dfsg-1_armhf.deb'.
dpkg-deb: building package 'acl2-infix' in '../acl2-infix_8.3dfsg-1_armhf.deb'.
dpkg-deb: building package 'acl2-books' in '../acl2-books_8.3dfsg-1_armhf.deb'.
dpkg-genbuildinfo --build=any
dpkg-genchanges --build=any -mRaspbian mythic lxc autobuilder 1 <root@raspbian.org> >../acl2_8.3dfsg-1_armhf.changes
dpkg-genchanges: info: binary-only arch-specific upload (source code and arch-indep packages not included)
dpkg-source --after-build .
dpkg-buildpackage: info: binary-only upload (no source included)
--------------------------------------------------------------------------------
Build finished at 2020-08-29T08:57:54Z
Finished
--------
I: Built successfully
+------------------------------------------------------------------------------+
| Post Build Chroot |
+------------------------------------------------------------------------------+
+------------------------------------------------------------------------------+
| Changes |
+------------------------------------------------------------------------------+
acl2_8.3dfsg-1_armhf.changes:
-----------------------------
Format: 1.8
Date: Sat, 22 Aug 2020 14:29:22 +0000
Source: acl2
Binary: acl2 acl2-books acl2-infix
Architecture: armhf
Version: 8.3dfsg-1
Distribution: bullseye-staging
Urgency: medium
Maintainer: Raspbian mythic lxc autobuilder 1 <root@raspbian.org>
Changed-By: Camm Maguire <camm@debian.org>
Description:
acl2 - Computational Logic for Applicative Common Lisp: main binary
acl2-books - Computational Logic for Applicative Common Lisp: compiled librari
acl2-infix - Computational Logic for Applicative Common Lisp: infix interface
Changes:
acl2 (8.3dfsg-1) unstable; urgency=medium
.
* New upstream release
Checksums-Sha1:
d750de57e8d4a0d4f809f6ae3c48a443f392c891 12956 acl2-books_8.3dfsg-1_armhf.deb
786e6395c5780b6b71f01907ec328ee6af739a76 441808 acl2-infix_8.3dfsg-1_armhf.deb
aa34c8064e49281ab2292aaa560d09a1084931cb 11227 acl2_8.3dfsg-1_armhf.buildinfo
517b7ce84afadc0b8b2441daa88c8103524c1ca8 18109240 acl2_8.3dfsg-1_armhf.deb
Checksums-Sha256:
a2ea00bff227b3fa8450e4b8a8adf815657ca8f36e091d2eabdbe9acc653d33e 12956 acl2-books_8.3dfsg-1_armhf.deb
cbb1ba3736ff5ef08bffbdc7ceb20b7c7a4272b4856da28222a87f6c05a4fcbb 441808 acl2-infix_8.3dfsg-1_armhf.deb
b0b90c156385ba287b4b9d2f5618da6120b274d39af681c7c86dc71aa85df2fb 11227 acl2_8.3dfsg-1_armhf.buildinfo
00d2c737ed771c11ba329d1a1766c00e6c0841eba6883f8e2846ea9279d7b564 18109240 acl2_8.3dfsg-1_armhf.deb
Files:
ab346fa133d0d36c66a2f89ab2d1ed23 12956 math optional acl2-books_8.3dfsg-1_armhf.deb
3475148d6dea0c732270ca2224d58eb2 441808 math optional acl2-infix_8.3dfsg-1_armhf.deb
7df838d29eb97288be9066886d70e562 11227 math optional acl2_8.3dfsg-1_armhf.buildinfo
e42b2bdb78eca9632108557324a12cc8 18109240 math optional acl2_8.3dfsg-1_armhf.deb
+------------------------------------------------------------------------------+
| Package contents |
+------------------------------------------------------------------------------+
acl2-books_8.3dfsg-1_armhf.deb
------------------------------
new Debian package, version 2.0.
size 12956 bytes: control archive=756 bytes.
703 bytes, 18 lines control
148 bytes, 2 lines md5sums
Package: acl2-books
Source: acl2
Version: 8.3dfsg-1
Architecture: armhf
Maintainer: Camm Maguire <camm@debian.org>
Installed-Size: 23
Depends: acl2 (= 8.3dfsg-1), acl2-books-certs (= 8.3dfsg-1), acl2-books-source (= 8.3dfsg-1)
Conflicts: acl2 (<= 2.7-9)
Replaces: acl2 (<= 2.7-9)
Section: math
Priority: optional
Description: Computational Logic for Applicative Common Lisp: compiled libraries
ACL2 is both a programming language in which you can model computer
systems and a tool to help you prove properties of those models.
.
This package contains numerous precompiled and precertified libraries
for use in proving theorems with ACL2. Serious users will no doubt
want to install this package.
drwxr-xr-x root/root 0 2020-08-22 14:29 ./
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/acl2-books/
-rw-r--r-- root/root 8587 2020-08-22 14:29 ./usr/share/doc/acl2-books/changelog.Debian.gz
-rw-r--r-- root/root 7785 2017-08-03 21:27 ./usr/share/doc/acl2-books/copyright
acl2-infix_8.3dfsg-1_armhf.deb
------------------------------
new Debian package, version 2.0.
size 441808 bytes: control archive=940 bytes.
684 bytes, 19 lines control
558 bytes, 7 lines md5sums
Package: acl2-infix
Source: acl2
Version: 8.3dfsg-1
Architecture: armhf
Maintainer: Camm Maguire <camm@debian.org>
Installed-Size: 1799
Depends: acl2 (= 8.3dfsg-1), texlive-latex-recommended
Recommends: acl2-infix-source (= 8.3dfsg-1)
Conflicts: acl2 (<= 2.7-9)
Replaces: acl2 (<= 2.7-9)
Section: math
Priority: optional
Description: Computational Logic for Applicative Common Lisp: infix interface
ACL2 is both a programming language in which you can model computer
systems and a tool to help you prove properties of those models.
.
This package contains utilities and libraries to access ACL2 via an
infix notation similar to that used in many non-lisp programming
languages.
drwxr-xr-x root/root 0 2020-08-22 14:29 ./
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/interface/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/interface/infix/
-rw-r--r-- root/root 1559401 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/interface/infix/infix.o
-rw-r--r-- root/root 143664 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/interface/infix/latex-init.o
-rw-r--r-- root/root 95054 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/books/interface/infix/scribe-init.o
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/interface/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/interface/infix/
lrwxrwxrwx root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/interface/infix/infix.o -> ../../../../../lib/acl2-8.3dfsg/books/interface/infix/infix.o
lrwxrwxrwx root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/interface/infix/latex-init.o -> ../../../../../lib/acl2-8.3dfsg/books/interface/infix/latex-init.o
lrwxrwxrwx root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/books/interface/infix/scribe-init.o -> ../../../../../lib/acl2-8.3dfsg/books/interface/infix/scribe-init.o
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/acl2-infix/
-rw-r--r-- root/root 8587 2020-08-22 14:29 ./usr/share/doc/acl2-infix/changelog.Debian.gz
-rw-r--r-- root/root 7785 2017-08-03 21:27 ./usr/share/doc/acl2-infix/copyright
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/acl2-infix/examples/
-rw-r--r-- root/root 1333 2020-04-16 14:22 ./usr/share/doc/acl2-infix/examples/doinfix
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/texmf/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/texmf/tex/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/texmf/tex/latex/
-rw-r--r-- root/root 752 2020-04-16 14:22 ./usr/share/texmf/tex/latex/CLI.sty
acl2_8.3dfsg-1_armhf.deb
------------------------
new Debian package, version 2.0.
size 18109240 bytes: control archive=964 bytes.
534 bytes, 15 lines control
650 bytes, 10 lines md5sums
Package: acl2
Version: 8.3dfsg-1
Architecture: armhf
Maintainer: Camm Maguire <camm@debian.org>
Installed-Size: 167891
Depends: libc6 (>= 2.29), libgmp10, libreadline8 (>= 6.0), libx11-6
Recommends: acl2-source, acl2-books
Suggests: acl2-emacs
Section: math
Priority: optional
Description: Computational Logic for Applicative Common Lisp: main binary
ACL2 is both a programming language in which you can model computer
systems and a tool to help you prove properties of those models.
.
This package contains the base ACL2 binary.
drwxr-xr-x root/root 0 2020-08-22 14:29 ./
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/bin/
-rwxr-xr-x root/root 135 2020-08-22 14:29 ./usr/bin/acl2
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/
-rwxr-xr-x root/root 171795984 2020-08-22 14:29 ./usr/lib/acl2-8.3dfsg/saved_acl2
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/
lrwxrwxrwx root/root 0 2020-08-22 14:29 ./usr/share/acl2-8.3dfsg/saved_acl2 -> ../../lib/acl2-8.3dfsg/saved_acl2
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/doc/acl2/
-rw-r--r-- root/root 73434 2020-08-22 14:29 ./usr/share/doc/acl2/README.Debian.gz
-rw-r--r-- root/root 28 2017-08-03 21:27 ./usr/share/doc/acl2/TODO.Debian
-rw-r--r-- root/root 8587 2020-08-22 14:29 ./usr/share/doc/acl2/changelog.Debian.gz
-rw-r--r-- root/root 7785 2017-08-03 21:27 ./usr/share/doc/acl2/copyright
-rw-r--r-- root/root 11386 2020-08-22 14:29 ./usr/share/doc/acl2/mini-proveall.out.gz
-rw-r--r-- root/root 277 2020-08-22 14:29 ./usr/share/doc/acl2/test.log
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/lintian/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/lintian/overrides/
-rw-r--r-- root/root 132 2020-08-22 14:29 ./usr/share/lintian/overrides/acl2
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/man/
drwxr-xr-x root/root 0 2020-08-22 14:29 ./usr/share/man/man1/
-rw-r--r-- root/root 726 2020-08-22 14:29 ./usr/share/man/man1/acl2.1.gz
+------------------------------------------------------------------------------+
| Post Build |
+------------------------------------------------------------------------------+
+------------------------------------------------------------------------------+
| Cleanup |
+------------------------------------------------------------------------------+
Purging /<<BUILDDIR>>
Not cleaning session: cloned chroot in use
+------------------------------------------------------------------------------+
| Summary |
+------------------------------------------------------------------------------+
Build Architecture: armhf
Build-Space: 1153620
Build-Time: 6386
Distribution: bullseye-staging
Host Architecture: armhf
Install-Time: 812
Job: acl2_8.3dfsg-1
Machine Architecture: armhf
Package: acl2
Package-Time: 7244
Source-Version: 8.3dfsg-1
Space: 1153620
Status: successful
Version: 8.3dfsg-1
--------------------------------------------------------------------------------
Finished at 2020-08-29T08:57:54Z
Build needed 02:00:44, 1153620k disk space