Input buildinfo: https://buildinfos.debian.net/buildinfo-pool/a/acl2/acl2_8.4dfsg-2_all.buildinfo Use metasnap for getting required timestamps New buildinfo file: /tmp/acl2-8.4dfsg-29wg_vp2_/acl2_8.4dfsg-2_all.buildinfo Get source package info: acl2=8.4dfsg-2 Source URL: http://snapshot.notset.fr/mr/package/acl2/8.4dfsg-2/srcfiles?fileinfo=1 env -i PATH=/usr/sbin:/usr/bin:/sbin:/bin TMPDIR=/tmp mmdebstrap --arch=amd64 --include=autoconf=2.71-2 automake=1:1.16.5-1 autopoint=0.21-4 autotools-dev=20180224.1+nmu1 base-files=12 base-passwd=3.5.52 bash=5.1-3+b2 binutils=2.37-7 binutils-common=2.37-7 binutils-x86-64-linux-gnu=2.37-7 bsdextrautils=2.37.2-4 bsdutils=1:2.37.2-4 build-essential=12.9 bzip2=1.0.8-4 ca-certificates=20211016 coreutils=8.32-4+b1 cpp=4:11.2.0-2 cpp-11=11.2.0-10 dash=0.5.11+git20210903+057cd650a4ed-1 debconf=1.5.79 debhelper=13.5.2 debianutils=5.5-1 dh-autoreconf=20 dh-elpa=2.0.9 dh-strip-nondeterminism=1.12.0-2 diffutils=1:3.7-5 dpkg=1.20.9 dpkg-dev=1.20.9 dwz=0.14-1 emacs-bin-common=1:27.1+1-3.1 emacs-common=1:27.1+1-3.1 emacs-nox=1:27.1+1-3.1 emacsen-common=3.0.4 file=1:5.39-3 findutils=4.8.0-1 fontconfig-config=2.13.1-4.2 fonts-dejavu-core=2.37-2 fonts-lmodern=2.004.5-6.1 g++=4:11.2.0-2 g++-11=11.2.0-10 gcc=4:11.2.0-2 gcc-11=11.2.0-10 gcc-11-base=11.2.0-10 gcl=2.6.12-105 gettext=0.21-4 gettext-base=0.21-4 grep=3.7-1 groff-base=1.22.4-7 gzip=1.10-4 hostname=3.23 init-system-helpers=1.60 install-info=6.8-3 intltool-debian=0.35.0+20060710.5 libacl1=2.3.1-1 libapt-pkg-perl=0.1.40 libapt-pkg6.0=2.3.11 libarchive-zip-perl=1.68-1 libarray-unique-perl=0.08-2.1 libarray-utils-perl=0.5-1.1 libasan6=11.2.0-10 libasound2=1.2.5.1-1 libasound2-data=1.2.5.1-1 libatomic1=11.2.0-10 libattr1=1:2.5.1-1 libaudit-common=1:3.0.6-1 libaudit1=1:3.0.6-1 libbinutils=2.37-7 libblkid1=2.37.2-4 libbrotli1=1.0.9-2+b2 libbsd0=0.11.3-1 libbz2-1.0=1.0.8-4 libc-bin=2.32-4 libc-dev-bin=2.32-4 libc6=2.32-4 libc6-dev=2.32-4 libcairo2=1.16.0-5 libcanna1g=3.7p3-17 libcap-ng0=0.7.9-2.2+b1 libcap2=1:2.44-1 libcc1-0=11.2.0-10 libcgi-pm-perl=4.53-1 libclass-accessor-perl=0.51-1 libcom-err2=1.46.4-1 libcompfaceg1=1:1.5.2-5+b2 libconfig-tiny-perl=2.27-1 libcrypt-dev=1:4.4.25-2 libcrypt1=1:4.4.25-2 libctf-nobfd0=2.37-7 libctf0=2.37-7 libdb5.3=5.3.28+dfsg1-0.8 libdbus-1-3=1.12.20-3 libdebconfclient0=0.260 libdebhelper-perl=13.5.2 libdebian-source-perl=0.116 libdeflate0=1.8-1 libdpkg-perl=1.20.9 libelf1=0.185-2 libencode-locale-perl=1.05-1.1 liberror-perl=0.17029-1 libexpat1=2.4.1-3 libexporter-lite-perl=0.08-1 libexporter-tiny-perl=1.002002-1 libffi8=3.4.2-3 libfile-find-rule-perl=0.34-1 libfile-listing-perl=6.14-1 libfile-stripnondeterminism-perl=1.12.0-2 libfontconfig1=2.13.1-4.2 libfreetype6=2.11.0+dfsg-1 libgcc-11-dev=11.2.0-10 libgcc-s1=11.2.0-10 libgcrypt20=1.9.4-3+b1 libgdbm-compat4=1.22-1 libgdbm6=1.22-1 libglib2.0-0=2.70.0-3 libgmp10=2:6.2.1+dfsg-2 libgnutls30=3.7.2-2 libgomp1=11.2.0-10 libgpg-error0=1.42-3 libgpm2=1.20.7-9 libgraphite2-3=1.3.14-1 libgssapi-krb5-2=1.18.3-7 libharfbuzz0b=2.7.4-1 libhogweed6=3.7.3-1 libhtml-form-perl=6.07-1 libhtml-parser-perl=3.76-1 libhtml-tagset-perl=3.20-4 libhtml-tree-perl=5.07-2 libhttp-cookies-perl=6.10-1 libhttp-date-perl=6.05-1 libhttp-message-perl=6.33-1 libhttp-negotiate-perl=6.01-1 libhttp-server-simple-perl=0.52-1.1 libice6=2:1.0.10-1 libicu67=67.1-7 libidn2-0=2.3.2-2 libio-html-perl=1.004-2 libio-socket-ssl-perl=2.072-1 libio-stringy-perl=2.111-3 libisl23=0.24-2 libitm1=11.2.0-10 libjansson4=2.13.1-1.1 libjbig0=2.1-3.1+b2 libjpeg62-turbo=1:2.0.6-4 libk5crypto3=1.18.3-7 libkeyutils1=1.6.1-2 libkpathsea6=2021.20210626.59705-1 libkrb5-3=1.18.3-7 libkrb5support0=1.18.3-7 liblcms2-2=2.12~rc1-2 libldap-2.4-2=2.4.59+dfsg-1 liblist-moreutils-perl=0.430-2 liblist-moreutils-xs-perl=0.430-2 liblsan0=11.2.0-10 liblwp-mediatypes-perl=6.04-1 liblwp-protocol-https-perl=6.10-1 liblz4-1=1.9.3-2 liblzma5=5.2.5-2 libmagic-mgc=1:5.39-3 libmagic1=1:5.39-3 libmd0=1.0.4-1 libmount1=2.37.2-4 libmpc3=1.2.1-1 libmpfr6=4.1.0-3 libnet-http-perl=6.21-1 libnet-ssleay-perl=1.88-3+b1 libnettle8=3.7.3-1 libnsl-dev=1.3.0-2 libnsl2=1.3.0-2 libnumber-compare-perl=0.03-2 libp11-kit0=0.24.0-5 libpam-modules=1.4.0-10 libpam-modules-bin=1.4.0-10 libpam-runtime=1.4.0-10 libpam0g=1.4.0-10 libpaper-utils=1.1.28+b1 libpaper1=1.1.28+b1 libparse-debcontrol-perl=2.005-4.1 libpcre2-8-0=10.36-2 libpcre3=2:8.39-13 libperl5.32=5.32.1-6 libpipeline1=1.5.3-1 libpixman-1-0=0.40.0-1 libpng16-16=1.6.37-3 libptexenc1=2021.20210626.59705-1 libquadmath0=11.2.0-10 libreadline8=8.1-2 libsasl2-2=2.1.27+dfsg-2.2 libsasl2-modules-db=2.1.27+dfsg-2.2 libseccomp2=2.5.2-2 libselinux1=3.1-3+b1 libsigsegv2=2.13-1 libsm6=2:1.2.3-1 libsmartcols1=2.37.2-4 libssl1.1=1.1.1l-1 libstdc++-11-dev=11.2.0-10 libstdc++6=11.2.0-10 libsub-install-perl=0.928-1.1 libsub-name-perl=0.26-1+b1 libsub-override-perl=0.09-2 libsynctex2=2021.20210626.59705-1 libsystemd0=249.5-1 libtasn1-6=4.17.0-2 libtcl8.6=8.6.11+dfsg-1 libteckit0=2.5.10+ds1-3 libtexlua53=2021.20210626.59705-1 libtexluajit2=2021.20210626.59705-1 libtext-glob-perl=0.11-2 libtext-unidecode-perl=1.30-1 libtie-ixhash-perl=1.23-2.1 libtiff5=4.3.0-2 libtimedate-perl=2.3300-2 libtinfo6=6.2+20210905-1 libtirpc-common=1.3.2-2 libtirpc-dev=1.3.2-2 libtirpc3=1.3.2-2 libtk8.6=8.6.11.1-1 libtool=2.4.6-15 libtry-tiny-perl=0.30-1 libtsan0=11.2.0-10 libubsan1=11.2.0-10 libuchardet0=0.0.7-1 libudev1=249.5-1 libunistring2=0.9.10-6 liburi-perl=5.10-1 libuuid1=2.37.2-4 libwebp6=0.6.1-2.1 libwww-mechanize-perl=2.06-1 libwww-perl=6.58-1 libwww-robotrules-perl=6.02-1 libx11-6=2:1.7.2-2+b1 libx11-data=2:1.7.2-2 libxau6=1:1.0.9-1 libxaw7=2:1.0.13-1.1 libxcb-render0=1.14-3 libxcb-shm0=1.14-3 libxcb1=1.14-3 libxdmcp6=1:1.1.2-3 libxext6=2:1.3.4-1 libxft2=2.3.2-2 libxi6=2:1.8-1 libxml-libxml-perl=2.0134+dfsg-2+b1 libxml-namespacesupport-perl=1.12-1.1 libxml-sax-base-perl=1.09-1.1 libxml-sax-perl=1.02+dfsg-3 libxml2=2.9.12+dfsg-5 libxmu6=2:1.1.2-2+b3 libxpm4=1:3.5.12-1 libxrender1=1:0.9.10-1 libxss1=1:1.2.3-1 libxt6=1:1.2.0-1 libxxhash0=0.8.0-2 libzstd1=1.4.8+dfsg-3 libzzip-0-13=0.13.72+dfsg.1-1.1 linux-libc-dev=5.14.12-1 login=1:4.8.1-1 lsb-base=11.1.0 m4=1.4.18-5 make=4.3-4.1 man-db=2.9.4-2 mawk=1.3.4.20200120-2 ncurses-base=6.2+20210905-1 ncurses-bin=6.2+20210905-1 netbase=6.3 openssl=1.1.1l-1 patch=2.7.6-7 perl=5.32.1-6 perl-base=5.32.1-6 perl-modules-5.32=5.32.1-6 perl-openssl-defaults=5 po-debconf=1.0.21+nmu1 readline-common=8.1-2 rpcsvc-proto=1.4.2-4 sed=4.8-1 sensible-utils=0.0.17 sysvinit-utils=3.00-1 t1utils=1.41-4 tar=1.34+dfsg-1 tex-common=6.17 texinfo=6.8-3 texlive-base=2021.20210921-1 texlive-binaries=2021.20210626.59705-1 texlive-latex-base=2021.20210921-1 texlive-latex-recommended=2021.20210921-1 time=1.9-0.1 tzdata=2021e-1 ucf=3.0043 util-linux=2.37.2-4 x11-common=1:7.7+23 xdg-utils=1.1.3-4.1 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 xz-utils=5.2.5-2 zlib1g=1:1.2.11.dfsg-2 --variant=apt --aptopt=Acquire::Check-Valid-Until "false" --aptopt=Acquire::http::Dl-Limit "1000"; --aptopt=Acquire::https::Dl-Limit "1000"; --aptopt=Acquire::Retries "5"; --aptopt=APT::Get::allow-downgrades "true"; --keyring=/usr/share/keyrings/ --essential-hook=chroot "$1" sh -c "apt-get --yes install fakeroot util-linux" --essential-hook=copy-in /usr/share/keyrings/debian-archive-bullseye-automatic.gpg /usr/share/keyrings/debian-archive-bullseye-security-automatic.gpg /usr/share/keyrings/debian-archive-bullseye-stable.gpg /usr/share/keyrings/debian-archive-buster-automatic.gpg /usr/share/keyrings/debian-archive-buster-security-automatic.gpg /usr/share/keyrings/debian-archive-buster-stable.gpg /usr/share/keyrings/debian-archive-keyring.gpg /usr/share/keyrings/debian-archive-removed-keys.gpg /usr/share/keyrings/debian-archive-stretch-automatic.gpg /usr/share/keyrings/debian-archive-stretch-security-automatic.gpg /usr/share/keyrings/debian-archive-stretch-stable.gpg /usr/share/keyrings/debian-ports-archive-keyring-removed.gpg /usr/share/keyrings/debian-ports-archive-keyring.gpg /usr/share/keyrings/debian-keyring.gpg /etc/apt/trusted.gpg.d/ --essential-hook=chroot "$1" sh -c "rm /etc/apt/sources.list && echo 'deb http://snapshot.notset.fr/archive/debian/20211107T145307Z/ bookworm main deb-src http://snapshot.notset.fr/archive/debian/20211107T145307Z/ bookworm main deb http://snapshot.notset.fr/archive/debian/20211102T092136Z/ unstable main' >> /etc/apt/sources.list && apt-get update" --customize-hook=chroot "$1" useradd --no-create-home -d /nonexistent -p "" builduser -s /bin/bash --customize-hook=chroot "$1" env sh -c "apt-get source --only-source -d acl2=8.4dfsg-2 && mkdir -p /build/acl2-YY69Iy && dpkg-source --no-check -x /*.dsc /build/acl2-YY69Iy/acl2-8.4dfsg && chown -R builduser:builduser /build/acl2-YY69Iy" --customize-hook=chroot "$1" env --unset=TMPDIR runuser builduser -c "cd /build/acl2-YY69Iy/acl2-8.4dfsg && env DEB_BUILD_OPTIONS="parallel=4" LANG="C.UTF-8" LC_ALL="C.UTF-8" LC_COLLATE="C.UTF-8" SOURCE_DATE_EPOCH="1635516393" DEB_BUILD_OPTIONS=nocheck dpkg-buildpackage -uc -a amd64 --build=all" --customize-hook=sync-out /build/acl2-YY69Iy /tmp/acl2-8.4dfsg-29wg_vp2_ bookworm /dev/null deb http://snapshot.notset.fr/archive/debian/20211102T092136Z unstable main I: automatically chosen mode: root I: chroot architecture amd64 is equal to the host's architecture I: automatically chosen format: null I: using /tmp/mmdebstrap.GnqqHQpeqB as tempdir I: running apt-get update... I: downloading packages with apt... I: extracting archives... I: installing essential packages... I: running --essential-hook in shell: sh -c 'chroot "$1" sh -c "apt-get --yes install fakeroot util-linux"' exec /tmp/mmdebstrap.GnqqHQpeqB Reading package lists... Building dependency tree... util-linux is already the newest version (2.37.2-4). The following NEW packages will be installed: fakeroot libfakeroot 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 134 kB of archives. After this operation, 397 kB of additional disk space will be used. Get:1 http://snapshot.notset.fr/archive/debian/20211102T092136Z unstable/main amd64 libfakeroot amd64 1.26-1 [47.3 kB] Get:2 http://snapshot.notset.fr/archive/debian/20211102T092136Z unstable/main amd64 fakeroot amd64 1.26-1 [87.1 kB] debconf: delaying package configuration, since apt-utils is not installed Fetched 134 kB in 0s (1025 kB/s) Selecting previously unselected package libfakeroot:amd64. (Reading database ... (Reading database ... 5% (Reading database ... 10% (Reading database ... 15% (Reading database ... 20% (Reading database ... 25% (Reading database ... 30% (Reading database ... 35% (Reading database ... 40% (Reading database ... 45% (Reading database ... 50% (Reading database ... 55% (Reading database ... 60% (Reading database ... 65% (Reading database ... 70% (Reading database ... 75% (Reading database ... 80% (Reading database ... 85% (Reading database ... 90% (Reading database ... 95% (Reading database ... 100% (Reading database ... 4666 files and directories currently installed.) Preparing to unpack .../libfakeroot_1.26-1_amd64.deb ... Unpacking libfakeroot:amd64 (1.26-1) ... Selecting previously unselected package fakeroot. Preparing to unpack .../fakeroot_1.26-1_amd64.deb ... Unpacking fakeroot (1.26-1) ... Setting up libfakeroot:amd64 (1.26-1) ... Setting up fakeroot (1.26-1) ... update-alternatives: using /usr/bin/fakeroot-sysv to provide /usr/bin/fakeroot (fakeroot) in auto mode Processing triggers for libc-bin (2.32-4) ... I: running special hook: copy-in /usr/share/keyrings/debian-archive-bullseye-automatic.gpg /usr/share/keyrings/debian-archive-bullseye-security-automatic.gpg /usr/share/keyrings/debian-archive-bullseye-stable.gpg /usr/share/keyrings/debian-archive-buster-automatic.gpg /usr/share/keyrings/debian-archive-buster-security-automatic.gpg /usr/share/keyrings/debian-archive-buster-stable.gpg /usr/share/keyrings/debian-archive-keyring.gpg /usr/share/keyrings/debian-archive-removed-keys.gpg /usr/share/keyrings/debian-archive-stretch-automatic.gpg /usr/share/keyrings/debian-archive-stretch-security-automatic.gpg /usr/share/keyrings/debian-archive-stretch-stable.gpg /usr/share/keyrings/debian-ports-archive-keyring-removed.gpg /usr/share/keyrings/debian-ports-archive-keyring.gpg /usr/share/keyrings/debian-keyring.gpg /etc/apt/trusted.gpg.d/ I: running --essential-hook in shell: sh -c 'chroot "$1" sh -c "rm /etc/apt/sources.list && echo 'deb http://snapshot.notset.fr/archive/debian/20211107T145307Z/ bookworm main deb-src http://snapshot.notset.fr/archive/debian/20211107T145307Z/ bookworm main deb http://snapshot.notset.fr/archive/debian/20211102T092136Z/ unstable main' >> /etc/apt/sources.list && apt-get update"' exec /tmp/mmdebstrap.GnqqHQpeqB Get:1 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm InRelease [128 kB] Hit:2 http://snapshot.notset.fr/archive/debian/20211102T092136Z unstable InRelease Ign:3 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main amd64 Packages Ign:3 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main amd64 Packages Ign:3 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main amd64 Packages Get:3 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main Sources [11.7 MB] Get:4 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main amd64 Packages [11.2 MB] Fetched 23.0 MB in 20s (1177 kB/s) Reading package lists... I: installing remaining packages inside the chroot... I: running --customize-hook in shell: sh -c 'chroot "$1" useradd --no-create-home -d /nonexistent -p "" builduser -s /bin/bash' exec /tmp/mmdebstrap.GnqqHQpeqB I: running --customize-hook in shell: sh -c 'chroot "$1" env sh -c "apt-get source --only-source -d acl2=8.4dfsg-2 && mkdir -p /build/acl2-YY69Iy && dpkg-source --no-check -x /*.dsc /build/acl2-YY69Iy/acl2-8.4dfsg && chown -R builduser:builduser /build/acl2-YY69Iy"' exec /tmp/mmdebstrap.GnqqHQpeqB Reading package lists... Need to get 203 MB of source archives. Get:1 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main acl2 8.4dfsg-2 (dsc) [2281 B] Get:2 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main acl2 8.4dfsg-2 (tar) [203 MB] Get:3 http://snapshot.notset.fr/archive/debian/20211107T145307Z bookworm/main acl2 8.4dfsg-2 (diff) [312 kB] Fetched 203 MB in 2min 38s (1288 kB/s) Download complete and in download only mode W: Download is performed unsandboxed as root as file 'acl2_8.4dfsg-2.dsc' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) dpkg-source: info: extracting acl2 in /build/acl2-YY69Iy/acl2-8.4dfsg dpkg-source: info: unpacking acl2_8.4dfsg.orig.tar.gz dpkg-source: info: unpacking acl2_8.4dfsg-2.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 compile_with_split_files dpkg-source: info: applying UTF-8-encoding dpkg-source: info: applying remove-w3-validation-badge dpkg-source: info: applying spelling_corrections_consolidated dpkg-source: info: applying elpa-emacs I: running --customize-hook in shell: sh -c 'chroot "$1" env --unset=TMPDIR runuser builduser -c "cd /build/acl2-YY69Iy/acl2-8.4dfsg && env DEB_BUILD_OPTIONS="parallel=4" LANG="C.UTF-8" LC_ALL="C.UTF-8" LC_COLLATE="C.UTF-8" SOURCE_DATE_EPOCH="1635516393" DEB_BUILD_OPTIONS=nocheck dpkg-buildpackage -uc -a amd64 --build=all"' exec /tmp/mmdebstrap.GnqqHQpeqB dpkg-buildpackage: info: source package acl2 dpkg-buildpackage: info: source version 8.4dfsg-2 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Camm Maguire dpkg-source --before-build . 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 '/build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix' rm -f /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.otl /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.err /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.ps /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.aux rm -f /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.dvi /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.aux /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.log /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/*.idx /build/acl2-YY69Iy/acl2-8.4dfsg/books/interface/infix/.log rm -f *~* *#* workxxx *.o *.tex *.nqtex TAGS *.dvi *.ps *.err *.aux *.log *.idx make[1]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/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 '/build/acl2-YY69Iy/acl2-8.4dfsg' 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 '/build/acl2-YY69Iy/acl2-8.4dfsg' /usr/bin/make clean-books make[1]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' ACL2_WD is /build/acl2-YY69Iy/acl2-8.4dfsg ACL2 is /build/acl2-YY69Iy/acl2-8.4dfsg/saved_acl2 Linux cca5ba070220 5.10.96-1.fc32.qubes.x86_64 #1 SMP Sat Feb 5 23:22:31 CET 2022 x86_64 GNU/Linux cd books ; /usr/bin/make -k ACL2=/build/acl2-YY69Iy/acl2-8.4dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books' ACL2_SYSTEM_BOOKS is /build/acl2-YY69Iy/acl2-8.4dfsg/books /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. Determining ACL2 features (for ACL2 = /build/acl2-YY69Iy/acl2-8.4dfsg/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 Determining whether STP is installed 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 := OS_HAS_STP := USE_QUICKLISP := ACL2_USELESS_RUNES := Done with features. Scanning for books... real 0m0.138s user 0m0.051s sys 0m0.050s Scanning for dependencies... real 1m15.385s user 1m10.992s sys 0m0.892s Done scanning. /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. Reading book deps Makefile-deps created on Fri Mar 25 11:13:05 UTC 2022 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/equivcheck-test.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/equivcheck-test.cert centaur/fgl/tests-ipasir.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/examples/examples.cert projects/smtlink/examples/ringosc.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert] Excluding books that need STP: [kestrel/axe/defthm-stp-tests.cert kestrel/axe/prove-with-stp-tests.cert kestrel/axe/query-tests.cert kestrel/axe/stp-clause-processor-tests.cert kestrel/axe/tactic-prover-tests.cert kestrel/axe/tests-top.cert] Excluding ACL2(r)-only books: [nonstd/arc-length/length-of-a-rectifiable-curve.cert nonstd/circles/area-of-a-circle/area-of-a-circle-1.cert nonstd/circles/area-of-a-circle/area-of-a-circle-2.cert nonstd/circles/circumference-of-a-circle.cert nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/integrals/u-substitution.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert] 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-test.cert centaur/fgl/equivcheck.cert centaur/fgl/greedy-int-slice-diffs.cert centaur/fgl/sat-default.cert centaur/fgl/satlink-sat.cert centaur/fgl/tests-ipasir.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/json.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/c/atc/atc.cert kestrel/c/atc/input-processing.cert kestrel/c/atc/tests/arrays-write.cert kestrel/c/atc/tests/arrays.cert kestrel/c/atc/tests/assign.cert kestrel/c/atc/tests/calls.cert kestrel/c/atc/tests/checksum.cert kestrel/c/atc/tests/conditionals.cert kestrel/c/atc/tests/constants.cert kestrel/c/atc/tests/conversions.cert kestrel/c/atc/tests/int.cert kestrel/c/atc/tests/locvars.cert kestrel/c/atc/tests/loops.cert kestrel/c/atc/tests/mbt.cert kestrel/c/atc/tests/nonstrict.cert kestrel/c/atc/tests/operators.cert kestrel/c/atc/tests/ops-diff-types.cert kestrel/c/atc/top.cert kestrel/c/top.cert kestrel/doc.cert kestrel/hdwallet/top.cert kestrel/hdwallet/wallet-executable.cert kestrel/hdwallet/wallet-tests.cert kestrel/java/atj/atj.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/booleans-deep-guarded.cert kestrel/java/atj/tests/booleans-deep-unguarded.cert kestrel/java/atj/tests/booleans-shallow-guarded.cert kestrel/java/atj/tests/booleans-shallow-unguarded.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/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/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/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/primarrays-shallow-guarded.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/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/rp-rewriter/lib/mult3/demo/demo-1.cert projects/rp-rewriter/lib/mult3/demo/demo-2.cert projects/rp-rewriter/lib/mult3/demo/demo-3.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-doc.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. /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/clean.pl clean.pl: scanning for generated files clean.pl: found 3 targets (0 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 '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/milawa/ACL2' Calculating cert dependencies... Calculating pcert dependencies... Done with dependencies. /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. 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 '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/milawa/ACL2' Cleaning centaur/vl/bin directory Cleaning centaur/vl2014/bin directory Removing extra, explicitly temporary files. rm -rf /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/Makefile-comp /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/Makefile-comp-pre /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/Makefile-deps /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/Makefile-books /build/acl2-YY69Iy/acl2-8.4dfsg/books/build/Makefile-features /build/acl2-YY69Iy/acl2-8.4dfsg/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/2003/kaufmann/support/rtl/ workshops/2004/sumners-ray/support/ projects/apply-model/ projects/apply-model-2/ ; \ do \ if [ -f $dir/Makefile ] ; then \ (cd $dir ; /usr/bin/make clean) ; \ fi ; \ done make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/acl2-YY69Iy/acl2-8.4dfsg/. rm -f defined-syms.lsp rm -f success.txt cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush/tests' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/system/toothbrush' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean-subdirs make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean -C $dir; \ done make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/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 '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/c-files' rm -f sat-input-formater smt-prep zchaff-output-formater minisat-output-formater *~ #*# make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/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 make[6]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/clause-processors rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# rm -f -r sat-temp-files make[6]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/sat-tests' rm -f *.cert *~ *.sexpr *.d *.sot rm -f -r sat-temp-files make[6]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/bv-smt-solver rm -f *.cert *~ *.sexpr *.d *.sot *~ \#*\# *.smt *.prepped rm -fr sat-temp-files rm -f *.bak make[6]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2' make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2/translator make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2/examples/thacker' rm -f tiny.lisp tiny-logic.lisp run-check.txt run-test.log make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2/examples/thacker' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/greve-wilding-vanfleet/support' rm -f consistency-test.lisp make.lisp consistency-test-passed.lisp make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/kaufmann/support/input' rm -f defs-out.lisp defs-eq.lisp lemmas-out.lisp check.txt make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/kaufmann/support/rtl' rm -f model.lisp model-defs.lisp model-eq.lisp model.lisp bvecp.lisp make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2003/kaufmann/support/rtl' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2004/sumners-ray/support rm -f *.rpt rm -f success.txt rm -f run.date run.log run.err make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/apply-model' /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/apply-model' make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/apply-model-2' /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. /usr/bin/which: this version of `which' is deprecated; use `command -v' in scripts instead. make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg/books/projects/apply-model-2' 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 '/build/acl2-YY69Iy/acl2-8.4dfsg/books' make[1]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' 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-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-books-source.lintian-overrides debian/acl2-books.lintian-overrides debian/acl2-doc.lintian-overrides debian/acl2.lintian-overrides debian/elpa-acl2.lintian-overrides rm -f books/centaur/fty/tests/deftagsum-scale.cert.temp books/centaur/fty/tests/deftranssum.cert.temp rm -f books/centaur/vl/kit/test.vlzip books/centaur/getopt/demo2 books/centaur/getopt/demo2-test.ok rm -f debian/elpa-acl2.elpa debian/acl2-pkg.el find books/build/defrec-certdeps -name "*.certdep" -exec rm {} \; dh_clean -XTAGS debian/rules binary-indep /usr/bin/make GCL_ANSI=t LISP=/usr/bin/gcl & j=$! ; tail --retry -f make.log & k=$! ; wait $j ; kill $k tail: warning: --retry only effective for the initial open tail: cannot open 'make.log' for reading: No such file or directory make[1]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' Preparing to build saved_acl2 (log file make.log). Compiling ...tail: 'make.log' has appeared; following new file -*- Mode: auto-revert -*- make[2]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' /usr/bin/make acl2r make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' rm -f TAGS rm -f workxxx echo '(load "init.lisp")' > workxxx echo '(acl2::make-tags)' >> workxxx echo '(acl2::exit-lisp)' >> workxxx /usr/bin/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/which: this version of `which' is deprecated; use `command -v' in scripts instead. /usr/bin/etags 0 0 >rm -f workxxx if [ -f TAGS ] ; then chmod 644 TAGS ; fi /usr/bin/make compile make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' rm -f workxxx echo '(load "init.lisp")' > workxxx echo '(let (#+gcl(compiler::*split-files* 1000000))(acl2::compile-acl2 ))' >> workxxx echo '(acl2::exit-lisp)' >> workxxx /usr/bin/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. /build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c: In function ‘L43’: /build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c:4720:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4720 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c:4876:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4876 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c: In function ‘L440’: /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:40206:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 40206 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:40586:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 40586 | if((Cnil)!=Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:40906:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 40906 | if((Cnil)!=Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:41216:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 41216 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/interface-raw.c: In function ‘L153’: /build/acl2-YY69Iy/acl2-8.4dfsg/interface-raw.c:24486:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 24486 | if((Cnil)!=Cnil){ | ^~ NIL >make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' rm -f acl2-proclaims.lisp /usr/bin/make acl2-proclaims.lisp make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' 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 /usr/bin/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[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' /usr/bin/make compile USE_ACL2_PROCLAIMS=t make[3]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' 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 /usr/bin/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/ >/build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c: In function ‘LI43’: /build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c:4284:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4284 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/serialize-raw.c:4414:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4414 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c: In function ‘L440’: /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:32182:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 32182 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:32499:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 32499 | if((Cnil)!=Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:32769:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 32769 | if((Cnil)!=Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/translate.c:33020:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 33020 | if((Cnil)==Cnil){ | ^~ /build/acl2-YY69Iy/acl2-8.4dfsg/interface-raw.c: In function ‘LI155’: /build/acl2-YY69Iy/acl2-8.4dfsg/interface-raw.c:20331:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 20331 | if((Cnil)!=Cnil){ | ^~ done. Bootstrapping, then saving executable (may take a few minutes) ... NIL >make[4]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[4]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[3]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[2]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' make[2]: Entering directory '/build/acl2-YY69Iy/acl2-8.4dfsg' 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))) "saved_acl2")' >> workxxx echo '(exit-lisp)' >> workxxx /usr/bin/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 526 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 0 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 211 SYMBOL pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).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=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=0).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 316 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 5376 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 5376 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 22 CFUN pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 4 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 586 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 586 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 103 SFUN pages..(T=2).GC finished] [GC for 113 SFUN pages..(T=2).GC finished] [GC for 113 SFUN pages..(T=1).GC finished] [GC for 113 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=1).GC finished] [GC for 123 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=1).GC finished] [GC for 133 SFUN pages..(T=2).GC finished] [GC for 133 SFUN pages..(T=2).GC finished] [GC for 133 SFUN pages..(T=1).GC finished] [GC for 143 SFUN pages..(T=2).GC finished] [GC for 143 SFUN pages..(T=1).GC finished] [GC for 153 SFUN pages..(T=2).GC finished] [GC for 153 SFUN pages..(T=2).GC finished] [GC for 153 SFUN pages..(T=1).GC finished] [GC for 163 SFUN pages..(T=2).GC finished] [GC for 163 SFUN pages..(T=1).GC finished] [GC for 173 SFUN pages..(T=2).GC finished] [GC for 173 SFUN pages..(T=2).GC finished] [GC for 183 SFUN pages..(T=1).GC finished] [GC for 183 SFUN pages..(T=2).GC finished] [GC for 897 CONS pages..(T=2).GC finished] [GC for 897 CONS pages..(T=2).GC finished] [GC for 193 SFUN pages..(T=2).GC finished] [GC for 897 CONS pages..(T=1).GC finished] [GC for 897 CONS pages..(T=1).GC finished] [GC for 897 CONS pages..(T=2).GC finished] [GC for 203 SFUN pages..(T=3).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 907 CONS pages..(T=3).GC finished] [GC for 917 CONS pages..(T=2).GC finished] [GC for 927 CONS pages..(T=2).GC finished] [GC for 937 CONS pages..(T=3).GC finished] [GC for 947 CONS pages..(T=2).GC finished] [GC for 957 CONS pages..(T=2).GC finished] [GC for 967 CONS pages..(T=2).GC finished] [GC for 977 CONS pages..(T=3).GC finished] [GC for 987 CONS pages..(T=2).GC finished] [GC for 997 CONS pages..(T=3).GC finished] [GC for 1007 CONS pages..(T=2).GC finished] [GC for 1017 CONS pages..(T=3).GC finished] [GC for 1027 CONS pages..(T=2).GC finished] [GC for 1037 CONS pages..(T=2).GC finished] [GC for 1047 CONS pages..(T=2).GC finished] [GC for 1057 CONS pages..(T=3).GC finished] [GC for 1067 CONS pages..(T=2).GC finished] [GC for 1077 CONS pages..(T=2).GC finished] [GC for 1087 CONS pages..(T=3).GC finished] [GC for 1097 CONS pages..(T=2).GC finished] [GC for 1107 CONS pages..(T=2).GC finished] [GC for 1117 CONS pages..(T=3).GC finished] [GC for 1127 CONS pages..(T=2).GC finished] [GC for 1137 CONS pages..(T=2).GC finished] [GC for 1147 CONS pages..(T=3).GC finished] [GC for 1157 CONS pages..(T=2).GC finished] [GC for 1167 CONS pages..(T=3).GC finished] [GC for 1177 CONS pages..(T=2).GC finished] [GC for 1187 CONS pages..(T=2).GC finished] [GC for 1197 CONS pages..(T=2).GC finished] [GC for 1207 CONS pages..(T=2).GC finished] [GC for 1217 CONS pages..(T=2).GC finished] [GC for 1227 CONS pages..(T=3).GC finished] [GC for 1237 CONS pages..(T=2).GC finished] [GC for 1247 CONS pages..(T=2).GC finished] [GC for 1257 CONS pages..(T=2).GC finished] [GC for 1267 CONS pages..(T=2).GC finished] [GC for 1277 CONS pages..(T=2).GC finished] [GC for 1287 CONS pages..(T=3).GC finished] [GC for 1297 CONS pages..(T=2).GC finished] [GC for 1307 CONS pages..(T=2).GC finished] [GC for 1317 CONS pages..(T=3).GC finished] [GC for 1327 CONS pages..(T=2).GC finished] [GC for 1337 CONS pages..(T=3).GC finished] [GC for 1347 CONS pages..(T=3).GC finished] [GC for 1357 CONS pages..(T=3).GC finished] [GC for 1367 CONS pages..(T=2).GC finished] [GC for 1377 CONS pages..(T=3).GC finished] [GC for 1387 CONS pages..(T=3).GC finished] [GC for 1397 CONS pages..(T=2).GC finished] [GC for 1407 CONS pages..(T=3).GC finished] [GC for 1417 CONS pages..(T=3).GC finished] [GC for 1427 CONS pages..(T=2).GC finished] [GC for 1437 CONS pages..(T=3).GC finished] [GC for 1447 CONS pages..(T=4).GC finished] [GC for 1457 CONS pages..(T=4).GC finished] [GC for 1467 CONS pages..(T=4).GC finished] [GC for 1477 CONS pages..(T=4).GC finished] [GC for 1487 CONS pages..(T=3).GC finished] [GC for 1497 CONS pages..(T=3).GC finished] [GC for 1507 CONS pages..(T=4).GC finished] [GC for 213 SFUN pages..(T=4).GC finished] [GC for 1517 CONS pages..(T=4).GC finished] [GC for 1527 CONS pages..(T=4).GC finished] [GC for 1537 CONS pages..(T=2).GC finished] [GC for 1547 CONS pages..(T=2).GC finished] [GC for 1557 CONS pages..(T=3).GC finished] [GC for 223 SFUN pages..(T=4).GC finished] [GC for 1557 CONS pages..(T=4).GC finished] [GC for 1567 CONS pages..(T=4).GC finished] [GC for 1577 CONS pages..(T=4).GC finished] [GC for 1587 CONS pages..(T=5).GC finished] [GC for 1597 CONS pages..(T=4).GC finished] [GC for 1607 CONS pages..(T=2).GC finished] [GC for 1617 CONS pages..(T=3).GC finished] [GC for 1627 CONS pages..(T=3).GC finished] [GC for 11008 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 233 SFUN pages..(T=4).GC finished] [GC for 1637 CONS pages..(T=4).GC finished] [GC for 243 SFUN pages..(T=3).GC finished] [GC for 1647 CONS pages..(T=4).GC finished] [GC for 253 SFUN pages..(T=2).GC finished] [GC for 1657 CONS pages..(T=4).GC finished] [GC for 1667 CONS pages..(T=4).GC finished] [GC for 1677 CONS pages..(T=4).GC finished] [GC for 1687 CONS pages..(T=4).GC finished] [GC for 1697 CONS pages..(T=3).GC finished] [GC for 1707 CONS pages..(T=2).GC finished] [GC for 263 SFUN pages..(T=3).GC finished] [GC for 1717 CONS pages..(T=2).GC finished] [GC for 11264 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 1727 CONS pages..(T=3).GC finished] [GC for 1737 CONS pages..(T=2).GC finished] [GC for 1747 CONS pages..(T=3).GC finished] [GC for 273 SFUN pages..(T=3).GC finished] [GC for 1757 CONS pages..(T=3).GC finished] [GC for 1767 CONS pages..(T=3).GC finished] [GC for 11520 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1777 CONS pages..(T=3).GC finished] [GC for 283 SFUN pages..(T=2).GC finished] [GC for 1787 CONS pages..(T=2).GC finished] [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 1797 CONS pages..(T=5).GC finished] [GC for 1807 CONS pages..(T=5).GC finished] [GC for 1817 CONS pages..(T=4).GC finished] [GC for 32 CFUN pages..(T=2).GC finished] [GC for 293 SFUN pages..(T=2).GC finished] [GC for 1827 CONS pages..(T=3).GC finished] [GC for 1837 CONS pages..(T=2).GC finished] [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1847 CONS pages..(T=2).GC finished] [GC for 1857 CONS pages..(T=2).GC finished] [GC for 1867 CONS pages..(T=2).GC finished] [GC for 303 SFUN pages..(T=2).GC finished] [GC for 1877 CONS pages..(T=2).GC finished] [GC for 1887 CONS pages..(T=3).GC finished] [GC for 1887 CONS pages..(T=3).GC finished] [GC for 1897 CONS pages..(T=2).GC finished] [GC for 1907 CONS pages..(T=2).GC finished] [GC for 1917 CONS pages..(T=2).GC finished] [GC for 313 SFUN pages..(T=3).GC finished] [GC for 1927 CONS pages..(T=2).GC finished] [GC for 1937 CONS pages..(T=3).GC finished] [GC for 1947 CONS pages..(T=2).GC finished] [GC for 1957 CONS pages..(T=2).GC finished] [GC for 323 SFUN pages..(T=2).GC finished] [GC for 1967 CONS pages..(T=3).GC finished] [GC for 1977 CONS pages..(T=2).GC finished] [GC for 1987 CONS pages..(T=3).GC finished] [GC for 333 SFUN pages..(T=2).GC finished] [GC for 1987 CONS pages..(T=3).GC finished] [GC for 343 SFUN pages..(T=2).GC finished] [GC for 1997 CONS pages..(T=2).GC finished] [GC for 2007 CONS pages..(T=2).GC finished] [GC for 2017 CONS pages..(T=3).GC finished] [GC for 2027 CONS pages..(T=3).GC finished] [GC for 2037 CONS pages..(T=2).GC finished] [GC for 2047 CONS pages..(T=2).GC finished] [GC for 2057 CONS pages..(T=3).GC finished] [GC for 2067 CONS pages..(T=2).GC finished] [GC for 2077 CONS pages..(T=3).GC finished] [GC for 2087 CONS pages..(T=2).GC finished] [GC for 2097 CONS pages..(T=3).GC finished] [GC for 2107 CONS pages..(T=2).GC finished] [GC for 2117 CONS pages..(T=3).GC finished] [GC for 2127 CONS pages..(T=2).GC finished] [GC for 2137 CONS pages..(T=3).GC finished] [GC for 2147 CONS pages..(T=2).GC finished] [GC for 2157 CONS pages..(T=3).GC finished] [GC for 2167 CONS pages..(T=2).GC finished] [GC for 2177 CONS pages..(T=2).GC finished] [GC for 2187 CONS pages..(T=2).GC finished] [GC for 2197 CONS pages..(T=2).GC finished] [GC for 2207 CONS pages..(T=2).GC finished] [GC for 2217 CONS pages..(T=2).GC finished] [GC for 2227 CONS pages..(T=3).GC finished] [GC for 353 SFUN pages..(T=2).GC finished] [GC for 2237 CONS pages..(T=3).GC finished] [GC for 2247 CONS pages..(T=2).GC finished] [GC for 2257 CONS pages..(T=3).GC finished] [GC for 2267 CONS pages..(T=2).GC finished] [GC for 2277 CONS pages..(T=3).GC finished] [GC for 2287 CONS pages..(T=2).GC finished] [GC for 2297 CONS pages..(T=2).GC finished] [GC for 2307 CONS pages..(T=3).GC finished] [GC for 2317 CONS pages..(T=2).GC finished] [GC for 2327 CONS pages..(T=3).GC finished] [GC for 2337 CONS pages..(T=3).GC finished] [GC for 2347 CONS pages..(T=2).GC finished] [GC for 2357 CONS pages..(T=2).GC finished] [GC for 2367 CONS pages..(T=2).GC finished] [GC for 2377 CONS pages..(T=2).GC finished] [GC for 2387 CONS pages..(T=3).GC finished] [GC for 2397 CONS pages..(T=3).GC finished] [GC for 363 SFUN pages..(T=3).GC finished] [GC for 2407 CONS pages..(T=2).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) (DEFCONST T 'T) (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* *COMMON-LISP-SPECIALS-AND-CONSTANTS* [GC for 2417 CONS pages..(T=3).GC finished] 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 [GC for 2427 CONS pages..(T=3).GC finished] GETPROP GETPROPC *STANDARD-CO* *STANDARD-OI* *STANDARD-CI* [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] INSIST IFF XOR EQ [GC for 2437 CONS pages..(T=3).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] BOOLEANP NIL IMPLIES NIL NIL NOT NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] HIDE REWRITE-EQUIV REAL/RATIONALP COMPLEX/COMPLEX-RATIONALP TRUE-LISTP LIST-MACRO LIST [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] AND-MACRO AND OR-MACRO OR - NIL NIL [GC for 2447 CONS pages..(T=3).GC finished] INTEGER-ABS [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] XXXJOIN + LEN LENGTH [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] ACL2-COUNT LEN LENGTH [GC for 2457 CONS pages..(T=3).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] ACL2-COUNT COND-CLAUSESP COND-MACRO COND [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] EQLABLEP NIL NIL EQLABLE-LISTP EQL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ATOM MAKE-CHARACTER-LIST EQLABLE-ALISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] ALISTP NIL NIL ACONS ENDP CAAR [GC for 2467 CONS pages..(T=3).GC finished] 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 [GC for 2477 CONS pages..(T=3).GC finished] CDDDAR CDDDDR [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] NULL SYMBOL-LISTP NIL SYMBOL-DOUBLET-LISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] REVERSE-STRIP-CARS STRIP-CARS REVERSE-STRIP-CDRS [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRIP-CDRS HARD-ERROR ILLEGAL RETURN-LAST [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] RETURN-LAST-FN MBE1 MUST-BE-EQUAL MBE MBT MBT* BINARY-APPEND APPEND NIL CAR-CDR-ELIM CAR-CONS CDR-CONS [GC for 2487 CONS pages..(T=3).GC finished] CONS-EQUAL NIL CONCATENATE STRING-APPEND [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] STRING-LISTP STRING-APPEND-LST [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] GUARD-CHECK-FN LET-MBE-GUARD-FORM LET-MBE DEFUN-WITH-GUARD-CHECK PROG2$ [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] MEMBER-EQ-EXEC MEMBER-EQL-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] MEMBER-EQUAL MEMBER-EQ NIL NIL MEMBER [GC for 2497 CONS pages..(T=7).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SUBSETP-EQ-EXEC SUBSETP-EQL-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] SUBSETP-EQUAL SUBSETP-EQ NIL NIL SUBSETP SYMBOL-ALISTP NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] CHARACTER-ALISTP NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ASSOC-EQ-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] ASSOC-EQL-EXEC ASSOC-EQUAL ASSOC-EQ NIL NIL ASSOC ASSOC-EQ-EQUAL-ALISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] ASSOC-EQ-EQUAL ASSOC-EQ-CADR [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] ASSOC-EQUAL-CADR <= = [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] /= > >= INT= ZP NIL NIL NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ZIP NIL NIL NIL NTH [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] CHAR SLEEP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] PROPER-CONSP IMPROPER-CONSP * NONNEGATIVE-PRODUCT [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] CONJUGATE ADD-SUFFIX *INLINE-SUFFIX* EC-CALL1 EC-CALL NON-EXEC [GC for 2507 CONS pages..(T=5).GC finished] / CLOSURE ASSOCIATIVITY-OF-+ COMMUTATIVITY-OF-+ [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] 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 [GC for 2517 CONS pages..(T=5).GC finished] COMPLEX-IMPLIES1 COMPLEX-DEFINITION NIL NONZERO-IMAGPART REALPART-IMAGPART-ELIM REALPART-COMPLEX IMAGPART-COMPLEX NIL FORCE *FORCE-XNUME* [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] IMMEDIATE-FORCE-MODEP *IMMEDIATE-FORCE-MODEP-XNUME* CASE-SPLIT NIL DISABLE-FORCING ENABLE-FORCING DISABLE-IMMEDIATE-FORCE-MODEP ENABLE-IMMEDIATE-FORCE-MODEP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SYNP SYNTAXP BIND-FREE EXTRA-INFO NIL *EXTRA-INFO-FN* [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] TAU-SYSTEM *TAU-STATUS-BOOT-STRAP-SETTINGS* NIL *TAU-SYSTEM-XNUME* *TAU-ACL2-NUMBERP-PAIR* *TAU-INTEGERP-PAIR* *TAU-RATIONALP-PAIR* *TAU-BOOLEANP-PAIR* *TAU-NATP-PAIR* *TAU-BITP-PAIR* *TAU-POSP-PAIR* *TAU-MINUSP-PAIR* INTEGER-0 INTEGER-1 INTEGER-STEP LOWEST-TERMS NIL BOOLEANP-CHARACTERP CHARACTERP-PAGE [GC for 2527 CONS pages..(T=4).GC finished] CHARACTERP-TAB CHARACTERP-RUBOUT CHARACTERP-RETURN [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] NO-DUPLICATESP-EQ-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] NO-DUPLICATESP-EQL-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQ NIL NIL NO-DUPLICATESP R-EQLABLE-ALISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] R-SYMBOL-ALISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] RASSOC-EQ-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] RASSOC-EQL-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] RASSOC-EQUAL RASSOC-EQ NIL NIL RASSOC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] IFIX RFIX [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] REALFIX [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] NFIX 1+ 1- NATP NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] NAT-ALISTP NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] BITP NIL NIL POSP NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] O-FINP O-INFP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] O-FIRST-EXPT [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] O-FIRST-COEFF [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] O-RST [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] O O<= O>= [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] O-P NIL NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] MAKE-ORD *STANDARD-CHARS* [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] STANDARD-CHAR-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] STANDARD-CHAR-P+ [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] STANDARD-CHAR-LISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] CHARACTER-LISTP NIL NIL COERCE-INVERSE-1 COERCE-INVERSE-2 CHARACTER-LISTP-COERCE NIL [GC for 2547 CONS pages..(T=4).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] ALPHA-CHAR-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] UPPER-CASE-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] LOWER-CASE-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] CHAR-UPCASE [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] CHAR-DOWNCASE NIL NIL NIL NIL NIL NIL NIL NIL NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] STRING-DOWNCASE1 NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING-DOWNCASE [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] STRING-UPCASE1 NIL [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING-UPCASE [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] OUR-DIGIT-CHAR-P DIGIT-CHAR-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] CHAR-EQUAL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=3).GC finished] ATOM-LISTP NIL NIL GOOD-ATOM-LISTP NIL NIL [GC for 2557 CONS pages..(T=3).GC finished] STANDARD-STRING-P1 STANDARD-STRING-P [GC for 2567 CONS pages..(T=3).GC finished] STANDARD-STRING-LISTP STRING-EQUAL1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING-EQUAL MEMBER-STRING-EQUAL STANDARD-STRING-ALISTP NIL [GC for 373 SFUN pages..(T=3).GC finished] ASSOC-STRING-EQUAL LIST*-MACRO LIST* THROW-OR-ATTACH-CALL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] NULL-BODY-ER *MAIN-LISP-PACKAGE-NAME* *INITIAL-KNOWN-PACKAGE-ALIST* STRINGP-SYMBOL-PACKAGE-NAME SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL SYMBOLP-PKG-WITNESS INTERN INTERN$ KEYWORDP NIL INTERN-IN-PACKAGE-OF-SYMBOL-SYMBOL-NAME NIL *PKG-WITNESS-NAME* SYMBOL-NAME-PKG-WITNESS SYMBOL-PACKAGE-NAME-PKG-WITNESS-NAME [GC for 2577 CONS pages..(T=4).GC finished] MEMBER-SYMBOL-NAME NIL NIL 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 [GC for 2587 CONS pages..(T=3).GC finished] [GC for 2597 CONS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 2607 CONS pages..(T=3).GC finished] T NO-DUPLICATESP-EQ-PKG-IMPORTS COMPLETION-OF-PKG-IMPORTS NIL ACL2-INPUT-CHANNEL-PACKAGE ACL2-OUTPUT-CHANNEL-PACKAGE ACL2-PACKAGE KEYWORD-PACKAGE [GC for 2617 CONS pages..(T=3).GC finished] STRING-IS-NOT-CIRCULAR NIL-IS-NOT-CIRCULAR NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] CONS-WITH-HINT REMOVE-EQ-EXEC REMOVE-EQL-EXEC REMOVE-EQUAL [GC for 2627 CONS pages..(T=3).GC finished] REMOVE-EQ NIL NIL REMOVE [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] REMOVE1-EQ-EXEC REMOVE1-EQL-EXEC REMOVE1-EQUAL REMOVE1-EQ NIL NIL [GC for 2627 CONS pages..(T=3).GC finished] REMOVE1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).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 [GC for 2637 CONS pages..(T=3).GC finished] FIFTH SIXTH SEVENTH EIGHTH NINTH TENTH REST IDENTITY REVAPPEND NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REVERSE PAIRLIS$-TAILREC PAIRLIS$ NIL NIL [GC for 2637 CONS pages..(T=4).GC finished] SET-DIFFERENCE-EQ-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SET-DIFFERENCE-EQL-EXEC SET-DIFFERENCE-EQUAL SET-DIFFERENCE-EQ NIL NIL SET-DIFFERENCE$ *WINDOW-DESCRIPTIONS* *VALID-OUTPUT-NAMES* LISTP *SUMMARY-TYPES* WITH-EVISC-TUPLE LAST [GC for 2647 CONS pages..(T=3).GC finished] FIRST-N-AC NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] TAKE BUTLAST MUTUAL-RECURSION-GUARDP COLLECT-CADRS-WHEN-CAR-MEMBER-EQ VALUE LEGAL-CONSTANTP1 [GC for 2657 CONS pages..(T=7).GC finished] VALUE-TRIPLE ASSERT-EVENT EVENT-KEYWORD-NAME [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] EVENT-KEYWORD-NAME-LST ADD-TO-SET-EQ-EXEC [GC for 2657 CONS pages..(T=4).GC finished] ADD-TO-SET-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] ADD-TO-SET-EQUAL ADD-TO-SET-EQ ADD-TO-SET-EQL NIL NIL NIL ADD-TO-SET KEYWORD-VALUE-LISTP NIL THROW-NONEXEC-ERROR EVENS ODDS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] MV-NTH MAKE-MV-NTHS MV MV? MV-LET MV?-LET LEGAL-CASE-CLAUSESP CASE-TEST [GC for 2657 CONS pages..(T=4).GC finished] CASE-LIST [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] CASE-LIST-CHECK CASE NONNEGATIVE-INTEGER-QUOTIENT TRUE-LIST-LISTP NIL [GC for 2667 CONS pages..(T=3).GC finished] LEGAL-LET*-P WELL-FORMED-TYPE-DECLS-P [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SYMBOL-LIST-LISTP GET-TYPE-DECLS [GC for 2667 CONS pages..(T=4).GC finished] LET*-MACRO COLLECT-CDRS-WHEN-CAR-EQ [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] APPEND-LST RESTRICT-ALIST LET* PROGN [GC for 2677 CONS pages..(T=3).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] LOGNOT DIGIT-TO-CHAR PRINT-BASE-P EXPLODE-NONNEGATIVE-INTEGER [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] MAKE-VAR-LST1 MAKE-VAR-LST NTHCDR NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] UNION-EQ-EXEC UNION-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).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$ *XARGS-KEYWORDS* [GC for 2677 CONS pages..(T=4).GC finished] PLAUSIBLE-DCLSP1 PLAUSIBLE-DCLSP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] STRIP-KEYWORD-LIST STRIP-DCLS1 STRIP-DCLS [GC for 2687 CONS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] FETCH-DCL-FIELDS2 FETCH-DCL-FIELDS1 FETCH-DCL-FIELDS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] FETCH-DCL-FIELD WITH-OUTPUT-ON-OFF-BINDING-VAL WITH-OUTPUT-ON-OFF-ARG [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] MSGP CTXP [GC for 2687 CONS pages..(T=4).GC finished] [GC for 2697 CONS pages..(T=4).GC finished] WITH-OUTPUT-FN WITH-OUTPUT! WITH-OUTPUT [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] DEFUN-NX-DCLS DEFUN-NX-FORM [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] DEFUN-NX-FN DEFUN-NX DEFUND-NX UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ASSOC-KEYWORD PROGRAM-DECLARED-P2 PROGRAM-DECLARED-P1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] PROGRAM-DECLARED-P SOME-PROGRAM-DECLARED-P [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] PAIRLIS-X1 PAIRLIS-X2 APPEND? MUTUAL-RECURSION VARIABLEP NVARIABLEP FQUOTEP QUOTEP *T* *NIL* *0* *1* *-1* *2* [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] KWOTE MAYBE-KWOTE [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] KWOTE-LST UNQUOTE T [GC for 2049 RELOCATABLE-BLOCKS pages..(T=5).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] (PSEUDO-TERMP PSEUDO-TERM-LISTP) NIL T PSEUDO-TERM-LIST-LISTP NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] LAMBDA-OBJECT-FORMALS LAMBDA-OBJECT-DCL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] LAMBDA-OBJECT-BODY LAMBDA-OBJECT-SHAPEP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] MAKE-LAMBDA-OBJECT FFN-SYMB FN-SYMB FARGS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] FARGN1 FARGN [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] (ALL-VARS1 ALL-VARS1-LST) NIL ALL-VARS TRANSLATE-AND-TEST [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] INTERSECTP-EQ-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] INTERSECTP-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] INTERSECTP-EQUAL INTERSECTP-EQ NIL NIL INTERSECTP CHK-NO-STOBJ-ARRAY-INDEX-ALIASING [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] MAKE-FMT-BINDINGS *BASE-10-CHARS* WARNING$ MSG CHECK-VARS-NOT-FREE-TEST CHECK-VARS-NOT-FREE [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] ER-PROGN-FN ER-PROGN [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] POSITION-AC-EQ-EXEC NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] POSITION-AC-EQL-EXEC NIL POSITION-EQUAL-AC NIL POSITION-AC-EQUAL POSITION-EQ-AC POSITION-AC-EQ NIL NIL POSITION-AC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] POSITION-EQ-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] POSITION-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] POSITION-EQUAL POSITION-EQ NIL NIL POSITION [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] ASH NIL NIL NIL NIL CHAR-CODE-LINEAR CODE-CHAR-TYPE CODE-CHAR-CHAR-CODE-IS-IDENTITY CHAR-CODE-CODE-CHAR-IS-IDENTITY [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] CHAR< CHAR> [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] CHAR<= [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] CHAR>= STRING<-L [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING< STRING> [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] STRING<= [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] STRING>= SYMBOL< NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] SUBSTITUTE-AC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] SUBSTITUTE NIL NIL SUBLIS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] SUBST PPROGN PROGN$ ACL2-UNWIND-PROTECT WHEN-LOGIC IN-PACKAGE DEFPKG DEFUN DEFUNS VERIFY-TERMINATION VERIFY-TERMINATION-BOOT-STRAP [GC for 2707 CONS pages..(T=7).GC finished] VERIFY-GUARDS VERIFY-GUARDS+ DEFMACRO DEFCONST DEFTHM ER DEFTHMD DEFAXIOM DEFLABEL DEFTHEORY DEFTHY DEFTHEORY-STATIC DEFSTOBJ IN-THEORY IN-ARITHMETIC-THEORY REGENERATE-TAU-DATABASE [GC for 2717 CONS pages..(T=6).GC finished] 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 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] PLIST-WORLDP NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] PUTPROP *ACL2-PROPERTY-UNBOUND* [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] GETPROP-DEFAULT [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] FGETPROP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SGETPROP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ORDERED-SYMBOL-ALISTP NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ADD-PAIR [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REMOVE1-ASSOC-EQ-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REMOVE1-ASSOC-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQ NIL NIL REMOVE1-ASSOC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REMOVE-ASSOC-EQ-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] REMOVE-ASSOC-EQL-EXEC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] REMOVE-ASSOC-EQUAL REMOVE-ASSOC-EQ NIL NIL REMOVE-ASSOC [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] GETPROPS1 [GC for 2727 CONS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] GETPROPS NIL NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] HAS-PROPSP1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] HAS-PROPSP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] EXTEND-WORLD [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] RETRACT-WORLD [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] GLOBAL-VAL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] FUNCTION-SYMBOLP FCONS-TERM* [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] CONJOIN2 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] CONJOIN [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] CONJOIN-UNTRANSLATED-TERMS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] DISJOIN2 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] DISJOIN [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] DISJOIN-LST [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] KWOTE? CONJOIN? <=? >? [GC for 2737 CONS pages..(T=4).GC finished] DISJOIN? TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN TRANSLATE-DECLARATION-TO-GUARD/INTEGER [GC for 2747 CONS pages..(T=7).GC finished] WEAK-SATISFIES-TYPE-SPEC-P [GC for 2757 CONS pages..(T=5).GC finished] [GC for 2767 CONS pages..(T=4).GC finished] TRANSLATE-DECLARATION-TO-GUARD1-GEN TRANSLATE-DECLARATION-TO-GUARD1 [GC for 2777 CONS pages..(T=3).GC finished] (TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST) TRANSLATE-DECLARATION-TO-GUARD TRANSLATE-DECLARATION-TO-GUARD-LST [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] THE-CHECK THE-FN THE THE-CHECK-FOR-*1* THE-FN-FOR-*1* THE-FOR-*1* *MAXIMUM-POSITIVE-32-BIT-INTEGER* BOUNDED-INTEGER-ALISTP NIL NIL NIL F-GET-GLOBAL [GC for 2777 CONS pages..(T=4).GC finished] ARRAY1P NIL NIL BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P NIL NIL [GC for 2777 CONS pages..(T=6).GC finished] HEADER DIMENSIONS MAXIMUM-LENGTH DEFAULT [GC for 2777 CONS pages..(T=5).GC finished] AREF1 [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] COMPRESS11 ARRAY-ORDER COMPRESS1 NIL ; (DEFUN ACL2_*1*_ACL2::ASET1 ...) is being compiled. ;; The variable STATE is undefined. ;; The compiler will assume this variable is a global. [GC for 2777 CONS pages..(T=5).GC finished] ASET1 ASET1-TRUSTED AREF2 COMPRESS211 [GC for 2787 CONS pages..(T=8).GC finished] COMPRESS21 COMPRESS2 NIL ; (DEFUN ACL2_*1*_ACL2::ASET2 ...) is being compiled. ;; The variable STATE is undefined. ;; The compiler will assume this variable is a global. ASET2 FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 [GC for 2787 CONS pages..(T=5).GC finished] CDRN MV-LIST SWAP-STOBJS [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] UPDATE-NTH 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 383 SFUN pages..(T=4).GC finished] NAT-LISTP NIL 32-BIT-INTEGER-LISTP NIL OPEN-INPUT-CHANNELS UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS UPDATE-OPEN-OUTPUT-CHANNELS GLOBAL-TABLE [GC for 383 SFUN pages..(T=5).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] UPDATE-GLOBAL-TABLE T-STACK UPDATE-T-STACK 32-BIT-INTEGER-STACK UPDATE-32-BIT-INTEGER-STACK BIG-CLOCK-ENTRY [GC for 383 SFUN pages..(T=5).GC finished] UPDATE-BIG-CLOCK-ENTRY IDATES UPDATE-IDATES ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK [GC for 383 SFUN pages..(T=7).GC finished] [GC for 42 CFUN pages..(T=8).GC finished] UPDATE-FILE-CLOCK [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] READABLE-FILES WRITTEN-FILES [GC for 2049 RELOCATABLE-BLOCKS pages..(T=7).GC finished] UPDATE-WRITTEN-FILES READ-FILES UPDATE-READ-FILES WRITEABLE-FILES LIST-ALL-PACKAGE-NAMES-LST UPDATE-LIST-ALL-PACKAGE-NAMES-LST [GC for 2787 CONS pages..(T=4).GC finished] 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 INIT-IPRINT-AR *IPRINT-SOFT-BOUND-DEFAULT* *IPRINT-HARD-BOUND-DEFAULT* [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT *FMT-SOFT-RIGHT-MARGIN-DEFAULT* *FMT-HARD-RIGHT-MARGIN-DEFAULT* *INITIAL-GLOBAL-TABLE* T WITH-INFIXP-NIL ALL-BOUNDP KNOWN-PACKAGE-ALISTP NIL TIMER-ALISTP NIL TYPED-IO-LISTP NIL *FILE-TYPES* [GC for 2797 CONS pages..(T=6).GC finished] OPEN-CHANNEL1 NIL OPEN-CHANNEL-LISTP OPEN-CHANNELS-P NIL FILE-CLOCK-P NIL READABLE-FILE NIL READABLE-FILES-LISTP NIL [GC for 383 SFUN pages..(T=4).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] READABLE-FILES-P NIL WRITTEN-FILE NIL WRITTEN-FILE-LISTP NIL WRITTEN-FILES-P NIL READ-FILE-LISTP1 NIL READ-FILE-LISTP NIL [GC for 383 SFUN pages..(T=4).GC finished] READ-FILES-P NIL WRITABLE-FILE-LISTP1 NIL WRITABLE-FILE-LISTP NIL WRITEABLE-FILES-P NIL [GC for 2807 CONS pages..(T=4).GC finished] STATE-P1 NIL STATE-P NIL NIL BUILD-STATE *DEFAULT-STATE* [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE NIL GLOBAL-TABLE-CARS1 GLOBAL-TABLE-CARS BOUNDP-GLOBAL1 [GC for 383 SFUN pages..(T=4).GC finished] BOUNDP-GLOBAL F-BOUNDP-GLOBAL MAKUNBOUND-GLOBAL GET-GLOBAL PUT-GLOBAL F-PUT-GLOBAL *INITIAL-LD-SPECIAL-BINDINGS* ALWAYS-BOUNDP-GLOBAL [GC for 2817 CONS pages..(T=6).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] STATE-GLOBAL-LET*-BINDINGS-P STATE-GLOBAL-LET*-GET-GLOBALS STATE-GLOBAL-LET*-PUT-GLOBALS [GC for 2817 CONS pages..(T=5).GC finished] STATE-GLOBAL-LET*-CLEANUP WITH-PARALLELISM-HAZARD-WARNINGS WARN-ABOUT-PARALLELISM-HAZARD WITH-ENSURED-PARALLELISM-FINISHING STATE-GLOBAL-LET* :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL :EMPTY-ENCAPSULATE NIL NIL :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL NIL INTEGER-RANGE-P NIL SIGNED-BYTE-P UNSIGNED-BYTE-P NIL NIL NIL THE-FIXNUM [GC for 2817 CONS pages..(T=10).GC finished] ZPF NIL NIL NIL NIL NIL NIL NIL :EMPTY-ENCAPSULATE LOGAND LOGEQV LOGIOR LOGXOR INTEGER-LENGTH BINARY-LOGAND [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] LOGNAND BINARY-LOGIOR LOGORC1 LOGORC2 LOGANDC1 LOGANDC2 [GC for 383 SFUN pages..(T=5).GC finished] BINARY-LOGEQV BINARY-LOGXOR LOGNOR 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* [GC for 2817 CONS pages..(T=4).GC finished] *BOOLE-SET* *BOOLE-XOR* BOOLE$ [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] SET-FORMS-FROM-BINDINGS *PRINT-CONTROL-DEFAULTS* ALIST-DIFFERENCE-EQ WITH-PRINT-DEFAULTS RESET-PRINT-CONTROL EXPLODE-ATOM NIL [GC for 2827 CONS pages..(T=6).GC finished] EXPLODE-ATOM+ NIL NIL NIL NIL OPEN-INPUT-CHANNEL-P1 OPEN-OUTPUT-CHANNEL-P1 [GC for 2837 CONS pages..(T=9).GC finished] OPEN-INPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-ANY-P1 OPEN-OUTPUT-CHANNEL-ANY-P [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES FREE-VAR-RUNES NIL *DIRECTORY-SEPARATOR* *DIRECTORY-SEPARATOR-STRING* OS-ER OS [GC for 2837 CONS pages..(T=5).GC finished] ABSOLUTE-PATHNAME-STRING-P ILLEGAL-RULER-EXTENDERS-VALUES TABLE-ALIST RULER-EXTENDERS-MSG-AUX [GC for 2837 CONS pages..(T=8).GC finished] RULER-EXTENDERS-MSG [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] 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* TTAG [GC for 2837 CONS pages..(T=8).GC finished] GET-REGISTER-INVARIANT-RISK-WORLD ACL2-DEFAULTS-TABLE ACL2-DEFAULTS-TABLE PRINT-CASE ACL2-PRINT-CASE CHECK-PRINT-CASE SET-PRINT-CASE PRINT-BASE ACL2-PRINT-BASE PRINT-RADIX ACL2-PRINT-RADIX CHECK-PRINT-BASE [GC for 2847 CONS pages..(T=8).GC finished] SET-PRINT-BASE [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX SET-PRINT-READABLY [GC for 383 SFUN pages..(T=3).GC finished] CHECK-NULL-OR-NATP SET-PRINT-LENGTH SET-PRINT-LEVEL SET-PRINT-LINES [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SET-PRINT-RIGHT-MARGIN RAW-PRINT-VARS-ALIST *RAW-PRINT-VARS-ALIST* PRINC$ [GC for 2857 CONS pages..(T=4).GC finished] WRITE-BYTE$ W GET-SERIALIZE-CHARACTER HONS-ENABLEDP [GC for 2857 CONS pages..(T=4).GC finished] SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] SET-SERIALIZE-CHARACTER-SYSTEM NIL NIL PRINT-OBJECT$+-ALIST MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL [GC for 2867 CONS pages..(T=4).GC finished] OPEN-INPUT-CHANNEL NIL NIL NIL NIL CLOSE-INPUT-CHANNEL [GC for 2867 CONS pages..(T=6).GC finished] OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL! ASSERT$ ASSERT* [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] COMMENT-WINDOW-CO FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! PAIRLIS2 CW CW! CW-PRINT-BASE-RADIX CW-PRINT-BASE-RADIX! SUBSEQ-LIST [GC for 383 SFUN pages..(T=7).GC finished] SUBSEQ LOCK-SYMBOL-NAME-P ASSIGN-LOCK LOCK-TABLE WITH-LOCK DEFLOCK WITH-OUTPUT-LOCK WITH-LOCAL-STATE-LOCK [GC for 2867 CONS pages..(T=6).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] GET-OUTPUT-STREAM-STRING$-FN GET-OUTPUT-STREAM-STRING$ CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ READ-CHAR$ [GC for 2877 CONS pages..(T=4).GC finished] PEEK-CHAR$ READ-BYTE$ RAW-MODE-P READ-OBJECT [GC for 2877 CONS pages..(T=4).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] READ-OBJECT-WITH-CASE READ-OBJECT-SUPPRESS *SUSPICIOUSLY-FIRST-NUMERIC-CHARS* *SUSPICIOUSLY-FIRST-HEX-CHARS* *HEX-CHARS* *LETTER-CHARS* *SLASHABLE-CHARS* SOME-SLASHABLE PRIN1-WITH-SLASHES1 [GC for 2877 CONS pages..(T=4).GC finished] PRIN1-WITH-SLASHES SUSPICIOUSLY-FIRST-NUMERIC-CHARS NUMERIC-CHARS MAY-NEED-SLASHES1 NIL [GC for 2887 CONS pages..(T=4).GC finished] MAY-NEED-SLASHES-FN MAY-NEED-SLASHES NEEDS-SLASHES [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] T-STACK-LENGTH1 T-STACK-LENGTH MAKE-LIST-AC MAKE-LIST EXTEND-T-STACK :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=4).GC finished] MSWINDOWS-DRIVE1 MSWINDOWS-DRIVE SHRINK-T-STACK [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] AREF-T-STACK ASET-T-STACK 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH ; (DEFUN ACL2_*1*_ACL2::EXTEND-32-BIT-INTEGER-STACK ...) is being compiled. ;; The variable STATE is undefined. ;; The compiler will assume this variable is a global. [GC for 383 SFUN pages..(T=3).GC finished] EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK ; (DEFUN ACL2_*1*_ACL2::ASET-32-BIT-INTEGER-STACK ...) is being compiled. ;; The variable STATE is undefined. ;; The compiler will assume this variable is a global. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] ASET-32-BIT-INTEGER-STACK F-BIG-CLOCK-NEGATIVE-P F-DECREMENT-BIG-CLOCK BIG-CLOCK-NEGATIVE-P DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES USER-STOBJ-ALIST [GC for 383 SFUN pages..(T=4).GC finished] UPDATE-USER-STOBJ-ALIST POWER-EVAL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] READ-IDATE READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR GETENV$ [GC for 383 SFUN pages..(T=8).GC finished] SETENV$ RANDOM$ NIL NIL NIL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] SYS-CALL NIL SYS-CALL-STATUS :EMPTY-ENCAPSULATE NIL NIL SYS-CALL+ SYS-CALL* NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2887 CONS pages..(T=7).GC finished] MAIN-TIMER [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] PUT-ASSOC-EQ-EXEC PUT-ASSOC-EQL-EXEC PUT-ASSOC-EQUAL PUT-ASSOC-EQ PUT-ASSOC-EQL NIL NIL PUT-ASSOC NIL NIL NIL SET-TIMER [GC for 383 SFUN pages..(T=8).GC finished] GET-TIMER NIL PUSH-TIMER NIL NIL NIL NIL NIL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] POP-TIMER ADD-TIMERS NIL NIL NIL NIL NIL NIL NIL NIL INCREMENT-TIMER [GC for 2897 CONS pages..(T=9).GC finished] PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER NIL SET-PRINT-BASE-RADIX [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P PRIN1$ [GC for 2907 CONS pages..(T=6).GC finished] NIL CURRENT-PACKAGE NIL *INITIAL-UNTOUCHABLE-FNS* *INITIAL-UNTOUCHABLE-VARS* LD-SKIP-PROOFSP ASSIGN @ SUBST-FOR-NTH-ARG THE-MV THE2S [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC [GC for 383 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 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] GET-ENFORCE-REDUNDANCY DEFAULT-VERIFY-GUARDS-EAGERNESS-FROM-TABLE DEFAULT-VERIFY-GUARDS-EAGERNESS SET-VERIFY-GUARDS-EAGERNESS DEFAULT-COMPILE-FNS SET-COMPILE-FNS SET-COMPILER-ENABLED [GC for 2907 CONS pages..(T=5).GC finished] SET-PORT-FILE-ENABLED DEFAULT-MEASURE-FUNCTION SET-MEASURE-FUNCTION [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] DEFAULT-WELL-FOUNDED-RELATION SET-WELL-FOUNDED-RELATION DEFAULT-DEFUN-MODE-FROM-TABLE DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE LOGIC PROGRAM INVISIBLE-FNS-TABLE SET-INVISIBLE-FNS-TABLE [GC for 383 SFUN pages..(T=9).GC finished] UNARY-FUNCTION-SYMBOL-LISTP [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).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 REMOVE1-ASSOC-STRING-EQUAL TOGGLE-INHIBIT-WARNING! TOGGLE-INHIBIT-WARNING SET-INHIBIT-OUTPUT-LST SET-INHIBITED-SUMMARY-TYPES SET-STATE-OK SET-LET*-ABSTRACTIONP SET-LET*-ABSTRACTION [GC for 2917 CONS pages..(T=10).GC finished] LET*-ABSTRACTIONP *INITIAL-BACKCHAIN-LIMIT* *INITIAL-DEFAULT-BACKCHAIN-LIMIT* SET-BACKCHAIN-LIMIT BACKCHAIN-LIMIT SET-DEFAULT-BACKCHAIN-LIMIT [GC for 2927 CONS pages..(T=7).GC finished] DEFAULT-BACKCHAIN-LIMIT [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] STEP-LIMIT-FROM-TABLE SET-PROVER-STEP-LIMIT *DEFAULT-REWRITE-STACK-LIMIT* SET-REWRITE-STACK-LIMIT REWRITE-STACK-LIMIT CASE-SPLIT-LIMITATIONS SR-LIMIT CASE-LIMIT SET-CASE-SPLIT-LIMITATIONS *INITIAL-ACL2-DEFAULTS-TABLE* [GC for 383 SFUN 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 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] MATCH-FREE-OVERRIDE ADD-MATCH-FREE-OVERRIDE ADD-INCLUDE-BOOK-DIR DELETE-INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR!-TABLE 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 2937 CONS pages..(T=6).GC finished] TAU-AUTO-MODEP SET-TAU-AUTO-MODE [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=7).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 MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE [GC for 2947 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 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 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 [GC for 2957 CONS pages..(T=8).GC finished] 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 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] TRUE-LIST-FIX :EMPTY-ENCAPSULATE NIL FIX-TRUE-LIST MACRO-ALIASES-TABLE NIL BOOLEAN-LISTP NIL NIL NIL COMPLETION-OF-+ NIL NIL COMPLETION-OF-* NIL NIL COMPLETION-OF-UNARY-MINUS NIL COMPLETION-OF-UNARY-/ NIL COMPLETION-OF-< NIL NIL COMPLETION-OF-CAR NIL COMPLETION-OF-CDR NIL NIL COMPLETION-OF-CHAR-CODE NIL COMPLETION-OF-CODE-CHAR NIL COMPLETION-OF-COMPLEX NIL NIL NIL NIL NIL NIL [GC for 2967 CONS pages..(T=4).GC finished] T COMPLETION-OF-COERCE NIL NIL NIL NIL COMPLETION-OF-DENOMINATOR NIL COMPLETION-OF-IMAGPART NIL COMPLETION-OF-INTERN-IN-PACKAGE-OF-SYMBOL NIL COMPLETION-OF-NUMERATOR NIL COMPLETION-OF-REALPART NIL COMPLETION-OF-SYMBOL-NAME NIL COMPLETION-OF-SYMBOL-PACKAGE-NAME NIL DOUBLE-REWRITE [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] CHK-WITH-PROVER-TIME-LIMIT-ARG WITH-PROVER-TIME-LIMIT1 WITH-PROVER-TIME-LIMIT CATCH-TIME-LIMIT5 *INTERRUPT-STRING* 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 383 SFUN pages..(T=4).GC finished] ABORT! A! [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=4).GC finished] P! NIL BIND-ACL2-TIME-LIMIT OUR-WITH-TERMINAL-INPUT WORMHOLE1 WORMHOLE-P DUPLICATES [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] SET-EQUALP-EQUAL |Access METAFUNCTION-CONTEXT record field UNIFY-SUBST| |Access REWRITE-CONSTANT record field CURRENT-CLAUSE| RECORD-ERROR RECORD-ACCESSOR-FUNCTION-NAME ACCESS [GC for 2977 CONS pages..(T=9).GC finished] MFC-CLAUSE [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP MFC-TYPE-ALIST [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] MFC-ANCESTORS MFC-UNIFY-SUBST MFC-WORLD NIL NIL BAD-ATOM NIL NIL BOOLEANP-BAD-ATOM<= BAD-ATOM<=-ANTISYMMETRIC BAD-ATOM<=-TRANSITIVE BAD-ATOM<=-TOTAL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] ALPHORDER LEXORDER NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL MERGE-LEXORDER NIL NIL NIL [GC for 2987 CONS pages..(T=8).GC finished] MERGE-SORT-LEXORDER [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] IF* RESIZE-LIST-EXEC RESIZE-LIST NIL NIL E/D-FN E/D 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 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.16 seconds (prove: 0.00, print: 0.01, other: 0.15) 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.06 seconds (prove: 0.00, print: 0.00, other: 0.06) 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.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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 2997 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. Summary Form: ( DEFUN CHAR ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.15 seconds (prove: 0.00, print: 0.01, other: 0.14) 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. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN EQLABLE-ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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))). 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)))). [GC for 3007 CONS pages..(T=10).GC finished] 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. Summary Form: ( DEFUN ASSOC-EQL-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION EQL) (:DEFINITION EQLABLE-ALISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 0.26 seconds (prove: 0.10, print: 0.00, other: 0.16) 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.06 seconds (prove: 0.00, print: 0.00, other: 0.06) 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. [GC for 3017 CONS pages..(T=8).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] Summary Form: ( DEFUN ASSOC-EQUAL ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT)) Time: 0.32 seconds (prove: 0.00, print: 0.01, other: 0.31) 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.... 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 3017 CONS pages..(T=7).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))). 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))). [GC for 3017 CONS pages..(T=9).GC finished] 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))). 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)). [GC for 3017 CONS pages..(T=8).GC finished] 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)). 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)). 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)). [GC for 3017 CONS pages..(T=8).GC finished] 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)). 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)). [GC for 3017 CONS pages..(T=8).GC finished] 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 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)). [GC for 3017 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 *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 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))). [GC for 3017 CONS pages..(T=6).GC finished] 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))). 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. 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: 0.78 seconds (prove: 0.56, print: 0.05, other: 0.17) 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. [GC for 3017 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN NFIX ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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.05 seconds (prove: 0.00, print: 0.00, other: 0.05) IFIX 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) 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), primitive type reasoning and the :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+, 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.... 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)))). [GC for 3017 CONS pages..(T=8).GC finished] 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. 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) (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+) (: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.26 seconds (prove: 0.08, print: 0.01, other: 0.17) Prover steps counted: 507 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. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN FLOOR ...) Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT)) Time: 0.28 seconds (prove: 0.00, print: 0.00, other: 0.28) 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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. Summary Form: ( DEFUN STRING-APPEND ...) Rules: ((:DEFINITION STRING-APPEND) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.17 seconds (prove: 0.00, print: 0.01, other: 0.16) 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.... [GC for 3017 CONS pages..(T=6).GC finished] 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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) 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)). 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. [GC for 3027 CONS pages..(T=6).GC finished] 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. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] Summary Form: ( DEFUN FGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.30 seconds (prove: 0.06, print: 0.00, other: 0.24) 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))). 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))). [GC for 3027 CONS pages..(T=6).GC finished] 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. Summary Form: ( DEFUN SGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.24 seconds (prove: 0.07, print: 0.00, other: 0.17) 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.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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)). [GC for 3037 CONS pages..(T=8).GC finished] 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. Summary Form: ( DEFUN STRIP-CARS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.17 seconds (prove: 0.08, print: 0.01, other: 0.08) 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. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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))). 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. [GC for 3037 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION SYMBOL-ALISTP)) Time: 0.23 seconds (prove: 0.00, print: 0.01, other: 0.22) 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. Summary Form: ( DEFUN TABLE-ALIST ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) TABLE-ALIST End of Encapsulated Events. [GC for 383 SFUN pages..(T=8).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] [GC for 383 SFUN pages..(T=9).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] [GC for 383 SFUN pages..(T=11).GC finished] [GC for 3037 CONS pages..(T=9).GC finished] [GC for 383 SFUN pages..(T=9).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, 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: 8.15 seconds (prove: 0.95, print: 0.12, other: 7.08) Prover steps counted: 9199 T Summary Form: ( DEFUN MOD-EXPT ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) MOD-EXPT Summary Form: ( DEFUN CONJOIN-CLAUSES ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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* [GC for 3047 CONS pages..(T=7).GC finished] Summary Form: ( DEFUN CLAUSES-RESULT ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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 Summary Form: ( DEFUN SPLICE-KEYWORD-ALIST ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) 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 [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: NIL Time: 0.32 seconds (prove: 0.00, print: 0.00, other: 0.32) SEARCH-FN-GUARD Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) SEARCH-FROM-START Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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)))) [GC for 3057 CONS pages..(T=7).GC finished] 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))))) 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))))) [GC for 3067 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!>>(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.17 seconds (prove: 0.00, print: 0.00, other: 0.17) SEARCH-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 SEARCH-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 0.48 seconds (prove: 0.00, print: 0.00, other: 0.48) 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.16 seconds (prove: 0.00, print: 0.00, other: 0.16) COUNT-STRINGP [GC for 3067 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN COUNT-LISTP ...) Rules: NIL Time: 0.25 seconds (prove: 0.00, print: 0.00, other: 0.25) 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)))))) Summary Form: ( DEFUN COUNT-FN ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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.32 seconds (prove: 0.00, print: 0.00, other: 0.32) 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 ACL2 Observation in TOP-LEVEL: VERIFY-TERMINATION events are skipped when the default-defun-mode is :PROGRAM. NIL [GC for 383 SFUN pages..(T=7).GC finished] Summary Form: ( DEFUN MAKE-SHARP-ATSIGN ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) MAKE-SHARP-ATSIGN Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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 six 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-FORM) 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :EMPTY-ENCAPSULATE Summary Form: ( DEFUN GC$-FN ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) GC$-FN Summary Form: ( DEFMACRO GC$ ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) GC$ Summary Form: ( DEFUN GC-VERBOSE-FN ...) Rules: NIL Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) 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.08 seconds (prove: 0.00, print: 0.00, other: 0.08) GET-WORMHOLE-STATUS [GC for 383 SFUN pages..(T=9).GC finished] Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: NIL Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) FILE-WRITE-DATE$ Summary Form: ( DEFUN DELETE-FILE$ ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) DELETE-FILE$ Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: NIL Time: 0.09 seconds (prove: 0.00, print: 0.00, other: 0.09) DEBUGGER-ENABLE [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) BREAK$ Summary Form: ( DEFUN PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) 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 Summary Form: ( DEFUN DEBUGGER-ENABLEDP ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) DEBUGGER-ENABLEDP Summary Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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 383 SFUN pages..(T=7).GC finished] Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) 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.08 seconds (prove: 0.00, print: 0.00, other: 0.08) ADD-@PAR-SUFFIX Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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* [GC for 383 SFUN pages..(T=8).GC finished] Summary Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...) Rules: NIL Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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)) 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) 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) [GC for 3067 CONS pages..(T=7).GC finished] 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 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 [GC for 3077 CONS pages..(T=7).GC finished] 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) 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 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)) [GC for 3087 CONS pages..(T=7).GC finished] Summary Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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)) [GC for 3097 CONS pages..(T=7).GC finished] 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)) 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.35 seconds (prove: 0.00, print: 0.00, other: 0.35) WATERFALL1@PAR Summary Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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* [GC for 474 SYMBOL pages..(T=8).GC finished] Summary Form: ( DEFUN SYMBOL-CONSTANT-FN ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) SYMBOL-CONSTANT-FN Summary Form: ( DEFUN STOBJS-IN ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) STOBJS-IN Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) ALL-NILS Summary Form: ( DEFCONST *TTAG-FNS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *TTAG-FNS* [GC for 383 SFUN pages..(T=9).GC finished] Summary Form: ( DEFUN LOGICP ...) Rules: NIL Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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* Summary Form: ( DEFUN STOBJS-OUT ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) STOBJS-OUT [GC for 3107 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: NIL Time: 0.32 seconds (prove: 0.00, print: 0.00, other: 0.32) EV-FNCALL-W-GUARD1 Summary Form: ( DEFUN EV-FNCALL-W-GUARD ...) Rules: NIL Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) EV-FNCALL-W-GUARD Summary Form: ( DEFUN TIME-TRACKER-FN ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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 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) 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. [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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 >(LOGIC) :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 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) ALL-NILS 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 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.... [GC for 3127 CONS pages..(T=8).GC finished] The non-trivial part of the guard conjecture for SUBSETP-EQL-EXEC, given primitive type reasoning, is Goal (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))). 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 and restrict the type of the new variable X2 to be that of the term it replaces, as established by primitive type reasoning. This produces the following goal. Subgoal 4.4' (IMPLIES (AND (TRUE-LISTP X2) (CONSP (CONS X1 X2)) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). This simplifies, using primitive type reasoning, to Subgoal 4.4'' (IMPLIES (AND (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). Name the formula above *1. [GC for 3127 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)). 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 and restrict the type of the new variable X2 to be that of the term it replaces, as established by primitive type reasoning. This produces the following goal. Subgoal 4.3' (IMPLIES (AND (TRUE-LISTP X2) (CONSP (CONS X1 X2)) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (TRUE-LISTP Y)). This simplifies, using primitive type reasoning, to Subgoal 4.3'' (IMPLIES (AND (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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)). 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 and restrict the type of the new variable X2 to be that of the term it replaces, as established by primitive type reasoning. This produces the following goal. Subgoal 4.2' (IMPLIES (AND (TRUE-LISTP X2) (CONSP (CONS X1 X2)) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (TRUE-LISTP Y)). This simplifies, using primitive type reasoning, to Subgoal 4.2'' (IMPLIES (AND (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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)). 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 and restrict the type of the new variable X2 to be that of the term it replaces, as established by primitive type reasoning. This produces the following goal. Subgoal 4.1' (IMPLIES (AND (TRUE-LISTP X2) (CONSP (CONS X1 X2)) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (TRUE-LISTP Y)). This simplifies, using primitive type reasoning, to Subgoal 4.1'' (IMPLIES (AND (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (TRUE-LISTP Y)). [GC for 3137 CONS pages..(T=8).GC finished] 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))))). 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))). 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. Subgoal 2.2' (IMPLIES (AND (CONSP (CONS X1 X2)) (TRUE-LISTP Y) (EQLABLE-LISTP (CONS X1 X2)) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). This simplifies, using the :definitions EQLABLE-LISTP (if-intro) and EQLABLEP (if-intro), primitive type reasoning and the :rewrite rules CAR-CONS and CDR-CONS, to the following three conjectures. Subgoal 2.2.3 (IMPLIES (AND (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). Name the formula above *5. Subgoal 2.2.2 (IMPLIES (AND (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=7).GC finished] Name the formula above *6. Subgoal 2.2.1 (IMPLIES (AND (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). Name the formula above *7. 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 *7, which is (IMPLIES (AND (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). Perhaps we can prove *7 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 Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X1 X2 Y) denote *7 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (:P X1 X2 (CDR Y))) (:P X1 X2 Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y))) (:P X1 X2 Y)) (IMPLIES (ENDP Y) (:P X1 X2 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 *7/5 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7/5' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). 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 *7/4 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=7).GC finished] 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 *7/4'' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). This simplifies, using primitive type reasoning, to Subgoal *7/4''' (IMPLIES (AND (CONSP Y) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). The destructor terms (CAR Y) and (CDR Y) can be eliminated by using CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y) by Y2 and restrict the type of the new variable Y1 to be that of the term it replaces. This produces the following goal. Subgoal *7/4'4' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (CHARACTERP Y1))) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By case analysis we reduce the conjecture to Subgoal *7/4'5' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3137 CONS pages..(T=6).GC finished] This simplifies, using primitive type reasoning, to Subgoal *7/4'6' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)), (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the truth of this conjecture and throw them out. We will thus try to prove Subgoal *7/4'7' (IMPLIES (AND (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). Name the formula above *7.1. Subgoal *7/3 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (NOT (TRUE-LISTP (CDR Y))) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *7/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7/2' (IMPLIES (AND (CONSP Y) (EQUAL X1 (CAR Y)) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). 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 *7/1 (IMPLIES (AND (ENDP Y) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *7/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP Y) (SYMBOLP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 *7.1, which is (IMPLIES (AND (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). Perhaps we can prove *7.1 by induction. Four induction schemes are suggested by this conjecture. Subsumption reduces that number to three. These merge into one derived induction scheme. 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 X1 Y2) denote *7.1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (:P X1 (CDR Y2))) (:P X1 Y2)) (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2))) (:P X1 Y2)) (IMPLIES (ENDP Y2) (:P X1 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 *7.1/5 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3137 CONS pages..(T=5).GC finished] By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7.1/5' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). 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 *7.1/4 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (TRUE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *7.1/3 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7.1/3' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *7.1/2 (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *7.1/2' (IMPLIES (AND (CONSP Y2) (EQUAL X1 (CAR Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). 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 *7.1/1 (IMPLIES (AND (ENDP Y2) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definition ENDP we reduce the conjecture to Subgoal *7.1/1' (IMPLIES (AND (NOT (CONSP Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (SYMBOLP X1)) (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 *7.1 and *7. We therefore turn our attention to *6, which is (IMPLIES (AND (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=5).GC finished] Perhaps we can prove *6 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 Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X1 X2 Y) denote *6 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (:P X1 X2 (CDR Y))) (:P X1 X2 Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y))) (:P X1 X2 Y)) (IMPLIES (ENDP Y) (:P X1 X2 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 *6/5 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6/5' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). 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 *6/4 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 *6/4'' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). This simplifies, using primitive type reasoning, to Subgoal *6/4''' [GC for 3137 CONS pages..(T=5).GC finished] (IMPLIES (AND (CONSP Y) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). The destructor terms (CAR Y) and (CDR Y) can be eliminated by using CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y) by Y2 and restrict the type of the new variable Y1 to be that of the term it replaces. This produces the following goal. Subgoal *6/4'4' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (CHARACTERP Y1))) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By case analysis we reduce the conjecture to Subgoal *6/4'5' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). This simplifies, using primitive type reasoning, to Subgoal *6/4'6' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)), (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the truth of this conjecture and throw them out. We will thus try to prove Subgoal *6/4'7' (IMPLIES (AND (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3137 CONS pages..(T=5).GC finished] Name the formula above *6.1. Subgoal *6/3 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (NOT (TRUE-LISTP (CDR Y))) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *6/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6/2' (IMPLIES (AND (CONSP Y) (EQUAL X1 (CAR Y)) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). 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 *6/1 (IMPLIES (AND (ENDP Y) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *6/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP Y) (CHARACTERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 *6.1, which is (IMPLIES (AND (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). Perhaps we can prove *6.1 by induction. Four induction schemes are suggested by this conjecture. Subsumption reduces that number to three. These merge into one derived induction scheme. 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 X1 Y2) denote *6.1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (:P X1 (CDR Y2))) (:P X1 Y2)) (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2))) (:P X1 Y2)) (IMPLIES (ENDP Y2) (:P X1 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 *6.1/5 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6.1/5' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (EQUAL (MEMBER-EQUAL X1 (CDR Y2)) (MEMBER-EQL-EXEC X1 (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). 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 *6.1/4 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (TRUE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3137 CONS pages..(T=5).GC finished] But we reduce the conjecture to T, by primitive type reasoning. Subgoal *6.1/3 (IMPLIES (AND (NOT (ENDP Y2)) (NOT (EQL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6.1/3' (IMPLIES (AND (CONSP Y2) (NOT (EQUAL X1 (CAR Y2))) (NOT (EQLABLE-LISTP (CDR Y2))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *6.1/2 (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *6.1/2' (IMPLIES (AND (CONSP Y2) (EQUAL X1 (CAR Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). 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 *6.1/1 (IMPLIES (AND (ENDP Y2) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By the simple :definition ENDP we reduce the conjecture to Subgoal *6.1/1' (IMPLIES (AND (NOT (CONSP Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (CHARACTERP X1)) (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 *6.1 and *6. We therefore turn our attention to *5, which is (IMPLIES (AND (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 X1 Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP. If we let (:P X1 X2 Y) denote *5 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (:P X1 X2 (CDR Y))) (:P X1 X2 Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y))) (:P X1 X2 Y)) (IMPLIES (ENDP Y) (:P X1 X2 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 X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/5' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=5).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 X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 X1 (CAR Y))) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). This simplifies, using primitive type reasoning, to Subgoal *5/4''' (IMPLIES (AND (CONSP Y) (EQLABLE-LISTP (CDR Y)) (TRUE-LISTP (CDR Y)) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (ACL2-NUMBERP (CAR Y))) (NOT (SYMBOLP (CAR Y))) (NOT (CHARACTERP (CAR Y)))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y)))). [GC for 3137 CONS pages..(T=5).GC finished] The destructor terms (CAR Y) and (CDR Y) can be eliminated by using CAR-CDR-ELIM to replace Y by (CONS Y1 Y2), (CAR Y) by Y1 and (CDR Y) by Y2 and restrict the type of the new variable Y1 to be that of the term it replaces. This produces the following goal. Subgoal *5/4'4' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (CHARACTERP Y1))) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). By case analysis we reduce the conjecture to Subgoal *5/4'5' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (CONSP (CONS Y1 Y2)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). This simplifies, using primitive type reasoning, to Subgoal *5/4'6' (IMPLIES (AND (NOT (ACL2-NUMBERP Y1)) (NOT (SYMBOLP Y1)) (NOT (CHARACTERP Y1)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). We suspect that the terms (EQLABLE-LISTP X2), (NOT (ACL2-NUMBERP Y1)), (NOT (SYMBOLP Y1)) and (NOT (CHARACTERP Y1)) are irrelevant to the truth of this conjecture and throw them out. We will thus try to prove Subgoal *5/4'7' (IMPLIES (AND (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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 X1 (CAR Y))) (NOT (TRUE-LISTP (CDR Y))) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). But we reduce the conjecture to T, by primitive type reasoning. Subgoal *5/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *5/2' (IMPLIES (AND (CONSP Y) (EQUAL X1 (CAR Y)) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). 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) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definition ENDP we reduce the conjecture to [GC for 3137 CONS pages..(T=4).GC finished] Subgoal *5/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP Y) (ACL2-NUMBERP X1) (EQLABLE-LISTP X2) (NOT (EQLABLE-LISTP Y))) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). Perhaps we can prove *5.1 by induction. Four induction schemes are suggested by this conjecture. Subsumption reduces that number to three. These merge into one derived induction scheme. 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 X1 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 X1 (CDR Y2))) (:P X1 Y2)) (IMPLIES (AND (NOT (ENDP Y2)) (EQL X1 (CAR Y2))) (:P X1 Y2)) (IMPLIES (ENDP Y2) (:P X1 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))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). 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))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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))) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (EQUAL (MEMBER-EQUAL X1 Y2) (MEMBER-EQL-EXEC X1 Y2))). [GC for 3137 CONS pages..(T=4).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) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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)) (EQLABLE-LISTP Y2) (TRUE-LISTP Y2) (ACL2-NUMBERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (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 X1 X2 Y) denote *4 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X1 X2 (CDR Y))) (:P X1 X2 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (TRUE-LISTP Y)). 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (SYMBOLP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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 X1 X2 Y) denote *3 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X1 X2 (CDR Y))) (:P X1 X2 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (TRUE-LISTP Y)). [GC for 3137 CONS pages..(T=3).GC finished] 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (CHARACTERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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 X1 X2 Y) denote *2 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP Y)) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (NOT (EQLABLEP (CAR Y)))) (:P X1 X2 Y)) (IMPLIES (AND (CONSP Y) (EQLABLEP (CAR Y)) (:P X1 X2 (CDR Y))) (:P X1 X2 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (TRUE-LISTP Y)). 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y) (ACL2-NUMBERP X1)) (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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=4).GC finished] 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 X1 Y). This suggestion was produced using the :induction rules EQLABLE-LISTP, MEMBER-EQL-EXEC and MEMBER-EQUAL. If we let (:P X1 X2 Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (:P X1 X2 (CDR Y))) (:P X1 X2 Y)) (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y))) (:P X1 X2 Y)) (IMPLIES (ENDP Y) (:P X1 X2 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 X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (EQUAL (MEMBER-EQUAL X1 (CDR Y)) (MEMBER-EQL-EXEC X1 (CDR Y))) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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/3 (IMPLIES (AND (NOT (ENDP Y)) (NOT (EQL X1 (CAR Y))) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP Y) (NOT (EQUAL X1 (CAR Y))) (NOT (EQLABLE-LISTP (CDR Y))) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and EQLABLEP. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP Y)) (EQL X1 (CAR Y)) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP Y) (EQUAL X1 (CAR Y)) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 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 X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP Y)) (TRUE-LISTP X2) (TRUE-LISTP (CONS X1 X2)) (EQLABLE-LISTP Y)) (EQUAL (MEMBER-EQUAL X1 Y) (MEMBER-EQL-EXEC X1 Y))). [GC for 3137 CONS pages..(T=4).GC finished] 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. 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) (:ELIM CAR-CDR-ELIM) (: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) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION EQLABLE-LISTP)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION EQLABLE-LISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 1.17 seconds (prove: 0.71, print: 0.29, other: 0.17) Prover steps counted: 13737 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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) REVAPPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC) [GC for 3137 CONS pages..(T=7).GC finished] 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. 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.24 seconds (prove: 0.00, print: 0.01, other: 0.23) 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. Summary Form: ( DEFUN TAKE ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26) TAKE End of Encapsulated Events. [GC for 3137 CONS pages..(T=8).GC finished] [GC for 3137 CONS pages..(T=8).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).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 and ALL-NILS. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 3.47 seconds (prove: 0.71, print: 0.30, other: 2.46) Prover steps counted: 13800 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) READ-FILE-INTO-STRING1 Summary Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) READ-FILE-INTO-STRING2-LOGICAL Summary Form: ( DEFUN READ-FILE-INTO-STRING2 ...) Rules: NIL Time: 0.04 seconds (prove: 0.00, print: 0.00, other: 0.04) READ-FILE-INTO-STRING2 Summary Form: ( DEFMACRO READ-FILE-INTO-STRING ...) Rules: NIL [GC for 3147 CONS pages..(T=8).GC finished] 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.04 seconds (prove: 0.00, print: 0.00, other: 0.04) 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 Summary Form: ( DEFUN HONS-REMOVE-ASSOC ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) HONS-REMOVE-ASSOC Summary Form: ( DEFUN COUNT-KEYS ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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) (DEFCONST T 'T) (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 [GC for 3147 CONS pages..(T=8).GC finished] FAST-ALIST-FREE-ON-EXIT HONS-COPY HONS-COPY-PERSISTENT HONS [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH HONS-WASH! HONS-SUMMARY HONS-RESIZE HONS-RESIZE-FN HONS SET-SLOW-ALIST-ACTION HONS-ACONS! MAKE-FAST-ALIST FAST-ALIST-FORK [GC for 393 SFUN pages..(T=9).GC finished] FAST-ALIST-FORK! HONS-SHRINK-ALIST HONS-SHRINK-ALIST! MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE FAST-ALIST-CLEAN FAST-ALIST-CLEAN! FAST-ALIST-LEN FAST-ALIST-SUMMARY WITH-FAST-ALIST-RAW WITH-FAST-ALIST WITH-STOLEN-ALIST-RAW WITH-STOLEN-ALIST CONS-SUBTREES [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] 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" EQUAL-X-CONSTANT [GC for 3157 CONS pages..(T=7).GC finished] MATCH-TESTS-AND-BINDINGS MATCH-CLAUSE MATCH-CLAUSE-LIST CASE-MATCH WORMHOLE-STATUSP WORMHOLE-ENTRY-CODE WORMHOLE-DATA [GC for 3167 CONS pages..(T=9).GC finished] SET-WORMHOLE-ENTRY-CODE SET-WORMHOLE-DATA MAKE-WORMHOLE-STATUS TREE-OCCUR-EQ WORMHOLE-EVAL WITH-WORMHOLE-LOCK [GC for 3177 CONS pages..(T=9).GC finished] WORMHOLE-EVAL-EARLY-NULL-EXIT-P WORMHOLE [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] LAMBDA-KEYWORDP LEGAL-VARIABLE-OR-CONSTANT-NAMEP LEGAL-VARIABLEP ARGLISTP1 ARGLISTP [GC for 3187 CONS pages..(T=10).GC finished] FIND-FIRST-BAD-ARG PROCESS-DEFABBREV-DECLARES 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* GET-SHARP-ATSIGN [GC for 3197 CONS pages..(T=9).GC finished] UPDATE-IPRINT-ALIST-FAL (EVISCERATE1 EVISCERATE1-LST) [GC for 3197 CONS pages..(T=7).GC finished] (EVISCERATE1P EVISCERATE1P-LST) EVISCERATE [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] EVISCERATE-SIMPLE ; (DEFUN ACL2_*1*_ACL2::ASET1-LST ...) is being compiled. ;; The variable STATE is undefined. ;; The compiler will assume this variable is a global. ASET1-LST IPRINT-HARD-BOUND IPRINT-SOFT-BOUND IPRINT-LAST-INDEX* IPRINT-LAST-INDEX [GC for 3197 CONS pages..(T=7).GC finished] IPRINT-AR-ILLEGAL-INDEX IPRINT-ENABLEDP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=7).GC finished] IPRINT-AR-AREF1 COLLECT-POSP-INDICES-TO-HEADER IPRINT-FAL-NAME IPRINT-EAGER-P INIT-IPRINT-FAL ROLLOVER-IPRINT-AR [GC for 3207 CONS pages..(T=4).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=5).GC finished] 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 3207 CONS pages..(T=9).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 3217 CONS pages..(T=9).GC finished] CONS-PPR1 FLSZ-INTEGER [GC for 3227 CONS pages..(T=8).GC finished] [GC for 3227 CONS pages..(T=8).GC finished] FLSZ-ATOM [GC for 3237 CONS pages..(T=8).GC finished] FLSZ1 FLSZ MAX-WIDTH [GC for 3237 CONS pages..(T=9).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] (PPR1 PPR1-LST) NEWLINE FMT-HARD-RIGHT-MARGIN FMT-SOFT-RIGHT-MARGIN [GC for 3237 CONS pages..(T=9).GC finished] SET-FMT-HARD-RIGHT-MARGIN SET-FMT-SOFT-RIGHT-MARGIN WRITE-FOR-READ SPACES1 MAKE-SPACES-ARRAY-REC MAKE-SPACES-ARRAY *ACL2-BUILT-IN-SPACES-ARRAY* [GC for 3237 CONS pages..(T=8).GC finished] SPACES (FLPR1 FLPR11) [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] FLPR PPR2-FLAT [GC for 3237 CONS pages..(T=8).GC finished] (PPR2-COLUMN PPR2) *FMT-PPR-INDENTATION* PPR *ILLEGAL-FMT-KEYS* ILLEGAL-FMT-STRING ILLEGAL-FMT-MSG [GC for 3247 CONS pages..(T=8).GC finished] SCAN-PAST-WHITESPACE ZERO-ONE-OR-MORE [GC for 3247 CONS pages..(T=9).GC finished] FIND-ALTERNATIVE-SKIP [GC for 3257 CONS pages..(T=8).GC finished] FIND-ALTERNATIVE-START1 [GC for 3257 CONS pages..(T=10).GC finished] FMT-CHAR FIND-ALTERNATIVE-START [GC for 3257 CONS pages..(T=10).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] FIND-ALTERNATIVE-STOP PUNCTP [GC for 3257 CONS pages..(T=9).GC finished] FMT-TILDE-S1 FMT-TILDE-CAP-S1 [GC for 3267 CONS pages..(T=8).GC finished] FMT-VAR SPLAT-ATOM SPLAT-ATOM! SPLAT-STRING [GC for 3267 CONS pages..(T=9).GC finished] (SPLAT SPLAT1) NUMBER-OF-DIGITS [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] LEFT-PAD-WITH-BLANKS MAYBE-NEWLINE EVISC-TUPLE STANDARD-EVISC-TUPLEP WORLD-EVISCERATION-ALIST ABBREV-EVISC-TUPLE GAG-MODE TERM-EVISC-TUPLE [GC for 484 SYMBOL pages..(T=9).GC finished] GAG-MODE-EVISC-TUPLE LD-EVISC-TUPLE FMT-PPR [GC for 3267 CONS pages..(T=10).GC finished] SCAN-PAST-EMPTY-FMT-DIRECTIVES [GC for 3277 CONS pages..(T=9).GC finished] [GC for 3287 CONS pages..(T=8).GC finished] [GC for 3297 CONS pages..(T=7).GC finished] [GC for 3307 CONS pages..(T=8).GC finished] [GC for 3317 CONS pages..(T=7).GC finished] [GC for 3327 CONS pages..(T=7).GC finished] [GC for 3337 CONS pages..(T=6).GC finished] [GC for 3347 CONS pages..(T=7).GC finished] [GC for 3357 CONS pages..(T=6).GC finished] [GC for 3367 CONS pages..(T=6).GC finished] [GC for 3377 CONS pages..(T=7).GC finished] [GC for 3387 CONS pages..(T=7).GC finished] [GC for 3397 CONS pages..(T=6).GC finished] [GC for 3407 CONS pages..(T=6).GC finished] [GC for 3417 CONS pages..(T=6).GC finished] [GC for 3427 CONS pages..(T=5).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] [GC for 393 SFUN pages..(T=8).GC finished] (FMT0* FMT0&V SPELL-NUMBER FMT-TILDE-S FMT-TILDE-CAP-S FMT0) [GC for 393 SFUN pages..(T=6).GC finished] TILDE-*-&V-STRINGS FMT1 FMT FMS [GC for 393 SFUN pages..(T=10).GC finished] FMT1! FMT! FMS! FMX FMX-CW-MSG-1-BODY [GC for 3437 CONS pages..(T=9).GC finished] [GC for 393 SFUN pages..(T=8).GC finished] FMX-CW-MSG-1 FMX-CW-MSG FMX-CW-FN-GUARD FMX-CW-FN [GC for 393 SFUN pages..(T=10).GC finished] FMX!-CW-FN FMX-CW FMX!-CW FMT-DOC-EXAMPLE1 FMT-DOC-EXAMPLE *SEE-DOC-SET-IPRINT* FMT-ABBREV1 [GC for 393 SFUN pages..(T=10).GC finished] FMT-ABBREV *FMT-CTX-SPACERS* FMT-CTX FMT-IN-CTX [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] ERROR-FMS-CHANNEL ERROR-FMS PUSH-WARNING-FRAME ABSORB-FRAME [GC for 393 SFUN pages..(T=10).GC finished] POP-WARNING-FRAME PUSH-WARNING RECORD-MAKER-FUNCTION-NAME RECORD-CHANGER-FUNCTION-NAME MAKE CHANGE [GC for 393 SFUN pages..(T=6).GC finished] MAKE-RECORD-CAR-CDRS1 MAKE-RECORD-CAR-CDRS MAKE-RECORD-ACCESSORS SYMBOL-NAME-TREE-OCCUR SOME-SYMBOL-NAME-TREE-OCCUR [GC for 393 SFUN pages..(T=8).GC finished] MAKE-RECORD-CHANGER-CONS [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] MAKE-RECORD-CHANGER-LET-BINDINGS MAKE-RECORD-CHANGER-LET MAKE-RECORD-CHANGER MAKE-RECORD-MAKER-CONS [GC for 393 SFUN pages..(T=8).GC finished] MAKE-RECORD-MAKER-LET MAKE-RECORD-MAKER MAKE-RECORD-FIELD-LST RECORD-MAKER-RECOGNIZER-NAME [GC for 393 SFUN pages..(T=9).GC finished] MAKE-RECORD-RECOGNIZER-BODY MAKE-RECORD-RECOGNIZER RECORD-MACROS DEFREC RECORD-TYPE IO?-NIL-OUTPUT CHECK-EXACT-FREE-VARS [GC for 393 SFUN pages..(T=5).GC finished] FORMAL-BINDINGS WEAK-IO-RECORD-P PUSH-IO-RECORD SAVED-OUTPUT-TOKEN-P [GC for 393 SFUN pages..(T=8).GC finished] IO?-WORMHOLE-BINDINGS *TRACKED-WARNING-SUMMARIES* IO? IO?-PROVE OUTPUT-IGNORED-P ERROR1 [GC for 393 SFUN pages..(T=9).GC finished] ERROR1-SAFE *UNINHIBITED-WARNING-SUMMARIES* WARNING-OFF-P1 WARNING-OFF-P [GC for 393 SFUN pages..(T=9).GC finished] WEAK-STATE-VARS-P DEFAULT-STATE-VARS WARNING1-BODY WARNING1-FORM [GC for 393 SFUN pages..(T=9).GC finished] WARNING1 WARNING-DISABLED-P OBSERVATION1-BODY OBSERVATION1 OBSERVATION1-CW OBSERVATION OBSERVATION-CW [GC for 393 SFUN pages..(T=8).GC finished] WEAK-DEFSTOBJ-FIELD-TEMPLATE-P WEAK-DEFSTOBJ-TEMPLATE-P PACKN1 [GC for 393 SFUN pages..(T=8).GC finished] PACKN-POS FIND-FIRST-NON-CL-SYMBOL PACKN PACK2 DEFSTOBJ-FNNAME-KEY2 DEFSTOBJ-FNNAME [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] DEFINED-CONSTANT FIX-STOBJ-ARRAY-TYPE DEFSTOBJ-FIELD-TEMPLATES *DEFSTOBJ-KEYWORDS* PARTITION-REST-AND-KEYWORD-ARGS1 PARTITION-REST-AND-KEYWORD-ARGS2 PARTITION-REST-AND-KEYWORD-ARGS [GC for 3437 CONS pages..(T=9).GC finished] DEFSTOBJ-TEMPLATE SIMPLE-ARRAY-TYPE LIVE-STOBJP ABSSTOBJ-NAME WEAK-DEFSTOBJ-REDUNDANT-RAW-LISP-DISCRIMINATOR-VALUE-P GET-STOBJ-CREATOR THE$ GET-STOBJ-SCALAR-FIELD MAKE-STOBJ-SCALAR-FIELD [GC for 403 SFUN pages..(T=8).GC finished] (MAYBE-CONTAINED-IN-CHARACTER SOME-MAYBE-CONTAINED-IN-CHARACTER ALL-MAYBE-CONTAINED-IN-CHARACTER) SINGLE-FIELD-TYPE-P DEFSTOBJ-FIELD-FNS-RAW-DEFS [GC for 3437 CONS pages..(T=10).GC finished] DEFSTOBJ-RAW-INIT-FIELDS DEFSTOBJ-RAW-INIT-SETF-FORMS DEFSTOBJ-RAW-INIT DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS [GC for 3437 CONS pages..(T=9).GC finished] STOBJP TRANSLATE-STOBJ-TYPE-TO-GUARD DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS CONGRUENT-STOBJ-REP ALL-BUT-LAST [GC for 3437 CONS pages..(T=8).GC finished] DEFSTOBJ-RAW-DEFS DEFCONST-NAME DEFSTOBJ-DEFCONSTS STRIP-ACCESSOR-NAMES THE-LIVE-VAR STANDARD-CO [GC for 3437 CONS pages..(T=9).GC finished] PARSE-WITH-LOCAL-STOBJ PARSE-VERSION PCD2 POWER-REP [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] DECODE-IDATE PRINT-IDATE GOOD-BYE-FN GOOD-BYE EXIT QUIT EXPAND-TILDE-TO-USER-HOME-DIR SAVE-EXEC-FN [GC for 3437 CONS pages..(T=9).GC finished] SAVE-EXEC *SLASH-DOT-DOT* *LENGTH-SLASH-DOT-DOT* FIND-DOT-DOT [GC for 3437 CONS pages..(T=8).GC finished] (CANCEL-DOT-DOTS GET-PARENT-DIRECTORY MERGE-USING-DOT-DOT) *NEWLINE-STRING* COMMENT-STRING-P1 COMMENT-STRING-P WEAK-PRINT-CONTROL-P :REDUNDANT [GC for 3447 CONS pages..(T=10).GC finished] PRINT-CONTROL-ALISTP *RAW-PRINT-VARS-KEYS* ALIST-KEYS-SUBSETP PRINT-CONTROL-P PRINT-OBJECT$-FN PRINT-OBJECT$ [GC for 3457 CONS pages..(T=9).GC finished] PRINT-OBJECT$-PRESERVING-CASE PRINT-OBJECT$+ 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" CLEAR-MEMOIZE-TABLE CLEAR-MEMOIZE-TABLES MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MEMSUM *HONS-PRIMITIVE-FNS* *HONS-PRIMITIVES* *MHT-DEFAULT-SIZE* [GC for 3457 CONS pages..(T=10).GC finished] [GC for 3467 CONS pages..(T=8).GC finished] [GC for 3477 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 SERIALIZE-WRITE-FN SERIALIZE-READ [GC for 3487 CONS pages..(T=9).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 [GC for 494 SYMBOL pages..(T=9).GC finished] LEGAL-CONSTANTP GENVAR1 GENVAR [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] GEN-FORMALS-FROM-PRETTY-FLAGS1 GEN-FORMALS-FROM-PRETTY-FLAGS COLLECT-NON-X COLLECT-NON-* DEFSTUB-BODY-NEW DEFPROXY DEFSTUB-IGNORES [GC for 403 SFUN pages..(T=9).GC finished] DEFSTUB-BODY-OLD-AUX DEFSTUB-BODY-OLD DEFSTUB-FN1 DEFSTUB-FN DEFSTUB *PRIMITIVE-FORMALS-AND-GUARDS* *PRIMITIVE-MONADIC-BOOLEANS* [GC for 3487 CONS pages..(T=10).GC finished] CONS-TERM1-CASES *CONS-TERM1-ALIST* CONS-TERM1-BODY QUOTE-LISTP [GC for 3487 CONS pages..(T=5).GC finished] CONS-TERM1 CONS-TERM CONS-TERM* MCONS-TERM MCONS-TERM* FCONS-TERM CDR-NEST STOBJ-PRINT-NAME EVISCERATION-STOBJ-MARK [GC for 403 SFUN pages..(T=10).GC finished] EVISCERATION-STOBJ-MARKS1 *ERROR-TRIPLE-SIG* *CMP-SIG* EVISCERATION-STOBJ-MARKS EVISCERATE-STOBJS1 EVISCERATE-STOBJS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] EVISCERATE-STOBJS-TOP FLAMBDA-APPLICATIONP LAMBDA-APPLICATIONP FLAMBDAP LAMBDA-FORMALS LAMBDA-BODY MAKE-LAMBDA MAKE-LET DOUBLET-LISTP ER-LET* MATCH MATCH! DEF-BASIC-TYPE-SETS1 DEF-BASIC-TYPE-SETS LIST-OF-THE-TYPE-SET TS= TS-COMPLEMENT0 TS-COMPLEMENTP TS-UNION0-FN TS-UNION0 TS-INTERSECTION0 TS-DISJOINTP TS-INTERSECTP [GC for 3497 CONS pages..(T=10).GC finished] TS-BUILDER-CASE-LISTP TS-BUILDER-MACRO1 TS-BUILDER-MACRO TS-BUILDER FFN-SYMB-P STRIP-NOT EQUALITYP INEQUALITYP CONSITYP PRINT-CURRENT-IDATE SKIP-WHEN-LOGIC [GC for 3507 CONS pages..(T=9).GC finished] CHK-INHIBIT-OUTPUT-LST *LD-SPECIAL-ERROR* [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] CHK-LD-SKIP-PROOFSP 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! [GC for 3507 CONS pages..(T=12).GC finished] CHECK-SUM1 [GC for 52 CFUN pages..(T=10).GC finished] CHECK-SUM CHECK-SUM-INC CHECK-SUM-NATURAL CHECK-SUM-STRING1 [GC for 3517 CONS pages..(T=10).GC finished] CHECK-SUM-STRING2 CHECK-SUM-STRING CHECK-SUM-OBJ1 [GC for 3517 CONS pages..(T=10).GC finished] OLD-CHECK-SUM-OBJ PLUS-MOD-M31 DOUBLE-MOD-M31 TIMES-EXPT-2-16-MOD-M31 [GC for 3527 CONS pages..(T=10).GC finished] TIMES-MOD-M31 FCHECKSUM-NATURAL-AUX FCHECKSUM-NATURAL [GC for 3527 CONS pages..(T=12).GC finished] FCHECKSUM-STRING1 FCHECKSUM-STRING2 [GC for 3537 CONS pages..(T=11).GC finished] FCHECKSUM-STRING FCHECKSUM-ATOM *FCHECKSUM-OBJ-STACK-BOUND-INIT* (FCHECKSUM-OBJ2 FCHECKSUM-OBJ) [GC for 403 SFUN pages..(T=9).GC finished] CHECK-SUM-OBJ READ-FILE-ITERATE READ-FILE FORMALS PLIST-WORLDP-WITH-FORMALS [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ARITY SYMBOL-CLASS FDEFUN-MODE DEFUN-MODE ARITIES-OKP USER-DEFINED-FUNCTIONS-TABLE WEAK-DEF-BODY-P [GC for 403 SFUN pages..(T=10).GC finished] LATEST-BODY DEF-BODY BODY GET-STOBJ-RECOGNIZER STOBJ-RECOGNIZER-TERMS [GC for 403 SFUN pages..(T=10).GC finished] MCONS-TERM-SMART (OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST) OPTIMIZE-STOBJ-RECOGNIZERS GUARD [GC for 403 SFUN pages..(T=13).GC finished] GUARD-LST EQUIVALENCE-RELATIONP >=-LEN ALL->=-LEN STRIP-CADRS STRIP-CDDRS [GC for 403 SFUN pages..(T=11).GC finished] GLOBAL-SET-LST CONS-TERM1-BODY-MV2 CONS-TERM1-MV2 [GC for 3537 CONS pages..(T=11).GC finished] (SUBLIS-VAR1 SUBLIS-VAR1-LST) SUBLIS-VAR SUBLIS-VAR-LST [GC for 403 SFUN pages..(T=9).GC finished] SUBCOR-VAR1 (SUBCOR-VAR SUBCOR-VAR-LST) MAKE-REVERSED-AD-LIST [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] CAR-CDR-ABBREV-NAME PRETTY-PARSE-AD-LIST UNTRANSLATE-CAR-CDR-NEST COLLECT-NON-TRIVIAL-BINDINGS UNTRANSLATE-AND [GC for 403 SFUN pages..(T=12).GC finished] UNTRANSLATE-OR CASE-LENGTH [GC for 3547 CONS pages..(T=11).GC finished] COND-LENGTH *UNTRANSLATE-BOOLEAN-PRIMITIVES* RIGHT-ASSOCIATED-ARGS DUMB-NEGATE-LIT DUMB-NEGATE-LIT-LST [GC for 3557 CONS pages..(T=11).GC finished] (TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT) ACCESSOR-ROOT PROGN! LD-REDEFINITION-ACTION [GC for 403 SFUN pages..(T=11).GC finished] CHK-LD-REDEFINITION-ACTION SET-LD-REDEFINITION-ACTION REDEF REDEF! REDEF+ REDEF- CHK-CURRENT-PACKAGE SET-CURRENT-PACKAGE [GC for 403 SFUN pages..(T=10).GC finished] DEFUN-FOR-STATE-NAME ERROR-FREE-TRIPLE-TO-STATE DEFUN-FOR-STATE SET-CURRENT-PACKAGE-STATE STANDARD-OI READ-STANDARD-OI CHK-STANDARD-OI [GC for 403 SFUN pages..(T=10).GC finished] SET-STANDARD-OI CHK-STANDARD-CO SET-STANDARD-CO PROOFS-CO [GC for 403 SFUN pages..(T=9).GC finished] CHK-PROOFS-CO [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] SET-PROOFS-CO ILLEGAL-STATE-LD-PROMPT LD-PRE-EVAL-FILTER ILLEGAL-STATE-P [GC for 403 SFUN pages..(T=9).GC finished] LD-PROMPT CHK-LD-PROMPT SET-LD-PROMPT LD-KEYWORD-ALIASES [GC for 3567 CONS pages..(T=9).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 [GC for 403 SFUN pages..(T=8).GC finished] NEW-NAMEP CHK-LD-PRE-EVAL-FILTER SET-LD-PRE-EVAL-FILTER LD-PRE-EVAL-PRINT [GC for 403 SFUN pages..(T=9).GC finished] CHK-LD-PRE-EVAL-PRINT SET-LD-PRE-EVAL-PRINT LD-POST-EVAL-PRINT CHK-LD-POST-EVAL-PRINT [GC for 403 SFUN pages..(T=9).GC finished] SET-LD-POST-EVAL-PRINT LD-ERROR-TRIPLES CHK-LD-ERROR-TRIPLES SET-LD-ERROR-TRIPLES [GC for 403 SFUN pages..(T=9).GC finished] LD-ERROR-ACTION CHK-LD-ERROR-ACTION SET-LD-ERROR-ACTION LD-QUERY-CONTROL-ALIST [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] LD-QUERY-CONTROL-ALISTP CDR-ASSOC-QUERY-ID CHK-LD-QUERY-CONTROL-ALIST SET-LD-QUERY-CONTROL-ALIST [GC for 403 SFUN pages..(T=11).GC finished] LD-VERBOSE CHK-LD-VERBOSE SET-LD-VERBOSE CHK-LD-USER-STOBJS-MODIFIED-WARNING [GC for 3577 CONS pages..(T=10).GC finished] SET-LD-USER-STOBJS-MODIFIED-WARNING *NQTHM-TO-ACL2-PRIMITIVES* *NQTHM-TO-ACL2-COMMANDS* [GC for 3587 CONS pages..(T=10).GC finished] NQTHM-TO-ACL2-FN NQTHM-TO-ACL2 ALLOCATE-FIXNUM-RANGE [GC for 403 SFUN pages..(T=10).GC finished] ALLEGRO-ALLOCATE-SLOWLY-FN CLEAR-PSTK *PSTK-VARS* PSTK-BINDINGS-AND-ARGS PSTK PSTACK-FN PSTACK VERBOSE-PSTACK SET-PRINT-CLAUSE-IDS [GC for 403 SFUN pages..(T=5).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=5).GC finished] SET-SAVED-OUTPUT-TOKEN-LST SET-GAG-MODE-FN SET-GAG-MODE POP-INHIBIT-OUTPUT-LST-STACK [GC for 3597 CONS pages..(T=8).GC finished] PUSH-INHIBIT-OUTPUT-LST-STACK SET-GC-THRESHOLD$-FN SET-GC-THRESHOLD$ Finished loading "basis-b.lisp". ACL2 loading "parallel.lisp". "ACL2" SET-PARALLEL-EXECUTION-FN SET-PARALLEL-EXECUTION WATERFALL-PRINTING-VALUE-FOR-PARALLELISM-VALUE [GC for 3607 CONS pages..(T=10).GC finished] PRINT-SET-WATERFALL-PARALLELISM-NOTICE CHECK-FOR-NO-OVERRIDE-HINTS SET-WATERFALL-PARALLELISM-FN SET-WATERFALL-PARALLELISM1 SAVED-MEMOIZE-TABLE SAVE-MEMO-TABLE [GC for 3617 CONS pages..(T=9).GC finished] 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 SET-WATERFALL-PARALLELISM-HACKS-ENABLED-GUARD WATERFALL-PARALLELISM-TABLE SET-WATERFALL-PARALLELISM-HACKS-ENABLED SET-WATERFALL-PARALLELISM-HACKS-ENABLED! CAAR-IS-DECLAREP [GC for 504 SYMBOL pages..(T=9).GC finished] DECLARE-GRANULARITY-P CHECK-AND-PARSE-FOR-GRANULARITY-FORM PARGS PLET BINARY-PAND PAND BINARY-POR POR OR-LIST AND-LIST [GC for 3627 CONS pages..(T=10).GC finished] 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 15616 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] (TERMP TERM-LISTP) TERM-LIST-LISTP COMPUTED-HINT-TUPLE-LISTP DEFAULT-HINTS-TABLE :REDUNDANT MACRO-ARGS *MACRO-EXPANSION-CTX* ERROR-TRACE-SUGGESTION [GC for 3637 CONS pages..(T=9).GC finished] IGNORED-ATTACHMENT-MSG EV-FNCALL-NULL-BODY-ER-MSG EV-FNCALL-NULL-BODY-ERP EV-FNCALL-NULL-BODY-ER EV-FNCALL-CREATOR-ER-MSG UNKNOWN-PKG-ERROR-MSG ILLEGAL-MSG PROGRAM-ONLY-ER-MSG *SAFE-MODE-GUARD-ER-ADDENDUM* FIND-FIRST-NON-NIL [GC for 3647 CONS pages..(T=10).GC finished] LATCH-STOBJS1 LATCH-STOBJS ACTUAL-STOBJS-OUT1 APPLY-SYMBOL-ALIST APPLY-INVERSE-SYMBOL-ALIST ACTUAL-STOBJS-OUT [GC for 3657 CONS pages..(T=9).GC finished] ; Hons-Note: grew SBITS to 7566139; 0.00 seconds, [unknown] bytes. [GC for 3667 CONS pages..(T=8).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP4 [GC for 3677 CONS pages..(T=9).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP ACL2-SYSTEM-NAMEP ACL2-SYSTEM-NAMEP-STATE (BIG-N DECREMENT-BIG-N ZP-BIG-N) W-OF-ANY-STATE [GC for 413 SFUN pages..(T=9).GC finished] UNTRANSLATE-PREPROCESS-FN UNTRANSLATE* SAVE-EV-FNCALL-GUARD-ER WEAK-ATTACHMENT-P WEAK-ATTACHMENT-COMPONENT-P ATTACHMENT-RECORD-PAIRS ALL-ATTACHMENTS GC-OFF1 [GC for 413 SFUN pages..(T=8).GC finished] GC-OFF RETURN-LAST-LOOKUP MAKE-LET-OR-LET* UNTRANSLATE*-LST LIVE-STATE-SYMBOLP [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] APPLY-USER-STOBJ-ALIST-OR-KWOTE SIGNATURE-FNS MAKE-EVENT-TUPLE ACCESS-EVENT-TUPLE-NUMBER ACCESS-EVENT-TUPLE-DEPTH ACCESS-EVENT-TUPLE-TYPE ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P [GC for 3677 CONS pages..(T=9).GC finished] ACCESS-EVENT-TUPLE-NAMEX ACCESS-EVENT-TUPLE-FORM ACCESS-EVENT-TUPLE-SYMBOL-CLASS WEAK-COMMAND-TUPLE-P MAKE-COMMAND-TUPLE ACCESS-COMMAND-TUPLE-NUMBER ACCESS-COMMAND-TUPLE-DEFUN-MODE [GC for 413 SFUN pages..(T=9).GC finished] ACCESS-COMMAND-TUPLE-FORM SAFE-ACCESS-COMMAND-TUPLE-FORM ACCESS-COMMAND-TUPLE-LAST-MAKE-EVENT-EXPANSION ACCESS-COMMAND-TUPLE-CBD MAX-ABSOLUTE-EVENT-NUMBER NEXT-ABSOLUTE-EVENT-NUMBER MAX-ABSOLUTE-COMMAND-NUMBER NEXT-ABSOLUTE-COMMAND-NUMBER [GC for 413 SFUN pages..(T=9).GC finished] SCAN-TO-LANDMARK-NUMBER ADD-TO-ZAP-TABLE FETCH-FROM-ZAP-TABLE *EVENT-INDEX-INTERVAL* *COMMAND-INDEX-INTERVAL* LOOKUP-WORLD-INDEX1 LOOKUP-WORLD-INDEX *UNSPECIFIED-XARG-VALUE* GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS1 [GC for 3687 CONS pages..(T=10).GC finished] GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS GET-UNAMBIGUOUS-XARGS-FLG1 GET-UNAMBIGUOUS-XARGS-FLG GET-UNAMBIGUOUS-XARGS-FLG-LST REMOVE-STRINGS REV-UNION-EQUAL [GC for 3697 CONS pages..(T=9).GC finished] TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST TRANSLATE-DECLARATION-TO-GUARD-VAR-LST GET-GUARDS2 GET-GUARDS1 [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] GET-GUARDS DCLS-GUARD-RAW-FROM-DEF GET-EVENT GET-SKIPPED-PROOFS-P NEGATE-UNTRANSLATED-FORM EVENT-TUPLE-FN-NAMES [GC for 3707 CONS pages..(T=8).GC finished] CLTL-DEF-FROM-NAME2 CLTL-DEF-FROM-NAME1 CLTL-DEF-FROM-NAME UNMAKE-TRUE-LIST-CONS-NEST [GC for 3707 CONS pages..(T=9).GC finished] UNMAKE-FORMAL-PAIRLIS2 COLLECT-IGNORED-MV-VARS ALL-QUOTEPS (SUBST-VAR SUBST-VAR-LST) [GC for 3717 CONS pages..(T=9).GC finished] SUBST-EACH-FOR-VAR TYPE-EXPRESSIONS-FROM-TYPE-SPEC SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1 FLATTEN-ANDS-IN-LIT FLATTEN-ANDS-IN-LIT-LST [GC for 3717 CONS pages..(T=8).GC finished] WEAK-SPLO-EXTRACTS-TUPLE-P [GC for 3717 CONS pages..(T=9).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 MAKE-BADGE-USERFN-STRUCTURE-TUPLE [GC for 3727 CONS pages..(T=7).GC finished] PUT-BADGE-USERFN-STRUCTURE-TUPLE-IN-ALIST WEAK-BADGE-USERFN-STRUCTURE-TUPLEP ACCESS-BADGE-USERFN-STRUCTURE-TUPLE-WARRANTP ACCESS-BADGE-USERFN-STRUCTURE-TUPLE-BADGE GET-WARRANTP GET-BADGE GET-BADGE-AND-WARRANTP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=7).GC finished] WARRANT-NAME STRING-PREFIXP-1 STRING-PREFIXP WARRANT-NAME-INVERSE WARRANT-FUNCTION-NAMEP [GC for 3727 CONS pages..(T=10).GC finished] T APPLY$-BADGE-ARITY *GENERIC-TAME-BADGE-1* *GENERIC-TAME-BADGE-2* *GENERIC-TAME-BADGE-3* *APPLY$-BADGE* *EV$-BADGE* EXECUTABLE-BADGE [GC for 3737 CONS pages..(T=10).GC finished] FIND-WARRANT-FUNCTION-NAME EXECUTABLE-TAMEP-LAMBDAP [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] (EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP EXECUTABLE-SUITABLY-TAMEP-LISTP) WELL-FORMED-LAMBDA-OBJECTP1 WELL-FORMED-LAMBDA-OBJECTP [GC for 3747 CONS pages..(T=9).GC finished] ALL-FNNAMES! REMOVE-GUARD-HOLDERS-BLOCKED-BY-HIDE-P :ATTACHMENTS-RECORDED (POSSIBLY-DIRTY-LAMBDA-OBJECTP1 POSSIBLY-DIRTY-LAMBDA-OBJECTP1-LST) POSSIBLY-DIRTY-LAMBDA-OBJECTP [GC for 3747 CONS pages..(T=11).GC finished] (MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP-LST) (EXPAND-ALL-LAMBDAS EXPAND-ALL-LAMBDAS-LST) (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST) [GC for 413 SFUN pages..(T=6).GC finished] TRIVIAL-LAMBDA-P (REMOVE-GUARD-HOLDERS1 REMOVE-GUARD-HOLDERS1-LST) REMOVE-GUARD-HOLDERS-WEAK [GC for 3757 CONS pages..(T=9).GC finished] REMOVE-GUARD-HOLDERS-WEAK-LST REMOVE-GUARD-HOLDERS1-LST-LST REMOVE-GUARD-HOLDERS-WEAK-LST-LST (CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST) [GC for 413 SFUN pages..(T=10).GC finished] POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST-LST REMOVE-GUARD-HOLDERS-LAMP :ATTACHMENTS-RECORDED REMOVE-GUARD-HOLDERS REMOVE-GUARD-HOLDERS-LST [GC for 413 SFUN pages..(T=9).GC finished] REMOVE-GUARD-HOLDERS-LST-LST LAMBDA-OBJECT-GUARD TAG-TRANSLATED-LAMBDA$-BODY LAMBDA$-BODYP MEMBER-LAMBDA-OBJECTP ATTACHMENT-ALIST [GC for 413 SFUN pages..(T=9).GC finished] ATTACHMENT-PAIR [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] APPLY$-LAMBDA-GUARD APPLY$-GUARD NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES ALL-FUNCTION-SYMBOLPS *UNKNOWN-CONSTRAINTS* UNKNOWN-CONSTRAINTS-TABLE-GUARD UNKNOWN-CONSTRAINTS-TABLE SET-UNKNOWN-CONSTRAINTS-SUPPORTERS [GC for 413 SFUN pages..(T=9).GC finished] EV-FNCALL-REC-LOGICAL-UNKNOWN-CONSTRAINTS NON-EXECUTABLE-STOBJS-MSG SCAN-TO-EVENT GET-DEFUN-EVENT [GC for 3757 CONS pages..(T=9).GC finished] [GC for 3767 CONS pages..(T=9).GC finished] [GC for 3777 CONS pages..(T=9).GC finished] [GC for 3787 CONS pages..(T=8).GC finished] [GC for 3797 CONS pages..(T=5).GC finished] [GC for 3807 CONS pages..(T=5).GC finished] [GC for 3817 CONS pages..(T=6).GC finished] [GC for 3827 CONS pages..(T=5).GC finished] [GC for 3837 CONS pages..(T=6).GC finished] [GC for 3847 CONS pages..(T=5).GC finished] [GC for 3857 CONS pages..(T=5).GC finished] [GC for 514 SYMBOL pages..(T=11).GC finished] [GC for 3867 CONS pages..(T=10).GC finished] [GC for 3877 CONS pages..(T=9).GC finished] [GC for 3887 CONS pages..(T=11).GC finished] [GC for 413 SFUN pages..(T=11).GC finished] [GC for 413 SFUN pages..(T=11).GC finished] [GC for 413 SFUN pages..(T=10).GC finished] [GC for 3887 CONS pages..(T=10).GC finished] (GUARD-RAW EV-FNCALL-GUARD-ER EV-FNCALL-REC-LOGICAL EV-FNCALL-REC EV-REC-RETURN-LAST EV-REC EV-REC-LST ...) [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] EV-FNCALL EV EV-LST UNTRANSLATE [GC for 413 SFUN pages..(T=11).GC finished] UNTRANSLATE-LST EV-W-LST 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 [GC for 413 SFUN pages..(T=10).GC finished] 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 [GC for 413 SFUN pages..(T=12).GC finished] LEGAL-INITP MACRO-ARGLIST-KEYSP MACRO-ARGLIST-AFTER-RESTP MACRO-ARGLIST-OPTIONALP [GC for 413 SFUN pages..(T=11).GC finished] MACRO-ARGLIST1P SUBSEQUENCEP COLLECT-LAMBDA-KEYWORDPS [GC for 413 SFUN pages..(T=10).GC finished] MACRO-ARGS-STRUCTUREP BIND-MACRO-ARGS-KEYS1 BIND-MACRO-ARGS-KEYS BIND-MACRO-ARGS-AFTER-REST [GC for 413 SFUN pages..(T=10).GC finished] BIND-MACRO-ARGS-OPTIONAL BIND-MACRO-ARGS1 BIND-MACRO-ARGS [GC for 413 SFUN pages..(T=10).GC finished] MACRO-GUARD-ER-MSG MACROEXPAND1-CMP MACROEXPAND1 CHK-DECLARE COLLECT-DCLS [GC for 413 SFUN pages..(T=10).GC finished] TAG-LOOP$ *ACCEPTABLE-DCLS-ALIST* *DOCUMENTATION-STRINGS-PERMITTED* *DCL-EXPLANATION-ALIST* TILDE-*-CONJUNCTION-PHRASE1 [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] TILDE-*-CONJUNCTION-PHRASE COLLECT-NON-LEGAL-VARIABLEPS OPTIMIZE-ALISTP [GC for 413 SFUN pages..(T=13).GC finished] CHK-DCL-LST NUMBER-OF-STRINGS GET-STRING [GC for 413 SFUN pages..(T=10).GC finished] COLLECT-DECLARATIONS-CMP COLLECT-DECLARATIONS LISTIFY TRANSLATE-DCL-LST *ONEIFY-PRIMITIVES* *EC-CALL-BAD-OPS* RETURN-LAST-CALL PROG2$-CALL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] DCL-GUARDIAN IGNORE-VARS IGNORABLE-VARS MV-NTH-LIST TRANSLATE-BIND [GC for 413 SFUN pages..(T=11).GC finished] TRANSLATE-DEREF TRANSLATE-UNBOUND LISTLIS [GC for 413 SFUN pages..(T=10).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* [GC for 413 SFUN pages..(T=10).GC finished] HIDE-IGNORED-ACTUALS AUGMENT-IGNORE-VARS COMPUTE-STOBJ-FLAGS PRETTYIFY-STOBJ-FLAGS [GC for 413 SFUN pages..(T=10).GC finished] PRETTYIFY-STOBJS-OUT DEFSTOBJ-SUPPORTERP STOBJ-CREATORP [GC for 413 SFUN pages..(T=9).GC finished] (FFNNAMEP FFNNAMEP-LST) UNKNOWN-BINDING-MSG *MACROS-FOR-NONEXPANSION-IN-RAW-LISP* [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] CHK-NO-DUPLICATE-DEFUNS-CMP CHK-NO-DUPLICATE-DEFUNS CHK-STATE-OK-MSG [GC for 413 SFUN pages..(T=9).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 CHK-ALL-BUT-NEW-NAME [GC for 3897 CONS pages..(T=10).GC finished] 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 STOBJS-IN-OUT1 [GC for 3897 CONS pages..(T=10).GC finished] STOBJS-IN-MATCHP STOBJS-IN-OUT NON-TRIVIAL-STOBJ-BINDING FORMALIZED-VARLISTP THROW-NONEXEC-ERROR-P1 THROW-NONEXEC-ERROR-P CHK-FLET-DECLARATIONS [GC for 3897 CONS pages..(T=11).GC finished] CHK-FLET-DECLARE-FORM CHK-FLET-DECLARE-FORM-LIST STOBJ-UPDATER-GUESS-FROM-ACCESSOR PARSE-STOBJ-LET1 ILLEGAL-STOBJ-LET-MSG [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] PARSE-STOBJ-LET SPLIT-VALUES-BY-KEYS NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST CONCRETE-ACCESSOR NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS-1 [GC for 3897 CONS pages..(T=9).GC finished] WEAK-ABSSTOBJ-INFO-P ABSSTOBJ-TUPLES-LST NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS STOBJ-LET-FN STOBJ-FIELD-ACCESSOR-P [GC for 3897 CONS pages..(T=10).GC finished] CHK-STOBJ-LET/BINDINGS CHK-STOBJ-LET/UPDATERS-1 CHK-STOBJ-LET/UPDATERS ALIST-TO-DOUBLETS [GC for 3897 CONS pages..(T=12).GC finished] CHK-STOBJ-LET/ACCESSORS2 CHK-STOBJ-LET/ACCESSORS1 COLLECT-SOME-TRIPLES-WITH-NON-NIL-CDDDRS CHK-STOBJ-LET/ACCESSORS [GC for 3897 CONS pages..(T=12).GC finished] CHK-STOBJ-LET ALL-NILS-OR-X ABSSTOBJ-FIELD-FN-OF-STOBJ-TYPE-P STOBJ-FIELD-FN-OF-STOBJ-TYPE-P STOBJ-RECOGNIZER-P TRANS-OR INSIDE-DEFABSSTOBJ MISSING-KNOWN-STOBJS [GC for 3907 CONS pages..(T=12).GC finished] DEREF-MACRO-NAME CORRESPONDING-INLINE-FN UNTOUCHABLE-FN-P MACROEXPAND1*-CMP FIND-STOBJ-OUT-AND-CALL [GC for 3907 CONS pages..(T=10).GC finished] *INITIAL-RETURN-LAST-TABLE* DEFINED-SYMBOLS [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES MATCH-STOBJS MAKE-LAMBDA-TERM (ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST) *GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG* [GC for 3917 CONS pages..(T=10).GC finished] EDCLS-FROM-LAMBDA-OBJECT-DCLS EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT *LOOP$-KEYWORD-INFO* *LOOP$-SPECIAL-FUNCTION-SYMBOLS* LOOP$-OPERATOR-SCIONP LOOP$-SCION-STYLE [GC for 3927 CONS pages..(T=11).GC finished] LOOP$-SCION-RESTRICTION MAKE-CARTON EXCART SYMBOL-NAME-EQUAL ASSOC-SYMBOL-NAME-EQUAL PARSE-LOOP$-ACCUM [GC for 3927 CONS pages..(T=11).GC finished] POSSIBLE-TYPOP MAYBE-MEANT-BUT-DIDNT-WRITE PARSE-LOOP$-WHEN PARSE-LOOP$-UNTIL [GC for 3927 CONS pages..(T=10).GC finished] PARSE-LOOP$-VSTS-DIAGNOSE-FAILURE [GC for 3927 CONS pages..(T=11).GC finished] [GC for 3937 CONS pages..(T=10).GC finished] PARSE-LOOP$-VSTS PARSE-LOOP$ MAKE-PLAIN-LOOP$-LAMBDA-OBJECT [GC for 3947 CONS pages..(T=11).GC finished] TRANSLATE-VSTS MAKE-BINDINGS COLLECT-TVSTS-LIFTED-GUARDS MAKE-FANCY-LOOP$-TYPE-SPECS LIFT-FANCY-LOOP$-CARTON-GUARD MAKE-FANCY-LOOP$-LAMBDA-OBJECT [GC for 3947 CONS pages..(T=12).GC finished] MAKE-PLAIN-LOOP$ [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] MAKE-FANCY-LOOP$-TARGET MAKE-FANCY-LOOP$ REMOVE-LOOP$-GUARDS TRANSLATE11-VAR-OR-QUOTE-EXIT WEAK-BADGE-USERFN-STRUCTURE-ALISTP [GC for 3947 CONS pages..(T=9).GC finished] ILKS-PLIST-WORLDP ILKS-PER-ARGUMENT-SLOT (QUOTE-NORMAL-FORM1 QUOTE-NORMAL-FORM1-LST) QUOTE-NORMAL-FORM [GC for 423 SFUN pages..(T=10).GC finished] PRIMITIVE-EVENT-MACROS *SYMS-NOT-CALLABLE-IN-CODE-FAL* [GC for 3947 CONS pages..(T=9).GC finished] [GC for 3957 CONS pages..(T=10).GC finished] [GC for 3967 CONS pages..(T=9).GC finished] [GC for 3977 CONS pages..(T=10).GC finished] [GC for 3987 CONS pages..(T=9).GC finished] [GC for 3997 CONS pages..(T=7).GC finished] [GC for 4007 CONS pages..(T=6).GC finished] [GC for 4017 CONS pages..(T=6).GC finished] [GC for 4027 CONS pages..(T=6).GC finished] [GC for 4037 CONS pages..(T=6).GC finished] [GC for 4047 CONS pages..(T=6).GC finished] [GC for 4057 CONS pages..(T=6).GC finished] [GC for 4067 CONS pages..(T=6).GC finished] [GC for 4077 CONS pages..(T=5).GC finished] [GC for 4087 CONS pages..(T=5).GC finished] [GC for 4097 CONS pages..(T=5).GC finished] [GC for 4107 CONS pages..(T=5).GC finished] [GC for 4117 CONS pages..(T=5).GC finished] [GC for 4127 CONS pages..(T=5).GC finished] [GC for 4127 CONS pages..(T=6).GC finished] [GC for 4127 CONS pages..(T=6).GC finished] [GC for 4127 CONS pages..(T=5).GC finished] [GC for 4127 CONS pages..(T=5).GC finished] [GC for 524 SYMBOL pages..(T=5).GC finished] [GC for 4137 CONS pages..(T=5).GC finished] [GC for 4147 CONS pages..(T=5).GC finished] [GC for 4157 CONS pages..(T=6).GC finished] [GC for 4167 CONS pages..(T=5).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=5).GC finished] [GC for 4177 CONS pages..(T=5).GC finished] [GC for 4187 CONS pages..(T=5).GC finished] [GC for 56 STRUCTURE pages..(T=5).GC finished] [GC for 4197 CONS pages..(T=5).GC finished] [GC for 4207 CONS pages..(T=5).GC finished] [GC for 237 ARRAY pages..(T=5).GC finished] [GC for 4217 CONS pages..(T=6).GC finished] [GC for 4227 CONS pages..(T=5).GC finished] [GC for 4237 CONS pages..(T=5).GC finished] [GC for 4247 CONS pages..(T=5).GC finished] [GC for 4257 CONS pages..(T=5).GC finished] [GC for 4267 CONS pages..(T=5).GC finished] [GC for 15872 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] [GC for 423 SFUN pages..(T=12).GC finished] /tmp/gazonk_1660654_0.c: In function ‘L1’: /tmp/gazonk_1660654_0.c:1155:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 1155 | if((Cnil)==Cnil){ | ^~ /tmp/gazonk_1660654_0.c:1598:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 1598 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_1660654_0.c:2029:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 2029 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_1660654_0.c:2354:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 2354 | if((Cnil)==Cnil){ | ^~ [GC for 423 SFUN pages..(T=10).GC finished] [GC for 423 SFUN pages..(T=11).GC finished] [GC for 423 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 423 SFUN pages..(T=9).GC finished] (LOGIC-FNSP LOGIC-FNS-LISTP) LOGIC-TERMP LOGIC-TERM-LISTP LOGIC-FNS-LIST-LISTP [GC for 423 SFUN pages..(T=10).GC finished] LOGIC-TERM-LIST-LISTP TRANSLATE-CMP TRANSLATE TRANSLATABLE-P CHK-TRANSLATABLE [GC for 423 SFUN pages..(T=10).GC finished] REPLACED-STOBJ REPLACE-STOBJS1 REPLACE-STOBJS NON-STOBJPS USER-STOBJSP [GC for 423 SFUN pages..(T=10).GC finished] PUT-ASSOC-EQ-ALIST COLLECT-USER-STOBJS EV-FOR-TRANS-EVAL MACROEXPAND1* [GC for 423 SFUN pages..(T=9).GC finished] TRANS-EVAL1 TRANS-EVAL0 TRANS-EVAL TRANS-EVAL-NO-WARNING [GC for 423 SFUN pages..(T=9).GC finished] TRANS-EVAL-DEFAULT-WARNING LAMBDA-OBJECT-GUARD-LST [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] LAMBDA-OBJECT-BODY-LST FILTER-LAMBDA$-OBJECTS (COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST) TAGGED-LOOP$P [GC for 423 SFUN pages..(T=8).GC finished] (COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST) (ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST) [GC for 423 SFUN pages..(T=9).GC finished] COLLECT-NON-EMPTY-PAIRS ANCESTRAL-LAMBDA$S-BY-CALLER (ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST) [GC for 423 SFUN pages..(T=10).GC finished] TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4 [GC for 423 SFUN pages..(T=10).GC finished] TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5 STRINGS-AND-OTHERS PROHIBITION-OF-LOOP$-AND-LAMBDA$-MSG SIMPLE-TRANSLATE-AND-EVAL [GC for 423 SFUN pages..(T=7).GC finished] ERROR-FMS-CW SIMPLE-TRANSLATE-AND-EVAL-CMP SIMPLE-TRANSLATE-AND-EVAL-ERROR-DOUBLE TILDE-*-ALIST-PHRASE1 TILDE-*-ALIST-PHRASE SET-TEMP-TOUCHABLE-FNS SET-TEMP-TOUCHABLE-VARS [GC for 433 SFUN pages..(T=13).GC finished] CLEAR-TEMP-TOUCHABLE-FNS CLEAR-TEMP-TOUCHABLE-VARS MAPCAR$ MAPDO ALWAYS 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 433 SFUN pages..(T=11).GC finished] ONE-BIT-TYPE-SETP *CODE-TYPE-SET-ALIST* LOGIOR-LST LOGAND-LST [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).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 4277 CONS pages..(T=13).GC finished] [GC for 4277 CONS pages..(T=11).GC finished] [GC for 4277 CONS pages..(T=11).GC finished] TYPE-SET-BINARY-+-ALIST-ENTRY TYPE-SET-BINARY-+-ALIST1 [GC for 433 SFUN pages..(T=10).GC finished] TYPE-SET-BINARY-+-ALIST [GC for 4277 CONS pages..(T=10).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=9).GC finished] [GC for 433 SFUN pages..(T=10).GC finished] TYPE-SET-BINARY-*-ALIST-ENTRY TYPE-SET-BINARY-*-ALIST1 TYPE-SET-BINARY-*-ALIST [GC for 4277 CONS pages..(T=9).GC finished] [GC for 4277 CONS pages..(T=10).GC finished] [GC for 4277 CONS pages..(T=10).GC finished] [GC for 433 SFUN pages..(T=9).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 TS-REAL/RATIONALP TS-INTEGERP (DUMB-OCCUR DUMB-OCCUR-LST) [GC for 433 SFUN pages..(T=6).GC finished] WEAK-HISTORY-ENTRY-P 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 [GC for 433 SFUN pages..(T=11).GC finished] REMOVE1-ASSOC-EQ-ASSOC-EQ-1 REMOVE1-ASSOC-EQ-ASSOC-EQ CONS-TAG-TREES1 CONS-TAG-TREES TAGGED-OBJECTS TAGGED-OBJECTSP TAGGED-OBJECT WITH-TTREE-LOCK ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE PTS-TO-TTREE-LST [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] MARRY-PARENTS COLLECT-PARENTS1 COLLECT-PARENTS0 COLLECT-PARENTS IGNORE-POLYP TO-BE-IGNOREDP1 TO-BE-IGNOREDP WEAK-ASSUMNOTE-P [GC for 433 SFUN pages..(T=12).GC finished] WEAK-ASSUMPTION-P WEAK-FC-DERIVATION-P (CONTAINS-ASSUMPTIONP CONTAINS-ASSUMPTIONP-FC-DERIVATIONS) REMOVE-ASSUMPTION-ENTRIES-FROM-TYPE-ALIST FORCE-ASSUMPTION1 [GC for 534 SYMBOL pages..(T=14).GC finished] DUMB-OCCUR-IN-TYPE-ALIST ALL-DUMB-OCCUR-IN-TYPE-ALIST *FORCE-XRUNE* FORCE-ASSUMPTION TAG-TREE-OCCUR-ASSUMPTION-NIL-1 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 [GC for 433 SFUN pages..(T=11).GC finished] FN-COUNT-EVG-REC FN-COUNT-EVG [GC for 62 CFUN pages..(T=11).GC finished] VAR-FN-COUNT-1 VAR-FN-COUNT VAR-OR-FN-COUNT-< TERM-ORDER1 ARITH-TERM-ORDER WEAK-POLY-P FIRST-VAR FIRST-COEFFICIENT GOOD-COEFFICIENT GOOD-POT-VARP GOOD-POLYP [GC for 433 SFUN pages..(T=12).GC finished] LOGICAL-< LOGICAL-<= EVALUATE-GROUND-POLY IMPOSSIBLE-POLYP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TRUE-POLYP SILLY-POLYP IMPOSSIBLE-POLY BASE-POLY0 BASE-POLY POLY-ALIST-EQUAL POLY-EQUAL [GC for 433 SFUN pages..(T=11).GC finished] POLY-WEAKERP POLY-MEMBER NEW-AND-UGLY-LINEAR-VARSP FILTER-POLYS ADD-LINEAR-VARIABLE1 ZERO-FACTOR-P GET-COEFFICIENT ADD-LINEAR-VARIABLE [GC for 433 SFUN pages..(T=9).GC finished] DUMB-EVAL-YIELDS-QUOTEP DUMB-EVAL ADD-LINEAR-TERM ADD-LINEAR-TERMS-FN ADD-LINEAR-TERMS NORMALIZE-POLY1 NORMALIZE-POLY [GC for 433 SFUN pages..(T=12).GC finished] 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 VAR-IN-POT-LST-P BOUNDS-POLY-WITH-VAR [GC for 433 SFUN pages..(T=11).GC finished] BOUNDS-POLYS-WITH-VAR POLYS-WITH-VAR1 POLYS-WITH-VAR POLYS-WITH-POTS [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] NEW-VARS-IN-POT-LST CHANGED-POT-VARS INFECT-POLYS INFECT-FIRST-N-POLYS INFECT-NEW-POLYS FCOMPLEMENTARY-MULTIPLEP1 FCOMPLEMENTARY-MULTIPLEP [GC for 433 SFUN pages..(T=11).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 [GC for 433 SFUN pages..(T=10).GC finished] FIND-EQUATIONAL-POLY-RHS FIND-EQUATIONAL-POLY3 FIND-EQUATIONAL-POLY2 FIND-EQUATIONAL-POLY1 FIND-EQUATIONAL-POLY GET-COEFF-FOR-CANCEL1 CANCEL2 [GC for 433 SFUN pages..(T=7).GC finished] CANCEL1 CANCEL CANCEL-POLY-AGAINST-ALL-POLYS ADD-POLY PRUNE-POLY-LST ADD-POLYS1 ADD-POLYS0 [GC for 433 SFUN pages..(T=10).GC finished] SHOW-POLY2 SHOW-POLY1 SHOW-POLY [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] 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* [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] ASSOC-EQUAL-CDR RUNEP BASE-SYMBOL STRIP-BASE-SYMBOLS FNUME FRUNIC-MAPPING-PAIR FN-RUNE-NUME DEFINITION-RUNES [GC for 433 SFUN pages..(T=12).GC finished] GET-NEXT-NUME DEREF-MACRO-NAME-LST *ABBREV-RUNE-ALIST* TRANSLATE-ABBREV-RUNE RULE-NAME-DESIGNATORP THEORYP1 THEORYP [GC for 433 SFUN pages..(T=10).GC finished] RUNIC-THEORYP1 RUNIC-THEORYP FIND-MAPPING-PAIRS-TAIL1 FIND-MAPPING-PAIRS-TAIL AUGMENT-RUNIC-THEORY1 AUGMENT-RUNIC-THEORY *BAD-RUNIC-DESIGNATOR-STRING* [GC for 433 SFUN pages..(T=10).GC finished] CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1 CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS DUPLICITOUS-CONS-CAR DUPLICITOUS-REVAPPEND-CAR DUPLICITOUS-MERGE-CAR DUPLICITOUS-SORT-CAR AUGMENT-THEORY ASSERT$-RUNIC-THEORYP [GC for 433 SFUN pages..(T=10).GC finished] RUNIC-THEORY WEAK-ENABLED-STRUCTURE-P ENABLED-STRUCTURE-P ENABLED-NUMEP ENABLED-ARITH-NUMEP [GC for 433 SFUN pages..(T=11).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ENABLED-RUNEP ACTIVE-RUNEP ACTIVE-OR-NON-RUNEP ENABLED-XFNP (SUBLIS-VAR! SUBLIS-VAR!-LST) THEORY-WARNING-FNS-AUX THEORY-WARNING-FNS [GC for 433 SFUN pages..(T=11).GC finished] MAYBE-WARN-ABOUT-THEORY WEAK-THEORY-INVARIANT-RECORD-P ENABLED-DISABLED-RUNEPS THEORY-INVARIANT-MSG-IMPLICATION [GC for 433 SFUN pages..(T=11).GC finished] COMBINE-ANDS THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST THEORY-INVARIANT-MSG WEAK-CERTIFY-BOOK-INFO-P ACTIVE-USELESS-RUNES [GC for 433 SFUN pages..(T=12).GC finished] USELESS-RUNES-FILENAME ACTIVE-USELESS-RUNES-FILENAME CHK-THEORY-INVARIANT1 CHK-THEORY-INVARIANT [GC for 433 SFUN pages..(T=13).GC finished] WEAK-CLAUSE-ID-P POS-LISTP ALL-DIGITS-P D-POS-LISTP [GC for 433 SFUN pages..(T=11).GC finished] 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 STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE [GC for 433 SFUN pages..(T=11).GC finished] UPDATE-ENABLED-STRUCTURE-ARRAY INCREMENT-ARRAY-NAME [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] UPDATE-ENABLED-STRUCTURE LOAD-THEORY-INTO-ENABLED-STRUCTURE-1 LOAD-THEORY-INTO-ENABLED-STRUCTURE INITIAL-GLOBAL-ENABLED-STRUCTURE [GC for 433 SFUN pages..(T=11).GC finished] RECOMPRESS-GLOBAL-ENABLED-STRUCTURE RECOMPRESS-STOBJ-ACCESSOR-ARRAYS *FAKE-RUNE-FOR-TYPE-SET* PUFFERT IMMEDIATE-FORCEP NUMERIC-TYPE-SET RATIONAL-TYPE-SET [GC for 4277 CONS pages..(T=11).GC finished] TYPE-SET-BINARY-+ TYPE-SET-BINARY-* [GC for 4277 CONS pages..(T=12).GC finished] TYPE-SET-NOT TYPE-SET-<-1 [GC for 4277 CONS pages..(T=11).GC finished] [GC for 4277 CONS pages..(T=11).GC finished] TYPE-SET-< [GC for 4277 CONS pages..(T=9).GC finished] TYPE-SET-UNARY-- [GC for 4277 CONS pages..(T=12).GC finished] [GC for 4277 CONS pages..(T=12).GC finished] TYPE-SET-UNARY-/ [GC for 4277 CONS pages..(T=10).GC finished] TYPE-SET-NUMERATOR [GC for 4277 CONS pages..(T=10).GC finished] TYPE-SET-DENOMINATOR TYPE-SET-REALPART TYPE-SET-IMAGPART [GC for 4277 CONS pages..(T=11).GC finished] TYPE-SET-COMPLEX WEAK-RECOGNIZER-TUPLE-P *INITIAL-RECOGNIZER-ALIST* MOST-RECENT-ENABLED-RECOG-TUPLE1 [GC for 433 SFUN pages..(T=12).GC finished] MOST-RECENT-ENABLED-RECOG-TUPLE TYPE-SET-RECOGNIZER TYPE-SET-CAR [GC for 4277 CONS pages..(T=12).GC finished] TYPE-SET-CDR TYPE-SET-COERCE [GC for 4277 CONS pages..(T=12).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL TYPE-SET-LENGTH [GC for 4277 CONS pages..(T=11).GC finished] TYPE-SET-CONS *SINGLETON-TYPE-SETS* [GC for 4277 CONS pages..(T=10).GC finished] TYPE-SET-EQUAL TYPE-SET-QUOTE TYPE-SET-CHAR-CODE FN-COUNT-1 FN-COUNT [GC for 433 SFUN pages..(T=11).GC finished] TERM-ORDER WEAK-TYPE-PRESCRIPTION-P FIND-RUNED-TYPE-PRESCRIPTION MV-ATF [GC for 433 SFUN pages..(T=11).GC finished] ASSUME-TRUE-FALSE-ERROR NON-CONS-CDR *ONE-WAY-UNIFY1-IMPLICIT-FNS* ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS [GC for 4277 CONS pages..(T=10).GC finished] (ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1 ONE-WAY-UNIFY1-EQUAL) ONE-WAY-UNIFY [GC for 433 SFUN pages..(T=10).GC finished] CANONICAL-REPRESENTATIVE SUBST-TYPE-ALIST1-CHECK NIL-FN *NIL-FN-TS-ENTRY* SUBST-TYPE-ALIST1 [GC for 433 SFUN pages..(T=10).GC finished] SUBST-TYPE-ALIST INFECT-TYPE-ALIST-ENTRY INFECT-NEW-TYPE-ALIST-ENTRIES2 [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] INFECT-NEW-TYPE-ALIST-ENTRIES1 INFECT-NEW-TYPE-ALIST-ENTRIES EXTEND-TYPE-ALIST-SIMPLE [GC for 544 SYMBOL pages..(T=10).GC finished] EXTEND-TYPE-ALIST1 EXTEND-TYPE-ALIST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] ZIP-VARIABLE-TYPE-ALIST ASSOC-EQUIV ASSOC-EQUIV+ [GC for 433 SFUN pages..(T=13).GC finished] ASSOC-TYPE-ALIST LOOK-IN-TYPE-ALIST MEMBER-CHAR-STRINGP TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP [GC for 4277 CONS 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 4287 CONS pages..(T=10).GC finished] [GC for 4297 CONS pages..(T=12).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=12).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 ...) WORSE-THAN WORSE-THAN-OR-EQUAL WORSE-THAN-CLK WORSE-THAN-BUILTIN WORSE-THAN-OR-EQUAL-BUILTIN :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED [GC for 4307 CONS pages..(T=11).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 4307 CONS pages..(T=11).GC finished] EQUAL-MOD-COMMUTING ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN ANCESTORS-CHECK :ATTACHMENTS-RECORDED MAP-MULTIPLY-CAR [GC for 4317 CONS pages..(T=12).GC finished] NORMALIZE-ADDEND INSERT-CDR-TERM-ORDER NORMALIZE-LINEAR-SUM-2 NORMALIZE-LINEAR-SUM-1 NORMALIZE-LINEAR-SUM NORMALIZE-LINEAR-SUM-P1 NORMALIZE-LINEAR-SUM-P [GC for 4317 CONS pages..(T=13).GC finished] [GC for 4327 CONS pages..(T=12).GC finished] [GC for 4337 CONS pages..(T=10).GC finished] [GC for 4347 CONS pages..(T=11).GC finished] TYPE-SET-FINISH-1 [GC for 4357 CONS pages..(T=10).GC finished] TYPE-SET-FINISH [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] SEARCH-TYPE-ALIST-REC (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 [GC for 443 SFUN pages..(T=11).GC finished] HYP-XRUNE HYP-XRUNE-RUNE CONC-XRUNE CONC-XRUNE-RUNE XRUNE-RUNE RUNE= XRUNE= PRETTYIFY-XRUNE WEAK-ACCP-INFO-P WEAK-ACCP-ENTRY-P MERGE-ACCUMULATED-PERSISTENCE-AUX MERGE-ACCUMULATED-PERSISTENCE-REC [GC for 4357 CONS pages..(T=10).GC finished] MERGE-ACCUMULATED-PERSISTENCE ADD-ACCUMULATED-PERSISTENCE-S ADD-ACCUMULATED-PERSISTENCE-F [GC for 4357 CONS pages..(T=12).GC finished] ACCUMULATED-PERSISTENCE-MAKE-FAILURES 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 4357 CONS pages..(T=5).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE1 SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2 SPLIT-XRUNE-ALIST SORT-XRUNE-ALIST-BY-RUNE1 [GC for 4357 CONS pages..(T=11).GC finished] SORT-XRUNE-ALIST-BY-RUNE POP-ACCP-FN POP-ACCP-FN-ITERATE [GC for 4367 CONS pages..(T=11).GC finished] SHOW-ACCUMULATED-PERSISTENCE-LIST SHOW-ACCUMULATED-PERSISTENCE-PHRASE SHOW-ACCUMULATED-PERSISTENCE [GC for 4367 CONS pages..(T=13).GC finished] PUSH-ACCP-FN PUSH-ACCP POP-ACCP WITH-ACCUMULATED-PERSISTENCE [GC for 4377 CONS pages..(T=12).GC finished] [GC for 4387 CONS pages..(T=12).GC finished] [GC for 4397 CONS pages..(T=11).GC finished] [GC for 4407 CONS pages..(T=11).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ASSUME-TRUE-FALSE-< MV-ATF-2 BINDING-HYP-P ADJUST-IGNORE-FOR-ATF BACKCHAIN-LIMIT-REACHEDP1 BACKCHAIN-LIMIT-REACHEDP NEW-BACKCHAIN-LIMIT ONCEP-TP [GC for 443 SFUN pages..(T=10).GC finished] ONCEP-TP-BUILTIN :ATTACHMENTS-RECORDED STRENGTHEN-RECOG-CALL PUSH-LEMMA? STRONG-RECOGNIZER-EXPR-P [GC for 4417 CONS pages..(T=11).GC finished] RECOGNIZER-EXPR-P PUSH-LEMMA[S] [GC for 4417 CONS pages..(T=11).GC finished] [GC for 4427 CONS pages..(T=11).GC finished] [GC for 4437 CONS pages..(T=11).GC finished] [GC for 4447 CONS pages..(T=11).GC finished] [GC for 4457 CONS pages..(T=11).GC finished] [GC for 4467 CONS pages..(T=9).GC finished] [GC for 4477 CONS pages..(T=8).GC finished] [GC for 4487 CONS pages..(T=8).GC finished] [GC for 4497 CONS pages..(T=7).GC finished] [GC for 4507 CONS pages..(T=7).GC finished] [GC for 4517 CONS pages..(T=8).GC finished] [GC for 4527 CONS pages..(T=7).GC finished] [GC for 4537 CONS pages..(T=6).GC finished] [GC for 4537 CONS pages..(T=7).GC finished] [GC for 4537 CONS pages..(T=7).GC finished] [GC for 4537 CONS pages..(T=6).GC finished] [GC for 4547 CONS pages..(T=6).GC finished] [GC for 4557 CONS pages..(T=6).GC finished] [GC for 4567 CONS pages..(T=7).GC finished] [GC for 4577 CONS pages..(T=11).GC finished] [GC for 4587 CONS pages..(T=11).GC finished] [GC for 4597 CONS pages..(T=11).GC finished] [GC for 4607 CONS pages..(T=11).GC finished] [GC for 4617 CONS pages..(T=11).GC finished] [GC for 4627 CONS pages..(T=11).GC finished] [GC for 4637 CONS pages..(T=9).GC finished] [GC for 4647 CONS pages..(T=8).GC finished] [GC for 4657 CONS pages..(T=8).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] [GC for 443 SFUN pages..(T=11).GC finished] [GC for 443 SFUN 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 TYPE-SET-BC ASSUME-TRUE-FALSE-AGGRESSIVE-P :ATTACHMENTS-RECORDED [GC for 443 SFUN pages..(T=11).GC finished] TOP-LEVEL-IF-REDUCE-REC TOP-LEVEL-IF-REDUCE TOP-LEVEL-IF-P TYPE-ALIST-REDUCIBLE-ENTRIES ASSUME-TRUE-FALSE-AGGRESSIVE-1 ASSUME-TRUE-FALSE-AGGRESSIVE [GC for 443 SFUN pages..(T=11).GC finished] ASSUME-TRUE-FALSE ASSUME-TRUE-FALSE-BC OK-TO-FORCE-ENS ADD-LINEAR-ASSUMPTION RETURN-TYPE-ALIST [GC for 443 SFUN pages..(T=9).GC finished] 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 16384 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] RECONSIDER-TYPE-ALIST TYPE-ALIST-CLAUSE-FINISH1 TYPE-ALIST-CLAUSE-FINISH TYPE-ALIST-CLAUSE KNOWN-WHETHER-NIL [GC for 443 SFUN pages..(T=11).GC finished] TS-BOOLEANP WEAK-CONS-OCCUR EQUAL-X-CONS-X-YP NOT-IDENT FIRST-IF ALL-VARIABLEP [GC for 443 SFUN pages..(T=11).GC finished] NORMALIZE-WITH-TYPE-SET [GC for 443 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 4667 CONS pages..(T=11).GC finished] POLYS-FROM-TYPE-SET [GC for 443 SFUN pages..(T=13).GC finished] ADD-TYPE-SET-POLYS ADD-POLYNOMIAL-INEQUALITIES ADD-POLYS (EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST) [GC for 554 SYMBOL pages..(T=11).GC finished] EVAL-GROUND-SUBEXPRESSIONS EVAL-GROUND-SUBEXPRESSIONS-LST POLY-SET [GC for 4667 CONS pages..(T=12).GC finished] [GC for 443 SFUN pages..(T=12).GC finished] LINEARIZE1 LINEARIZE [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] LINEARIZE-LST1 LINEARIZE-LST Finished loading "linear-b.lisp". ACL2 loading "non-linear.lisp". "ACL2" CLEANSE-TYPE-ALIST VAR-WITH-DIVISIONP VARIFY VARIFY! [GC for 443 SFUN pages..(T=9).GC finished] VARIFY!-LST1 VARIFY!-LST INVERT-VAR PART-OF1 PART-OF [GC for 443 SFUN pages..(T=9).GC finished] 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 [GC for 443 SFUN pages..(T=8).GC finished] GOOD-BOUNDS-IN-POT INVERSE-POLYS ADD-INVERSE-POLYS ADD-POLYS-FROM-TYPE-SET LENGTH-OF-SHORTEST-POLYS-WITH-VAR [GC for 443 SFUN pages..(T=7).GC finished] SHORTEST-POLYS-WITH-VAR1 SHORTEST-POLYS-WITH-VAR BINARY-*-LEAVES BINARY-*-TREE MERGE-ARITH-TERM-ORDER [GC for 443 SFUN pages..(T=7).GC finished] INSERT-ARITH-TERM-ORDER SORT-ARITH-TERM-ORDER [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] 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 [GC for 443 SFUN pages..(T=7).GC finished] INSERT-NEG-EVGS1 INSERT-NEG-EVGS MERGE-CAR-< MERGE-SORT-CAR-< [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] MERGE-CADR-< MERGE-SORT-CADR-< STRIP-CADDRS UNPRETTYIFY/ADD-HYPS-TO-PAIRS UNPRETTYIFY [GC for 443 SFUN pages..(T=6).GC finished] REPRETTYIFY CONVERT-RETURNED-VARS-TO-TERM-LST IMPLICATE WEAK-TYPE-SET-INVERTER-RULE-P *INITIAL-TYPE-SET-INVERTER-RULES* [GC for 443 SFUN pages..(T=6).GC finished] CONVERT-TYPE-SET-TO-TERM-LST CONVERT-TYPE-SET-TO-TERM1 CONVERT-TYPE-SET-TO-TERM CONVERT-TYPE-PRESCRIPTION-TO-TERM ALL-RUNES-IN-VAR-TO-RUNES-ALIST [GC for 443 SFUN pages..(T=11).GC finished] ALL-RUNES-IN-VAR-TO-RUNES-ALIST-LST UNION-EQUAL-REMOVING-DUPLICATES WEAK-SUMMARY-DATA-P MAKE-SUMMARY-DATA [GC for 443 SFUN pages..(T=8).GC finished] [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=9).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) [GC for 443 SFUN pages..(T=6).GC finished] WEAK-TAU-INTERVAL-P *TAU-EMPTY-INTERVAL* TAU-EMPTY-INTERVALP = LOWER-BOUND-> UPPER-BOUND-< TAU-SUBINTERVALP TAU-IMPLIES [GC for 453 SFUN pages..(T=5).GC finished] EMPTY-TAU-INTERVALP SINGLETON-TAU-INTERVALP MAKE-IDENTITY-INTERVAL IDENTITY-INTERVALP DELETE-CONSECUTIVE-INTEGERS-UPWARD DELETE-CONSECUTIVE-INTEGERS-DOWNWARD COLLECT- APPLY-REORDER-HINT ERASE-RW-CACHE-ANY-TAG-FROM-PSPV RESTORE-RW-CACHE-STATE-IN-PSPV WATERFALL1-WRAPPER [GC for 6337 CONS pages..(T=9).GC finished] [GC for 6337 CONS pages..(T=8).GC finished] [GC for 6337 CONS pages..(T=8).GC finished] (WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0 WATERFALL0-OR-HIT WATERFALL1-LST) WATERFALL SOME-POOL-MEMBER-SUBSUMES ADD-TO-POP-HISTORY POP-CLAUSE1 [GC for 533 SFUN pages..(T=11).GC finished] MAKE-DEFTHM-FORMS-FOR-BYES POP-CLAUSE-MSG1 POP-CLAUSE-MSG SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY INCREMENT-PROOF-TREE-POP-CLAUSE [GC for 6337 CONS pages..(T=13).GC finished] POP-CLAUSE TILDE-@-ASSUMNOTES-PHRASE-LST TILDE-*-ASSUMNOTES-COLUMN-PHRASE TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE [GC for 533 SFUN pages..(T=14).GC finished] PROCESS-ASSUMPTIONS-MSG1 PROCESS-ASSUMPTIONS-MSG COUNT-ASSUMPTIONS ADD-TYPE-ALIST-RUNES-TO-TTREE1 ADD-TYPE-ALIST-RUNES-TO-TTREE PROCESS-ASSUMPTIONS-TTREE [GC for 6337 CONS pages..(T=11).GC finished] PROCESS-ASSUMPTIONS DO-NOT-INDUCT-MSG PROVE-LOOP2 PROVE-LOOP1 [GC for 6337 CONS pages..(T=18).GC finished] PRINT-SUMMARY-ON-ERROR PROVE-LOOP0 PROVE-LOOP MAKE-PSPV CHK-ASSUMPTION-FREE-TTREE [GC for 533 SFUN pages..(T=10).GC finished] PUSH-CURRENT-ACL2-WORLD POP-CURRENT-ACL2-WORLD REVERT-WORLD PROVE Finished loading "prove.lisp". ACL2 loading "defuns.lisp". "ACL2" CERT-DATA-PAIR CERT-DATA-VAL CERT-DATA-ENTRY-PAIR [GC for 533 SFUN pages..(T=9).GC finished] CERT-DATA-ENTRY IN-ENCAPSULATEP (CONTAINS-LAMBDA-OBJECTP CONTAINS-LAMBDA-OBJECT-LISTP) STORE-CERT-DATA WEAK-TRANSLATE-CERT-DATA-RECORD-P [GC for 533 SFUN pages..(T=9).GC finished] UPDATE-TRANSLATE-CERT-DATA-FN UPDATE-TRANSLATE-CERT-DATA *MUTUAL-RECURSION-CTX-STRING* TRANSLATE-BODIES1 CHK-NON-EXECUTABLE-BODIES COLLECT-UNTOUCHABLE-FNS COLLECT-UNTOUCHABLE-VARS [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] GET-TRANSLATE-CERT-DATA-RECORD GET-TRANSLATE-BODIES TRANSLATE-BODIES CHK-MUTUAL-RECURSION-BAD-NAMES *CHK-MUTUAL-RECURSION-STRING* CHK-MUTUAL-RECURSION1 [GC for 533 SFUN pages..(T=9).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 533 SFUN pages..(T=15).GC finished] GUESS-MEASURE GUESS-MEASURE-ALIST TILDE-*-MEASURE-PHRASE1 TILDE-*-MEASURE-PHRASE FIND-?-MEASURE [GC for 6337 CONS pages..(T=14).GC finished] [GC for 6347 CONS pages..(T=17).GC finished] PROVE-TERMINATION PUTPROP-JUSTIFICATION-LST UNION-EQUAL-TO-END CROSS-TESTS-AND-CALLS3 CROSS-TESTS-AND-CALLS2 [GC for 533 SFUN pages..(T=15).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 533 SFUN pages..(T=12).GC finished] (INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST) SIMPLIFY-TESTS-AND-CALLS SIMPLIFY-TESTS-AND-CALLS-LST [GC for 533 SFUN pages..(T=12).GC finished] (LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST) INDUCTION-MACHINE-FOR-FN CLEAN-UP-NOTS CLEAN-UP-NOTS-LST CLEAN-UP-CONJUNCTION1 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] CLEAN-UP-CONJUNCTION CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE INDUCTION-MACHINES PUTPROP-INDUCTION-MACHINE-LST QUICK-BLOCK-INITIAL-SETTINGS [GC for 664 SYMBOL pages..(T=12).GC finished] QUICK-BLOCK-INFO1 QUICK-BLOCK-INFO2 QUICK-BLOCK-SETTINGS QUICK-BLOCK-DOWN-T-MACHINE QUICK-BLOCK-INFO PUTPROP-QUICK-BLOCK-INFO-LST BIG-MUTREC [GC for 533 SFUN pages..(T=14).GC finished] GET-SIG-FNS1 GET-SIG-FNS SELECTED-ALL-FNNAMES-LST SUBVERSIVEP SUBVERSIVE-CLIQUEP [GC for 533 SFUN pages..(T=12).GC finished] PROVE-TERMINATION-NON-RECURSIVE PROVE-TERMINATION-RECURSIVE PUT-INDUCTION-INFO-RECURSIVE MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE [GC for 533 SFUN pages..(T=10).GC finished] COLLECT-PROBLEMATIC-QUOTED-FNS MAYBE-WARN-ON-PROBLEMATIC-QUOTED-FNS PUT-INDUCTION-INFO DESTRUCTURE-DEFINITION [GC for 533 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 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] PUTPROP-BODY-LST TYPE-SET-IMPLIED-BY-TERM1 TYPE-SET-IMPLIED-BY-TERM PUTPROP-INITIAL-TYPE-PRESCRIPTIONS MAP-RETURNED-FORMALS-VIA-FORMALS [GC for 533 SFUN pages..(T=12).GC finished] MAP-TYPE-SETS-VIA-FORMALS VECTOR-TS-UNION MAP-CONS-TAG-TREES TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1 [GC for 6357 CONS pages..(T=9).GC finished] TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES [GC for 6367 CONS pages..(T=10).GC finished] (TYPE-SET-AND-RETURNED-FORMALS TYPE-SET-AND-RETURNED-FORMALS-LST) TYPE-SET-AND-RETURNED-FORMALS-TOP [GC for 6377 CONS pages..(T=9).GC finished] GUESS-TYPE-PRESCRIPTION-FOR-FN-STEP *CLIQUE-STEP-INSTALL-INTERVAL* GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE-STEP (GUARDED-TERMP GUARDED-TERM-LISTP) [GC for 533 SFUN pages..(T=12).GC finished] CONJOIN-TYPE-PRESCRIPTIONS CLEANSE-TYPE-PRESCRIPTIONS [GC for 6387 CONS pages..(T=12).GC finished] GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE GET-NORMALIZED-BODIES CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE PUTPROP-TYPE-PRESCRIPTION-LST PUTPROP-LEVEL-NO-LST PRIMITIVE-RECURSIVE-ARGP PRIMITIVE-RECURSIVE-CALLP [GC for 6387 CONS pages..(T=11).GC finished] PRIMITIVE-RECURSIVE-CALLSP PRIMITIVE-RECURSIVE-MACHINEP PUTPROP-PRIMITIVE-RECURSIVE-DEFUNP-LST MAKE-CONTROLLER-POCKET MAKE-CONTROLLER-ALIST1 MAKE-CONTROLLER-ALIST MAX-NUME-EXCEEDED-ERROR PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS1 PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS [GC for 6397 CONS pages..(T=16).GC finished] PRINT-VERIFY-GUARDS-MSG COLLECT-IDEALS COLLECT-NON-IDEALS COLLECT-NON-COMMON-LISP-COMPLIANTS ALL-FNNAMES1-EXEC ALL-FNNAMES-EXEC COLLECT-GUARDS-AND-BODIES CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS [GC for 543 SFUN pages..(T=15).GC finished] CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP CHK-ACCEPTABLE-VERIFY-GUARDS-CMP CHK-ACCEPTABLE-VERIFY-GUARDS GUARD-OBLIGATION-CLAUSES [GC for 6407 CONS pages..(T=9).GC finished] GUARD-OBLIGATION PROVE-GUARD-CLAUSES-MSG VERIFY-GUARDS-FORMULA-FN VERIFY-GUARDS-FORMULA [GC for 6417 CONS pages..(T=15).GC finished] PROVE-GUARD-CLAUSES MAYBE-REMOVE-INVARIANT-RISK VERIFY-GUARDS-FN1 CONVERT-RUNES-TO-UNORDERED-MAPPING-PAIRS AUGMENT-THEORY-WEAK [GC for 6427 CONS pages..(T=12).GC finished] WITH-USELESS-RUNES-AUX ACCP-INFO USELESS-RUNES BAD-USELESS-RUNES SET-DIFFERENCE-EQUAL-SORTED REMOVE-EXECUTABLE-COUNTERPART-USELESS-RUNES1 EXECUTABLE-COUNTERPART-USELESS-RUNES-P REMOVE-EXECUTABLE-COUNTERPART-USELESS-RUNES [GC for 6427 CONS pages..(T=15).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] PRINT-USELESS-RUNES AUGMENTED-RUNES-AFTER-1 AUGMENTED-RUNES-AFTER EXTEND-SET-DIFFERENCE-THEORIES USELESS-RUNES-ENS WITH-USELESS-RUNES [GC for 6437 CONS pages..(T=17).GC finished] 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 STOBJS-GUARD-ONLY-LST [GC for 543 SFUN pages..(T=17).GC finished] STOBJS-GUARD-ONLY REMOVE-GUARD-T *BOOT-STRAP-INVARIANT-RISK-ALIST* 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 [GC for 543 SFUN pages..(T=12).GC finished] ALL-SIMPLE-SIGNATURESP PRINT-DEFUN-MSG/SIGNATURES1 PRINT-DEFUN-MSG/SIGNATURES PRINT-DEFUN-MSG GET-IGNORES GET-IGNORABLES IRRELEVANT-VARS GET-IRRELEVANTS [GC for 543 SFUN pages..(T=17).GC finished] CHK-ALL-STOBJ-NAMES GET-DECLARED-STOBJ-NAMES GET-STOBJS-IN-LST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] CHK-STOBJS-OUT-BOUND STORE-STOBJS-OUT UNPARSE-SIGNATURE CHK-DEFUN-MODE SCAN-TO-CLTL-COMMAND DCL-FIELDS1 DCL-FIELDS [GC for 543 SFUN pages..(T=9).GC finished] SET-EQUALP-EQ NON-IDENTICAL-DEFP-CHK-MEASURES NON-IDENTICAL-DEFP IDENTICAL-DEFP [GC for 6447 CONS pages..(T=15).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 [GC for 543 SFUN pages..(T=12).GC finished] STRIP-LAST-ELEMENTS REDUNDANT-OR-RECLASSIFYING-DEFUNSP COLLECT-WHEN-CADR-EQ ALL-PROGRAMP FORMAL-POSITION MAKE-POSNS [GC for 543 SFUN pages..(T=15).GC finished] (RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST RELEVANT-POSNS-CALL) RELEVANT-POSNS-CLIQUE1 RELEVANT-POSNS-CLIQUE-RECUR [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] RELEVANT-POSNS-CLIQUE-INIT (RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST) RELEVANT-POSNS-MERGE RELEVANT-POSNS-LAMBDAS-TOP RELEVANT-POSNS-CLIQUE IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2 [GC for 543 SFUN pages..(T=17).GC finished] IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE TILDE-*-IRRELEVANT-FORMALS-MSG1 TILDE-*-IRRELEVANT-FORMALS-MSG MISSING-IRRELEVANT-SLOTS1 MISSING-IRRELEVANT-SLOTS FIND-SLOT BOGUS-IRRELEVANTS-ALIST2 [GC for 543 SFUN pages..(T=18).GC finished] BOGUS-IRRELEVANTS-ALIST1 BOGUS-IRRELEVANTS-ALIST TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG1 TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG CHK-IRRELEVANT-FORMALS-MSG CHK-IRRELEVANT-FORMALS CHK-LOGIC-SUBFUNCTIONS COLLECT-UNBADGED [GC for 543 SFUN pages..(T=13).GC finished] CHK-BADGED-QUOTED-SUBFUNCTIONS UNION-COLLECT-NON-X TRANSLATE-MEASURES REDUNDANT-PREDEFINED-ERROR-MSG CHK-ACCEPTABLE-DEFUNS-REDUNDANCY [GC for 6457 CONS pages..(T=18).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 6467 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS1 CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS2 CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS WEAK-LOOP$-ALIST-ENTRY-P LOOP$-ALIST-TERM *PRIMITIVE-UNTRANSLATE-ALIST* [GC for 543 SFUN pages..(T=14).GC finished] (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 CHK-ACCEPTABLE-LOOP$-TRANSLATIONS1 [GC for 6477 CONS pages..(T=18).GC finished] CHK-ACCEPTABLE-LOOP$-TRANSLATIONS2 [GC for 102 CFUN pages..(T=15).GC finished] CHK-ACCEPTABLE-LOOP$-TRANSLATIONS (STATE-GLOBALS-SET-BY STATE-GLOBALS-SET-BY-LST) (CHK-LAMBDAS-FOR-LOOP$-RECURSION1 CHK-LAMBDAS-FOR-LOOP$-RECURSION1-LST) CHK-LAMBDAS-FOR-LOOP$-RECURSION [GC for 674 SYMBOL pages..(T=15).GC finished] WEAK-LAMBDA-INFO-P (REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST) REMOVE-LAMBDAS TYPE-PRESCRIPTION-DISJUNCTP TYPE-PRESCRIPTION-CONCLP [GC for 543 SFUN pages..(T=17).GC finished] SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL UNPRETTYIFY-TP DESTRUCTURE-TYPE-PRESCRIPTION GET-XARGS-TYPE-PRESCRIPTION-LST [GC for 6487 CONS pages..(T=18).GC finished] CHK-TYPE-PRESCRIPTION-LST [GC for 6497 CONS pages..(T=12).GC finished] [GC for 6507 CONS pages..(T=11).GC finished] [GC for 6517 CONS pages..(T=12).GC finished] CHK-ACCEPTABLE-DEFUNS1 [GC for 6527 CONS pages..(T=12).GC finished] CONDITIONALLY-MEMOIZED-FNS CHK-ACCEPTABLE-DEFUNS UNION-EQ1-REV COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST [GC for 6527 CONS pages..(T=13).GC finished] DEFUNS-FN1 [GC for 6537 CONS pages..(T=14).GC finished] DEFUNS-FN0 STRIP-NON-HIDDEN-PACKAGE-NAMES IN-PACKAGE-FN DEFSTOBJ-FUNCTIONSP INDEX-OF-NON-NUMBER MAKE-UDF-INSIGS [GC for 543 SFUN pages..(T=12).GC finished] INTRO-UDF INTRO-UDF-LST1 INTRO-UDF-LST2 INTRO-UDF-LST DEFUN-CTX [GC for 543 SFUN pages..(T=11).GC finished] INSTALL-EVENT-DEFUNS DEFUNS-FN DEFUN-FN [GC for 6537 CONS pages..(T=14).GC finished] ARGS-FN ARGS MAKE-VERIFY-TERMINATION-DEF MAKE-VERIFY-TERMINATION-DEFS-LST [GC for 543 SFUN pages..(T=15).GC finished] CHK-ACCEPTABLE-VERIFY-TERMINATION1 UNIFORM-DEFUN-MODES CHK-ACCEPTABLE-VERIFY-TERMINATION [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] VERIFY-TERMINATION1 VERIFY-TERMINATION-BOOT-STRAP-FN1 VERIFY-TERMINATION-BOOT-STRAP-FN WHEN-LOGIC3 VERIFY-TERMINATION-FN FNS-USED-IN-AXIOMS CHECK-OUT-INSTANTIABLEP1 [GC for 543 SFUN pages..(T=14).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 PC-PROMPT [GC for 543 SFUN pages..(T=12).GC finished] 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* [GC for 543 SFUN pages..(T=15).GC finished] CONC HYPS CURRENT-ADDR GOAL-NAME DEPENDS-ON MAKE-OFFICIAL-PC-COMMAND INTERN-IN-KEYWORD-PACKAGE MAKE-PRETTY-PC-COMMAND MAKE-PRETTY-PC-INSTR CHANGE-PC-STATE MAKE-OFFICIAL-PC-INSTR [GC for 543 SFUN pages..(T=16).GC finished] CHECK-FORMALS-LENGTH CHECK-&OPTIONAL-AND-&REST MAKE-LET-PAIRS-FROM-FORMALS [GC for 543 SFUN pages..(T=11).GC finished] (ALL-SYMBOLS ALL-SYMBOLS-LIST) MAKE-ACCESS-BINDINGS [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] LET-FORM-FOR-PC-STATE-VARS CHECK-FIELD-NAMES PRINT-NO-CHANGE PRINT-NO-CHANGE2 PRINT-NO-CHANGE-FN MAYBE-UPDATE-INSTRUCTION PC-PRIMITIVE-DEFUN-FORM [GC for 6547 CONS pages..(T=10).GC finished] PC-COMMAND-TABLE-GUARD PC-COMMAND-TABLE ADD-PC-COMMAND PC-COMMAND-TYPE PRINT-NO-CHANGE3 ADD-PC-COMMAND-1 TOGGLE-PC-MACRO-FN PC-META-OR-MACRO-DEFUN [GC for 543 SFUN pages..(T=10).GC finished] GOAL-NAMES INSTRUCTIONS-OF-STATE-STACK FMS0 WITH-OUTPUT-FORCED PRINT-PC-PROMPT PC-MACROEXPAND FIND-GOAL [GC for 6557 CONS pages..(T=9).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 [GC for 6567 CONS pages..(T=11).GC finished] ACCUMULATE-TTREE-IN-PC-STATE PC-PROCESS-ASSUMPTIONS MAKE-IMPLICATION CL-SET-TO-IMPLICATIONS KNOWN-ASSUMPTIONS ADD-ASSUMPTIONS-TO-TOP-GOAL [GC for 6577 CONS pages..(T=18).GC finished] UNPROVED-GOALS MAKE-PC-ENS INITIAL-RCNST-FROM-ENS MAKE-NEW-GOALS-FIXED-HYPS [GC for 6587 CONS pages..(T=11).GC finished] [GC for 6597 CONS pages..(T=10).GC finished] [GC for 6607 CONS pages..(T=10).GC finished] PC-SINGLE-STEP-PRIMITIVE [GC for 6617 CONS pages..(T=18).GC finished] MAYBE-PRINT-MACROEXPANSION PC-SINGLE-STEP-1 UNION-LASTN-PC-TAG-TREES [GC for 6617 CONS pages..(T=10).GC finished] PC-SINGLE-STEP *PC-COMPLETE-SIGNAL* PRINT-RE-ENTERING-PROOF-BUILDER CHK-ABSSTOBJ-INVARIANTS [GC for 6627 CONS pages..(T=17).GC finished] PC-MAIN-LOOP MAKE-INITIAL-GOAL INITIAL-STATE-STACK EVENT-NAME-AND-TYPES-AND-RAW-TERM INSTALL-INITIAL-STATE-STACK PC-MAIN1 PC-MAIN PC-TOP [GC for 6637 CONS pages..(T=17).GC finished] (ILLEGAL-FNP ILLEGAL-FNP-LIST) VERIFY-FN [GC for 6637 CONS pages..(T=16).GC finished] PRINT-UNPROVED-GOALS-MESSAGE STATE-STACK-FROM-INSTRUCTIONS STATE-FROM-INSTRUCTIONS PRINT-PC-DEFTHM PRINT-PC-GOAL PRINT-PC-STATE [GC for 6637 CONS pages..(T=9).GC finished] PROOF-BUILDER VERIFY GUARD-MSG-TABLE (SUBLIS-EXPR-NON-QUOTEPS SUBLIS-EXPR-NON-QUOTEPS-LST) INVERT-ABBREVIATIONS-ALIST ABBREVIATE UNTRANS0 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] UNTRANS0-LST-FN UNTRANS0-LST Finished loading "proof-builder-a.lisp". ACL2 loading "defthm.lisp". "ACL2" FORM-OF-REWRITE-QUOTED-CONSTANT-RULE INTERPRET-TERM-AS-REWRITE-RULE2 [GC for 6637 CONS pages..(T=17).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 NON-RECURSIVE-FNNAMES-ALIST-LST [GC for 553 SFUN pages..(T=17).GC finished] HIDE-LAMBDAS1 HIDE-LAMBDAS VARIANTP (SURROUNDING-FNS1 SURROUNDING-FNS-LST) SURROUNDING-FNS LOOP-STOPPER1 LOOP-STOPPER REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS [GC for 553 SFUN pages..(T=16).GC finished] PUT-MATCH-FREE-VALUE FREE-VARS-IN-HYPS FREE-VARS-IN-HYPS-SIMPLE FREE-VARS-IN-FC-HYPS FREE-VARS-IN-HYPS-CONSIDERING-BIND-FREE [GC for 6647 CONS pages..(T=19).GC finished] ALL-VARS-IN-HYPS MATCH-FREE-VALUE MATCH-FREE-FC-VALUE RULE-BACKCHAIN-LIMIT-LST CREATE-REWRITE-RULE HYPS-THAT-INSTANTIATE-FREE-VARS [GC for 684 SYMBOL pages..(T=16).GC finished] (MAYBE-ONE-WAY-UNIFY MAYBE-ONE-WAY-UNIFY-LST) MAYBE-ONE-WAY-UNIFY-WITH-SOME MAYBE-SUBSUMES SUBSUMES-REWRITE-RULE FIND-SUBSUMED-RULE-NAMES FIND-SUBSUMING-RULE-NAMES FORCED-HYPS STRIP-TOP-LEVEL-NOTS-AND-FORCES [GC for 6657 CONS pages..(T=16).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=20).GC finished] FREE-VARIABLE-ERROR? EXTEND-GENEQV-ALIST (COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST) UNCOVERED-EQUIVS (UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST) [GC for 6667 CONS pages..(T=18).GC finished] DOUBLE-REWRITE-OPPORTUNITIES SHOW-DOUBLE-REWRITE-OPPORTUNITIES1 SHOW-DOUBLE-REWRITE-OPPORTUNITIES IRRELEVANT-LOOP-STOPPER-PAIRS NON-REC-DEF-RULES-MSG-1 NON-REC-DEF-RULES-MSG [GC for 6677 CONS pages..(T=21).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] CHK-REWRITE-RULE-WARNINGS CHK-ACCEPTABLE-REWRITE-RULE2 CHK-ACCEPTABLE-REWRITE-RULE1 CHK-ACCEPTABLE-REWRITE-RULE ADD-REWRITE-RULE2 [GC for 6687 CONS pages..(T=17).GC finished] ADD-REWRITE-RULE1 ADD-REWRITE-RULE EXPAND-INEQUALITY-FNCALL1 EXPAND-INEQUALITY-FNCALL ALL-VARS-IN-POLY-LST SUBBAGP-EQ ALWAYS-BIGGERP-DATA [GC for 553 SFUN pages..(T=15).GC finished] ALWAYS-BIGGERP-DATA-LST ALWAYS-BIGGERP NO-ELEMENT-ALWAYS-BIGGERP MAXIMAL-TERMS1 MAXIMAL-TERMS COLLECT-WHEN-FFNNAMESP MAKE-FREE-MAX-TERMS-MSG1 [GC for 553 SFUN pages..(T=10).GC finished] MAKE-FREE-MAX-TERMS-MSG EXTERNAL-LINEARIZE BAD-SYNP-HYP-MSG-FOR-LINEAR SHOW-DOUBLE-REWRITE-OPPORTUNITIES-LINEAR NO-LINEAR-MSG ALL-NON-NUMERIC [GC for 553 SFUN pages..(T=9).GC finished] CHK-ACCEPTABLE-LINEAR-RULE2 CHK-ACCEPTABLE-LINEAR-RULE1 CHK-ACCEPTABLE-LINEAR-RULE ADD-LINEAR-RULE3 ADD-LINEAR-RULE2 ADD-LINEAR-RULE1 [GC for 553 SFUN pages..(T=9).GC finished] ADD-LINEAR-RULE [GC for 6687 CONS pages..(T=9).GC finished] DESTRUCTURE-WELL-FOUNDED-RELATION-RULE [GC for 6697 CONS pages..(T=9).GC finished] CHK-ACCEPTABLE-WELL-FOUNDED-RELATION-RULE ADD-WELL-FOUNDED-RELATION-RULE CHK-ACCEPTABLE-BUILT-IN-CLAUSE-RULE2 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 553 SFUN pages..(T=9).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 6707 CONS pages..(T=14).GC finished] DESTRUCTURE-COMPOUND-RECOGNIZER [GC for 6717 CONS pages..(T=15).GC finished] MAKE-RECOGNIZER-TUPLE [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=20).GC finished] COMMENT-ON-NEW-RECOG-TUPLE1 COMMENT-ON-NEW-RECOG-TUPLE [GC for 6717 CONS pages..(T=10).GC finished] CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE ADD-COMPOUND-RECOGNIZER-RULE CHK-TRIGGERS DESTRUCTURE-FORWARD-CHAINING-TERM CHK-ACCEPTABLE-FORWARD-CHAINING-RULE [GC for 553 SFUN pages..(T=17).GC finished] PUTPROP-FORWARD-CHAINING-RULES-LST ADD-FORWARD-CHAINING-RULE EVALUATOR-CLAUSE/ARGLIST EVALUATOR-CLAUSE EVALUATOR-CLAUSES1 EVALUATOR-CLAUSES CDRP [GC for 553 SFUN pages..(T=12).GC finished] EXPAND-EQ-AND-ATOM-TERM-LST NORMALIZE-ALLEGED-EVALUATOR-CLAUSE NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET SHALLOW-CLAUSIFY1 SHALLOW-CLAUSIFY [GC for 6727 CONS pages..(T=14).GC finished] FIND-EVFN-LST-IN-CLAUSE GUESS-EVFN-LST-FOR-EVFN FIND-FN-IN-CLAUSE GUESS-FN-ARGS-LST-FOR-EVFN NORMALIZED-EVALUATOR-CL-SET CHK-EVALUATOR [GC for 553 SFUN pages..(T=10).GC finished] NAMEDP-PREFIX DEFEVALUATOR-FORM/DEFTHM-NAME DEFEVALUATOR-FORM/DEFTHM-HINTS DEFEVALUATOR-FORM/DEFTHM DEFEVALUATOR-FORM/DEFTHMS [GC for 553 SFUN pages..(T=10).GC finished] CAR-CADR-CADDR-ETC DEFEVALUATOR-FORM/FNS-CLAUSES *DEFEVALUATOR-FORM-BASE-THEORY* DEFEVALUATOR-FORM PAIRS-TO-MACRO-ALIAS-MSGS DEFEVALUATOR-CHECK-MSG [GC for 553 SFUN pages..(T=9).GC finished] DEFEVALUATOR-CHECK DEFEVALUATOR-CHECK-FORM DEFEVALUATOR TERM-TABLE TERM-TABLE REMOVE-META-EXTRACT-CONTEXTUAL-HYPS REMOVE-META-EXTRACT-GLOBAL-HYPS META-RULE-HYPOTHESIS-FUNCTIONS META-FN-ARGS [GC for 553 SFUN pages..(T=10).GC finished] CHK-META-FUNCTION EV-LST-FROM-EV ATTACHED-FNS SIBLINGS CANONICAL-SIBLING [GC for 553 SFUN pages..(T=17).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] (CANONICAL-FFN-SYMBS CANONICAL-FFN-SYMBS-LST) COLLECT-CANONICAL-SIBLINGS CONSTRAINTS-LIST CONSTRAINT-INFO+ IMMEDIATE-CANONICAL-ANCESTORS CANONICAL-ANCESTORS-REC [GC for 553 SFUN pages..(T=10).GC finished] CANONICAL-ANCESTORS CANONICAL-ANCESTORS-LST CHK-EVALUATOR-USE-IN-RULE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] CHK-RULE-FN-GUARD ADD-NEW-NEVER-UNTOUCHABLE-FNS COLLECT-NEVER-UNTOUCHABLE-FNS-ENTRIES [GC for 6737 CONS pages..(T=19).GC finished] INTERPRET-TERM-AS-META-RULE [GC for 6747 CONS pages..(T=13).GC finished] CHK-ACCEPTABLE-META-RULE ADD-META-RULE1 MAYBE-PUTPROP-LST MARK-ATTACHMENT-DISALLOWED2 [GC for 553 SFUN pages..(T=10).GC finished] MARK-ATTACHMENT-DISALLOWED1 MARK-ATTACHMENT-DISALLOWED ADD-META-RULE (DESTRUCTORS DESTRUCTORS-LST) STRIP-FFN-SYMBS [GC for 553 SFUN pages..(T=10).GC finished] CHK-ACCEPTABLE-ELIM-RULE1 CHK-ACCEPTABLE-ELIM-RULE ADD-ELIM-RULE1 ADD-ELIM-RULE CHK-ACCEPTABLE-GENERALIZE-RULE ADD-GENERALIZE-RULE [GC for 6757 CONS pages..(T=12).GC finished] FIND-TYPE-PRESCRIPTION-PAT ADD-TYPE-PRESCRIPTION-RULE STRONG-COMPOUND-RECOGNIZER-P1 STRONG-COMPOUND-RECOGNIZER-P 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 [GC for 6767 CONS pages..(T=12).GC finished] FIX-PKG FIX-INTERN$ FIX-INTERN-IN-PKG-OF-SYM PACK-TO-STRING GEN-SYM-SYM BOOLEAN-FN REFLEXIVITY SYMMETRY TRANSITIVITY EQUIVALENCE-RELATION-CONDITION [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] FIND-CANDIDATE-EQUIVALENCE-RELATION COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES CHK-ACCEPTABLE-EQUIVALENCE-RULE ADD-EQUIVALENCE-RULE [GC for 6777 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-REFINEMENT-RULE COLLECT-COARSENINGS PUTPROP-COARSENINGS UNION-VALUES EXTEND-VALUE-SET EXTEND-EACH-VALUE-SET CLOSE-VALUE-SETS ADD-REFINEMENT-RULE CORRESPONDING-ARGS-EQ-EXCEPT [GC for 563 SFUN pages..(T=14).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 563 SFUN pages..(T=12).GC finished] (VAR-ADDRESS VAR-ADDRESS-LST) INTERPRET-TERM-AS-CONGRUENCE-RULE SOME-CONGRUENCE-RULE-SAME [GC for 6787 CONS pages..(T=13).GC finished] SOME-CONGRUENCE-RULE-HAS-REFINEMENT CHK-ACCEPTABLE-CONGRUENCE-RULE ADD-CONGRUENCE-RULE-TO-CONGRUENCE CONS-ASSOC-EQ-REC CONS-ASSOC-EQ [GC for 6797 CONS pages..(T=12).GC finished] ADD-CONGRUENCE-RULE CHK-DESTRUCTURE-DEFINITION CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY [GC for 6807 CONS pages..(T=13).GC finished] CHK-ACCEPTABLE-DEFINITION-RULE CHK-ACCEPTABLE-INDUCTION-RULE ADD-INDUCTION-RULE CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE ADD-TYPE-SET-INVERTER-RULE TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG **ERROR**: See make.log. make[1]: *** [GNUmakefile:701: large] Error 1 make[1]: Leaving directory '/build/acl2-YY69Iy/acl2-8.4dfsg' mv *saved_acl2.gcl saved_acl2 mv: cannot stat '*saved_acl2.gcl': No such file or directory make: *** [debian/rules:94: saved_acl2] Error 1 dpkg-buildpackage: error: debian/rules binary-indep subprocess returned exit status 2 E: run_chroot failed: E: command failed: chroot "$1" env --unset=TMPDIR runuser builduser -c "cd /build/acl2-YY69Iy/acl2-8.4dfsg && env DEB_BUILD_OPTIONS="parallel=4" LANG="C.UTF-8" LC_ALL="C.UTF-8" LC_COLLATE="C.UTF-8" SOURCE_DATE_EPOCH="1635516393" DEB_BUILD_OPTIONS=nocheck dpkg-buildpackage -uc -a amd64 --build=all" W: listening on child socket failed: I: removing tempdir /tmp/mmdebstrap.GnqqHQpeqB... E: mmdebstrap failed to run mmdebstrap failed