Input buildinfo: https://buildinfos.debian.net/buildinfo-pool/a/acl2/acl2_8.5dfsg-1_amd64.buildinfo Use metasnap for getting required timestamps New buildinfo file: /tmp/acl2-8.5dfsg-1uom90mzq/acl2_8.5dfsg-1_amd64.buildinfo Get source package info: acl2=8.5dfsg-1 Source URL: http://snapshot.notset.fr/mr/package/acl2/8.5dfsg-1/srcfiles?fileinfo=1 env -i PATH=/usr/sbin:/usr/bin:/sbin:/bin TMPDIR=/tmp mmdebstrap --arch=amd64 --include=adduser=3.123 adwaita-icon-theme=42.0-2 autoconf=2.71-2 automake=1:1.16.5-1.3 autopoint=0.21-6 autotools-dev=20220109.1 base-files=12.2 base-passwd=3.5.52 bash=5.1-6.1 binutils=2.38.90.20220713-2 binutils-common=2.38.90.20220713-2 binutils-x86-64-linux-gnu=2.38.90.20220713-2 bsdextrautils=2.38-5 bsdutils=1:2.38-5 build-essential=12.9 bzip2=1.0.8-5 coreutils=8.32-4.1 cpp=4:12.1.0-3 cpp-12=12.1.0-7 dash=0.5.11+git20210903+057cd650a4ed-8 dbus=1.14.0-2 dbus-bin=1.14.0-2 dbus-daemon=1.14.0-2 dbus-session-bus-common=1.14.0-2 dbus-system-bus-common=1.14.0-2 dbus-user-session=1.14.0-2 dconf-gsettings-backend=0.40.0-3 dconf-service=0.40.0-3 debconf=1.5.79 debhelper=13.8 debianutils=5.7-0.2 dh-autoreconf=20 dh-strip-nondeterminism=1.13.0-1 diffutils=1:3.7-5 dmsetup=2:1.02.185-1 dpkg=1.21.9 dpkg-dev=1.21.9 dwz=0.14-1 emacs=1:27.1+1-3.1 emacs-bin-common=1:27.1+1-3.1+b1 emacs-common=1:27.1+1-3.1 emacs-gtk=1:27.1+1-3.1+b1 emacsen-common=3.0.4 file=1:5.41-4 findutils=4.9.0-3 fontconfig=2.13.1-4.4 fontconfig-config=2.13.1-4.4 fonts-dejavu-core=2.37-2 fonts-lmodern=2.005-1 g++=4:12.1.0-3 g++-12=12.1.0-7 gcc=4:12.1.0-3 gcc-12=12.1.0-7 gcc-12-base=12.1.0-7 gcl=2.6.12-118 gettext=0.21-6 gettext-base=0.21-6 grep=3.7-1 groff-base=1.22.4-8 gtk-update-icon-cache=3.24.34-1 gzip=1.12-1 hicolor-icon-theme=0.17-2 hostname=3.23 init-system-helpers=1.64 install-info=6.8-6 intltool-debian=0.35.0+20060710.5 libacl1=2.3.1-1 libapparmor1=3.0.5-1 libarchive-zip-perl=1.68-1 libargon2-1=0~20171227-0.3 libasan8=12.1.0-7 libasound2=1.2.7.1-1 libasound2-data=1.2.7.1-1 libatk-bridge2.0-0=2.38.0-4 libatk1.0-0=2.38.0-1 libatk1.0-data=2.38.0-1 libatomic1=12.1.0-7 libatspi2.0-0=2.44.1-1 libattr1=1:2.5.1-1 libaudit-common=1:3.0.7-1 libaudit1=1:3.0.7-1+b1 libavahi-client3=0.8-6 libavahi-common-data=0.8-6 libavahi-common3=0.8-6 libbinutils=2.38.90.20220713-2 libblkid1=2.38-5 libbrotli1=1.0.9-2+b4 libbsd0=0.11.6-1 libbz2-1.0=1.0.8-5 libc-bin=2.33-8 libc-dev-bin=2.33-8 libc6=2.33-8 libc6-dev=2.33-8 libcairo-gobject2=1.16.0-6 libcairo2=1.16.0-6 libcap-ng0=0.8.3-1+b1 libcap2=1:2.44-1 libcc1-0=12.1.0-7 libcolord2=1.4.6-1 libcom-err2=1.46.5-2 libcrypt-dev=1:4.4.28-2 libcrypt1=1:4.4.28-2 libcryptsetup12=2:2.4.3-1+b1 libctf-nobfd0=2.38.90.20220713-2 libctf0=2.38.90.20220713-2 libcups2=2.4.2-1 libdatrie1=0.2.13-2 libdb5.3=5.3.28+dfsg1-0.10 libdbus-1-3=1.14.0-2 libdconf1=0.40.0-3 libdebconfclient0=0.263 libdebhelper-perl=13.8 libdeflate0=1.12-1 libdevmapper1.02.1=2:1.02.185-1 libdpkg-perl=1.21.9 libedit2=3.1-20210910-1 libelf1=0.187-1 libepoxy0=1.5.10-1 libexpat1=2.4.8-1 libfdisk1=2.38-5 libffi8=3.4.2-4 libfile-stripnondeterminism-perl=1.13.0-1 libfontconfig1=2.13.1-4.4 libfreetype6=2.12.1+dfsg-3 libfribidi0=1.0.8-2.1 libgcc-12-dev=12.1.0-7 libgcc-s1=12.1.0-7 libgcrypt20=1.10.1-2 libgd3=2.3.3-6 libgdbm-compat4=1.23-1 libgdbm6=1.23-1 libgdk-pixbuf-2.0-0=2.42.8+dfsg-2 libgdk-pixbuf2.0-common=2.42.8+dfsg-2 libgif7=5.2.1-2.5 libglib2.0-0=2.72.3-1 libgmp10=2:6.2.1+dfsg1-1 libgnutls30=3.7.6-2 libgomp1=12.1.0-7 libgpg-error0=1.45-2 libgpm2=1.20.7-10 libgprofng0=2.38.90.20220713-2 libgraphite2-3=1.3.14-1 libgssapi-krb5-2=1.20-1 libgtk-3-0=3.24.34-1 libgtk-3-common=3.24.34-1 libharfbuzz0b=2.7.4-1+b1 libhogweed6=3.7.3-1 libice6=2:1.0.10-1 libicu71=71.1-3 libidn2-0=2.3.3-1 libip4tc2=1.8.8-1 libisl23=0.25-1 libitm1=12.1.0-7 libjansson4=2.14-2 libjbig0=2.1-3.1+b2 libjpeg62-turbo=1:2.1.2-1 libjson-c5=0.16-1 libk5crypto3=1.20-1 libkeyutils1=1.6.3-1 libkmod2=30+20220630-2 libkpathsea6=2022.20220321.62855-4 libkrb5-3=1.20-1 libkrb5support0=1.20-1 liblcms2-2=2.13.1-1 liblerc3=3.0+ds-1 liblsan0=12.1.0-7 liblz4-1=1.9.3-2 liblzma5=5.2.5-2.1 libm17n-0=1.8.0-4 libmagic-mgc=1:5.41-4 libmagic1=1:5.41-4 libmd0=1.0.4-2 libmount1=2.38-5 libmpc3=1.2.1-2 libmpfr6=4.1.0-3 libnettle8=3.7.3-1 libnsl-dev=1.3.0-2 libnsl2=1.3.0-2 libotf1=0.9.16-3 libp11-kit0=0.24.1-1 libpam-modules=1.4.0-13 libpam-modules-bin=1.4.0-13 libpam-runtime=1.4.0-13 libpam-systemd=251.3-1 libpam0g=1.4.0-13 libpango-1.0-0=1.50.7+ds-1 libpangocairo-1.0-0=1.50.7+ds-1 libpangoft2-1.0-0=1.50.7+ds-1 libpaper-utils=1.1.28+b1 libpaper1=1.1.28+b1 libpcre2-8-0=10.40-1 libpcre3=2:8.39-14 libperl5.34=5.34.0-5 libpipeline1=1.5.6-1 libpixman-1-0=0.40.0-1 libpng16-16=1.6.37-5 libptexenc1=2022.20220321.62855-4 libquadmath0=12.1.0-7 librsvg2-2=2.54.4+dfsg-1 libseccomp2=2.5.4-1+b1 libselinux1=3.4-1+b1 libsemanage-common=3.4-1 libsemanage2=3.4-1+b1 libsepol2=3.4-2 libsigsegv2=2.14-1 libsm6=2:1.2.3-1 libsmartcols1=2.38-5 libssl3=3.0.5-1 libstdc++-12-dev=12.1.0-7 libstdc++6=12.1.0-7 libsub-override-perl=0.09-3 libsynctex2=2022.20220321.62855-4 libsystemd-shared=251.3-1 libsystemd0=251.3-1 libtasn1-6=4.18.0-4 libtcl8.6=8.6.12+dfsg-1 libteckit0=2.5.11+ds1-1 libtexlua53-5=2022.20220321.62855-4 libtexluajit2=2022.20220321.62855-4 libtext-unidecode-perl=1.30-2 libthai-data=0.1.29-1 libthai0=0.1.29-1 libtiff5=4.4.0-3 libtinfo6=6.3+20220423-2 libtirpc-common=1.3.2-2 libtirpc-dev=1.3.2-2 libtirpc3=1.3.2-2 libtk8.6=8.6.12-1 libtool=2.4.7-4 libtsan2=12.1.0-7 libubsan1=12.1.0-7 libuchardet0=0.0.7-1 libudev1=251.3-1 libunistring2=1.0-1 libuuid1=2.38-5 libwayland-client0=1.21.0-1 libwayland-cursor0=1.21.0-1 libwayland-egl1=1.21.0-1 libwebp7=1.2.2-2+b1 libx11-6=2:1.7.5-1 libx11-data=2:1.7.5-1 libxau6=1:1.0.9-1 libxaw7=2:1.0.14-1 libxcb-render0=1.14-3 libxcb-shm0=1.14-3 libxcb1=1.14-3 libxcomposite1=1:0.4.5-1 libxcursor1=1:1.2.1-1 libxdamage1=1:1.1.5-2 libxdmcp6=1:1.1.2-3 libxext6=2:1.3.4-1 libxfixes3=1:6.0.0-1 libxft2=2.3.4-1 libxi6=2:1.8-1 libxinerama1=2:1.1.4-3 libxkbcommon0=1.4.1-1 libxml-libxml-perl=2.0207+dfsg+really+2.0134-1 libxml-namespacesupport-perl=1.12-2 libxml-sax-base-perl=1.09-2 libxml-sax-perl=1.02+dfsg-3 libxml2=2.9.14+dfsg-1+b1 libxmu6=2:1.1.3-3 libxpm4=1:3.5.12-1 libxrandr2=2:1.5.2-2+b1 libxrender1=1:0.9.10-1.1 libxss1=1:1.2.3-1 libxt6=1:1.2.1-1 libzstd1=1.5.2+dfsg-1 libzzip-0-13=0.13.72+dfsg.1-1.1 linux-libc-dev=5.18.14-1 login=1:4.11.1+dfsg1-2 lsb-base=11.2 m17n-db=1.8.0-3 m4=1.4.18-5 make=4.3-4.1 man-db=2.10.2-1 mawk=1.3.4.20200120-3.1 mount=2.38-5 ncurses-base=6.3+20220423-2 ncurses-bin=6.3+20220423-2 passwd=1:4.11.1+dfsg1-2 patch=2.7.6-7 perl=5.34.0-5 perl-base=5.34.0-5 perl-modules-5.34=5.34.0-5 po-debconf=1.0.21+nmu1 rpcsvc-proto=1.4.2-4 sed=4.8-1 sensible-utils=0.0.17 sgml-base=1.30 shared-mime-info=2.2-1 systemd=251.3-1 systemd-sysv=251.3-1 sysvinit-utils=3.03-1 t1utils=1.41-4 tar=1.34+dfsg-1 tex-common=6.17 texinfo=6.8-6 texlive-base=2022.20220722-1 texlive-binaries=2022.20220321.62855-4 texlive-latex-base=2022.20220722-1 texlive-latex-recommended=2022.20220722-1 time=1.9-0.1 tzdata=2022a-1 ucf=3.0043 util-linux=2.38-5 util-linux-extra=2.38-5 x11-common=1:7.7+23 xdg-utils=1.1.3-4.1 xkb-data=2.35.1-1 xz-utils=5.2.5-2.1 zlib1g=1:1.2.11.dfsg-4 --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/20220803T090151Z/ bookworm main deb-src http://snapshot.notset.fr/archive/debian/20220803T090151Z/ bookworm main deb http://snapshot.notset.fr/archive/debian/20220728T094517Z/ 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.5dfsg-1 && mkdir -p /build/acl2-b0HWqY && dpkg-source --no-check -x /*.dsc /build/acl2-b0HWqY/acl2-8.5dfsg && chown -R builduser:builduser /build/acl2-b0HWqY" --customize-hook=chroot "$1" env --unset=TMPDIR runuser builduser -c "cd /build/acl2-b0HWqY/acl2-8.5dfsg && env DEB_BUILD_OPTIONS="parallel=4" LC_ALL="C.UTF-8" LC_COLLATE="C.UTF-8" SOURCE_DATE_EPOCH="1658929371" DEB_BUILD_OPTIONS=nocheck dpkg-buildpackage -uc -a amd64 --build=any" --customize-hook=sync-out /build/acl2-b0HWqY /tmp/acl2-8.5dfsg-1uom90mzq bookworm /dev/null deb http://snapshot.notset.fr/archive/debian/20220728T094517Z 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.QsA1kQsjHQ 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.QsA1kQsjHQ Reading package lists... Building dependency tree... util-linux is already the newest version (2.38-5). The following NEW packages will be installed: fakeroot libfakeroot 0 upgraded, 2 newly installed, 0 to remove and 0 not upgraded. Need to get 136 kB of archives. After this operation, 401 kB of additional disk space will be used. Get:1 http://snapshot.notset.fr/archive/debian/20220728T094517Z unstable/main amd64 libfakeroot amd64 1.29-1 [48.5 kB] Get:2 http://snapshot.notset.fr/archive/debian/20220728T094517Z unstable/main amd64 fakeroot amd64 1.29-1 [87.3 kB] debconf: delaying package configuration, since apt-utils is not installed Fetched 136 kB in 0s (953 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 ... 4629 files and directories currently installed.) Preparing to unpack .../libfakeroot_1.29-1_amd64.deb ... Unpacking libfakeroot:amd64 (1.29-1) ... Selecting previously unselected package fakeroot. Preparing to unpack .../fakeroot_1.29-1_amd64.deb ... Unpacking fakeroot (1.29-1) ... Setting up libfakeroot:amd64 (1.29-1) ... Setting up fakeroot (1.29-1) ... update-alternatives: using /usr/bin/fakeroot-sysv to provide /usr/bin/fakeroot (fakeroot) in auto mode Processing triggers for libc-bin (2.33-8) ... 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/20220803T090151Z/ bookworm main deb-src http://snapshot.notset.fr/archive/debian/20220803T090151Z/ bookworm main deb http://snapshot.notset.fr/archive/debian/20220728T094517Z/ unstable main' >> /etc/apt/sources.list && apt-get update"' exec /tmp/mmdebstrap.QsA1kQsjHQ Get:1 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm InRelease [157 kB] Hit:2 http://snapshot.notset.fr/archive/debian/20220728T094517Z unstable InRelease Ign:3 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main amd64 Packages Ign:3 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main amd64 Packages Ign:3 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main Sources Ign:4 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main amd64 Packages Get:3 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main Sources [12.1 MB] Get:4 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main amd64 Packages [11.5 MB] Fetched 23.8 MB in 20s (1189 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.QsA1kQsjHQ I: running --customize-hook in shell: sh -c 'chroot "$1" env sh -c "apt-get source --only-source -d acl2=8.5dfsg-1 && mkdir -p /build/acl2-b0HWqY && dpkg-source --no-check -x /*.dsc /build/acl2-b0HWqY/acl2-8.5dfsg && chown -R builduser:builduser /build/acl2-b0HWqY"' exec /tmp/mmdebstrap.QsA1kQsjHQ Reading package lists... Need to get 224 MB of source archives. Get:1 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main acl2 8.5dfsg-1 (dsc) [2281 B] Get:2 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main acl2 8.5dfsg-1 (tar) [224 MB] Get:3 http://snapshot.notset.fr/archive/debian/20220803T090151Z bookworm/main acl2 8.5dfsg-1 (diff) [312 kB] Fetched 224 MB in 2min 55s (1280 kB/s) Download complete and in download only mode W: Download is performed unsandboxed as root as file 'acl2_8.5dfsg-1.dsc' couldn't be accessed by user '_apt'. - pkgAcquire::Run (13: Permission denied) dpkg-source: info: extracting acl2 in /build/acl2-b0HWqY/acl2-8.5dfsg dpkg-source: info: unpacking acl2_8.5dfsg.orig.tar.gz dpkg-source: info: unpacking acl2_8.5dfsg-1.debian.tar.xz dpkg-source: info: using patch list from debian/patches/series dpkg-source: info: applying remove-pcert-elementary-bounders-for-final-file dpkg-source: info: applying remove-pcert-local-elided-for-final-file dpkg-source: info: applying 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-b0HWqY/acl2-8.5dfsg && env DEB_BUILD_OPTIONS="parallel=4" LC_ALL="C.UTF-8" LC_COLLATE="C.UTF-8" SOURCE_DATE_EPOCH="1658929371" DEB_BUILD_OPTIONS=nocheck dpkg-buildpackage -uc -a amd64 --build=any"' exec /tmp/mmdebstrap.QsA1kQsjHQ dpkg-buildpackage: info: source package acl2 dpkg-buildpackage: info: source version 8.5dfsg-1 dpkg-buildpackage: info: source distribution unstable dpkg-buildpackage: info: source changed by Camm Maguire dpkg-source --before-build . dpkg-buildpackage: info: host architecture amd64 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-b0HWqY/acl2-8.5dfsg/books/interface/infix' rm -f /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.otl /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.err /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.ps /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.aux rm -f /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.dvi /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.aux /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.log /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/*.idx /build/acl2-b0HWqY/acl2-8.5dfsg/books/interface/infix/.log rm -f *~* *#* workxxx *.o *.tex *.nqtex TAGS *.dvi *.ps *.err *.aux *.log *.idx make[1]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg' 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-b0HWqY/acl2-8.5dfsg' /usr/bin/make clean-books make[1]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' ACL2_WD is /build/acl2-b0HWqY/acl2-8.5dfsg ACL2 is /build/acl2-b0HWqY/acl2-8.5dfsg/saved_acl2 Linux 6a9a3b5cda6b 5.10.112-1.fc32.qubes.x86_64 #1 SMP Fri Apr 22 12:45:40 CEST 2022 x86_64 GNU/Linux cd books ; /usr/bin/make -k ACL2=/build/acl2-b0HWqY/acl2-8.5dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books' ACL2_SYSTEM_BOOKS is /build/acl2-b0HWqY/acl2-8.5dfsg/books Determining ACL2 features (for ACL2 = /build/acl2-b0HWqY/acl2-8.5dfsg/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_ANSI := ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_HAS_ACL2_DEVEL := 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.162s user 0m0.078s sys 0m0.101s Scanning for dependencies... real 1m29.906s user 1m26.897s sys 0m0.993s Done scanning. Reading book deps Makefile-deps created on Thu Aug 4 07:02:58 UTC 2022 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-new.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 kestrel/axe/x86/examples/popcount/popcount-32-proof.cert kestrel/axe/x86/examples/popcount/popcount-64-proof.cert kestrel/axe/x86/examples/popcount/top.cert kestrel/axe/x86/examples/top.cert] Excluding ACL2(r)-only books: [nonstd/arc-length/length-of-a-rectifiable-curve.cert nonstd/circles/area-of-a-circle/area-of-a-circle-1.cert nonstd/circles/area-of-a-circle/area-of-a-circle-2.cert nonstd/circles/circumference-of-a-circle.cert nonstd/fft/fft-trig-with-axioms.cert nonstd/fft/fft-trig.cert nonstd/integrals/continuous-function.cert nonstd/integrals/equivalence-continuous-function.cert nonstd/integrals/equivalence-ftc.cert nonstd/integrals/equivalence-integrals.cert nonstd/integrals/ftc-1.cert nonstd/integrals/ftc-2.cert nonstd/integrals/integrable-functions.cert nonstd/integrals/integral-of-polynomials.cert nonstd/integrals/integration-composition-equivalences.cert nonstd/integrals/integration-composition.cert nonstd/integrals/make-partition.cert nonstd/integrals/split-integral-by-subintervals.cert nonstd/integrals/u-substitution.cert nonstd/nsa/Banach-Tarski/banach-tarski-b-0.cert nonstd/nsa/Banach-Tarski/banach-tarski-s2.cert nonstd/nsa/Banach-Tarski/banach-tarski.cert nonstd/nsa/Banach-Tarski/countable-sets.cert nonstd/nsa/Banach-Tarski/free-group.cert nonstd/nsa/Banach-Tarski/groups.cert nonstd/nsa/Banach-Tarski/hausdorff-paradox-1.cert nonstd/nsa/Banach-Tarski/hausdorff-paradox-2.cert nonstd/nsa/Banach-Tarski/rotations.cert nonstd/nsa/Banach-Tarski/supportive-theorems.cert nonstd/nsa/alternating-series.cert nonstd/nsa/chain-rule.cert nonstd/nsa/complex-polar.cert nonstd/nsa/continuity-product.cert nonstd/nsa/continuity.cert nonstd/nsa/derivative-raise.cert nonstd/nsa/derivatives-composition.cert nonstd/nsa/derivatives.cert nonstd/nsa/equivalence-continuity.cert nonstd/nsa/equivalence-derivatives-composition.cert nonstd/nsa/equivalence-derivatives.cert nonstd/nsa/equivalence-limits.cert nonstd/nsa/exp-continuous.cert nonstd/nsa/exp-sum.cert nonstd/nsa/exp.cert nonstd/nsa/factorial.cert nonstd/nsa/intervals.cert nonstd/nsa/inverse-derivatives.cert nonstd/nsa/inverse-monotone.cert nonstd/nsa/inverse-square.cert nonstd/nsa/inverse-trig.cert nonstd/nsa/inverses.cert nonstd/nsa/ln.cert nonstd/nsa/next-integer.cert nonstd/nsa/norm.cert nonstd/nsa/nsa.cert nonstd/nsa/overspill-proof.cert nonstd/nsa/overspill-test.cert nonstd/nsa/overspill.cert nonstd/nsa/raise.cert nonstd/nsa/sine.cert nonstd/nsa/sqrt.cert nonstd/nsa/trig-approx.cert nonstd/nsa/trig.cert nonstd/polynomials/polynomial-calculus.cert nonstd/polynomials/polynomial-defuns.cert nonstd/polynomials/polynomial-lemmas.cert nonstd/transcendentals/nested-intervals-revised.cert nonstd/transcendentals/nested-intervals.cert nonstd/transcendentals/reals-are-uncountable-1.cert nonstd/transcendentals/reals-are-uncountable-2.cert nonstd/workshops/1999/analysis/continuity.cert nonstd/workshops/1999/analysis/derivatives.cert nonstd/workshops/1999/analysis/exercise1.cert nonstd/workshops/1999/analysis/exercise2.cert nonstd/workshops/1999/analysis/exercise3.cert nonstd/workshops/1999/analysis/exercise4.cert nonstd/workshops/1999/analysis/exercise5.cert nonstd/workshops/1999/analysis/exercise6.cert nonstd/workshops/1999/analysis/exercise7.cert nonstd/workshops/1999/analysis/exercise8.cert nonstd/workshops/1999/calculus/book/between-i-close-implies-i-close.cert nonstd/workshops/1999/calculus/book/between-limited-implies-limited.cert nonstd/workshops/1999/calculus/book/defaxioms.cert nonstd/workshops/1999/calculus/book/equal-riemann-rcfn-refinement-reduction.cert nonstd/workshops/1999/calculus/book/ftoc-lemma.cert nonstd/workshops/1999/calculus/book/fundamental-theorem-of-calculus.cert nonstd/workshops/1999/calculus/book/i-close-implies-abs-difference-small.cert nonstd/workshops/1999/calculus/book/i-limited-rcfn.cert nonstd/workshops/1999/calculus/book/i-small-maxlist-abslist-difflist-maps.cert nonstd/workshops/1999/calculus/book/integral-rcfn-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/integral-rcfn-lemmas.cert nonstd/workshops/1999/calculus/book/integral-rcfn-quotient-between-non-classical.cert nonstd/workshops/1999/calculus/book/integral-rcfn.cert nonstd/workshops/1999/calculus/book/make-partition.cert nonstd/workshops/1999/calculus/book/map-rcfn-close-to-map-rcfn-refinement.cert nonstd/workshops/1999/calculus/book/map-rcfn-refinement-cdr-co-member.cert nonstd/workshops/1999/calculus/book/max-and-min-attained.cert nonstd/workshops/1999/calculus/book/max-x-between.cert nonstd/workshops/1999/calculus/book/maxlist-abslist-difflist-maps-lt.cert nonstd/workshops/1999/calculus/book/min-max-x-rec-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-and-max-x-lemmas.cert nonstd/workshops/1999/calculus/book/min-x-between.cert nonstd/workshops/1999/calculus/book/next-gte-close.cert nonstd/workshops/1999/calculus/book/nsa-lemmas.cert nonstd/workshops/1999/calculus/book/nsa.cert nonstd/workshops/1999/calculus/book/partitions-give-i-close-riemann-sum.cert nonstd/workshops/1999/calculus/book/proof-outline.cert nonstd/workshops/1999/calculus/book/rcfn-next-gte-close.cert nonstd/workshops/1999/calculus/book/rcfn-standard-part.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change-1.cert nonstd/workshops/1999/calculus/book/refinement-makes-i-small-change.cert nonstd/workshops/1999/calculus/book/riemann-bound.cert nonstd/workshops/1999/calculus/book/riemann-defuns.cert nonstd/workshops/1999/calculus/book/riemann-lemmas.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-between.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-lower-bound.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-refinement-is-riemann-rcfn.cert nonstd/workshops/1999/calculus/book/riemann-rcfn-upper-bound.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-1.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral-2.cert nonstd/workshops/1999/calculus/book/riemann-sum-approximates-integral.cert nonstd/workshops/1999/calculus/book/riemann.cert nonstd/workshops/1999/calculus/book/split-integral-by-subintervals.cert nonstd/workshops/1999/calculus/book/standard-part-equal-if-i-close.cert nonstd/workshops/1999/calculus/book/standard-part-preserves-between.cert nonstd/workshops/1999/calculus/book/standard-part-riemann-rcfn-is-standard.cert nonstd/workshops/1999/calculus/book/two-times-r-is-not-less-than-standard-part.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/abs-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/chain-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-elem.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/differentiator.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/exp-properties.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-square.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-derivatives.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/inverse-trig-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/ln-derivative-real.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/nsa-ex.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/product-composition.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sin-cos-minimal.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sqrt-derivative.cert nonstd/workshops/2011/reid-gamboa-differentiator/support/sum-composition.cert nonstd/workshops/2013/helms-gamboa-quantum/support/quantum.cert projects/hybrid-systems/abs.cert projects/hybrid-systems/arith-nsa4.cert projects/hybrid-systems/computed-hints.cert projects/hybrid-systems/eexp.cert projects/hybrid-systems/example.cert projects/hybrid-systems/nsa.cert projects/hybrid-systems/o-real-p.cert projects/hybrid-systems/phi-exists.cert projects/hybrid-systems/phi-properties.cert projects/hybrid-systems/phi-unique.cert projects/hybrid-systems/tm-floor.cert workshops/2015/chau-kaufmann-hunt/support/cosines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients-2.cert workshops/2015/chau-kaufmann-hunt/support/fourier-coefficients.cert workshops/2015/chau-kaufmann-hunt/support/fourier-inner-product.cert workshops/2015/chau-kaufmann-hunt/support/fourier-sums.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-1.cert workshops/2015/chau-kaufmann-hunt/support/int-infinite-sum-2.cert workshops/2015/chau-kaufmann-hunt/support/int-sum.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuity-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/continuous-function-2.cert workshops/2015/chau-kaufmann-hunt/support/riemann-integral/ftc-1-2.cert workshops/2015/chau-kaufmann-hunt/support/sine-cosine-orthog.cert workshops/2015/chau-kaufmann-hunt/support/sines-orthog.cert workshops/2015/chau-kaufmann-hunt/support/utils.cert workshops/2018/gamboa-cowles/complex-continuity.cert workshops/2018/gamboa-cowles/complex-lemmas.cert workshops/2018/gamboa-cowles/complex-polynomials.cert workshops/2018/gamboa-cowles/de-moivre.cert workshops/2018/gamboa-cowles/norm2.cert workshops/2018/kwan-greenstreet/cauchy-schwarz.cert workshops/2018/kwan-greenstreet/continuity.cert workshops/2018/kwan-greenstreet/convex.cert workshops/2018/kwan-greenstreet/ftc-2.cert workshops/2018/kwan-greenstreet/metric.cert workshops/2018/kwan-greenstreet/nesterov-1.cert workshops/2018/kwan-greenstreet/nesterov-2.cert workshops/2018/kwan-greenstreet/nesterov-3.cert workshops/2018/kwan-greenstreet/nesterov-4.cert workshops/2018/kwan-greenstreet/nesterov-top.cert workshops/2018/kwan-greenstreet/norm.cert workshops/2018/kwan-greenstreet/top.cert workshops/2018/kwan-greenstreet/vectors.cert workshops/2020/gamboa-cowles-gamboa/floor1-non-R.cert workshops/2020/gamboa-cowles-gamboa/norm-1C.cert workshops/2020/gamboa-cowles-gamboa/number-field.cert workshops/2020/gamboa-cowles-gamboa/polylist.cert workshops/2020/gamboa-cowles-gamboa/prior/raise-to.cert workshops/2020/kwan-peng-greenstreet/abstract-cs.cert workshops/2022/gamboa-primitive-roots/order-constructions.cert workshops/2022/gamboa-primitive-roots/pfield-polynomial.cert] 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/extremize.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-new.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.cert kestrel/c/atc/atc.cert kestrel/c/atc/input-processing.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/not.cert kestrel/c/atc/tests/operators.cert kestrel/c/atc/tests/ops-diff-types.cert kestrel/c/atc/tests/structs.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/code-generation.cert kestrel/java/atj/input-processing.cert kestrel/java/atj/tests/abnf.cert kestrel/java/atj/tests/acl2-times.cert kestrel/java/atj/tests/booleans.cert kestrel/java/atj/tests/cache-const-methods.cert kestrel/java/atj/tests/factorial.cert kestrel/java/atj/tests/fibonacci.cert kestrel/java/atj/tests/multivalue.cert kestrel/java/atj/tests/natives.cert kestrel/java/atj/tests/no-aij-types.cert kestrel/java/atj/tests/packages.cert kestrel/java/atj/tests/primarrays.cert kestrel/java/atj/tests/primitives.cert kestrel/java/atj/top.cert kestrel/java/top.cert kestrel/top-doc.cert kestrel/top.cert oslib/copy.cert oslib/dirname.cert oslib/file-types.cert oslib/ls.cert oslib/mkdir.cert oslib/rmtree.cert oslib/tests/copy.cert oslib/tests/dirname.cert oslib/tests/file-types.cert oslib/tests/ls.cert oslib/tests/mkdir.cert oslib/tests/top.cert oslib/top.cert projects/doc.cert projects/include-doc.cert projects/rp-rewriter/lib/mult/demo.cert projects/rp-rewriter/lib/mult2/demo.cert projects/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 top.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 workshops/2022/walter-manolios/acl2s-utils/top.cert workshops/2022/walter-manolios/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-b0HWqY/acl2-8.5dfsg/books/build/clean.pl clean.pl: scanning for generated files clean.pl: found 4 targets (1 seconds) clean.pl: deleted 4 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-b0HWqY/acl2-8.5dfsg/books/projects/milawa/ACL2' Calculating cert dependencies... Calculating pcert dependencies... Done with dependencies. Cleaning ACL2 directory (certificates, ACL2 images, etc.) clean.pl: scanning for generated files clean.pl: found 1 targets (0 seconds) clean.pl: deleted 1 files (0 seconds) Cleaning ../Proofs directory. make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/milawa/ACL2' Cleaning centaur/vl/bin directory Cleaning centaur/vl2014/bin directory Removing extra, explicitly temporary files. rm -rf /build/acl2-b0HWqY/acl2-8.5dfsg/books/build/Makefile-comp /build/acl2-b0HWqY/acl2-8.5dfsg/books/build/Makefile-comp-pre /build/acl2-b0HWqY/acl2-8.5dfsg/books/build/Makefile-deps /build/acl2-b0HWqY/acl2-8.5dfsg/books/build/Makefile-books /build/acl2-b0HWqY/acl2-8.5dfsg/books/build/Makefile-features /build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/system/toothbrush' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/acl2-b0HWqY/acl2-8.5dfsg/. rm -f defined-syms.lsp rm -f success.txt cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush/tests' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/system/toothbrush' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/../../../aux/minisat2//minisat/core/minisat SAT_SOLVER_TYPE=minisat CC=gcc clean-subdirs make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator make[4]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/examples/thacker' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' rm -f consistency-test.lisp make.lisp consistency-test-passed.lisp make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/rtl' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/apply-model' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/apply-model' make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg/books/projects/apply-model-2' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg/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-b0HWqY/acl2-8.5dfsg/books' make[1]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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-arch /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-b0HWqY/acl2-8.5dfsg' 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-b0HWqY/acl2-8.5dfsg' /usr/bin/make acl2r make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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 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 CONSTANT-BACKQUOTE-LST-P 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 UNEXEC) Modifications of this banner must retain notice of a compatible license Dedicated to the memory of W. Schelter Use (help) to get some basic information on how to use GCL. Temporary directory for compiler files: /tmp/ >/usr/bin/etags 0 0 >rm -f workxxx if [ -f TAGS ] ; then chmod 644 TAGS ; fi /usr/bin/make compile make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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 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 CONSTANT-BACKQUOTE-LST-P 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 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-b0HWqY/acl2-8.5dfsg/serialize-raw.c: In function ‘L43’: /build/acl2-b0HWqY/acl2-8.5dfsg/serialize-raw.c:4690:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4690 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/serialize-raw.c:4846:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4846 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c: In function ‘L537’: /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:50503:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 50503 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:50883:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 50883 | if((Cnil)!=Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:51203:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 51203 | if((Cnil)!=Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:51513:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 51513 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/interface-raw.c: In function ‘L156’: /build/acl2-b0HWqY/acl2-8.5dfsg/interface-raw.c:24727:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 24727 | if((Cnil)!=Cnil){ | ^~ NIL >make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[4]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' rm -f acl2-proclaims.lisp /usr/bin/make acl2-proclaims.lisp make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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 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 CONSTANT-BACKQUOTE-LST-P 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 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-b0HWqY/acl2-8.5dfsg' /usr/bin/make compile USE_ACL2_PROCLAIMS=t make[3]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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 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 CONSTANT-BACKQUOTE-LST-P 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 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-b0HWqY/acl2-8.5dfsg/serialize-raw.c: In function ‘LI43’: /build/acl2-b0HWqY/acl2-8.5dfsg/serialize-raw.c:4250:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4250 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/serialize-raw.c:4380:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4380 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c: In function ‘L537’: /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:40493:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 40493 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:40810:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 40810 | if((Cnil)!=Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:41080:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 41080 | if((Cnil)!=Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/translate0.c:41331:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 41331 | if((Cnil)==Cnil){ | ^~ /build/acl2-b0HWqY/acl2-8.5dfsg/interface-raw.c: In function ‘LI158’: /build/acl2-b0HWqY/acl2-8.5dfsg/interface-raw.c:20432:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 20432 | if((Cnil)!=Cnil){ | ^~ done. Bootstrapping, then saving executable (may take a few minutes) ... NIL >make[4]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[4]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[3]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[2]: Leaving directory '/build/acl2-b0HWqY/acl2-8.5dfsg' make[2]: Entering directory '/build/acl2-b0HWqY/acl2-8.5dfsg' 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 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 CONSTANT-BACKQUOTE-LST-P 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 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 529 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 0 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 211 SYMBOL pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).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=1).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=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 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=3).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 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=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 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=1).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=1).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=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).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 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 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 22 CFUN pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=1).GC finished] [GC for 586 RELOCATABLE-BLOCKS pages..(T=2).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=3).GC finished] [GC for 103 SFUN pages..(T=3).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=3).GC finished] [GC for 113 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 123 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=2).GC finished] [GC for 123 SFUN pages..(T=2).GC finished] [GC for 133 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 143 SFUN pages..(T=1).GC finished] [GC for 143 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 153 SFUN pages..(T=1).GC finished] [GC for 163 SFUN pages..(T=2).GC finished] [GC for 163 SFUN pages..(T=2).GC finished] [GC for 173 SFUN pages..(T=2).GC finished] [GC for 173 SFUN pages..(T=1).GC finished] [GC for 183 SFUN pages..(T=2).GC finished] [GC for 183 SFUN pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 193 SFUN pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 203 SFUN pages..(T=1).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 900 CONS pages..(T=2).GC finished] [GC for 910 CONS pages..(T=1).GC finished] [GC for 910 CONS pages..(T=2).GC finished] [GC for 920 CONS pages..(T=2).GC finished] [GC for 213 SFUN pages..(T=1).GC finished] [GC for 920 CONS pages..(T=2).GC finished] [GC for 930 CONS pages..(T=1).GC finished] [GC for 940 CONS pages..(T=1).GC finished] [GC for 950 CONS pages..(T=2).GC finished] [GC for 960 CONS pages..(T=1).GC finished] [GC for 970 CONS pages..(T=2).GC finished] [GC for 980 CONS pages..(T=2).GC finished] [GC for 990 CONS pages..(T=1).GC finished] [GC for 1000 CONS pages..(T=2).GC finished] [GC for 1010 CONS pages..(T=1).GC finished] [GC for 1020 CONS pages..(T=2).GC finished] [GC for 1030 CONS pages..(T=2).GC finished] [GC for 1040 CONS pages..(T=1).GC finished] [GC for 1050 CONS pages..(T=2).GC finished] [GC for 1060 CONS pages..(T=2).GC finished] [GC for 1070 CONS pages..(T=1).GC finished] [GC for 1080 CONS pages..(T=2).GC finished] [GC for 1090 CONS pages..(T=2).GC finished] [GC for 1100 CONS pages..(T=1).GC finished] [GC for 1110 CONS pages..(T=2).GC finished] [GC for 1120 CONS pages..(T=2).GC finished] [GC for 1130 CONS pages..(T=1).GC finished] [GC for 1140 CONS pages..(T=2).GC finished] [GC for 1150 CONS pages..(T=2).GC finished] [GC for 1160 CONS pages..(T=1).GC finished] [GC for 1170 CONS pages..(T=2).GC finished] [GC for 1180 CONS pages..(T=2).GC finished] [GC for 1190 CONS pages..(T=1).GC finished] [GC for 1200 CONS pages..(T=2).GC finished] [GC for 1210 CONS pages..(T=2).GC finished] [GC for 1220 CONS pages..(T=2).GC finished] [GC for 1230 CONS pages..(T=1).GC finished] [GC for 1240 CONS pages..(T=2).GC finished] [GC for 1250 CONS pages..(T=2).GC finished] [GC for 1260 CONS pages..(T=2).GC finished] [GC for 1270 CONS pages..(T=1).GC finished] [GC for 1280 CONS pages..(T=2).GC finished] [GC for 1290 CONS pages..(T=2).GC finished] [GC for 1300 CONS pages..(T=1).GC finished] [GC for 1310 CONS pages..(T=2).GC finished] [GC for 1320 CONS pages..(T=2).GC finished] [GC for 1330 CONS pages..(T=2).GC finished] [GC for 1340 CONS pages..(T=2).GC finished] [GC for 1350 CONS pages..(T=1).GC finished] [GC for 1360 CONS pages..(T=2).GC finished] [GC for 1370 CONS pages..(T=2).GC finished] [GC for 1380 CONS pages..(T=2).GC finished] [GC for 1390 CONS pages..(T=1).GC finished] [GC for 1400 CONS pages..(T=2).GC finished] [GC for 1410 CONS pages..(T=2).GC finished] [GC for 1420 CONS pages..(T=2).GC finished] [GC for 1430 CONS pages..(T=2).GC finished] [GC for 1440 CONS pages..(T=1).GC finished] [GC for 1450 CONS pages..(T=2).GC finished] [GC for 1460 CONS pages..(T=2).GC finished] [GC for 1470 CONS pages..(T=1).GC finished] [GC for 1480 CONS pages..(T=2).GC finished] [GC for 1490 CONS pages..(T=1).GC finished] [GC for 1500 CONS pages..(T=2).GC finished] [GC for 1510 CONS pages..(T=2).GC finished] [GC for 1520 CONS pages..(T=1).GC finished] [GC for 1530 CONS pages..(T=2).GC finished] [GC for 1540 CONS pages..(T=1).GC finished] [GC for 1550 CONS pages..(T=1).GC finished] [GC for 1560 CONS pages..(T=2).GC finished] [GC for 1570 CONS pages..(T=2).GC finished] [GC for 223 SFUN pages..(T=1).GC finished] [GC for 1570 CONS pages..(T=2).GC finished] [GC for 1580 CONS pages..(T=2).GC finished] [GC for 1590 CONS pages..(T=1).GC finished] [GC for 1600 CONS pages..(T=2).GC finished] [GC for 11008 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1610 CONS pages..(T=2).GC finished] [GC for 1620 CONS pages..(T=1).GC finished] [GC for 233 SFUN pages..(T=2).GC finished] [GC for 1630 CONS pages..(T=2).GC finished] [GC for 243 SFUN pages..(T=2).GC finished] [GC for 1640 CONS pages..(T=2).GC finished] [GC for 253 SFUN pages..(T=1).GC finished] [GC for 1650 CONS pages..(T=2).GC finished] [GC for 11264 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1660 CONS pages..(T=2).GC finished] [GC for 1670 CONS pages..(T=1).GC finished] [GC for 1680 CONS pages..(T=1).GC finished] [GC for 1690 CONS pages..(T=2).GC finished] [GC for 263 SFUN pages..(T=1).GC finished] [GC for 1700 CONS pages..(T=2).GC finished] [GC for 1710 CONS pages..(T=2).GC finished] [GC for 1720 CONS pages..(T=2).GC finished] [GC for 1730 CONS pages..(T=1).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 273 SFUN pages..(T=2).GC finished] [GC for 1740 CONS pages..(T=2).GC finished] [GC for 1750 CONS pages..(T=1).GC finished] [GC for 1760 CONS pages..(T=2).GC finished] [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 283 SFUN pages..(T=2).GC finished] [GC for 1770 CONS pages..(T=1).GC finished] [GC for 13568 CONTIGUOUS-BLOCKS pages..(T=2).GC finished] [GC for 1780 CONS pages..(T=2).GC finished] [GC for 1790 CONS pages..(T=1).GC finished] [GC for 293 SFUN pages..(T=2).GC finished] [GC for 32 CFUN pages..(T=2).GC finished] [GC for 1800 CONS pages..(T=2).GC finished] [GC for 1810 CONS pages..(T=2).GC finished] [GC for 1820 CONS pages..(T=1).GC finished] [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=3).GC finished] [GC for 1830 CONS pages..(T=2).GC finished] [GC for 303 SFUN pages..(T=2).GC finished] [GC for 1840 CONS pages..(T=1).GC finished] [GC for 1850 CONS pages..(T=2).GC finished] [GC for 1860 CONS pages..(T=2).GC finished] [GC for 1870 CONS pages..(T=2).GC finished] [GC for 1880 CONS pages..(T=2).GC finished] [GC for 313 SFUN pages..(T=2).GC finished] [GC for 1890 CONS pages..(T=2).GC finished] [GC for 1900 CONS pages..(T=2).GC finished] [GC for 1910 CONS pages..(T=2).GC finished] [GC for 1920 CONS pages..(T=2).GC finished] [GC for 323 SFUN pages..(T=1).GC finished] [GC for 1930 CONS pages..(T=1).GC finished] [GC for 1940 CONS pages..(T=2).GC finished] [GC for 1950 CONS pages..(T=2).GC finished] [GC for 333 SFUN pages..(T=2).GC finished] [GC for 1960 CONS pages..(T=2).GC finished] [GC for 1970 CONS pages..(T=2).GC finished] [GC for 343 SFUN pages..(T=2).GC finished] [GC for 1980 CONS pages..(T=2).GC finished] [GC for 353 SFUN pages..(T=2).GC finished] [GC for 1990 CONS pages..(T=2).GC finished] [GC for 2000 CONS pages..(T=2).GC finished] [GC for 2010 CONS pages..(T=2).GC finished] [GC for 2020 CONS pages..(T=2).GC finished] [GC for 2030 CONS pages..(T=2).GC finished] [GC for 2040 CONS pages..(T=2).GC finished] [GC for 2050 CONS pages..(T=2).GC finished] [GC for 2060 CONS pages..(T=2).GC finished] [GC for 2070 CONS pages..(T=2).GC finished] [GC for 2080 CONS pages..(T=2).GC finished] [GC for 2090 CONS pages..(T=2).GC finished] [GC for 2100 CONS pages..(T=2).GC finished] [GC for 2110 CONS pages..(T=2).GC finished] [GC for 2120 CONS pages..(T=3).GC finished] [GC for 353 SFUN pages..(T=2).GC finished] [GC for 2130 CONS pages..(T=2).GC finished] [GC for 2140 CONS pages..(T=2).GC finished] [GC for 2150 CONS pages..(T=2).GC finished] [GC for 2160 CONS pages..(T=2).GC finished] [GC for 2170 CONS pages..(T=2).GC finished] [GC for 2180 CONS pages..(T=2).GC finished] [GC for 2190 CONS pages..(T=2).GC finished] [GC for 2200 CONS pages..(T=2).GC finished] [GC for 2210 CONS pages..(T=2).GC finished] [GC for 2220 CONS pages..(T=2).GC finished] [GC for 2230 CONS pages..(T=2).GC finished] [GC for 2240 CONS pages..(T=2).GC finished] [GC for 2250 CONS pages..(T=3).GC finished] [GC for 2260 CONS pages..(T=2).GC finished] [GC for 2270 CONS pages..(T=2).GC finished] [GC for 2280 CONS pages..(T=2).GC finished] [GC for 2290 CONS pages..(T=2).GC finished] [GC for 363 SFUN pages..(T=2).GC finished] [GC for 2300 CONS pages..(T=3).GC finished] [GC for 2310 CONS pages..(T=2).GC finished] [GC for 2320 CONS pages..(T=2).GC finished] [GC for 2330 CONS pages..(T=2).GC finished] [GC for 2340 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 2350 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 [GC for 2360 CONS pages..(T=2).GC finished] CHANGE-PACKAGE-ENTRY-HIDDEN-P GETPROP GETPROPC *STANDARD-CO* *STANDARD-OI* *STANDARD-CI* INSIST [GC for 373 SFUN pages..(T=4).GC finished] IFF XOR EQ [GC for 2370 CONS pages..(T=4).GC finished] BOOLEANP NIL IMPLIES NIL NIL NOT NIL HIDE REWRITE-EQUIV REAL/RATIONALP COMPLEX/COMPLEX-RATIONALP [GC for 2380 CONS pages..(T=8).GC finished] TRUE-LISTP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] LIST-MACRO LIST AND-MACRO AND OR-MACRO OR - NIL NIL INTEGER-ABS [GC for 2390 CONS pages..(T=7).GC finished] XXXJOIN + LEN LENGTH ACL2-COUNT [GC for 2400 CONS pages..(T=6).GC finished] LEN LENGTH ACL2-COUNT COND-CLAUSESP COND-MACRO [GC for 2410 CONS pages..(T=6).GC finished] COND [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] EQLABLEP NIL NIL EQLABLE-LISTP EQL ATOM MAKE-CHARACTER-LIST EQLABLE-ALISTP [GC for 383 SFUN pages..(T=6).GC finished] ALISTP NIL NIL ACONS ENDP CAAR CADR CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR CDADR CDDAR CDDDR CAAAAR CAAADR CAADAR CAADDR [GC for 2420 CONS pages..(T=5).GC finished] CADAAR CADADR CADDAR CADDDR CDAAAR CDAADR CDADAR CDADDR CDDAAR CDDADR CDDDAR CDDDDR NULL SYMBOL-LISTP NIL SYMBOL-DOUBLET-LISTP REVERSE-STRIP-CARS [GC for 2430 CONS pages..(T=7).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] STRIP-CARS REVERSE-STRIP-CDRS STRIP-CDRS HARD-ERROR ILLEGAL RETURN-LAST RETURN-LAST-FN MBE1 MUST-BE-EQUAL MBE MBT MBT* [GC for 2440 CONS pages..(T=7).GC finished] BINARY-APPEND APPEND NIL CAR-CDR-ELIM CAR-CONS CDR-CONS CONS-EQUAL NIL CONCATENATE STRING-APPEND STRING-LISTP STRING-APPEND-LST [GC for 2440 CONS pages..(T=6).GC finished] GUARD-CHECK-FN LET-MBE-GUARD-FORM LET-MBE DEFUN-WITH-GUARD-CHECK PROG2$ [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] MEMBER-EQ-EXEC MEMBER-EQL-EXEC MEMBER-EQUAL MEMBER-EQ NIL NIL MEMBER [GC for 2450 CONS pages..(T=6).GC finished] SUBSETP-EQ-EXEC SUBSETP-EQL-EXEC SUBSETP-EQUAL SUBSETP-EQ NIL NIL SUBSETP [GC for 2450 CONS pages..(T=8).GC finished] SYMBOL-ALISTP NIL CHARACTER-ALISTP NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] ASSOC-EQ-EXEC ASSOC-EQL-EXEC ASSOC-EQUAL ASSOC-EQ NIL NIL ASSOC [GC for 2450 CONS pages..(T=7).GC finished] ASSOC-EQ-EQUAL-ALISTP ASSOC-EQ-SAFE ASSOC-EQ-EQUAL ASSOC-EQ-CADR ASSOC-EQUAL-CADR <= [GC for 2460 CONS pages..(T=6).GC finished] = /= > >= INT= ZP NIL NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] ZIP NIL NIL NIL NTH CHAR SLEEP PROPER-CONSP [GC for 2460 CONS pages..(T=7).GC finished] IMPROPER-CONSP * NONNEGATIVE-PRODUCT CONJUGATE ADD-SUFFIX *INLINE-SUFFIX* EC-CALL1 EC-CALL NON-EXEC / CLOSURE ASSOCIATIVITY-OF-+ COMMUTATIVITY-OF-+ FIX UNICITY-OF-0 INVERSE-OF-+ ASSOCIATIVITY-OF-* [GC for 2470 CONS pages..(T=7).GC finished] COMMUTATIVITY-OF-* UNICITY-OF-1 INVERSE-OF-* DISTRIBUTIVITY <-ON-OTHERS ZERO TRICHOTOMY POSITIVE RATIONAL-IMPLIES1 RATIONAL-IMPLIES2 INTEGER-IMPLIES-RATIONAL COMPLEX-IMPLIES1 COMPLEX-DEFINITION NIL NONZERO-IMAGPART REALPART-IMAGPART-ELIM REALPART-COMPLEX IMAGPART-COMPLEX NIL FORCE *FORCE-XNUME* IMMEDIATE-FORCE-MODEP *IMMEDIATE-FORCE-MODEP-XNUME* [GC for 2470 CONS pages..(T=6).GC finished] CASE-SPLIT NIL DISABLE-FORCING ENABLE-FORCING DISABLE-IMMEDIATE-FORCE-MODEP ENABLE-IMMEDIATE-FORCE-MODEP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] SYNP SYNTAXP BIND-FREE EXTRA-INFO NIL *EXTRA-INFO-FN* TAU-SYSTEM *TAU-STATUS-BOOT-STRAP-SETTINGS* NIL *TAU-SYSTEM-XNUME* *TAU-ACL2-NUMBERP-PAIR* *TAU-INTEGERP-PAIR* *TAU-RATIONALP-PAIR* *TAU-BOOLEANP-PAIR* *TAU-NATP-PAIR* *TAU-BITP-PAIR* *TAU-POSP-PAIR* *TAU-MINUSP-PAIR* REWRITE-LAMBDA-MODEP *REWRITE-LAMBDA-MODEP-XNUME* INTEGER-0 INTEGER-1 INTEGER-STEP LOWEST-TERMS NIL [GC for 2480 CONS pages..(T=7).GC finished] BOOLEANP-CHARACTERP CHARACTERP-PAGE CHARACTERP-TAB CHARACTERP-RUBOUT CHARACTERP-RETURN NO-DUPLICATESP-EQ-EXEC [GC for 2490 CONS pages..(T=7).GC finished] NO-DUPLICATESP-EQL-EXEC NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQ NIL NIL NO-DUPLICATESP R-EQLABLE-ALISTP R-SYMBOL-ALISTP [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] RASSOC-EQ-EXEC RASSOC-EQL-EXEC RASSOC-EQUAL RASSOC-EQ NIL NIL RASSOC IFIX [GC for 2500 CONS pages..(T=7).GC finished] RFIX REALFIX NFIX 1+ 1- NATP NIL NAT-ALISTP NIL BITP NIL NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] POSP NIL O-FINP O-INFP O-FIRST-EXPT O-FIRST-COEFF O-RST [GC for 2500 CONS pages..(T=8).GC finished] O O<= O>= [GC for 2510 CONS pages..(T=7).GC finished] O-P NIL NIL MAKE-ORD *STANDARD-CHARS* [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] STANDARD-CHAR-P STANDARD-CHAR-P+ STANDARD-CHAR-LISTP CHARACTER-LISTP NIL NIL COERCE-INVERSE-1 COERCE-INVERSE-2 CHARACTER-LISTP-COERCE NIL STRING [GC for 2520 CONS pages..(T=8).GC finished] ALPHA-CHAR-P UPPER-CASE-P LOWER-CASE-P [GC for 2520 CONS pages..(T=8).GC finished] CHAR-UPCASE CHAR-DOWNCASE NIL NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=7).GC finished] STRING-DOWNCASE1 NIL STRING-DOWNCASE STRING-UPCASE1 NIL STRING-UPCASE OUR-DIGIT-CHAR-P DIGIT-CHAR-P [GC for 2530 CONS pages..(T=8).GC finished] CHAR-EQUAL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] ATOM-LISTP NIL NIL GOOD-ATOM-LISTP NIL NIL STANDARD-STRING-P1 STANDARD-STRING-P STANDARD-STRING-LISTP [GC for 2530 CONS pages..(T=8).GC finished] STRING-EQUAL1 STRING-EQUAL MEMBER-STRING-EQUAL STANDARD-STRING-ALISTP NIL ASSOC-STRING-EQUAL [GC for 383 SFUN pages..(T=7).GC finished] LIST*-MACRO LIST* THROW-OR-ATTACH-CALL 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 MEMBER-SYMBOL-NAME NIL SYMBOL-NAME-INTERN-IN-PACKAGE-OF-SYMBOL [GC for 2540 CONS pages..(T=6).GC finished] SYMBOL-PACKAGE-NAME-INTERN-IN-PACKAGE-OF-SYMBOL INTERN-IN-PACKAGE-OF-SYMBOL-IS-IDENTITY SYMBOL-LISTP-PKG-IMPORTS [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] [GC for 2540 CONS pages..(T=7).GC finished] [GC for 2550 CONS pages..(T=8).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 STRING-IS-NOT-CIRCULAR NIL-IS-NOT-CIRCULAR NIL NIL CONS-WITH-HINT [GC for 2560 CONS pages..(T=7).GC finished] REMOVE-EQ-EXEC REMOVE-EQL-EXEC [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] REMOVE-EQUAL REMOVE-EQ NIL NIL REMOVE REMOVE1-EQ-EXEC [GC for 2560 CONS pages..(T=7).GC finished] REMOVE1-EQL-EXEC REMOVE1-EQUAL REMOVE1-EQ NIL NIL REMOVE1 REMOVE-DUPLICATES-EQ-EXEC [GC for 2570 CONS pages..(T=8).GC finished] REMOVE-DUPLICATES-EQL-EXEC REMOVE-DUPLICATES-EQUAL REMOVE-DUPLICATES-EQ NIL NIL REMOVE-DUPLICATES-LOGIC REMOVE-DUPLICATES NIL FIRST SECOND THIRD FOURTH FIFTH SIXTH SEVENTH EIGHTH NINTH TENTH REST IDENTITY REVAPPEND NIL NIL [GC for 2570 CONS pages..(T=7).GC finished] REVERSE PAIRLIS$-TAILREC [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] PAIRLIS$ NIL NIL SET-DIFFERENCE-EQ-EXEC SET-DIFFERENCE-EQL-EXEC [GC for 2580 CONS pages..(T=8).GC finished] SET-DIFFERENCE-EQUAL SET-DIFFERENCE-EQ NIL NIL SET-DIFFERENCE$ *WINDOW-DESCRIPTIONS* *VALID-OUTPUT-NAMES* LISTP *SUMMARY-TYPES* WITH-EVISC-TUPLE LAST FIRST-N-AC NIL [GC for 2580 CONS pages..(T=7).GC finished] TAKE BUTLAST MUTUAL-RECURSION-GUARDP COLLECT-CADRS-WHEN-CAR-MEMBER-EQ VALUE [GC for 2580 CONS pages..(T=8).GC finished] LEGAL-CONSTANTP1 VALUE-TRIPLE ASSERT-EVENT [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] EVENT-KEYWORD-NAME EVENT-KEYWORD-NAME-LST ADD-TO-SET-EQ-EXEC [GC for 2580 CONS pages..(T=9).GC finished] ADD-TO-SET-EQL-EXEC 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 [GC for 383 SFUN pages..(T=7).GC finished] EVENS ODDS MV-NTH MAKE-MV-NTHS MV MV? MV-LET MV?-LET LEGAL-CASE-CLAUSESP [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] CASE-TEST CASE-LIST CASE-LIST-CHECK CASE NONNEGATIVE-INTEGER-QUOTIENT TRUE-LIST-LISTP NIL [GC for 2590 CONS pages..(T=8).GC finished] LEGAL-LET*-P WELL-FORMED-TYPE-DECLS-P SYMBOL-LIST-LISTP [GC for 2590 CONS pages..(T=8).GC finished] GET-TYPE-DECLS LET*-MACRO [GC for 2600 CONS pages..(T=8).GC finished] COLLECT-CDRS-WHEN-CAR-EQ APPEND-LST RESTRICT-ALIST LET* PROGN [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] [GC for 2600 CONS pages..(T=7).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] [GC for 383 SFUN pages..(T=8).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] LOGNOT DIGIT-TO-CHAR PRINT-BASE-P [GC for 383 SFUN pages..(T=8).GC finished] EXPLODE-NONNEGATIVE-INTEGER MAKE-VAR-LST1 MAKE-VAR-LST NTHCDR NIL [GC for 383 SFUN pages..(T=7).GC finished] UNION-EQ-EXEC UNION-EQL-EXEC [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).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 2610 CONS pages..(T=7).GC finished] PLAUSIBLE-DCLSP1 PLAUSIBLE-DCLSP STRIP-KEYWORD-LIST STRIP-DCLS1 [GC for 2620 CONS pages..(T=8).GC finished] STRIP-DCLS FETCH-DCL-FIELDS2 FETCH-DCL-FIELDS1 [GC for 2620 CONS pages..(T=8).GC finished] FETCH-DCL-FIELDS FETCH-DCL-FIELD WITH-OUTPUT-ON-OFF-BINDING-VAL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] WITH-OUTPUT-ON-OFF-ARG MSGP CTXP [GC for 2620 CONS pages..(T=8).GC finished] [GC for 2630 CONS pages..(T=7).GC finished] WITH-OUTPUT-FN WITH-OUTPUT! WITH-OUTPUT [GC for 2640 CONS pages..(T=7).GC finished] DEFUN-NX-DCLS DEFUN-NX-FORM DEFUN-NX-FN DEFUN-NX DEFUND-NX UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 [GC for 2640 CONS pages..(T=6).GC finished] UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX ASSOC-KEYWORD PROGRAM-DECLARED-P2 PROGRAM-DECLARED-P1 [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] PROGRAM-DECLARED-P [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] SOME-PROGRAM-DECLARED-P PAIRLIS-X1 PAIRLIS-X2 APPEND? MUTUAL-RECURSION VARIABLEP NVARIABLEP FQUOTEP QUOTEP *T* *NIL* *0* *1* *-1* *2* [GC for 383 SFUN pages..(T=7).GC finished] KWOTE MAYBE-KWOTE KWOTE-LST UNQUOTE T (PSEUDO-TERMP PSEUDO-TERM-LISTP) NIL T [GC for 383 SFUN pages..(T=8).GC finished] PSEUDO-TERM-LIST-LISTP NIL LAMBDA-OBJECT-FORMALS LAMBDA-OBJECT-DCL LAMBDA-OBJECT-BODY LAMBDA-OBJECT-SHAPEP [GC for 383 SFUN pages..(T=7).GC finished] MAKE-LAMBDA-OBJECT FFN-SYMB FN-SYMB FARGS FARGN1 FARGN [GC for 383 SFUN pages..(T=6).GC finished] (ALL-VARS1 ALL-VARS1-LST) NIL ALL-VARS TRANSLATE-AND-TEST INTERSECTP-EQ-EXEC [GC for 383 SFUN pages..(T=8).GC finished] INTERSECTP-EQL-EXEC [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] INTERSECTP-EQUAL INTERSECTP-EQ NIL NIL INTERSECTP CHK-NO-STOBJ-INDEX-ALIASING MAKE-FMT-BINDINGS *BASE-10-CHARS* WARNING$ MSG [GC for 2640 CONS pages..(T=8).GC finished] CHECK-VARS-NOT-FREE-TEST CHECK-VARS-NOT-FREE ER-PROGN-FN ER-PROGN POSITION-AC-EQ-EXEC NIL [GC for 383 SFUN pages..(T=7).GC finished] POSITION-AC-EQL-EXEC NIL POSITION-EQUAL-AC NIL POSITION-AC-EQUAL POSITION-EQ-AC POSITION-AC-EQ NIL NIL POSITION-AC POSITION-EQ-EXEC [GC for 383 SFUN pages..(T=7).GC finished] POSITION-EQL-EXEC POSITION-EQUAL POSITION-EQ NIL NIL POSITION [GC for 2650 CONS pages..(T=7).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 383 SFUN pages..(T=8).GC finished] CHAR< CHAR> CHAR<= CHAR>= [GC for 383 SFUN pages..(T=7).GC finished] STRING<-L [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] STRING< STRING> STRING<= STRING>= [GC for 383 SFUN pages..(T=7).GC finished] SYMBOL< NIL NIL SUBSTITUTE-AC SUBSTITUTE NIL NIL SUBLIS [GC for 2660 CONS pages..(T=7).GC finished] SUBST PPROGN PROGN$ ACL2-UNWIND-PROTECT WHEN-LOGIC IN-PACKAGE DEFPKG DEFUN DEFUNS VERIFY-TERMINATION VERIFY-TERMINATION-BOOT-STRAP VERIFY-GUARDS VERIFY-GUARDS+ DEFMACRO DEFCONST DEFTHM ER DEFTHMD DEFAXIOM DEFLABEL DEFTHEORY DEFTHY DEFTHEORY-STATIC DEFSTOBJ IN-THEORY IN-ARITHMETIC-THEORY REGENERATE-TAU-DATABASE PUSH-UNTOUCHABLE [GC for 2670 CONS pages..(T=7).GC finished] REMOVE-UNTOUCHABLE SET-BODY TABLE ENCAPSULATE PARTIAL-ENCAPSULATE *LOAD-COMPILED-FILE-VALUES* INCLUDE-BOOK MAKE-EVENT RECORD-EXPANSION SKIP-PROOFS LOCAL DEFCHOOSE DEFATTACH WORLDP PLIST-WORLDP NIL PUTPROP *ACL2-PROPERTY-UNBOUND* GETPROP-DEFAULT [GC for 2680 CONS pages..(T=7).GC finished] FGETPROP SGETPROP ORDERED-SYMBOL-ALISTP NIL NIL ADD-PAIR [GC for 383 SFUN pages..(T=6).GC finished] REMOVE1-ASSOC-EQ-EXEC REMOVE1-ASSOC-EQL-EXEC [GC for 383 SFUN pages..(T=7).GC finished] REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQ NIL NIL REMOVE1-ASSOC REMOVE-ASSOC-EQ-EXEC [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] REMOVE-ASSOC-EQL-EXEC REMOVE-ASSOC-EQUAL REMOVE-ASSOC-EQ NIL NIL REMOVE-ASSOC GETPROPS1 [GC for 2680 CONS pages..(T=7).GC finished] GETPROPS NIL NIL NIL HAS-PROPSP1 [GC for 2690 CONS pages..(T=8).GC finished] HAS-PROPSP EXTEND-WORLD RETRACT-WORLD GLOBAL-VAL [GC for 383 SFUN pages..(T=9).GC finished] FUNCTION-SYMBOLP FCONS-TERM* CONJOIN2 CONJOIN CONJOIN-UNTRANSLATED-TERMS [GC for 383 SFUN pages..(T=7).GC finished] DISJOIN2 DISJOIN DISJOIN-LST KWOTE? [GC for 383 SFUN pages..(T=5).GC finished] CONJOIN? <=? >? DISJOIN? TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN [GC for 383 SFUN pages..(T=8).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD/INTEGER WEAK-SATISFIES-TYPE-SPEC-P [GC for 2700 CONS pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD1-GEN [GC for 2710 CONS pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD1 (TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST) TRANSLATE-DECLARATION-TO-GUARD [GC for 383 SFUN pages..(T=7).GC finished] TRANSLATE-DECLARATION-TO-GUARD-LST THE-CHECK THE-FN THE THE-CHECK-FOR-*1* [GC for 383 SFUN pages..(T=8).GC finished] THE-FN-FOR-*1* THE-FOR-*1* *MAXIMUM-POSITIVE-32-BIT-INTEGER* BOUNDED-INTEGER-ALISTP NIL NIL NIL F-GET-GLOBAL ARRAY1P NIL NIL [GC for 383 SFUN pages..(T=8).GC finished] BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P NIL NIL HEADER [GC for 383 SFUN pages..(T=8).GC finished] DIMENSIONS MAXIMUM-LENGTH DEFAULT AREF1 [GC for 383 SFUN pages..(T=8).GC finished] COMPRESS11 [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] ARRAY-ORDER COMPRESS1 NIL ASET1 [GC for 383 SFUN pages..(T=9).GC finished] ASET1-TRUSTED AREF2 COMPRESS211 COMPRESS21 [GC for 383 SFUN pages..(T=9).GC finished] COMPRESS2 NIL ASET2 FLUSH-COMPRESS [GC for 383 SFUN pages..(T=8).GC finished] MAYBE-FLUSH-AND-COMPRESS1 CDRN MV-LIST SWAP-STOBJS UPDATE-NTH [GC for 42 CFUN pages..(T=8).GC finished] UPDATE-NTH-ARRAY MAXIMUM-POSITIVE-32-BIT-INTEGER MINIMUM-NEGATIVE-32-BIT-INTEGER 32-BIT-INTEGERP NIL ACL2-NUMBER-LISTP NIL RATIONAL-LISTP NIL INTEGER-LISTP NIL [GC for 383 SFUN pages..(T=8).GC finished] NAT-LISTP NIL 32-BIT-INTEGER-LISTP NIL OPEN-INPUT-CHANNELS [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS UPDATE-OPEN-OUTPUT-CHANNELS GLOBAL-TABLE [GC for 383 SFUN pages..(T=9).GC finished] UPDATE-GLOBAL-TABLE T-STACK UPDATE-T-STACK 32-BIT-INTEGER-STACK [GC for 383 SFUN pages..(T=6).GC finished] UPDATE-32-BIT-INTEGER-STACK BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY IDATES [GC for 2049 RELOCATABLE-BLOCKS pages..(T=4).GC finished] UPDATE-IDATES ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK [GC for 383 SFUN pages..(T=4).GC finished] UPDATE-FILE-CLOCK READABLE-FILES WRITTEN-FILES UPDATE-WRITTEN-FILES [GC for 383 SFUN pages..(T=7).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] READ-FILES UPDATE-READ-FILES WRITEABLE-FILES LIST-ALL-PACKAGE-NAMES-LST [GC for 383 SFUN pages..(T=7).GC finished] UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 UPDATE-USER-STOBJ-ALIST1 *INITIAL-CHECKPOINT-PROCESSORS* *INITIAL-PROGRAM-FNS-WITH-RAW-CODE* *INITIAL-LOGIC-FNS-WITH-RAW-CODE* *INITIAL-MACROS-WITH-RAW-CODE* UNTOUCHABLE-MARKER DEFMACRO-UNTOUCHABLE WITH-LIVE-STATE [GC for 383 SFUN pages..(T=5).GC finished] INIT-IPRINT-AR *IPRINT-SOFT-BOUND-DEFAULT* *IPRINT-HARD-BOUND-DEFAULT* DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT *FMT-SOFT-RIGHT-MARGIN-DEFAULT* *FMT-HARD-RIGHT-MARGIN-DEFAULT* *INITIAL-GLOBAL-TABLE* T WITH-INFIXP-NIL ALL-BOUNDP KNOWN-PACKAGE-ALISTP NIL [GC for 2710 CONS pages..(T=5).GC finished] TIMER-ALISTP NIL TYPED-IO-LISTP NIL *FILE-TYPES* OPEN-CHANNEL1 NIL [GC for 383 SFUN pages..(T=4).GC finished] OPEN-CHANNEL-LISTP OPEN-CHANNELS-P NIL FILE-CLOCK-P NIL READABLE-FILE NIL READABLE-FILES-LISTP NIL [GC for 383 SFUN pages..(T=8).GC finished] READABLE-FILES-P NIL [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] WRITTEN-FILE NIL WRITTEN-FILE-LISTP NIL WRITTEN-FILES-P NIL READ-FILE-LISTP1 NIL [GC for 383 SFUN pages..(T=5).GC finished] READ-FILE-LISTP NIL READ-FILES-P NIL WRITABLE-FILE-LISTP1 NIL WRITABLE-FILE-LISTP NIL [GC for 383 SFUN pages..(T=8).GC finished] WRITEABLE-FILES-P NIL STATE-P1 NIL STATE-P NIL NIL [GC for 2720 CONS pages..(T=8).GC finished] BUILD-STATE *DEFAULT-STATE* BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE NIL GLOBAL-TABLE-CARS1 [GC for 383 SFUN pages..(T=8).GC finished] GLOBAL-TABLE-CARS BOUNDP-GLOBAL1 BOUNDP-GLOBAL F-BOUNDP-GLOBAL [GC for 383 SFUN pages..(T=8).GC finished] MAKUNBOUND-GLOBAL GET-GLOBAL [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] PUT-GLOBAL F-PUT-GLOBAL *INITIAL-LD-SPECIAL-BINDINGS* ALWAYS-BOUNDP-GLOBAL STATE-GLOBAL-LET*-BINDINGS-P [GC for 383 SFUN pages..(T=7).GC finished] STATE-GLOBAL-LET*-GET-GLOBALS STATE-GLOBAL-LET*-PUT-GLOBALS STATE-GLOBAL-LET*-CLEANUP WITH-PARALLELISM-HAZARD-WARNINGS [GC for 2730 CONS pages..(T=7).GC finished] 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 383 SFUN pages..(T=8).GC finished] ZPF NIL NIL NIL NIL NIL NIL NIL COMPLETION-OF-SYMBOL-NAME NIL COMPLETION-OF-SYMBOL-PACKAGE-NAME NIL NIL :EMPTY-ENCAPSULATE LOGAND LOGEQV LOGIOR LOGXOR INTEGER-LENGTH BINARY-LOGAND [GC for 2740 CONS pages..(T=8).GC finished] LOGNAND BINARY-LOGIOR LOGORC1 [GC for 383 SFUN pages..(T=8).GC finished] LOGORC2 LOGANDC1 LOGANDC2 BINARY-LOGEQV [GC for 383 SFUN pages..(T=7).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] 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* *BOOLE-SET* *BOOLE-XOR* [GC for 383 SFUN pages..(T=8).GC finished] BOOLE$ SET-FORMS-FROM-BINDINGS *PRINT-CONTROL-DEFAULTS* ALIST-DIFFERENCE-EQ WITH-PRINT-DEFAULTS RESET-PRINT-CONTROL [GC for 2750 CONS pages..(T=7).GC finished] EXPLODE-ATOM NIL EXPLODE-ATOM+ NIL NIL NIL NIL [GC for 383 SFUN pages..(T=8).GC finished] OPEN-INPUT-CHANNEL-P1 OPEN-OUTPUT-CHANNEL-P1 OPEN-INPUT-CHANNEL-P [GC for 383 SFUN pages..(T=7).GC finished] OPEN-OUTPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-ANY-P1 OPEN-OUTPUT-CHANNEL-ANY-P OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES [GC for 2760 CONS pages..(T=8).GC finished] FREE-VAR-RUNES NIL *DIRECTORY-SEPARATOR* *DIRECTORY-SEPARATOR-STRING* OS-ER OS [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] ABSOLUTE-PATHNAME-STRING-P ILLEGAL-RULER-EXTENDERS-VALUES TABLE-ALIST RULER-EXTENDERS-MSG-AUX [GC for 2760 CONS pages..(T=7).GC finished] RULER-EXTENDERS-MSG STRICT-SYMBOL<-SORTEDP CHK-RULER-EXTENDERS FIXNUM-BOUND *DEFAULT-STEP-LIMIT* INCLUDE-BOOK-DIR-ALIST-ENTRY-P INCLUDE-BOOK-DIR-ALISTP *CHECK-INVARIANT-RISK-VALUES* [GC for 2770 CONS pages..(T=7).GC finished] TTAG 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 [GC for 2770 CONS pages..(T=6).GC finished] CHECK-PRINT-BASE SET-PRINT-BASE SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] SET-PRINT-READABLY CHECK-NULL-OR-NATP SET-PRINT-LENGTH SET-PRINT-LEVEL SET-PRINT-LINES SET-PRINT-RIGHT-MARGIN [GC for 2780 CONS pages..(T=8).GC finished] RAW-PRINT-VARS-ALIST *RAW-PRINT-VARS-ALIST* PRINC$ WRITE-BYTE$ [GC for 2790 CONS pages..(T=8).GC finished] W GET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM NIL NIL [GC for 2790 CONS pages..(T=7).GC finished] PRINT-OBJECT$+-ALIST MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL [GC for 2790 CONS pages..(T=8).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] OPEN-INPUT-CHANNEL NIL NIL NIL NIL CLOSE-INPUT-CHANNEL OPEN-OUTPUT-CHANNEL [GC for 2790 CONS pages..(T=8).GC finished] OPEN-OUTPUT-CHANNEL! ASSERT$ ASSERT* COMMENT-WINDOW-CO FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! FMT-TO-COMMENT-WINDOW+ [GC for 2790 CONS pages..(T=7).GC finished] FMT-TO-COMMENT-WINDOW!+ PAIRLIS2 CW CW! CW+ CW!+ CW-PRINT-BASE-RADIX CW-PRINT-BASE-RADIX! SUBSEQ-LIST SUBSEQ LOCK-SYMBOL-NAME-P [GC for 2790 CONS pages..(T=8).GC finished] ASSIGN-LOCK LOCK-TABLE WITH-LOCK DEFLOCK WITH-OUTPUT-LOCK WITH-LOCAL-STATE-LOCK GET-OUTPUT-STREAM-STRING$-FN GET-OUTPUT-STREAM-STRING$ [GC for 2800 CONS pages..(T=9).GC finished] CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] READ-CHAR$ PEEK-CHAR$ READ-BYTE$ RAW-MODE-P READ-OBJECT [GC for 2800 CONS pages..(T=8).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 [GC for 2800 CONS pages..(T=7).GC finished] PRIN1-WITH-SLASHES1 PRIN1-WITH-SLASHES SUSPICIOUSLY-FIRST-NUMERIC-CHARS NUMERIC-CHARS MAY-NEED-SLASHES1 NIL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=7).GC finished] ALL-DOTS MAY-NEED-SLASHES-FN MAY-NEED-SLASHES NEEDS-SLASHES [GC for 2810 CONS pages..(T=9).GC finished] T-STACK-LENGTH1 T-STACK-LENGTH MAKE-LIST-AC MAKE-LIST [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] EXTEND-T-STACK :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL MSWINDOWS-DRIVE1 MSWINDOWS-DRIVE SHRINK-T-STACK [GC for 2810 CONS pages..(T=8).GC finished] AREF-T-STACK ASET-T-STACK 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK [GC for 2810 CONS pages..(T=7).GC finished] AREF-32-BIT-INTEGER-STACK 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 [GC for 2810 CONS pages..(T=5).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] USER-STOBJ-ALIST UPDATE-USER-STOBJ-ALIST POWER-EVAL READ-IDATE READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR [GC for 2820 CONS pages..(T=7).GC finished] GETENV$ SETENV$ RANDOM$ NIL NIL NIL SYS-CALL NIL SYS-CALL-STATUS :EMPTY-ENCAPSULATE NIL NIL SYS-CALL+ [GC for 2820 CONS pages..(T=7).GC finished] SYS-CALL* NIL NIL NIL NIL NIL NIL NIL NIL MAIN-TIMER [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).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 [GC for 2820 CONS pages..(T=7).GC finished] SET-TIMER GET-TIMER NIL PUSH-TIMER NIL NIL NIL NIL NIL POP-TIMER ADD-TIMERS NIL NIL NIL NIL [GC for 2830 CONS pages..(T=8).GC finished] NIL NIL NIL INCREMENT-TIMER PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER NIL [GC for 2830 CONS pages..(T=9).GC finished] SET-PRINT-BASE-RADIX KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] PRIN1$ NIL CURRENT-PACKAGE NIL *INITIAL-UNTOUCHABLE-FNS* *INITIAL-UNTOUCHABLE-VARS* LD-SKIP-PROOFSP ASSIGN @ [GC for 2830 CONS pages..(T=8).GC finished] SUBST-FOR-NTH-ARG THE-MV THE2S INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC [GC for 2830 CONS pages..(T=7).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 GET-ENFORCE-REDUNDANCY DEFAULT-VERIFY-GUARDS-EAGERNESS-FROM-TABLE DEFAULT-VERIFY-GUARDS-EAGERNESS SET-VERIFY-GUARDS-EAGERNESS DEFAULT-COMPILE-FNS SET-COMPILE-FNS [GC for 2840 CONS pages..(T=7).GC finished] SET-COMPILER-ENABLED SET-PORT-FILE-ENABLED [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] DEFAULT-MEASURE-FUNCTION SET-MEASURE-FUNCTION DEFAULT-WELL-FOUNDED-RELATION SET-WELL-FOUNDED-RELATION DEFAULT-DEFUN-MODE-FROM-TABLE DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE LOGIC PROGRAM [GC for 2840 CONS pages..(T=7).GC finished] INVISIBLE-FNS-TABLE SET-INVISIBLE-FNS-TABLE UNARY-FUNCTION-SYMBOL-LISTP 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 [GC for 2840 CONS pages..(T=7).GC finished] REMOVE1-ASSOC-STRING-EQUAL TOGGLE-INHIBIT-WARNING! TOGGLE-INHIBIT-WARNING INHIBIT-ER-SOFT-TABLE SET-INHIBIT-ER-SOFT! SET-INHIBIT-ER-SOFT TOGGLE-INHIBIT-ER-SOFT! TOGGLE-INHIBIT-ER-SOFT SET-INHIBIT-OUTPUT-LST SET-INHIBITED-SUMMARY-TYPES SET-STATE-OK SET-LET*-ABSTRACTIONP SET-LET*-ABSTRACTION LET*-ABSTRACTIONP *INITIAL-BACKCHAIN-LIMIT* *INITIAL-DEFAULT-BACKCHAIN-LIMIT* SET-BACKCHAIN-LIMIT [GC for 2850 CONS pages..(T=7).GC finished] BACKCHAIN-LIMIT SET-DEFAULT-BACKCHAIN-LIMIT DEFAULT-BACKCHAIN-LIMIT STEP-LIMIT-FROM-TABLE SET-PROVER-STEP-LIMIT *DEFAULT-REWRITE-STACK-LIMIT* SET-REWRITE-STACK-LIMIT [GC for 2860 CONS pages..(T=9).GC finished] REWRITE-STACK-LIMIT [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] CASE-SPLIT-LIMITATIONS SR-LIMIT CASE-LIMIT SET-CASE-SPLIT-LIMITATIONS *INITIAL-ACL2-DEFAULTS-TABLE* 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 MATCH-FREE-OVERRIDE [GC for 2860 CONS pages..(T=8).GC finished] 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 TAU-AUTO-MODEP SET-TAU-AUTO-MODE [GC for 2860 CONS 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 [GC for 2870 CONS pages..(T=8).GC finished] MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE 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! [GC for 2870 CONS pages..(T=7).GC finished] ADD-DEFAULT-HINTS ADD-DEFAULT-HINTS! REMOVE-DEFAULT-HINTS REMOVE-DEFAULT-HINTS! SET-OVERRIDE-HINTS-MACRO ADD-OVERRIDE-HINTS! ADD-OVERRIDE-HINTS SET-OVERRIDE-HINTS! SET-OVERRIDE-HINTS REMOVE-OVERRIDE-HINTS! REMOVE-OVERRIDE-HINTS SET-RW-CACHE-STATE SET-RW-CACHE-STATE! *LEGAL-RW-CACHE-STATES* RW-CACHE-STATE-TABLE INDUCTION-DEPTH-LIMIT-TABLE *INDUCTION-DEPTH-LIMIT-DEFAULT* INDUCTION-DEPTH-LIMIT-TABLE SET-INDUCTION-DEPTH-LIMIT! SET-INDUCTION-DEPTH-LIMIT TRUE-LIST-FIX-EXEC TRUE-LIST-FIX :EMPTY-ENCAPSULATE NIL FIX-TRUE-LIST MACRO-ALIASES-TABLE NIL BOOLEAN-LISTP [GC for 2880 CONS pages..(T=9).GC finished] 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 14848 CONTIGUOUS-BLOCKS pages..(T=10).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 DOUBLE-REWRITE 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* [GC for 2890 CONS pages..(T=8).GC finished] CHK-WITH-GUARD-CHECKING-ARG WITH-GUARD-CHECKING1 WITH-GUARD-CHECKING-GATE WITH-GUARD-CHECKING WITH-GUARD-CHECKING-ERROR-TRIPLE WITH-GUARD-CHECKING-EVENT ABORT! A! P! NIL BIND-ACL2-TIME-LIMIT OUR-WITH-TERMINAL-INPUT WORMHOLE1 WORMHOLE-P DUPLICATES [GC for 474 SYMBOL pages..(T=8).GC finished] SET-EQUALP-EQUAL |Access METAFUNCTION-CONTEXT record field UNIFY-SUBST| |Access REWRITE-CONSTANT record field CURRENT-CLAUSE| RECORD-ERROR [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] RECORD-ACCESSOR-FUNCTION-NAME ACCESS MFC-CLAUSE MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP [GC for 2900 CONS pages..(T=9).GC finished] MFC-TYPE-ALIST 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 2910 CONS pages..(T=8).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 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] MERGE-SORT-LEXORDER 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 2920 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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.19 seconds (prove: 0.01, print: 0.00, other: 0.18) 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.... The guard conjecture for CHAR is trivial to prove, given primitive type reasoning and the :type-prescription rule LENGTH. CHAR is compliant with Common Lisp. [GC for 2920 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN CHAR ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.25 seconds (prove: 0.00, print: 0.00, other: 0.25) CHAR ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP) The admission of EQLABLE-ALISTP is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of EQLABLE-ALISTP is described by the theorem (OR (EQUAL (EQLABLE-ALISTP X) T) (EQUAL (EQLABLE-ALISTP X) NIL)). We used primitive type reasoning. Computing the guard conjecture for EQLABLE-ALISTP.... The guard conjecture for EQLABLE-ALISTP is trivial to prove. EQLABLE-ALISTP is compliant with Common Lisp. Summary Form: ( DEFUN EQLABLE-ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) EQLABLE-ALISTP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC) The admission of ASSOC-EQL-EXEC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT ALIST). We could deduce no constraints on the type of ASSOC-EQL-EXEC. Computing the guard conjecture for ASSOC-EQL-EXEC.... The non-trivial part of the guard conjecture for ASSOC-EQL-EXEC is Goal (AND (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (NOT (CONSP ALIST))) (EQ ALIST NIL)) (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (NOT (ENDP ALIST)) (NOT (EQL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))) (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (EQLABLEP X)) (NOT (ENDP ALIST))) (EQLABLEP (CAR (CAR ALIST)))) (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (EQLABLEP X)) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (EQLABLEP X)) (NOT (ENDP ALIST)) (NOT (EQL X (CAR (CAR ALIST))))) (EQLABLE-ALISTP (CDR ALIST))) (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (EQLABLEP X)) (NOT (CONSP ALIST))) (EQ ALIST NIL))). By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the conjecture to the following seven conjectures. Subgoal 7 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 6 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))). [GC for 2930 CONS pages..(T=8).GC finished] But simplification reduces this to T, using the :definition ALISTP. Subgoal 5 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 4 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST))))) (CHARACTERP (CAR (CAR ALIST)))). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal 3 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal 2 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (EQLABLE-ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal 1 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Q.E.D. That completes the proof of the guard theorem for ASSOC-EQL-EXEC. ASSOC-EQL-EXEC is compliant with Common Lisp. 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.08, print: 0.00, other: 0.18) Prover steps counted: 665 ASSOC-EQL-EXEC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK) Since ASSOC-EQL-EXEC$GUARD-CHECK is non-recursive, its admission is trivial. We observe that the type of ASSOC-EQL-EXEC$GUARD-CHECK is described by the theorem (EQUAL (ASSOC-EQL-EXEC$GUARD-CHECK X ALIST) T). Computing the guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK.... The guard conjecture for ASSOC-EQL-EXEC$GUARD-CHECK is trivial to prove. ASSOC-EQL-EXEC$GUARD-CHECK is compliant with Common Lisp. Summary Form: ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) ASSOC-EQL-EXEC$GUARD-CHECK ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL) The admission of ASSOC-EQUAL is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT ALIST). We could deduce no constraints on the type of ASSOC-EQUAL. Computing the guard conjecture for ASSOC-EQUAL.... The non-trivial part of the guard conjecture for ASSOC-EQUAL is Goal (AND (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST))) (EQ ALIST NIL)) (IMPLIES (AND (ALISTP ALIST) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (ALISTP ALIST) (NOT (ENDP ALIST)) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST)))). [GC for 2930 CONS pages..(T=8).GC finished] 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 14848 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] Summary Form: ( DEFUN ASSOC-EQUAL ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT)) Time: 0.35 seconds (prove: 0.08, print: 0.01, other: 0.26) 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 2930 CONS pages..(T=8).GC finished] Name the formula above *3. Subgoal 2.1 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). Name the formula above *4. Subgoal 1 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST) (NOT (CONSP (ASSOC-EQUAL TREE ALIST)))) (EQUAL (ASSOC-EQUAL TREE ALIST) NIL)). This simplifies, using primitive type reasoning, to Subgoal 1' (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). Name the formula above *5. Perhaps we can prove *5 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. These merge into one derived induction scheme. We will induct according to a scheme suggested by (ASSOC-EQUAL TREE ALIST). This suggestion was produced using the :induction rules ASSOC-EQUAL and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *5 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (AND (NOT (ENDP ALIST)) (EQUAL TREE (CAR (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (ENDP ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit ASSOC-EQUAL. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *5/5 (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (CONSP (ASSOC-EQUAL TREE (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). 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 2930 CONS pages..(T=8).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)). [GC for 2930 CONS pages..(T=8).GC finished] By the simple :definition ATOM we reduce the conjecture to Subgoal *4/5' (IMPLIES (AND (CONSP ALIST) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal *4/4 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *4/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). 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)). [GC for 2930 CONS pages..(T=7).GC finished] 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)). Perhaps we can prove *3 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST). This suggestion was produced using the :induction rules ALISTP and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *3 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST))))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (ATOM ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit EQLABLE-ALISTP. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *3/5 (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/5' (IMPLIES (AND (CONSP ALIST) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal *3/4 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *3/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *3/3 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/3' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). [GC for 2930 CONS pages..(T=8).GC finished] But simplification reduces this to T, using the :definitions ALISTP, EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP. Subgoal *3/2 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/2' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *3/1 (IMPLIES (AND (ATOM ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *3. We therefore turn our attention to *2, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). Perhaps we can prove *2 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST). This suggestion was produced using the :induction rules ALISTP and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *2 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST))))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (ATOM ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit EQLABLE-ALISTP. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *2/5 (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to 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)). [GC for 2930 CONS pages..(T=7).GC finished] By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *2/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *2/3 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *2/3' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions ALISTP, EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP. Subgoal *2/2 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to 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)). [GC for 2930 CONS pages..(T=7).GC finished] But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *2. We therefore turn our attention to *1, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (ASSOC-EQL-EXEC TREE ALIST). This suggestion was produced using the :induction rules ASSOC-EQL-EXEC, ASSOC-EQUAL and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQL TREE (CAR (CAR ALIST)))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (AND (NOT (ENDP ALIST)) (EQL TREE (CAR (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (ENDP ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit ASSOC-EQL-EXEC. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQL TREE (CAR (CAR ALIST)))) (EQUAL (ASSOC-EQUAL TREE (CDR ALIST)) (ASSOC-EQL-EXEC TREE (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP ALIST) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (EQUAL (ASSOC-EQUAL TREE (CDR ALIST)) (ASSOC-EQL-EXEC TREE (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC, ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQL TREE (CAR (CAR ALIST)))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP ALIST) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). 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))). [GC for 2930 CONS pages..(T=8).GC finished] 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.89 seconds (prove: 0.65, print: 0.03, other: 0.21) Prover steps counted: 5516 SUBLIS ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX) Since NFIX is non-recursive, its admission is trivial. We observe that the type of NFIX is described by the theorem (AND (INTEGERP (NFIX X)) (<= 0 (NFIX X))). Computing the guard conjecture for NFIX.... The guard conjecture for NFIX is trivial to prove. NFIX is compliant with Common Lisp. Summary Form: ( DEFUN NFIX ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) NFIX ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX) Since IFIX is non-recursive, its admission is trivial. We observe that the type of IFIX is described by the theorem (INTEGERP (IFIX X)). Computing the guard conjecture for IFIX.... The guard conjecture for IFIX is trivial to prove. IFIX is compliant with Common Lisp. Summary Form: ( DEFUN IFIX ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) IFIX ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS) 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)). [GC for 2930 CONS pages..(T=11).GC finished] 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)))). 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.31 seconds (prove: 0.11, print: 0.00, other: 0.20) 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.... [GC for 2940 CONS pages..(T=8).GC finished] The guard conjecture for FLOOR is trivial to prove, given the :executable- counterpart of EQLABLEP, primitive type reasoning and the :type-prescription rule NONNEGATIVE-INTEGER-QUOTIENT. FLOOR is compliant with Common Lisp. Summary Form: ( DEFUN FLOOR ...) Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT)) Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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 [GC for 2940 CONS pages..measure (ACL2-COUNT ALIST).(T=9).GC finished] We observe that the type of PLIST-WORLDP is described by the theorem (OR (EQUAL (PLIST-WORLDP ALIST) T) (EQUAL (PLIST-WORLDP ALIST) NIL)). We used primitive type reasoning. Computing the guard conjecture for PLIST-WORLDP.... The guard conjecture for PLIST-WORLDP is trivial to prove. PLIST-WORLDP is compliant with Common Lisp. Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) 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))). [GC for 2940 CONS pages..(T=9).GC finished] But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 2 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 1 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for FGETPROP. FGETPROP is compliant with Common Lisp. Summary Form: ( DEFUN FGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.27 seconds (prove: 0.10, print: 0.00, other: 0.17) Prover steps counted: 704 FGETPROP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP) The admission of SGETPROP is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT WORLD-ALIST). We could deduce no constraints on the type of SGETPROP. Computing the guard conjecture for SGETPROP.... The non-trivial part of the guard conjecture for SGETPROP is Goal (AND (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (CONSP WORLD-ALIST))) (EQ WORLD-ALIST NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (NOT (AND (EQ SYMB (CAR (CAR WORLD-ALIST))) (EQ KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (AND (EQ SYMB (CAR (CAR WORLD-ALIST))) (EQ KEY (CADR (CAR WORLD-ALIST)))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)) (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (ENDP WORLD-ALIST)) (EQ SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL))). [GC for 2950 CONS pages..(T=9).GC finished] By the simple :definitions ENDP and EQ we reduce the conjecture to the following five conjectures. Subgoal 5 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (NOT (CONSP WORLD-ALIST))) (EQUAL WORLD-ALIST NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 4 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 3 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 2 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 1 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP WORLD-NAME) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for SGETPROP. SGETPROP is compliant with Common Lisp. Summary Form: ( DEFUN SGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.29 seconds (prove: 0.09, print: 0.01, other: 0.19) 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. [GC for 2950 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) FUNCTION-SYMBOLP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS) The admission of STRIP-CARS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of STRIP-CARS is described by the theorem (TRUE-LISTP (STRIP-CARS X)). We used primitive type reasoning. Computing the guard conjecture for STRIP-CARS.... The non-trivial part of the guard conjecture for STRIP-CARS is Goal (AND (IMPLIES (AND (ALISTP X) (NOT (CONSP X))) (EQ X NIL)) (IMPLIES (AND (ALISTP X) (NOT (ENDP X))) (ALISTP (CDR X))) (IMPLIES (AND (ALISTP X) (NOT (ENDP X)) (NOT (CONSP (CAR X)))) (EQUAL (CAR X) NIL))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following three conjectures. Subgoal 3 (IMPLIES (AND (ALISTP X) (NOT (CONSP X))) (EQUAL X NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 2 (IMPLIES (AND (ALISTP X) (CONSP X)) (ALISTP (CDR X))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 1 (IMPLIES (AND (ALISTP X) (CONSP X) (NOT (CONSP (CAR X)))) (EQUAL (CAR X) NIL)). But simplification reduces this to T, using the :definition ALISTP. Q.E.D. That completes the proof of the guard theorem for STRIP-CARS. STRIP-CARS is compliant with Common Lisp. Summary Form: ( DEFUN STRIP-CARS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) 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 14848 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24) 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. [GC for 2950 CONS pages..(T=9).GC finished] That completes the proof of the guard theorem for ASSOC-EQ-EXEC. ASSOC-EQ-EXEC is compliant with Common Lisp. Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION SYMBOL-ALISTP)) Time: 0.29 seconds (prove: 0.00, print: 0.09, other: 0.20) 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.13 seconds (prove: 0.00, print: 0.00, other: 0.13) TABLE-ALIST End of Encapsulated Events. [GC for 2950 CONS pages..(T=9).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] [GC for 2950 CONS pages..(T=10).GC finished] [GC for 2960 CONS pages..(T=9).GC finished] [GC for 2960 CONS pages..(T=8).GC finished] [GC for 2970 CONS pages..(T=8).GC finished] Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export 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: 9.00 seconds (prove: 1.12, print: 0.14, other: 7.74) Prover steps counted: 9199 T [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN MOD-EXPT ...) Rules: NIL Time: 0.25 seconds (prove: 0.00, print: 0.00, other: 0.25) MOD-EXPT Summary Form: ( DEFUN CONJOIN-CLAUSES ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) CONJOIN-CLAUSES Summary Form: ( DEFCONST *TRUE-CLAUSE* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *TRUE-CLAUSE* Summary Form: ( DEFCONST *FALSE-CLAUSE* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *FALSE-CLAUSE* Summary Form: ( DEFUN CLAUSES-RESULT ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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 2980 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: NIL Time: 0.36 seconds (prove: 0.00, print: 0.00, other: 0.36) SEARCH-FN-GUARD Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) SEARCH-FROM-START Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) SEARCH-FROM-END To verify that the 18 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1 (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STRINGP-SUBSEQ (IMPLIES (STRINGP STR) (STRINGP (SUBSEQ STR START END))))) [GC for 2980 CONS pages..(T=9).GC finished] ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-NTHCDR (IMPLIES (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP (NTHCDR N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND (IMPLIES (AND (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE (IMPLIES (AND (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-NTHCDR (EQUAL (LEN (NTHCDR N X)) (NFIX (- (LEN X) (NFIX N)))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) [GC for 2980 CONS pages..(T=8).GC finished] ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-OF-TAKE (EQUAL (LEN (TAKE N LST)) (NFIX N)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ (IMPLIES (AND (TRUE-LISTP SEQ) (NATP START) (NATP END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (- END START))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ-STRING (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (- END START))) :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(DEFUN SEARCH-FN (SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (DECLARE (XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ))))) (LET* ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2))) (SEQ1 (SUBSEQ SEQ1 START1 END1))) (MV-LET (SEQ1 SEQ2) (COND ((EQ TEST 'CHAR-EQUAL) (MV (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2))) (T (MV SEQ1 SEQ2))) (AND (<= (- END1 START1) (- END2 START2)) (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL)) (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))))))) Summary Form: ( DEFUN SEARCH-FN ...) Rules: NIL Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) 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.59 seconds (prove: 0.00, print: 0.00, other: 0.59) T Summary Form: ( DEFMACRO SEARCH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SEARCH [GC for 2980 CONS pages..(T=9).GC finished] 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.19 seconds (prove: 0.00, print: 0.00, other: 0.19) COUNT-STRINGP Summary Form: ( DEFUN COUNT-LISTP ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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.19 seconds (prove: 0.00, print: 0.00, other: 0.19) COUNT-FN End of Encapsulated Events. [GC for 2980 CONS 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 COUNT-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 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 Summary Form: ( DEFUN MAKE-SHARP-ATSIGN ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) MAKE-SHARP-ATSIGN Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) 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 [GC for 2990 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN GET-WORMHOLE-STATUS ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) GET-WORMHOLE-STATUS Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) FILE-WRITE-DATE$ Summary Form: ( DEFUN DELETE-FILE$ ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) DELETE-FILE$ Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) DEBUGGER-ENABLE Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) BREAK$ Summary Form: ( DEFUN PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) 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.17 seconds (prove: 0.00, print: 0.00, other: 0.17) DEBUGGER-ENABLEDP [GC for 393 SFUN pages..(T=10).GC finished] Summary Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.27 seconds (prove: 0.00, print: 0.00, other: 0.27) 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 Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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 [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ADD-@PAR-SUFFIX ...) Rules: NIL Time: 0.25 seconds (prove: 0.00, print: 0.00, other: 0.25) ADD-@PAR-SUFFIX Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) GENERATE-@PAR-MAPPINGS Summary Form: ( DEFCONST *@PAR-MAPPINGS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *@PAR-MAPPINGS* Summary Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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)) [GC for 2990 CONS pages..(T=8).GC finished] Summary Form: ( DEFMACRO MV-LET@PAR ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) 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) 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)) [GC for 3000 CONS pages..(T=7).GC finished] 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) 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 Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ACL2 p!>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION RST)) Summary Form: ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS RST)) Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) FIND-APPLICABLE-HINT-SETTINGS@PAR ACL2 p!>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS1 RST)) Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) FIND-APPLICABLE-HINT-SETTINGS1@PAR ACL2 p!>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST) (CONS 'GAG-STATE-EXITING-CL-ID RST)) Summary Form: ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) GAG-STATE-EXITING-CL-ID@PAR ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-PSPV RST)) Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) LOAD-HINT-SETTINGS-INTO-PSPV@PAR ACL2 p!>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-RCNST RST)) Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) LOAD-HINT-SETTINGS-INTO-RCNST@PAR ACL2 p!>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR (&REST RST) (CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE RST)) Summary Form: ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY RST)) Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MAYBE-WARN-ABOUT-THEORY@PAR ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS RST)) Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ACL2 p!>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE RST)) Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ACL2 p!>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST) (CONS 'MAYBE-WARN-FOR-USE-HINT RST)) Summary Form: ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MAYBE-WARN-FOR-USE-HINT@PAR ACL2 p!>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR (&REST RST) (CONS 'PAIR-CL-ID-WITH-HINT-SETTING RST)) Summary Form: ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PAIR-CL-ID-WITH-HINT-SETTING@PAR ACL2 p!>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST) (CONS 'PROCESS-BACKTRACK-HINT RST)) Summary Form: ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PROCESS-BACKTRACK-HINT@PAR ACL2 p!>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST) (CONS 'PUSH-CLAUSE RST)) Summary Form: ( DEFMACRO PUSH-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PUSH-CLAUSE@PAR ACL2 p!>>(DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR (&REST RST) (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM RST)) Summary Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ACL2 p!>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST) (CONS 'RECORD-GAG-STATE RST)) Summary Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) RECORD-GAG-STATE@PAR ACL2 p!>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST) (CONS 'THANKS-FOR-THE-HINT RST)) Summary Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) THANKS-FOR-THE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE@PAR (&REST RST) (CONS 'TRANSLATE RST)) Summary Form: ( DEFMACRO TRANSLATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE@PAR ACL2 p!>>(DEFMACRO TRANSLATE1@PAR (&REST RST) (CONS 'TRANSLATE1 RST)) Summary Form: ( DEFMACRO TRANSLATE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKTRACK-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BACKTRACK-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BDD-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BDD-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BY-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-BY-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASES-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CASES-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL 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)) [GC for 3010 CONS pages..(T=8).GC finished] Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-DO-NOT-INDUCT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-ERROR-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-EXPAND-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-EXPAND-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM RST)) Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-EXPAND-TERM@PAR ACL2 p!>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM1 RST)) Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-EXPAND-TERM1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION RST)) Summary Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HANDS-OFF-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HANDS-OFF-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST) (CONS 'TRANSLATE-HINTS RST)) Summary Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINTS@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS1 RST)) Summary Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINTS1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST) (CONS 'TRANSLATE-HINTS2 RST)) Summary Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINTS2@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS+1 RST)) Summary Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINTS+1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSION RST)) Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINT-EXPRESSION@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSIONS RST)) Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINT-EXPRESSIONS@PAR ACL2 p!>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-SETTINGS RST)) Summary Form: ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-HINT-SETTINGS@PAR ACL2 p!>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-INDUCT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-INDUCT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST) (CONS 'TRANSLATE-LMI RST)) Summary Form: ( DEFMACRO TRANSLATE-LMI@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-LMI@PAR ACL2 p!>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE RST)) Summary Form: ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ACL2 p!>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/INSTANCE RST)) Summary Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-LMI/INSTANCE@PAR ACL2 p!>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-OP-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-NO-OP-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-THANKS-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-NO-THANKS-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NONLINEARP-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-NONLINEARP-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-OR-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-OR-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST) (CONS 'TRANSLATE-REORDER-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-REORDER-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RESTRICT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-RESTRICT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RW-CACHE-STATE-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-RW-CACHE-STATE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR (&REST RST) (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE RST)) Summary Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION RST)) Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-TERM-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) [GC for 3010 CONS pages..(T=8).GC finished] Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-X-HINT-VALUE@PAR ACL2 p!>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ACL2 p!>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST) (CONS 'WATERFALL-MSG RST)) Summary Form: ( DEFMACRO WATERFALL-MSG@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WATERFALL-MSG@PAR ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE RST)) 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.37 seconds (prove: 0.00, print: 0.00, other: 0.37) WATERFALL1@PAR Summary Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) REPLACE-DEFUN@PAR-WITH-DEFUN Summary Form: ( DEFMACRO MUTUAL-RECURSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MUTUAL-RECURSION@PAR Summary Form: ( DEFMACRO DEFUN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) DEFUN@PAR Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM Summary Form: ( DEFMACRO SERIAL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-ONLY Summary Form: ( DEFMACRO PARALLEL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PARALLEL-ONLY Summary Form: ( DEFMACRO STATE-MAC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) STATE-MAC Summary Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ERROR-IN-PARALLELISM-MODE Summary Form: ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *WATERFALL-PRINTING-VALUES* Summary Form: ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *WATERFALL-PARALLELISM-VALUES* Summary Form: ( DEFUN SYMBOL-CONSTANT-FN ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) SYMBOL-CONSTANT-FN [GC for 3020 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN STOBJS-IN ...) Rules: NIL Time: 0.21 seconds (prove: 0.00, print: 0.00, other: 0.21) STOBJS-IN Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) ALL-NILS Summary Form: ( DEFCONST *TTAG-FNS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *TTAG-FNS* Summary Form: ( DEFUN LOGICP ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) LOGICP Summary Form: ( DEFMACRO LOGICALP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) LOGICALP Summary Form: ( DEFMACRO PROGRAMP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PROGRAMP Summary Form: ( DEFCONST *STOBJS-OUT-INVALID* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *STOBJS-OUT-INVALID* Summary Form: ( DEFUN STOBJS-OUT ...) Rules: NIL Time: 0.20 seconds (prove: 0.00, print: 0.00, other: 0.20) STOBJS-OUT [GC for 3020 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: NIL Time: 0.37 seconds (prove: 0.00, print: 0.00, other: 0.37) EV-FNCALL-W-GUARD1 Summary Form: ( DEFUN EV-FNCALL-W-GUARD ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) EV-FNCALL-W-GUARD Summary Form: ( DEFUN TIME-TRACKER-FN ...) Rules: NIL Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) 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 3030 CONS pages..(T=8).GC finished] Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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.... 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)))). [GC for 3040 CONS pages..(T=7).GC finished] 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. 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)). [GC for 3050 CONS pages..(T=8).GC finished] 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)). Name the formula above *4. Subgoal 3 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (NOT (CONSP X))) (EQUAL X NIL)). But simplification reduces this to T, using the :definition EQLABLE-LISTP. Subgoal 2 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (LET ((X (CAR X)) (L Y)) (AND (OR (NOT (EQLABLEP X)) (TRUE-LISTP L)) (OR (EQLABLEP X) (EQLABLE-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQL-EXEC X L))))). [GC for 3050 CONS pages..(T=7).GC finished] This simplifies, using the :definitions EQLABLEP (if-intro) and NOT (if-intro), to the following two conjectures. Subgoal 2.2 (IMPLIES (AND (TRUE-LISTP Y) (EQLABLE-LISTP X) (NOT (EQLABLE-LISTP Y)) (CONSP X)) (EQUAL (MEMBER-EQUAL (CAR X) Y) (MEMBER-EQL-EXEC (CAR X) Y))). 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))). 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))). [GC for 3050 CONS pages..(T=8).GC finished] 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))). 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'' [GC for 3050 CONS pages..(T=7).GC finished] (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))). 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))). [GC for 3050 CONS pages..(T=7).GC finished] 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))). 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))). [GC for 3050 CONS pages..(T=6).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 *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))). 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. [GC for 3050 CONS pages..(T=6).GC finished] 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''' (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)))). [GC for 3050 CONS pages..(T=6).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 *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))). 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))). [GC for 3050 CONS pages..(T=6).GC finished] 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))). 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))). [GC for 3050 CONS pages..(T=6).GC finished] 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 3050 CONS pages..(T=6).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 3050 CONS pages..(T=6).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 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))). [GC for 3050 CONS pages..(T=5).GC finished] 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 3050 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.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 3050 CONS pages..(T=4).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)). [GC for 3050 CONS pages..(T=4).GC finished] 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))). 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 3050 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.45 seconds (prove: 0.97, print: 0.25, other: 0.23) 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.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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. [GC for 3050 CONS pages..(T=9).GC finished] Summary Form: ( DEFUN REVAPPEND ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) REVAPPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC) The admission of FIRST-N-AC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT I). We observe that the type of FIRST-N-AC is described by the theorem (OR (CONSP (FIRST-N-AC I L AC)) (EQUAL (FIRST-N-AC I L AC) NIL)). We used the :type-prescription rule REVAPPEND. Computing the guard conjecture for FIRST-N-AC.... The non-trivial part of the guard conjecture for FIRST-N-AC, given primitive type reasoning, is Goal (IMPLIES (AND (TRUE-LISTP AC) (TRUE-LISTP L) (<= 0 I) (INTEGERP I) (NOT (ZP I))) (<= 0 (+ -1 I))). But we reduce the conjecture to T, by the simple :definition ZP and the :executable-counterpart of TAU-SYSTEM. Q.E.D. 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.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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.32 seconds (prove: 0.00, print: 0.00, other: 0.32) TAKE End of Encapsulated Events. [GC for 3050 CONS pages..(T=9).GC finished] [GC for 393 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 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: 4.06 seconds (prove: 0.97, print: 0.25, other: 2.84) 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.20 seconds (prove: 0.00, print: 0.00, other: 0.20) READ-FILE-INTO-STRING1 [GC for 3050 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...) Rules: NIL Time: 0.33 seconds (prove: 0.00, print: 0.00, other: 0.33) READ-FILE-INTO-STRING2-LOGICAL Summary Form: ( DEFUN READ-FILE-INTO-STRING2 ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) READ-FILE-INTO-STRING2 Summary Form: ( DEFMACRO READ-FILE-INTO-STRING ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) READ-FILE-INTO-STRING Summary Form: ( DEFMACRO WHEN-PASS-2 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WHEN-PASS-2 Summary Form: ( DEFUN PRINT-CL-CACHE-FN ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) PRINT-CL-CACHE-FN Summary Form: ( DEFMACRO PRINT-CL-CACHE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PRINT-CL-CACHE [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] Summary Form: ( DEFUN HONS-REMOVE-ASSOC ...) Rules: NIL Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) HONS-REMOVE-ASSOC Summary Form: ( DEFUN COUNT-KEYS ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) COUNT-KEYS Summary Form: ( DEFUN HONS-ENABLEDP ...) Rules: NIL Time: 0.09 seconds (prove: 0.00, print: 0.00, other: 0.09) HONS-ENABLEDP 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 [GC for 393 SFUN pages..(T=9).GC finished] HONS-ACONS FAST-ALIST-FREE-ON-EXIT-RAW FAST-ALIST-FREE FAST-ALIST-FREE-ON-EXIT HONS-COPY HONS-COPY-PERSISTENT HONS HONS-EQUAL-LITE HONS-CLEAR [GC for 484 SYMBOL pages..(T=9).GC finished] HONS-CLEAR! HONS-WASH HONS-WASH! HONS-SUMMARY HONS-RESIZE HONS-RESIZE-FN HONS SET-SLOW-ALIST-ACTION HONS-ACONS! MAKE-FAST-ALIST [GC for 393 SFUN pages..(T=9).GC finished] FAST-ALIST-FORK FAST-ALIST-FORK! HONS-SHRINK-ALIST HONS-SHRINK-ALIST! MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE FAST-ALIST-CLEAN FAST-ALIST-CLEAN! FAST-ALIST-LEN [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] FAST-ALIST-SUMMARY WITH-FAST-ALIST-RAW WITH-FAST-ALIST WITH-STOLEN-ALIST-RAW WITH-STOLEN-ALIST CONS-SUBTREES NUMBER-SUBTREES FLUSH-HONS-GET-HASH-TABLE-LINK NIL REMOVE-KEYWORD Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO DEFN (F A &REST R) (CONS 'DEFUN (CONS F #))) (DEFMACRO DEFND (F A &REST R) (CONS 'DEFUND (CONS F #))) (DEFN HONS-EQUAL (X Y) (DECLARE (XARGS :MODE :LOGIC)) (EQUAL X Y)) (DEFN HONS-ASSOC-EQUAL (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (COND (# NIL) (# #) (T #))) (DEFN HONS-GET (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (HONS-ASSOC-EQUAL KEY ALIST)) (DEFN HONS-ACONS (KEY VAL ALIST) (DECLARE (XARGS :MODE :LOGIC)) (CONS (CONS KEY VAL) ALIST)) ...). ACL2 loading "basis-a.lisp". "ACL2" [GC for 3060 CONS pages..(T=8).GC finished] EQUAL-X-CONSTANT MATCH-TESTS-AND-BINDINGS MATCH-CLAUSE [GC for 3070 CONS pages..(T=9).GC finished] MATCH-CLAUSE-LIST CASE-MATCH WORMHOLE-STATUSP WORMHOLE-ENTRY-CODE WORMHOLE-DATA SET-WORMHOLE-ENTRY-CODE [GC for 393 SFUN pages..(T=7).GC finished] SET-WORMHOLE-DATA MAKE-WORMHOLE-STATUS TREE-OCCUR-EQ WORMHOLE-EVAL WITH-WORMHOLE-LOCK [GC for 3080 CONS pages..(T=8).GC finished] WORMHOLE-EVAL-EARLY-NULL-EXIT-P WORMHOLE LAMBDA-KEYWORDP [GC for 3090 CONS pages..(T=8).GC finished] LEGAL-VARIABLE-OR-CONSTANT-NAMEP LEGAL-VARIABLEP ARGLISTP1 ARGLISTP [GC for 3100 CONS pages..(T=8).GC finished] FIND-FIRST-BAD-ARG PROCESS-DEFABBREV-DECLARES [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] DEFABBREV1 DEFABBREV *EVISCERATION-MARK* *EVISCERATION-HASH-MARK* *EVISCERATION-ELLIPSIS-MARK* *EVISCERATION-WORLD-MARK* *EVISCERATION-STATE-MARK* *EVISCERATION-ERROR-TRIPLE-MARKS* *EVISCERATION-HIDING-MARK* *ANTI-EVISCERATION-MARK* EVISCERATEDP *SHARP-ATSIGN-AR* GET-SHARP-ATSIGN UPDATE-IPRINT-ALIST-FAL [GC for 3100 CONS pages..(T=8).GC finished] (EVISCERATE1 EVISCERATE1-LST) (EVISCERATE1P EVISCERATE1P-LST) [GC for 2049 RELOCATABLE-BLOCKS pages..(T=9).GC finished] EVISCERATE EVISCERATE-SIMPLE ASET1-LST IPRINT-HARD-BOUND IPRINT-SOFT-BOUND [GC for 393 SFUN pages..(T=9).GC finished] IPRINT-LAST-INDEX* IPRINT-LAST-INDEX IPRINT-AR-ILLEGAL-INDEX IPRINT-ENABLEDP [GC for 393 SFUN pages..(T=8).GC finished] IPRINT-AR-AREF1 COLLECT-POSP-INDICES-TO-HEADER IPRINT-FAL-NAME IPRINT-EAGER-P INIT-IPRINT-FAL [GC for 393 SFUN pages..(T=9).GC finished] ROLLOVER-IPRINT-AR [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=9).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! [GC for 3110 CONS pages..(T=9).GC finished] THE-STRING! XXXJOIN-FIXNUM +F -F |1-F| |1+F| CHARF *F PPR-FLAT-RIGHT-MARGIN SET-PPR-FLAT-RIGHT-MARGIN KEYWORD-PARAM-VALUEP [GC for 3120 CONS pages..(T=8).GC finished] CONS-PPR1 FLSZ-INTEGER [GC for 3130 CONS pages..(T=8).GC finished] [GC for 3140 CONS pages..(T=9).GC finished] FLSZ-ATOM *NEWLINE-STRING* [GC for 3150 CONS pages..(T=10).GC finished] FLSZ1 FLSZ MAX-WIDTH [GC for 3150 CONS pages..(T=9).GC finished] (PPR1 PPR1-LST) NEWLINE FMT-HARD-RIGHT-MARGIN [GC for 393 SFUN pages..(T=9).GC finished] FMT-SOFT-RIGHT-MARGIN SET-FMT-HARD-RIGHT-MARGIN SET-FMT-SOFT-RIGHT-MARGIN WRITE-FOR-READ [GC for 393 SFUN pages..(T=8).GC finished] SPACES1 [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] MAKE-SPACES-ARRAY-REC MAKE-SPACES-ARRAY *ACL2-BUILT-IN-SPACES-ARRAY* SPACES [GC for 393 SFUN pages..(T=10).GC finished] (FLPR1 FLPR11) FLPR PPR2-FLAT [GC for 3150 CONS pages..(T=9).GC finished] (PPR2-COLUMN PPR2) *FMT-PPR-INDENTATION* PPR *ILLEGAL-FMT-KEYS* [GC for 393 SFUN pages..(T=9).GC finished] ILLEGAL-FMT-STRING ILLEGAL-FMT-MSG SCAN-PAST-WHITESPACE ZERO-ONE-OR-MORE [GC for 3160 CONS pages..(T=9).GC finished] FIND-ALTERNATIVE-SKIP [GC for 3160 CONS pages..(T=8).GC finished] FIND-ALTERNATIVE-START1 [GC for 3160 CONS pages..(T=10).GC finished] FMT-CHAR [GC for 3160 CONS pages..(T=8).GC finished] FIND-ALTERNATIVE-START [GC for 3170 CONS pages..(T=10).GC finished] FIND-ALTERNATIVE-STOP PUNCTP FMT-TILDE-S1 [GC for 3180 CONS pages..(T=10).GC finished] FMT-TILDE-CAP-S1 [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] FMT-VAR SPLAT-ATOM SPLAT-ATOM! SPLAT-STRING [GC for 393 SFUN pages..(T=10).GC finished] (SPLAT SPLAT1) NUMBER-OF-DIGITS [GC for 393 SFUN pages..(T=10).GC finished] LEFT-PAD-WITH-BLANKS MAYBE-NEWLINE EVISC-TUPLE STANDARD-EVISC-TUPLEP WORLD-EVISCERATION-ALIST ABBREV-EVISC-TUPLE GAG-MODE [GC for 393 SFUN pages..(T=9).GC finished] TERM-EVISC-TUPLE GAG-MODE-EVISC-TUPLE LD-EVISC-TUPLE [GC for 393 SFUN pages..(T=9).GC finished] FMT-PPR SCAN-PAST-EMPTY-FMT-DIRECTIVES [GC for 3180 CONS pages..(T=10).GC finished] [GC for 3190 CONS pages..(T=11).GC finished] [GC for 3200 CONS pages..(T=10).GC finished] [GC for 3210 CONS pages..(T=9).GC finished] [GC for 3220 CONS pages..(T=10).GC finished] [GC for 3230 CONS pages..(T=7).GC finished] [GC for 3240 CONS pages..(T=7).GC finished] [GC for 3250 CONS pages..(T=6).GC finished] [GC for 3260 CONS pages..(T=6).GC finished] [GC for 3270 CONS pages..(T=7).GC finished] [GC for 3280 CONS pages..(T=8).GC finished] [GC for 3290 CONS pages..(T=9).GC finished] [GC for 3300 CONS pages..(T=8).GC finished] [GC for 3310 CONS pages..(T=8).GC finished] [GC for 3320 CONS pages..(T=8).GC finished] [GC for 3330 CONS pages..(T=8).GC finished] [GC for 3340 CONS pages..(T=8).GC finished] [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=10).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 403 SFUN pages..(T=10).GC finished] TILDE-*-&V-STRINGS FMT1 FMT FMS FMT1! FMT! [GC for 403 SFUN pages..(T=9).GC finished] FMS! FMX FMX-CW-MSG-1-BODY [GC for 3350 CONS pages..(T=12).GC finished] FMX-CW-MSG-1 FMX-CW-MSG FMX-CW-FN-GUARD FMX-CW-FN [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] FMX!-CW-FN FMX-CW FMX!-CW FMT-DOC-EXAMPLE1 FMT-DOC-EXAMPLE *SEE-DOC-SET-IPRINT* FMT-ABBREV1 FMT-ABBREV *FMT-CTX-SPACERS* FMT-CTX [GC for 403 SFUN pages..(T=11).GC finished] FMT-IN-CTX ER-SOFT-OFF-P1 ER-SOFT-OFF-P ERROR-FMS-CHANNEL ERROR-FMS PUSH-WARNING-FRAME [GC for 403 SFUN pages..(T=8).GC finished] ABSORB-FRAME POP-WARNING-FRAME [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] PUSH-WARNING RECORD-MAKER-FUNCTION-NAME RECORD-CHANGER-FUNCTION-NAME MAKE CHANGE MAKE-RECORD-CAR-CDRS1 MAKE-RECORD-CAR-CDRS MAKE-RECORD-ACCESSORS SYMBOL-NAME-TREE-OCCUR [GC for 403 SFUN pages..(T=7).GC finished] SOME-SYMBOL-NAME-TREE-OCCUR MAKE-RECORD-CHANGER-CONS MAKE-RECORD-CHANGER-LET-BINDINGS MAKE-RECORD-CHANGER-LET MAKE-RECORD-CHANGER MAKE-RECORD-MAKER-CONS MAKE-RECORD-MAKER-LET [GC for 403 SFUN pages..(T=9).GC finished] MAKE-RECORD-MAKER MAKE-RECORD-FIELD-LST RECORD-MAKER-RECOGNIZER-NAME MAKE-RECORD-RECOGNIZER-BODY MAKE-RECORD-RECOGNIZER RECORD-MACROS DEFREC RECORD-TYPE [GC for 403 SFUN pages..(T=10).GC finished] IO?-NIL-OUTPUT CHECK-EXACT-FREE-VARS FORMAL-BINDINGS WEAK-IO-RECORD-P PUSH-IO-RECORD SAVED-OUTPUT-TOKEN-P IO?-WORMHOLE-BINDINGS *TRACKED-WARNING-SUMMARIES* IO? IO?-PROVE [GC for 403 SFUN pages..(T=8).GC finished] OUTPUT-IGNORED-P ERROR1 ERROR1-SAFE *UNINHIBITED-WARNING-SUMMARIES* WARNING-OFF-P1 WARNING-OFF-P [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] WEAK-DO-EXPRESSIONP-P WEAK-STATE-VARS-P DEFAULT-STATE-VARS WARNING1-BODY WARNING1-FORM WARNING1 WARNING-DISABLED-P ER-SOFT ER-SOFT@PAR OBSERVATION1-BODY [GC for 3350 CONS pages..(T=10).GC finished] OBSERVATION1 OBSERVATION1-CW OBSERVATION OBSERVATION-CW WEAK-DEFSTOBJ-FIELD-TEMPLATE-P [GC for 494 SYMBOL pages..(T=11).GC finished] WEAK-DEFSTOBJ-TEMPLATE-P PACKN1 PACKN-POS FIND-FIRST-NON-CL-SYMBOL PACKN PACK2 [GC for 403 SFUN pages..(T=10).GC finished] DEFSTOBJ-FNNAME-KEY2 DOUBLET-LISTP DEFSTOBJ-FNNAME DEFINED-CONSTANT [GC for 403 SFUN pages..(T=10).GC finished] 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 403 SFUN pages..(T=9).GC finished] DEFSTOBJ-TEMPLATE SIMPLE-ARRAY-TYPE LIVE-STOBJP ABSSTOBJ-NAME WEAK-DEFSTOBJ-REDUNDANT-RAW-LISP-DISCRIMINATOR-VALUE-P WEAK-STOBJ-PROPERTY-P [GC for 403 SFUN pages..(T=9).GC finished] GET-STOBJ-CREATOR THE$ GET-STOBJ-SCALAR-FIELD MAKE-STOBJ-SCALAR-FIELD [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] (MAYBE-CONTAINED-IN-CHARACTER SOME-MAYBE-CONTAINED-IN-CHARACTER ALL-MAYBE-CONTAINED-IN-CHARACTER) SINGLE-FIELD-TYPE-P STOBJ-HASH-TABLE-TEST STOBJ-HASH-TABLE-INIT-SIZE STOBJ-HASH-TABLE-ELEMENT-TYPE [GC for 3350 CONS pages..(T=9).GC finished] DEFSTOBJ-FIELD-FNS-RAW-DEFS DEFSTOBJ-RAW-INIT-FIELDS DEFSTOBJ-RAW-INIT-SETF-FORMS DEFSTOBJ-RAW-INIT [GC for 3350 CONS pages..(T=9).GC finished] DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS STOBJP TRANSLATE-STOBJ-TYPE-TO-GUARD DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS [GC for 3350 CONS pages..(T=9).GC finished] CONGRUENT-STOBJ-REP ALL-BUT-LAST DEFSTOBJ-RAW-DEFS DEFCONST-NAME [GC for 403 SFUN pages..(T=9).GC finished] DEFSTOBJ-DEFCONSTS STRIP-ACCESSOR-NAMES THE-LIVE-VAR STANDARD-CO WEAK-LD-HISTORY-ENTRY-P [GC for 403 SFUN pages..(T=9).GC finished] PARSE-WITH-LOCAL-STOBJ PARSE-VERSION PCD2 POWER-REP [GC for 403 SFUN pages..(T=9).GC finished] DECODE-IDATE PRINT-IDATE GOOD-BYE-FN GOOD-BYE EXIT QUIT EXPAND-TILDE-TO-USER-HOME-DIR [GC for 403 SFUN pages..(T=10).GC finished] SAVE-EXEC-FN SAVE-EXEC *SLASH-DOT-DOT* *LENGTH-SLASH-DOT-DOT* [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] FIND-DOT-DOT (CANCEL-DOT-DOTS GET-PARENT-DIRECTORY MERGE-USING-DOT-DOT) [GC for 403 SFUN pages..(T=8).GC finished] COMMENT-STRING-P1 COMMENT-STRING-P WEAK-PRINT-CONTROL-P :REDUNDANT [GC for 3350 CONS pages..(T=11).GC finished] PRINT-CONTROL-ALISTP *RAW-PRINT-VARS-KEYS* ALIST-KEYS-SUBSETP PRINT-CONTROL-P [GC for 403 SFUN pages..(T=9).GC finished] PRINT-OBJECT$-FN PRINT-OBJECT$ 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 [GC for 403 SFUN pages..(T=9).GC finished] MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MEMSUM *HONS-PRIMITIVE-FNS* *HONS-PRIMITIVES* *MHT-DEFAULT-SIZE* MEMOIZE-FORM MEMOIZE UNMEMOIZE PROFILE MEMOIZEDP-WORLD [GC for 3360 CONS pages..(T=9).GC finished] 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 SERIALIZE-READ-FN [GC for 403 SFUN pages..(T=9).GC finished] 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 403 SFUN 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 [GC for 403 SFUN pages..(T=9).GC finished] COLLECT-NON-* [GC for 52 CFUN pages..(T=9).GC finished] DEFSTUB-BODY-NEW DEFPROXY DEFSTUB-IGNORES DEFSTUB-BODY-OLD-AUX DEFSTUB-BODY-OLD [GC for 403 SFUN pages..(T=9).GC finished] DEFSTUB-FN1 DEFSTUB-FN DEFSTUB *PRIMITIVE-FORMALS-AND-GUARDS* *PRIMITIVE-MONADIC-BOOLEANS* [GC for 3370 CONS pages..(T=8).GC finished] CONS-TERM1-CASES *CONS-TERM1-ALIST* CONS-TERM1-BODY QUOTE-LISTP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] CONS-TERM1 CONS-TERM CONS-TERM* MCONS-TERM MCONS-TERM* FCONS-TERM [GC for 403 SFUN pages..(T=10).GC finished] CDR-NEST STOBJ-PRINT-NAME EVISCERATION-STOBJ-MARK EVISCERATION-STOBJ-MARKS1 *ERROR-TRIPLE-SIG* *CMP-SIG* [GC for 403 SFUN pages..(T=10).GC finished] EVISCERATION-STOBJ-MARKS EVISCERATE-STOBJS1 EVISCERATE-STOBJS EVISCERATE-STOBJS-TOP FLAMBDA-APPLICATIONP LAMBDA-APPLICATIONP FLAMBDAP LAMBDA-FORMALS LAMBDA-BODY MAKE-LAMBDA [GC for 403 SFUN pages..(T=9).GC finished] MAKE-LET 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 3380 CONS pages..(T=11).GC finished] [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).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 [GC for 3390 CONS pages..(T=11).GC finished] SKIP-WHEN-LOGIC CHK-INHIBIT-OUTPUT-LST *LD-SPECIAL-ERROR* [GC for 3400 CONS pages..(T=10).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 3410 CONS pages..(T=9).GC finished] CHECK-SUM1 CHECK-SUM CHECK-SUM-INC [GC for 3420 CONS pages..(T=9).GC finished] CHECK-SUM-NATURAL CHECK-SUM-STRING1 CHECK-SUM-STRING2 CHECK-SUM-STRING [GC for 3420 CONS pages..(T=10).GC finished] CHECK-SUM-OBJ1 OLD-CHECK-SUM-OBJ PLUS-MOD-M31 [GC for 3430 CONS pages..(T=11).GC finished] DOUBLE-MOD-M31 TIMES-EXPT-2-16-MOD-M31 TIMES-MOD-M31 FCHECKSUM-NATURAL-AUX [GC for 3430 CONS pages..(T=11).GC finished] FCHECKSUM-NATURAL [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] FCHECKSUM-STRING1 [GC for 3430 CONS pages..(T=11).GC finished] FCHECKSUM-STRING2 FCHECKSUM-STRING FCHECKSUM-ATOM *FCHECKSUM-OBJ-STACK-BOUND-INIT* [GC for 3440 CONS pages..(T=11).GC finished] (FCHECKSUM-OBJ2 FCHECKSUM-OBJ) CHECK-SUM-OBJ [GC for 504 SYMBOL pages..(T=11).GC finished] READ-FILE-ITERATE READ-FILE FORMALS PLIST-WORLDP-WITH-FORMALS ARITY SYMBOL-CLASS FDEFUN-MODE DEFUN-MODE [GC for 3440 CONS pages..(T=9).GC finished] ARITIES-OKP USER-DEFINED-FUNCTIONS-TABLE WEAK-DEF-BODY-P LATEST-BODY DEF-BODY [GC for 3440 CONS pages..(T=10).GC finished] BODY GET-STOBJ-RECOGNIZER STOBJ-RECOGNIZER-TERMS MCONS-TERM-SMART (OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST) [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] OPTIMIZE-STOBJ-RECOGNIZERS GUARD GUARD-LST EQUIVALENCE-RELATIONP >=-LEN ALL->=-LEN STRIP-CADRS STRIP-CDDRS [GC for 3450 CONS pages..(T=10).GC finished] GLOBAL-SET-LST CONS-TERM1-BODY-MV2 CONS-TERM1-MV2 [GC for 3460 CONS pages..(T=11).GC finished] (SUBLIS-VAR1 SUBLIS-VAR1-LST) SUBLIS-VAR SUBLIS-VAR-LST SUBCOR-VAR1 (SUBCOR-VAR SUBCOR-VAR-LST) [GC for 3460 CONS pages..(T=9).GC finished] MAKE-REVERSED-AD-LIST CAR-CDR-ABBREV-NAME PRETTY-PARSE-AD-LIST UNTRANSLATE-CAR-CDR-NEST COLLECT-NON-TRIVIAL-BINDINGS UNTRANSLATE-AND UNTRANSLATE-OR [GC for 3460 CONS pages..(T=9).GC finished] [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] CASE-LENGTH COND-LENGTH *UNTRANSLATE-BOOLEAN-PRIMITIVES* RIGHT-ASSOCIATED-ARGS [GC for 3470 CONS pages..(T=10).GC finished] DUMB-NEGATE-LIT DUMB-NEGATE-LIT-LST (TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT) ACCESSOR-ROOT PROGN! [GC for 3470 CONS pages..(T=9).GC finished] LD-REDEFINITION-ACTION CHK-LD-REDEFINITION-ACTION SET-LD-REDEFINITION-ACTION REDEF REDEF! REDEF+ REDEF- CHK-CURRENT-PACKAGE SET-CURRENT-PACKAGE DEFUN-FOR-STATE-NAME [GC for 3470 CONS pages..(T=11).GC finished] ERROR-FREE-TRIPLE-TO-STATE DEFUN-FOR-STATE SET-CURRENT-PACKAGE-STATE STANDARD-OI READ-STANDARD-OI CHK-STANDARD-OI SET-STANDARD-OI CHK-STANDARD-CO [GC for 3480 CONS pages..(T=6).GC finished] SET-STANDARD-CO PROOFS-CO [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] CHK-PROOFS-CO SET-PROOFS-CO ILLEGAL-STATE-LD-PROMPT LD-PRE-EVAL-FILTER ILLEGAL-STATE-P LD-PROMPT CHK-LD-PROMPT [GC for 3480 CONS pages..(T=10).GC finished] SET-LD-PROMPT LD-KEYWORD-ALIASES 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 [GC for 3490 CONS pages..(T=9).GC finished] SET-LD-MISSING-INPUT-OK NEW-NAMEP CHK-LD-PRE-EVAL-FILTER SET-LD-PRE-EVAL-FILTER LD-PRE-EVAL-PRINT CHK-LD-PRE-EVAL-PRINT [GC for 3490 CONS pages..(T=9).GC finished] SET-LD-PRE-EVAL-PRINT LD-POST-EVAL-PRINT CHK-LD-POST-EVAL-PRINT SET-LD-POST-EVAL-PRINT LD-ERROR-TRIPLES [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] CHK-LD-ERROR-TRIPLES SET-LD-ERROR-TRIPLES LD-ERROR-ACTION CHK-LD-ERROR-ACTION SET-LD-ERROR-ACTION LD-QUERY-CONTROL-ALIST [GC for 3500 CONS pages..(T=10).GC finished] LD-QUERY-CONTROL-ALISTP CDR-ASSOC-QUERY-ID CHK-LD-QUERY-CONTROL-ALIST SET-LD-QUERY-CONTROL-ALIST LD-VERBOSE CHK-LD-VERBOSE [GC for 413 SFUN pages..(T=12).GC finished] SET-LD-VERBOSE CHK-LD-USER-STOBJS-MODIFIED-WARNING [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] SET-LD-USER-STOBJS-MODIFIED-WARNING *NQTHM-TO-ACL2-PRIMITIVES* *NQTHM-TO-ACL2-COMMANDS* [GC for 3500 CONS pages..(T=11).GC finished] NQTHM-TO-ACL2-FN NQTHM-TO-ACL2 ALLOCATE-FIXNUM-RANGE ALLEGRO-ALLOCATE-SLOWLY-FN CLEAR-PSTK *PSTK-VARS* PSTK-BINDINGS-AND-ARGS PSTK PSTACK-FN PSTACK [GC for 3510 CONS pages..(T=11).GC finished] VERBOSE-PSTACK SET-PRINT-CLAUSE-IDS [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] SET-SAVED-OUTPUT-TOKEN-LST SET-GAG-MODE-FN SET-GAG-MODE POP-INHIBIT-OUTPUT-LST-STACK PUSH-INHIBIT-OUTPUT-LST-STACK [GC for 3510 CONS pages..(T=13).GC finished] 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 PRINT-SET-WATERFALL-PARALLELISM-NOTICE [GC for 3520 CONS pages..(T=10).GC finished] CHECK-FOR-NO-OVERRIDE-HINTS SET-WATERFALL-PARALLELISM-FN SET-WATERFALL-PARALLELISM1 SAVED-MEMOIZE-TABLE SAVE-MEMO-TABLE CLEAR-MEMO-TABLE-EVENTS CLEAR-MEMO-TABLE SAVE-AND-CLEAR-MEMOIZATION-SETTINGS SET-MEMO-TABLE-EVENTS RESTORE-MEMOIZATION-SETTINGS SET-WATERFALL-PARALLELISM [GC for 3520 CONS pages..(T=13).GC finished] 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 DECLARE-GRANULARITY-P CHECK-AND-PARSE-FOR-GRANULARITY-FORM PARGS PLET [GC for 413 SFUN pages..(T=9).GC finished] BINARY-PAND PAND BINARY-POR POR OR-LIST [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] AND-LIST CPU-CORE-COUNT SPEC-MV-LET SET-TOTAL-PARALLELISM-WORK-LIMIT-FN SET-TOTAL-PARALLELISM-WORK-LIMIT SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR-FN SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR Finished loading "parallel.lisp". ACL2 loading "translate.lisp". "ACL2" [GC for 3530 CONS pages..(T=9).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 413 SFUN pages..(T=10).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 [GC for 413 SFUN pages..(T=9).GC finished] ILLEGAL-MSG PROGRAM-ONLY-ER-MSG *SAFE-MODE-GUARD-ER-ADDENDUM* FIND-FIRST-NON-NIL LATCH-STOBJS1 [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] LATCH-STOBJS ACTUAL-STOBJS-OUT1 APPLY-SYMBOL-ALIST APPLY-INVERSE-SYMBOL-ALIST *FOR-LOOP$-KEYWORD-INFO* *LOOP$-SPECIAL-FUNCTION-SYMBOLS* FOR-LOOP$-OPERATOR-SCIONP [GC for 3540 CONS pages..(T=10).GC finished] LOOP$-SCION-STYLE1 LOOP$-SCION-STYLE LOOP$-SCION-RESTRICTION1 LOOP$-SCION-RESTRICTION MAKE-CARTON EXCART [GC for 413 SFUN pages..(T=10).GC finished] SYMBOL-NAME-EQUAL ASSOC-SYMBOL-NAME-EQUAL PARSE-LOOP$-ACCUM [GC for 3550 CONS pages..(T=10).GC finished] POSSIBLE-TYPOP MAYBE-MEANT-BUT-DIDNT-WRITE PARSE-LOOP$-WHEN [GC for 3560 CONS pages..(T=11).GC finished] PARSE-LOOP$-UNTIL [GC for 3570 CONS pages..(T=7).GC finished] PARSE-LOOP$-VSTS-DIAGNOSE-FAILURE [GC for 3580 CONS pages..(T=10).GC finished] PARSE-LOOP$-VSTS [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] PARSE-LOOP$-FINALLY PARSE-DO$-KEYWORDS-AND-BODY PARSE-DO$ FIRST-UNUSUAL-WITH-CLAUSE [GC for 3590 CONS pages..(T=10).GC finished] PARSE-LOOP$-WITH PARSE-LOOP$ UNKNOWN-STOBJ-NAMES DO$-STOBJS-OUT [GC for 413 SFUN pages..(T=11).GC finished] ACTUAL-STOBJS-OUT ; Hons-Note: grew SBITS to 7429301; 0.00 seconds, [unknown] bytes. [GC for 3590 CONS pages..(T=10).GC finished] [GC for 3600 CONS pages..(T=9).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP4 TRANSLATED-ACL2-UNWIND-PROTECTP ACL2-SYSTEM-NAMEP ACL2-SYSTEM-NAMEP-STATE [GC for 413 SFUN pages..(T=11).GC finished] (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* [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SAVE-EV-FNCALL-GUARD-ER WEAK-ATTACHMENT-P WEAK-ATTACHMENT-COMPONENT-P ATTACHMENT-RECORD-PAIRS [GC for 413 SFUN pages..(T=9).GC finished] ALL-ATTACHMENTS GC-OFF1 GC-OFF [GC for 514 SYMBOL pages..(T=12).GC finished] RETURN-LAST-LOOKUP ADD-IGNORE-TO-REST ADD-TYPE-DCLS-TO-REST COLLECT-IGNORED-LET-VARS [GC for 413 SFUN pages..(T=10).GC finished] MAKE-LET-OR-LET* UNTRANSLATE*-LST LIVE-STATE-SYMBOLP APPLY-USER-STOBJ-ALIST-OR-KWOTE SIGNATURE-FNS [GC for 413 SFUN pages..(T=11).GC finished] MAKE-EVENT-TUPLE ACCESS-EVENT-TUPLE-NUMBER ACCESS-EVENT-TUPLE-DEPTH [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] ACCESS-EVENT-TUPLE-TYPE ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P ACCESS-EVENT-TUPLE-NAMEX ACCESS-EVENT-TUPLE-FORM [GC for 413 SFUN pages..(T=9).GC finished] ACCESS-EVENT-TUPLE-SYMBOL-CLASS WEAK-COMMAND-TUPLE-P MAKE-COMMAND-TUPLE [GC for 413 SFUN pages..(T=11).GC finished] ACCESS-COMMAND-TUPLE-NUMBER ACCESS-COMMAND-TUPLE-DEFUN-MODE 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 423 SFUN pages..(T=8).GC finished] SCAN-TO-LANDMARK-NUMBER [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] 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 GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] GET-UNAMBIGUOUS-XARGS-FLG1 GET-UNAMBIGUOUS-XARGS-FLG GET-UNAMBIGUOUS-XARGS-FLG-LST REMOVE-STRINGS REV-UNION-EQUAL [GC for 3610 CONS pages..(T=11).GC finished] TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST TRANSLATE-DECLARATION-TO-GUARD-VAR-LST GET-GUARDS2 GET-GUARDS1 [GC for 3620 CONS pages..(T=11).GC finished] GET-GUARDS DCLS-GUARD-RAW-FROM-DEF GET-EVENT [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] GET-SKIPPED-PROOFS-P NEGATE-UNTRANSLATED-FORM EVENT-TUPLE-FN-NAMES CLTL-DEF-FROM-NAME2 CLTL-DEF-FROM-NAME1 CLTL-DEF-FROM-NAME [GC for 3630 CONS pages..(T=13).GC finished] UNMAKE-TRUE-LIST-CONS-NEST UNMAKE-FORMAL-PAIRLIS2 [GC for 3630 CONS pages..(T=11).GC finished] COLLECT-IGNORED-MV-VARS ALL-QUOTEPS (SUBST-VAR SUBST-VAR-LST) SUBST-EACH-FOR-VAR TYPE-EXPRESSIONS-FROM-TYPE-SPEC [GC for 3640 CONS pages..(T=11).GC finished] SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1 FLATTEN-ANDS-IN-LIT FLATTEN-ANDS-IN-LIT-LST [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] WEAK-SPLO-EXTRACTS-TUPLE-P [GC for 3650 CONS pages..(T=10).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 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 [GC for 3660 CONS pages..(T=10).GC finished] GET-BADGE GET-BADGE-AND-WARRANTP WARRANT-NAME STRING-PREFIXP-1 STRING-PREFIXP WARRANT-NAME-INVERSE WARRANT-FUNCTION-NAMEP [GC for 3660 CONS pages..(T=8).GC finished] T APPLY$-BADGE-ARITY *GENERIC-TAME-BADGE-1* *GENERIC-TAME-BADGE-2* *GENERIC-TAME-BADGE-3* *APPLY$-BADGE* *EV$-BADGE* EXECUTABLE-BADGE FIND-WARRANT-FUNCTION-NAME EXECUTABLE-TAMEP-LAMBDAP [GC for 3660 CONS pages..(T=9).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] (EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP EXECUTABLE-SUITABLY-TAMEP-LISTP) WELL-FORMED-LAMBDA-OBJECTP1 WELL-FORMED-LAMBDA-OBJECTP [GC for 3660 CONS pages..(T=6).GC finished] ALL-FNNAMES! REMOVE-GUARD-HOLDERS-BLOCKED-BY-HIDE-P :ATTACHMENTS-RECORDED (POSSIBLY-DIRTY-LAMBDA-OBJECTP1 POSSIBLY-DIRTY-LAMBDA-OBJECTP1-LST) [GC for 3670 CONS pages..(T=10).GC finished] POSSIBLY-DIRTY-LAMBDA-OBJECTP (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 423 SFUN pages..(T=8).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] TRIVIAL-LAMBDA-P [GC for 3670 CONS pages..(T=10).GC finished] (REMOVE-GUARD-HOLDERS1 REMOVE-GUARD-HOLDERS1-LST) REMOVE-GUARD-HOLDERS-WEAK REMOVE-GUARD-HOLDERS-WEAK-LST REMOVE-GUARD-HOLDERS1-LST-LST REMOVE-GUARD-HOLDERS-WEAK-LST-LST WARRANTS-FOR-TAMEP-LAMBDAP [GC for 3680 CONS pages..(T=7).GC finished] (WARRANTS-FOR-TAMEP WARRANTS-FOR-TAMEP-FUNCTIONP WARRANTS-FOR-SUITABLY-TAMEP-LISTP) WARRANTS-FOR-TAMEP-LAMBDAP-LST [GC for 3680 CONS pages..(T=8).GC finished] (CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST) POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-IN-PAIRS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] REMOVE-GUARD-HOLDERS-LAMP :ATTACHMENTS-RECORDED REMOVE-GUARD-HOLDERS REMOVE-GUARD-HOLDERS-LST REMOVE-GUARD-HOLDERS-LST-LST LAMBDA-OBJECT-GUARD TAG-TRANSLATED-LAMBDA$-BODY LAMBDA$-BODYP [GC for 423 SFUN pages..(T=5).GC finished] MEMBER-LAMBDA-OBJECTP ATTACHMENT-ALIST ATTACHMENT-PAIR APPLY$-LAMBDA-GUARD APPLY$-GUARD NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES ALL-FUNCTION-SYMBOLPS *UNKNOWN-CONSTRAINTS* [GC for 423 SFUN pages..(T=10).GC finished] UNKNOWN-CONSTRAINTS-TABLE-GUARD UNKNOWN-CONSTRAINTS-TABLE SET-UNKNOWN-CONSTRAINTS-SUPPORTERS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] EV-FNCALL-REC-LOGICAL-UNKNOWN-CONSTRAINTS NON-EXECUTABLE-STOBJS-MSG SCAN-TO-EVENT GET-DEFUN-EVENT *ONE-WAY-UNIFY1-IMPLICIT-FNS* [GC for 3690 CONS pages..(T=6).GC finished] ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS [GC for 3700 CONS pages..(T=6).GC finished] (ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1 ONE-WAY-UNIFY1-EQUAL) ONE-WAY-UNIFY *INITIAL-RETURN-LAST-TABLE* [GC for 3710 CONS pages..(T=10).GC finished] MAYBE-CONVERT-TO-MV *TYPE-EXPR-TO-TYPE-SPEC-ALIST* TYPE-SPEC-FIX-UNIFY-SUBST TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION-1 [GC for 3710 CONS pages..(T=8).GC finished] TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION TYPE-SPEC-TO-VARLIST-ALIST [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] RECOVER-TYPE-SPEC-EXPRS!1 RECOVER-TYPE-SPEC-EXPRS! SPLIT-TYPE-SPECS-FROM-TERM [GC for 3720 CONS pages..(T=6).GC finished] UNTRANSLATE-LAMBDA-OBJECT-P :ATTACHMENTS-RECORDED UNTRANSLATE-LAMBDA-OBJECT-CHEAT [GC for 3720 CONS pages..(T=6).GC finished] [GC for 3730 CONS pages..(T=5).GC finished] [GC for 3740 CONS pages..(T=6).GC finished] [GC for 3750 CONS pages..(T=6).GC finished] [GC for 3760 CONS pages..(T=6).GC finished] [GC for 3770 CONS pages..(T=10).GC finished] [GC for 3780 CONS pages..(T=12).GC finished] [GC for 3790 CONS pages..(T=8).GC finished] [GC for 3800 CONS pages..(T=10).GC finished] [GC for 3810 CONS pages..(T=12).GC finished] [GC for 3820 CONS pages..(T=10).GC finished] [GC for 3830 CONS pages..(T=11).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=6).GC finished] [GC for 524 SYMBOL pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] [GC for 3840 CONS pages..(T=12).GC finished] (GUARD-RAW EV-FNCALL-GUARD-ER EV-FNCALL-REC-LOGICAL EV-FNCALL-REC EV-REC-RETURN-LAST EV-REC EV-REC-LST ...) EV-FNCALL EV EV-LST [GC for 423 SFUN pages..(T=13).GC finished] ERSATZ-PROG2 ERSATZ-SETQ ERSATZ-RETURN ERSATZ-LOOP-FINISH ERSATZ-MV-SETQ [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] MAKE-ERSATZ-MV-SETQ ERSATZ-MV-SETQ-VARS ERSATZ-MV-SETQ-BODY *CLTL-TO-ERSATZ-FNS* ERSATZ-FUNCTIONP (ERSATZ-SYMBOLS ERSATZ-SYMBOLS-LIST) [GC for 423 SFUN pages..(T=12).GC finished] UNTRANSLATE UNTRANSLATE-LST (REPLACE-ERSATZ-FUNCTIONS REPLACE-ERSATZ-FUNCTIONS-LIST) UNTRANSLATE-DO-BODY PROGN$-OF-CHECK-DCL-GUARDIANSP [GC for 423 SFUN pages..(T=9).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] LAMBDA-DO-BODY-DECONSTRUCTOR (WELL-FORMED-DO-BODY WELL-FORMED-DO-BODY-LIST) [GC for 423 SFUN pages..(T=11).GC finished] (DUMB-OCCUR DUMB-OCCUR-LST) VAR-ON-IF-LEAF GUESS-DO-BODY-MEASURE-VARS GUESS-DO-BODY-MEASURE CMP-DO-BODY-ALIST [GC for 423 SFUN pages..(T=10).GC finished] MAKE-TRUE-LIST-CONS-NEST CMP-DO-BODY-EXIT [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] CMP-DO-BODY-GUARDIAN PROG2$-CALL CMP-DO-BODY-MV-GUARDIAN-1 CMP-DO-BODY-MV-GUARDIAN TRANSLATED-MV-NTH-CALLS COLLECT-BY-POSITION MAKE-LAMBDA-APPLICATION [GC for 423 SFUN pages..(T=11).GC finished] MAKE-LAMBDA-TERM CMP-TO-ERROR-TRIPLE CMP-TO-ERROR-DOUBLE CMP-AND-VALUE-TO-ERROR-QUADRUPLE ER-CMP-FN ER-CMP VALUE-CMP ER-PROGN-FN-CMP ER-PROGN-CMP ER-LET*-CMP CMP-DO-BODY-SETQ CMP-DO-BODY-MV-SETQ [GC for 423 SFUN pages..(T=10).GC finished] CHK-NO-ERSATZ-SYMBOLS-P [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] COLLECT-NONTRIVIAL-FORMALS-IN-SET CMP-DO-BODY-1 [GC for 3840 CONS pages..(T=11).GC finished] CMP-DO-BODY COLLECT-TWVTS-TYPE-PREDS VAR-TO-CDR-ASSOC-VAR-SUBSTITUTION MAKE-DO-BODY-LAMBDA$ MAKE-DO-MEASURE-LAMBDA$ MAKE-INITIAL-DO-BODY-ALIST [GC for 423 SFUN pages..(T=13).GC finished] EV-W-LST SILENT-ERROR WARNING1-CW WARNING$-CW1 WARNING$-CW [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] CHK-LENGTH-AND-KEYS DUPLICATE-KEYS-ACTION-TABLE SET-DUPLICATE-KEYS-ACTION! SET-DUPLICATE-KEYS-ACTION DUPLICATE-KEYS-ACTION LEGAL-INITP MACRO-ARGLIST-KEYSP [GC for 423 SFUN pages..(T=10).GC finished] MACRO-ARGLIST-AFTER-RESTP MACRO-ARGLIST-OPTIONALP MACRO-ARGLIST1P SUBSEQUENCEP [GC for 423 SFUN pages..(T=10).GC finished] COLLECT-LAMBDA-KEYWORDPS MACRO-ARGS-STRUCTUREP [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] BIND-MACRO-ARGS-KEYS1 BIND-MACRO-ARGS-KEYS BIND-MACRO-ARGS-AFTER-REST [GC for 423 SFUN pages..(T=10).GC finished] BIND-MACRO-ARGS-OPTIONAL BIND-MACRO-ARGS1 BIND-MACRO-ARGS MACRO-GUARD-ER-MSG MACROEXPAND1-CMP [GC for 423 SFUN pages..(T=10).GC finished] MACROEXPAND1 [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] CHK-DECLARE COLLECT-DCLS TAG-LOOP$ *ACCEPTABLE-DCLS-ALIST* *DOCUMENTATION-STRINGS-PERMITTED* *DCL-EXPLANATION-ALIST* TILDE-*-CONJUNCTION-PHRASE1 TILDE-*-CONJUNCTION-PHRASE [GC for 423 SFUN pages..(T=10).GC finished] COLLECT-NON-LEGAL-VARIABLEPS OPTIMIZE-ALISTP CHK-DCL-LST [GC for 3840 CONS pages..(T=11).GC finished] NUMBER-OF-STRINGS GET-STRING [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] COLLECT-DECLARATIONS-CMP COLLECT-DECLARATIONS LISTIFY TRANSLATE-DCL-LST *ONEIFY-PRIMITIVES* *EC-CALL-BAD-OPS* RETURN-LAST-CALL [GC for 423 SFUN pages..(T=11).GC finished] DCL-GUARDIAN IGNORE-VARS IGNORABLE-VARS MV-NTH-LIST TRANSLATE-BIND TRANSLATE-DEREF [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TRANSLATE-UNBOUND LISTLIS (FIND-FIRST-VAR FIND-FIRST-VAR-LST) [GC for 423 SFUN pages..(T=14).GC finished] (FIND-FIRST-FNSYMB FIND-FIRST-FNSYMB-LST) FIND-PKG-WITNESS TRANS-ER TRANS-ER+ TRANS-ER+? TRANS-VALUE TRANS-ER-LET* HIDE-IGNORED-ACTUALS AUGMENT-IGNORE-VARS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] COMPUTE-STOBJ-FLAGS PRETTYIFY-STOBJ-FLAGS PRETTYIFY-STOBJS-OUT DEFSTOBJ-SUPPORTERP STOBJ-CREATORP [GC for 423 SFUN pages..(T=12).GC finished] (FFNNAMEP FFNNAMEP-LST) UNKNOWN-BINDING-MSG *MACROS-FOR-NONEXPANSION-IN-RAW-LISP* CHK-NO-DUPLICATE-DEFUNS-CMP [GC for 423 SFUN pages..(T=10).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] CHK-NO-DUPLICATE-DEFUNS CHK-STATE-OK-MSG CHK-STATE-OK CHK-ARGLIST-MSG [GC for 423 SFUN pages..(T=10).GC finished] MSG-TO-CMP CHK-ARGLIST-CMP CHK-ARGLIST LOGICAL-NAME-TYPE [GC for 423 SFUN pages..(T=11).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] CHK-ALL-BUT-NEW-NAME-CMP CHK-ALL-BUT-NEW-NAME [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] CHK-DEFUNS-TUPLES-CMP CHK-DEFUNS-TUPLES NAME-DROPPER [GC for 423 SFUN pages..(T=10).GC finished] FIRST-ASSOC-EQ CONTEXT-FOR-ENCAPSULATE-PASS-2 *BRR-GLOBALS* UNKNOWN-BINDING-MSG-ER [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] CONGRUENT-STOBJSP STOBJS-IN-OUT1 STOBJS-IN-MATCHP STOBJS-IN-OUT [GC for 423 SFUN pages..(T=11).GC finished] NON-TRIVIAL-STOBJ-BINDING FORMALIZED-VARLISTP THROW-NONEXEC-ERROR-P1 [GC for 423 SFUN pages..(T=11).GC finished] THROW-NONEXEC-ERROR-P [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] CHK-FLET-DECLARATIONS CHK-FLET-DECLARE-FORM CHK-FLET-DECLARE-FORM-LIST STOBJ-UPDATER-GUESS-FROM-ACCESSOR PARSE-STOBJ-LET-ACTUAL [GC for 3840 CONS pages..(T=11).GC finished] UNQUOTED-SYMBOL [GC for 3850 CONS pages..(T=10).GC finished] PARSE-STOBJ-LET1 [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ILLEGAL-STOBJ-LET-MSG PARSE-STOBJ-LET SPLIT-VALUES-BY-KEYS NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST CONCRETE-ACCESSOR [GC for 3860 CONS pages..(T=12).GC finished] NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS-1 WEAK-ABSSTOBJ-INFO-P [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] ABSSTOBJ-TUPLES-LST NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS STOBJ-LET-FN STOBJ-LET-FN-RAW-LET-BINDINGS STOBJ-FIELD-ACCESSOR-P *STOBJ-TABLE-STOBJ* [GC for 3870 CONS pages..(T=11).GC finished] CHK-STOBJ-LET/BINDINGS [GC for 3870 CONS pages..(T=11).GC finished] CHK-STOBJ-LET/UPDATERS-1 [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] CHK-STOBJ-LET/UPDATERS ALIST-TO-DOUBLETS CHK-STOBJ-LET/ACCESSORS2 CHK-STOBJ-LET/ACCESSORS1 COLLECT-SOME-TRIPLES-WITH-NON-NIL-CDDDRS [GC for 3880 CONS pages..(T=11).GC finished] CHK-STOBJ-LET/ACCESSORS CHK-STOBJ-LET [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] 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 DEREF-MACRO-NAME [GC for 3880 CONS pages..(T=11).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] CORRESPONDING-INLINE-FN UNTOUCHABLE-FN-P MACROEXPAND1*-CMP FIND-STOBJ-OUT-AND-CALL DEFINED-SYMBOLS [GC for 3880 CONS pages..(T=11).GC finished] MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES MATCH-STOBJS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] (ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST) *GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG* [GC for 3890 CONS pages..(T=11).GC finished] EDCLS-FROM-LAMBDA-OBJECT-DCLS EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT MAKE-PLAIN-LOOP$-LAMBDA-OBJECT TRANSLATE-VSTS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] MAKE-BINDINGS COLLECT-TVSTS-LIFTED-GUARDS MAKE-FANCY-LOOP$-TYPE-SPECS LIFT-FANCY-LOOP$-CARTON-GUARD MAKE-FANCY-LOOP$-LAMBDA-OBJECT [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] MAKE-PLAIN-LOOP$ MAKE-FANCY-LOOP$-TARGET MAKE-FANCY-LOOP$ REMOVE-FOR-LOOP$-GUARDS REMOVE-DO-LOOP$-GUARDS REMOVE-LOOP$-GUARDS [GC for 3900 CONS pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TRANSLATE11-VAR-OR-QUOTE-EXIT WEAK-BADGE-USERFN-STRUCTURE-ALISTP ILKS-PLIST-WORLDP ILKS-PER-ARGUMENT-SLOT [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] (QUOTE-NORMAL-FORM1 QUOTE-NORMAL-FORM1-LST) QUOTE-NORMAL-FORM PRIMITIVE-EVENT-MACROS *SYMS-NOT-CALLABLE-IN-CODE-FAL* LOOP$-DEFAULT [GC for 534 SYMBOL pages..(T=14).GC finished] PARSE-WITH-GLOBAL-STOBJ *WITH-GLOBAL-STOBJ-PREFIX* *WITH-GLOBAL-STOBJ-PREFIX-CHARS* [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] WITH-GLOBAL-STOBJ-VAR-LST WITH-GLOBAL-STOBJ-ADJUST-SIGNATURE-OR-VARS WITH-GLOBAL-STOBJ-FN1 *SEE-DOC-WITH-GLOBAL-STOBJ* WITH-GLOBAL-STOBJ-FN WITH-GLOBAL-STOBJ [GC for 3910 CONS pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] (COLLECT-GLOBAL-STOBJS COLLECT-GLOBAL-STOBJS-LST) PATH-TO-WITH-GLOBAL-STOBJ WITH-GLOBAL-STOBJ-ILLEGAL-PATH-MSG [GC for 3920 CONS pages..(T=11).GC finished] CHK-GLOBAL-STOBJ-BODY [GC for 3920 CONS pages..(T=12).GC finished] [GC for 3930 CONS pages..(T=13).GC finished] [GC for 3940 CONS pages..(T=13).GC finished] [GC for 3950 CONS pages..(T=13).GC finished] [GC for 3960 CONS pages..(T=7).GC finished] [GC for 3970 CONS pages..(T=7).GC finished] [GC for 3980 CONS pages..(T=8).GC finished] [GC for 3990 CONS pages..(T=7).GC finished] [GC for 4000 CONS pages..(T=7).GC finished] [GC for 4010 CONS pages..(T=8).GC finished] [GC for 4020 CONS pages..(T=8).GC finished] [GC for 4030 CONS pages..(T=6).GC finished] [GC for 4040 CONS pages..(T=6).GC finished] [GC for 4050 CONS pages..(T=6).GC finished] [GC for 4060 CONS pages..(T=6).GC finished] [GC for 4070 CONS pages..(T=6).GC finished] [GC for 4080 CONS pages..(T=6).GC finished] [GC for 4090 CONS pages..(T=6).GC finished] [GC for 4100 CONS pages..(T=6).GC finished] [GC for 4110 CONS pages..(T=5).GC finished] [GC for 4120 CONS pages..(T=5).GC finished] [GC for 4130 CONS pages..(T=5).GC finished] [GC for 4130 CONS pages..(T=5).GC finished] [GC for 4140 CONS pages..(T=5).GC finished] [GC for 4140 CONS pages..(T=5).GC finished] [GC for 4140 CONS pages..(T=6).GC finished] [GC for 4140 CONS pages..(T=6).GC finished] [GC for 4140 CONS pages..(T=6).GC finished] [GC for 4140 CONS pages..(T=6).GC finished] [GC for 4150 CONS pages..(T=6).GC finished] [GC for 4150 CONS pages..(T=6).GC finished] [GC for 4150 CONS pages..(T=7).GC finished] [GC for 4150 CONS pages..(T=6).GC finished] [GC for 4150 CONS pages..(T=5).GC finished] [GC for 4160 CONS pages..(T=5).GC finished] [GC for 4170 CONS pages..(T=6).GC finished] [GC for 4180 CONS pages..(T=6).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] [GC for 4190 CONS pages..(T=6).GC finished] [GC for 4200 CONS pages..(T=5).GC finished] [GC for 4210 CONS pages..(T=6).GC finished] [GC for 4220 CONS pages..(T=6).GC finished] [GC for 56 STRUCTURE pages..(T=5).GC finished] [GC for 4230 CONS pages..(T=5).GC finished] [GC for 4240 CONS pages..(T=6).GC finished] [GC for 239 ARRAY pages..(T=5).GC finished] [GC for 4250 CONS pages..(T=5).GC finished] [GC for 249 ARRAY pages..(T=6).GC finished] [GC for 4260 CONS pages..(T=6).GC finished] [GC for 259 ARRAY pages..(T=8).GC finished] [GC for 269 ARRAY pages..(T=10).GC finished] [GC for 4270 CONS pages..(T=10).GC finished] [GC for 4280 CONS pages..(T=9).GC finished] [GC for 4290 CONS pages..(T=10).GC finished] [GC for 4300 CONS pages..(T=9).GC finished] [GC for 4310 CONS pages..(T=9).GC finished] [GC for 4320 CONS pages..(T=9).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] [GC for 4330 CONS pages..(T=7).GC finished] [GC for 279 ARRAY pages..(T=7).GC finished] [GC for 289 ARRAY pages..(T=11).GC finished] [GC for 433 SFUN pages..(T=12).GC finished] /tmp/gazonk_3226084_0.c: In function ‘L1’: /tmp/gazonk_3226084_0.c:1156:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 1156 | if((Cnil)==Cnil){ | ^~ /tmp/gazonk_3226084_0.c:1599:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 1599 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_3226084_0.c:2030:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 2030 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_3226084_0.c:2355:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 2355 | if((Cnil)==Cnil){ | ^~ [GC for 433 SFUN pages..(T=12).GC finished] [GC for 62 CFUN pages..(T=13).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] [GC for 433 SFUN pages..(T=12).GC finished] [GC for 433 SFUN pages..(T=12).GC finished] (TRANSLATE11-FLET-ALIST TRANSLATE11-FLET-ALIST1 TRANSLATE11-FLET TRANSLATE-STOBJ-CALLS TRANSLATE11-LET TRANSLATE11-LET* TRANSLATE11-MV-LET ...) [GC for 433 SFUN pages..(T=12).GC finished] TRANSLATE1-CMP TRANSLATE1 (LOGIC-FNSP LOGIC-FNS-LISTP) [GC for 433 SFUN pages..(T=13).GC finished] LOGIC-TERMP LOGIC-TERM-LISTP LOGIC-FNS-LIST-LISTP LOGIC-TERM-LIST-LISTP TRANSLATE-CMP [GC for 433 SFUN pages..(T=13).GC finished] TRANSLATE TRANSLATABLE-P CHK-TRANSLATABLE LOOP$-STOBJS-OUT REPLACED-STOBJ [GC for 433 SFUN pages..(T=13).GC finished] REPLACE-STOBJS1 REPLACE-STOBJS USER-STOBJSP PUT-ASSOC-EQ-ALIST COLLECT-USER-STOBJS [GC for 433 SFUN pages..(T=13).GC finished] FILTER-KNOWN-STOBJS CHK-GLOBAL-STOBJS [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] EV-FOR-TRANS-EVAL MACROEXPAND1* TRANS-EVAL1 [GC for 433 SFUN pages..(T=12).GC finished] TRANS-EVAL0 TRANS-EVAL TRANS-EVAL-NO-WARNING TRANS-EVAL-DEFAULT-WARNING LAMBDA-OBJECT-GUARD-LST [GC for 433 SFUN pages..(T=11).GC finished] LAMBDA-OBJECT-BODY-LST FILTER-LAMBDA$-OBJECTS (COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST) [GC for 433 SFUN pages..(T=11).GC finished] TAGGED-LOOP$P (COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST) [GC for 433 SFUN pages..(T=12).GC finished] (ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST) COLLECT-NON-EMPTY-PAIRS ANCESTRAL-LAMBDA$S-BY-CALLER [GC for 433 SFUN pages..(T=10).GC finished] (ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST) TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5 STRINGS-AND-OTHERS PROHIBITION-OF-LOOP$-AND-LAMBDA$-MSG [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] SIMPLE-TRANSLATE-AND-EVAL ERROR-FMS-CW SIMPLE-TRANSLATE-AND-EVAL-CMP SIMPLE-TRANSLATE-AND-EVAL-ERROR-DOUBLE TILDE-*-ALIST-PHRASE1 TILDE-*-ALIST-PHRASE SET-TEMP-TOUCHABLE-FNS [GC for 443 SFUN pages..(T=12).GC finished] SET-TEMP-TOUCHABLE-VARS 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 [GC for 443 SFUN pages..(T=12).GC finished] SUBLIS-EQUAL *TYPE-SPEC-TEMPLATES* PAIR-TYPE-EXPRESSIONS-WITH-TYPE-SPECS 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* ONE-BIT-TYPE-SETP *CODE-TYPE-SET-ALIST* LOGIOR-LST LOGAND-LST [GC for 443 SFUN pages..(T=12).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 4340 CONS pages..(T=11).GC finished] [GC for 4340 CONS pages..(T=11).GC finished] [GC for 443 SFUN pages..(T=10).GC finished] TYPE-SET-BINARY-+-ALIST-ENTRY TYPE-SET-BINARY-+-ALIST1 [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] TYPE-SET-BINARY-+-ALIST [GC for 4340 CONS pages..(T=11).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] [GC for 443 SFUN pages..(T=11).GC finished] TYPE-SET-BINARY-*-ALIST-ENTRY TYPE-SET-BINARY-*-ALIST1 TYPE-SET-BINARY-*-ALIST [GC for 4340 CONS pages..(T=11).GC finished] [GC for 4340 CONS pages..(T=10).GC finished] [GC for 443 SFUN pages..(T=11).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 WEAK-HISTORY-ENTRY-P PT-OCCUR [GC for 443 SFUN pages..(T=13).GC finished] PT-INTERSECTP TAG-TREE-OCCUR REMOVE-TAG-FROM-TAG-TREE REMOVE-TAG-FROM-TAG-TREE! EXTEND-TAG-TREE ADD-TO-TAG-TREE [GC for 544 SYMBOL pages..(T=12).GC finished] ADD-TO-TAG-TREE! *FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE* FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE-P PUSH-LEMMA REMOVE1-ASSOC-EQ-ASSOC-EQ-1 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 [GC for 443 SFUN pages..(T=12).GC finished] PTS-TO-TTREE-LST MARRY-PARENTS [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] COLLECT-PARENTS1 COLLECT-PARENTS0 COLLECT-PARENTS IGNORE-POLYP TO-BE-IGNOREDP1 TO-BE-IGNOREDP WEAK-ASSUMNOTE-P [GC for 443 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 DUMB-OCCUR-IN-TYPE-ALIST [GC for 443 SFUN pages..(T=11).GC finished] 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 443 SFUN pages..(T=11).GC finished] FN-COUNT-EVG-REC FN-COUNT-EVG VAR-FN-COUNT-1 VAR-FN-COUNT VAR-OR-FN-COUNT-< TERM-ORDER1 [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] ARITH-TERM-ORDER WEAK-POLY-P FIRST-VAR FIRST-COEFFICIENT GOOD-COEFFICIENT GOOD-POT-VARP GOOD-POLYP LOGICAL-< [GC for 443 SFUN pages..(T=10).GC finished] LOGICAL-<= EVALUATE-GROUND-POLY IMPOSSIBLE-POLYP TRUE-POLYP SILLY-POLYP IMPOSSIBLE-POLY BASE-POLY0 BASE-POLY [GC for 443 SFUN pages..(T=12).GC finished] POLY-ALIST-EQUAL POLY-EQUAL POLY-WEAKERP POLY-MEMBER NEW-AND-UGLY-LINEAR-VARSP FILTER-POLYS ADD-LINEAR-VARIABLE1 [GC for 443 SFUN pages..(T=12).GC finished] ZERO-FACTOR-P [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] GET-COEFFICIENT ADD-LINEAR-VARIABLE DUMB-EVAL-YIELDS-QUOTEP DUMB-EVAL ADD-LINEAR-TERM ADD-LINEAR-TERMS-FN ADD-LINEAR-TERMS [GC for 443 SFUN pages..(T=10).GC finished] NORMALIZE-POLY1 NORMALIZE-POLY NORMALIZE-POLY-LST WEAK-LINEAR-POT-P MODIFY-LINEAR-POT *MAX-LINEAR-POT-LOOP-STOPPER-VALUE* LOOP-STOPPER-VALUE-OF-VAR SET-LOOP-STOPPER-VALUES [GC for 443 SFUN pages..(T=10).GC finished] VAR-IN-POT-LST-P BOUNDS-POLY-WITH-VAR BOUNDS-POLYS-WITH-VAR POLYS-WITH-VAR1 POLYS-WITH-VAR POLYS-WITH-POTS NEW-VARS-IN-POT-LST [GC for 443 SFUN pages..(T=11).GC finished] CHANGED-POT-VARS INFECT-POLYS [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] INFECT-FIRST-N-POLYS INFECT-NEW-POLYS FCOMPLEMENTARY-MULTIPLEP1 FCOMPLEMENTARY-MULTIPLEP ALREADY-USED-BY-FIND-EQUATIONAL-POLYP-LST ALREADY-USED-BY-FIND-EQUATIONAL-POLYP [GC for 443 SFUN pages..(T=15).GC finished] CONS-TERM-BINARY-+-CONSTANT CONS-TERM-UNARY-- CONS-TERM-BINARY-*-CONSTANT FIND-EQUATIONAL-POLY-RHS1 FIND-EQUATIONAL-POLY-RHS FIND-EQUATIONAL-POLY3 FIND-EQUATIONAL-POLY2 [GC for 443 SFUN pages..(T=13).GC finished] FIND-EQUATIONAL-POLY1 FIND-EQUATIONAL-POLY GET-COEFF-FOR-CANCEL1 CANCEL2 CANCEL1 CANCEL [GC for 443 SFUN pages..(T=13).GC finished] CANCEL-POLY-AGAINST-ALL-POLYS ADD-POLY [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] PRUNE-POLY-LST ADD-POLYS1 ADD-POLYS0 SHOW-POLY2 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] SHOW-POLY1 SHOW-POLY SHOW-POLY-LST Finished loading "linear-a.lisp". ACL2 loading "type-set-b.lisp". "ACL2" *NUMBER-OF-NUMERIC-TYPE-SET-BITS* *TYPE-SET-BINARY-+-TABLE-LIST* *TYPE-SET-BINARY-+-TABLE* *TYPE-SET-BINARY-*-TABLE-LIST* *TYPE-SET-BINARY-*-TABLE* *TYPE-SET-<-TABLE-LIST* *TYPE-SET-<-TABLE* ASSOC-EQUAL-CDR RUNEP BASE-SYMBOL STRIP-BASE-SYMBOLS [GC for 443 SFUN pages..(T=16).GC finished] FNUME FRUNIC-MAPPING-PAIR FN-RUNE-NUME DEFINITION-RUNES GET-NEXT-NUME DEREF-MACRO-NAME-LST *ABBREV-RUNE-ALIST* [GC for 443 SFUN pages..(T=12).GC finished] TRANSLATE-ABBREV-RUNE RULE-NAME-DESIGNATORP THEORYP1 THEORYP RUNIC-THEORYP1 [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] RUNIC-THEORYP FIND-MAPPING-PAIRS-TAIL1 FIND-MAPPING-PAIRS-TAIL AUGMENT-RUNIC-THEORY1 AUGMENT-RUNIC-THEORY *BAD-RUNIC-DESIGNATOR-STRING* CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1 [GC for 443 SFUN pages..(T=7).GC finished] CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS DUPLICITOUS-CONS-CAR DUPLICITOUS-REVAPPEND-CAR DUPLICITOUS-MERGE-CAR DUPLICITOUS-SORT-CAR AUGMENT-THEORY ASSERT$-RUNIC-THEORYP RUNIC-THEORY [GC for 443 SFUN pages..(T=13).GC finished] WEAK-ENABLED-STRUCTURE-P ENABLED-STRUCTURE-P ENABLED-NUMEP ENABLED-ARITH-NUMEP ENABLED-RUNEP ACTIVE-RUNEP ACTIVE-OR-NON-RUNEP [GC for 443 SFUN pages..(T=12).GC finished] ENABLED-XFNP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] (SUBLIS-VAR! SUBLIS-VAR!-LST) THEORY-WARNING-FNS-AUX THEORY-WARNING-FNS MAYBE-WARN-ABOUT-THEORY [GC for 443 SFUN pages..(T=14).GC finished] WEAK-THEORY-INVARIANT-RECORD-P ENABLED-DISABLED-RUNEPS THEORY-INVARIANT-MSG-IMPLICATION COMBINE-ANDS THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST [GC for 443 SFUN pages..(T=14).GC finished] THEORY-INVARIANT-MSG WEAK-CERTIFY-BOOK-INFO-P WEAK-USELESS-RUNES-P ACTIVE-USELESS-RUNES USELESS-RUNES-FILENAME [GC for 443 SFUN pages..(T=12).GC finished] ACTIVE-USELESS-RUNES-FILENAME CHK-THEORY-INVARIANT1 CHK-THEORY-INVARIANT [GC for 443 SFUN pages..(T=12).GC finished] WEAK-CLAUSE-ID-P POS-LISTP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] ALL-DIGITS-P D-POS-LISTP CLAUSE-ID-P *INITIAL-CLAUSE-ID* CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS [GC for 443 SFUN pages..(T=12).GC finished] CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE UPDATE-ENABLED-STRUCTURE-ARRAY [GC for 443 SFUN pages..(T=12).GC finished] INCREMENT-ARRAY-NAME UPDATE-ENABLED-STRUCTURE LOAD-THEORY-INTO-ENABLED-STRUCTURE-1 LOAD-THEORY-INTO-ENABLED-STRUCTURE INITIAL-GLOBAL-ENABLED-STRUCTURE [GC for 443 SFUN pages..(T=14).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 554 SYMBOL pages..(T=12).GC finished] TYPE-SET-BINARY-+ [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] TYPE-SET-BINARY-* TYPE-SET-NOT TYPE-SET-<-1 [GC for 4340 CONS pages..(T=13).GC finished] TYPE-SET-< [GC for 4340 CONS pages..(T=12).GC finished] TYPE-SET-UNARY-- [GC for 4340 CONS pages..(T=12).GC finished] TYPE-SET-UNARY-/ TYPE-SET-NUMERATOR [GC for 4340 CONS pages..(T=12).GC finished] TYPE-SET-DENOMINATOR TYPE-SET-REALPART [GC for 443 SFUN pages..(T=12).GC finished] TYPE-SET-IMAGPART TYPE-SET-COMPLEX WEAK-RECOGNIZER-TUPLE-P *INITIAL-RECOGNIZER-ALIST* MOST-RECENT-ENABLED-RECOG-TUPLE1 [GC for 443 SFUN pages..(T=12).GC finished] MOST-RECENT-ENABLED-RECOG-TUPLE TYPE-SET-RECOGNIZER TYPE-SET-CAR [GC for 443 SFUN pages..(T=12).GC finished] TYPE-SET-CDR [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] TYPE-SET-COERCE TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL [GC for 443 SFUN pages..(T=12).GC finished] TYPE-SET-LENGTH TYPE-SET-CONS *SINGLETON-TYPE-SETS* TYPE-SET-EQUAL [GC for 443 SFUN pages..(T=12).GC finished] TYPE-SET-QUOTE TYPE-SET-CHAR-CODE FN-COUNT-1 FN-COUNT TERM-ORDER [GC for 443 SFUN pages..(T=7).GC finished] WEAK-TYPE-PRESCRIPTION-P FIND-RUNED-TYPE-PRESCRIPTION MV-ATF ASSUME-TRUE-FALSE-ERROR [GC for 443 SFUN pages..(T=12).GC finished] NON-CONS-CDR CANONICAL-REPRESENTATIVE SUBST-TYPE-ALIST1-CHECK [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] NIL-FN *NIL-FN-TS-ENTRY* SUBST-TYPE-ALIST1 SUBST-TYPE-ALIST INFECT-TYPE-ALIST-ENTRY INFECT-NEW-TYPE-ALIST-ENTRIES2 INFECT-NEW-TYPE-ALIST-ENTRIES1 INFECT-NEW-TYPE-ALIST-ENTRIES EXTEND-TYPE-ALIST-SIMPLE EXTEND-TYPE-ALIST1 [GC for 453 SFUN pages..(T=12).GC finished] EXTEND-TYPE-ALIST ZIP-VARIABLE-TYPE-ALIST ASSOC-EQUIV ASSOC-EQUIV+ ASSOC-TYPE-ALIST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] LOOK-IN-TYPE-ALIST MEMBER-CHAR-STRINGP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP 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 453 SFUN pages..(T=12).GC finished] [GC for 453 SFUN pages..(T=16).GC finished] (WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED BASIC-WORSE-THAN-LST1 BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN SOME-SUBTERM-WORSE-THAN-OR-EQUAL SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST ...) [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] WORSE-THAN WORSE-THAN-OR-EQUAL WORSE-THAN-CLK WORSE-THAN-BUILTIN WORSE-THAN-OR-EQUAL-BUILTIN :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED WEAK-ANCESTOR-P MAKE-ANCESTOR-BINDING-HYP ANCESTOR-BINDING-HYP-P ANCESTOR-BINDING-HYP/HYP ANCESTOR-BINDING-HYP/UNIFY-SUBST PUSH-ANCESTOR ANCESTOR-LISTP [GC for 453 SFUN pages..(T=12).GC finished] EARLIER-ANCESTOR-BIGGERP EQUAL-MOD-COMMUTING ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN ANCESTORS-CHECK :ATTACHMENTS-RECORDED MAP-MULTIPLY-CAR NORMALIZE-ADDEND [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] 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 4340 CONS pages..(T=13).GC finished] [GC for 4340 CONS pages..(T=12).GC finished] TYPE-SET-FINISH-1 [GC for 4340 CONS pages..(T=12).GC finished] TYPE-SET-FINISH SEARCH-TYPE-ALIST-REC (FREE-VARSP FREE-VARSP-LST) [GC for 4340 CONS pages..(T=11).GC finished] SEARCH-TYPE-ALIST-WITH-REST SEARCH-TYPE-ALIST TERM-AND-TYP-TO-LOOKUP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] LOOKUP-HYP BIND-FREE-VARS-TO-UNBOUND-FREE-VARS X-XRUNEP HYP-XRUNE HYP-XRUNE-RUNE CONC-XRUNE CONC-XRUNE-RUNE XRUNE-RUNE RUNE= XRUNE= PRETTYIFY-XRUNE WEAK-ACCP-INFO-P WEAK-ACCP-ENTRY-P MERGE-ACCUMULATED-PERSISTENCE-AUX [GC for 4340 CONS pages..(T=11).GC finished] MERGE-ACCUMULATED-PERSISTENCE-REC MERGE-ACCUMULATED-PERSISTENCE ADD-ACCUMULATED-PERSISTENCE-S ADD-ACCUMULATED-PERSISTENCE-F [GC for 4340 CONS pages..(T=15).GC finished] ACCUMULATED-PERSISTENCE-MAKE-FAILURES ADD-ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE-OOPS SET-ACCUMULATED-PERSISTENCE MERGE-CAR-> [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] MERGE-SORT-CAR-> *ACCP-MAJOR-SEPARATOR* *ACCP-MINOR-SEPARATOR* SHOW-ACCUMULATED-PERSISTENCE-PHRASE0 SHOW-ACCUMULATED-PERSISTENCE-PHRASE1 SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY [GC for 4340 CONS pages..(T=13).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2 SPLIT-XRUNE-ALIST SORT-XRUNE-ALIST-BY-RUNE1 SORT-XRUNE-ALIST-BY-RUNE [GC for 4340 CONS pages..(T=14).GC finished] POP-ACCP-FN POP-ACCP-FN-ITERATE [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] SHOW-ACCUMULATED-PERSISTENCE-LIST SHOW-ACCUMULATED-PERSISTENCE-PHRASE SHOW-ACCUMULATED-PERSISTENCE PUSH-ACCP-FN [GC for 4340 CONS pages..(T=12).GC finished] PUSH-ACCP POP-ACCP WITH-ACCUMULATED-PERSISTENCE [GC for 4340 CONS pages..(T=14).GC finished] [GC for 4350 CONS pages..(T=12).GC finished] [GC for 4360 CONS pages..(T=12).GC finished] [GC for 4370 CONS pages..(T=12).GC finished] ASSUME-TRUE-FALSE-< MV-ATF-2 [GC for 4380 CONS pages..(T=15).GC finished] BINDING-HYP-P ADJUST-IGNORE-FOR-ATF BACKCHAIN-LIMIT-REACHEDP1 BACKCHAIN-LIMIT-REACHEDP NEW-BACKCHAIN-LIMIT ONCEP-TP [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] ONCEP-TP-BUILTIN :ATTACHMENTS-RECORDED STRENGTHEN-RECOG-CALL PUSH-LEMMA? [GC for 4380 CONS pages..(T=13).GC finished] STRONG-RECOGNIZER-EXPR-P RECOGNIZER-EXPR-P PUSH-LEMMA[S] [GC for 4380 CONS pages..(T=14).GC finished] [GC for 4390 CONS pages..(T=13).GC finished] [GC for 4400 CONS pages..(T=12).GC finished] [GC for 4410 CONS pages..(T=11).GC finished] [GC for 4420 CONS pages..(T=11).GC finished] [GC for 4430 CONS pages..(T=11).GC finished] [GC for 4440 CONS pages..(T=9).GC finished] [GC for 4450 CONS pages..(T=9).GC finished] [GC for 4460 CONS pages..(T=9).GC finished] [GC for 4470 CONS pages..(T=9).GC finished] [GC for 4480 CONS pages..(T=9).GC finished] [GC for 4490 CONS pages..(T=8).GC finished] [GC for 4500 CONS pages..(T=8).GC finished] [GC for 4500 CONS pages..(T=12).GC finished] [GC for 4500 CONS pages..(T=11).GC finished] [GC for 4500 CONS pages..(T=10).GC finished] [GC for 4500 CONS pages..(T=9).GC finished] [GC for 4510 CONS pages..(T=9).GC finished] [GC for 4520 CONS pages..(T=9).GC finished] [GC for 4530 CONS pages..(T=14).GC finished] [GC for 4540 CONS pages..(T=12).GC finished] [GC for 4550 CONS pages..(T=11).GC finished] [GC for 4560 CONS pages..(T=11).GC finished] [GC for 4570 CONS pages..(T=12).GC finished] [GC for 4580 CONS pages..(T=12).GC finished] [GC for 4590 CONS pages..(T=9).GC finished] [GC for 4600 CONS pages..(T=9).GC finished] [GC for 4610 CONS pages..(T=9).GC finished] [GC for 4620 CONS pages..(T=10).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=6).GC finished] [GC for 453 SFUN pages..(T=16).GC finished] [GC for 564 SYMBOL pages..(T=11).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 [GC for 453 SFUN pages..(T=9).GC finished] ASSUME-TRUE-FALSE-AGGRESSIVE-P :ATTACHMENTS-RECORDED TOP-LEVEL-IF-REDUCE-REC TOP-LEVEL-IF-REDUCE TOP-LEVEL-IF-P TYPE-ALIST-REDUCIBLE-ENTRIES ASSUME-TRUE-FALSE-AGGRESSIVE-1 [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] ASSUME-TRUE-FALSE-AGGRESSIVE ASSUME-TRUE-FALSE ASSUME-TRUE-FALSE-BC OK-TO-FORCE-ENS ADD-LINEAR-ASSUMPTION RETURN-TYPE-ALIST [GC for 453 SFUN pages..(T=8).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 [GC for 453 SFUN pages..(T=10).GC finished] PUT-ASSOC-EQUAL-TS RECONSIDER-TYPE-ALIST TYPE-ALIST-CLAUSE-FINISH1 TYPE-ALIST-CLAUSE-FINISH TYPE-ALIST-CLAUSE [GC for 453 SFUN pages..(T=11).GC finished] KNOWN-WHETHER-NIL TS-BOOLEANP WEAK-CONS-OCCUR EQUAL-X-CONS-X-YP NOT-IDENT [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] FIRST-IF ALL-VARIABLEP NORMALIZE-WITH-TYPE-SET [GC for 453 SFUN pages..(T=11).GC finished] (NORMALIZE NORMALIZE-LST NORMALIZE-OR-DISTRIBUTE-FIRST-IF DISTRIBUTE-FIRST-IF) DECODE-TYPE-SET1 DECODE-TYPE-SET DTS [GC for 453 SFUN pages..(T=11).GC finished] ENS Finished loading "type-set-b.lisp". ACL2 loading "linear-b.lisp". "ACL2" [GC for 453 SFUN pages..(T=10).GC finished] POLYS-FROM-TYPE-SET ADD-TYPE-SET-POLYS ADD-POLYNOMIAL-INEQUALITIES ADD-POLYS (EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST) [GC for 453 SFUN pages..(T=9).GC finished] EVAL-GROUND-SUBEXPRESSIONS EVAL-GROUND-SUBEXPRESSIONS-LST POLY-SET [GC for 4630 CONS pages..(T=7).GC finished] [GC for 453 SFUN pages..(T=9).GC finished] LINEARIZE1 [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] LINEARIZE LINEARIZE-LST1 LINEARIZE-LST Finished loading "linear-b.lisp". ACL2 loading "non-linear.lisp". "ACL2" CLEANSE-TYPE-ALIST VAR-WITH-DIVISIONP [GC for 453 SFUN pages..(T=10).GC finished] VARIFY VARIFY! VARIFY!-LST1 VARIFY!-LST INVERT-VAR PART-OF1 [GC for 453 SFUN pages..(T=8).GC finished] PART-OF PRODUCT-ALREADY-TRIEDP TOO-MANY-POLYSP EXPANDED-NEW-VARS-IN-POT-LST2 EXPANDED-NEW-VARS-IN-POT-LST1 EXPANDED-NEW-VARS-IN-POT-LST [GC for 453 SFUN pages..(T=7).GC finished] EXTRACT-BOUNDS GOOD-BOUNDS-IN-POT [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] INVERSE-POLYS ADD-INVERSE-POLYS ADD-POLYS-FROM-TYPE-SET LENGTH-OF-SHORTEST-POLYS-WITH-VAR SHORTEST-POLYS-WITH-VAR1 SHORTEST-POLYS-WITH-VAR [GC for 453 SFUN pages..(T=8).GC finished] BINARY-*-LEAVES BINARY-*-TREE MERGE-ARITH-TERM-ORDER INSERT-ARITH-TERM-ORDER SORT-ARITH-TERM-ORDER [GC for 453 SFUN 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 453 SFUN pages..(T=8).GC finished] INSERT-NEG-EVGS1 INSERT-NEG-EVGS [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] MERGE-CAR-< MERGE-SORT-CAR-< MERGE-CADR-< MERGE-SORT-CADR-< STRIP-CADDRS [GC for 453 SFUN pages..(T=8).GC finished] UNPRETTYIFY/ADD-HYPS-TO-PAIRS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=8).GC finished] UNPRETTYIFY REPRETTYIFY CONVERT-RETURNED-VARS-TO-TERM-LST IMPLICATE WEAK-TYPE-SET-INVERTER-RULE-P *INITIAL-TYPE-SET-INVERTER-RULES* [GC for 453 SFUN pages..(T=11).GC finished] CONVERT-TYPE-SET-TO-TERM-LST CONVERT-TYPE-SET-TO-TERM1 CONVERT-TYPE-SET-TO-TERM CONVERT-TYPE-PRESCRIPTION-TO-TERM [GC for 453 SFUN pages..(T=13).GC finished] ALL-RUNES-IN-VAR-TO-RUNES-ALIST ALL-RUNES-IN-VAR-TO-RUNES-ALIST-LST UNION-EQUAL-REMOVING-DUPLICATES [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] WEAK-SUMMARY-DATA-P MAKE-SUMMARY-DATA [GC for 453 SFUN pages..(T=8).GC finished] (ALL-RUNES-IN-ELIM-SEQUENCE-LST ALL-RUNES-IN-ELIM-SEQUENCE ALL-RUNES-IN-TTREE-FC-DERIVATION-LST ALL-RUNES-IN-TTREE-FIND-EQUATIONAL-POLY-LST ALL-RUNES-SUMMARY-DATA-LST ALL-RUNES-IN-TTREE ALL-RUNES-IN-TTREE-LST) WEAK-TAU-INTERVAL-P *TAU-EMPTY-INTERVAL* [GC for 453 SFUN pages..(T=8).GC finished] TAU-EMPTY-INTERVALP = LOWER-BOUND-> UPPER-BOUND-< TAU-SUBINTERVALP TAU-IMPLIES EMPTY-TAU-INTERVALP [GC for 463 SFUN pages..(T=9).GC finished] 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 [GC for 543 SFUN pages..(T=12).GC finished] RESTORE-RW-CACHE-STATE-IN-PSPV WATERFALL1-WRAPPER [GC for 6230 CONS pages..(T=12).GC finished] [GC for 6230 CONS pages..(T=12).GC finished] [GC for 543 SFUN pages..(T=12).GC finished] (WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0 WATERFALL0-OR-HIT WATERFALL1-LST) WATERFALL SOME-POOL-MEMBER-SUBSUMES ADD-TO-POP-HISTORY POP-CLAUSE1 MAKE-DEFTHM-FORMS-FOR-BYES [GC for 6230 CONS pages..(T=12).GC finished] POP-CLAUSE-MSG1 POP-CLAUSE-MSG SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY INCREMENT-PROOF-TREE-POP-CLAUSE [GC for 543 SFUN pages..(T=18).GC finished] POP-CLAUSE TILDE-@-ASSUMNOTES-PHRASE-LST TILDE-*-ASSUMNOTES-COLUMN-PHRASE TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE PROCESS-ASSUMPTIONS-MSG1 [GC for 543 SFUN pages..(T=19).GC finished] PROCESS-ASSUMPTIONS-MSG COUNT-ASSUMPTIONS ADD-TYPE-ALIST-RUNES-TO-TTREE1 ADD-TYPE-ALIST-RUNES-TO-TTREE PROCESS-ASSUMPTIONS-TTREE [GC for 543 SFUN pages..(T=14).GC finished] PROCESS-ASSUMPTIONS DO-NOT-INDUCT-MSG PROVE-LOOP2 PROVE-LOOP1 [GC for 6230 CONS pages..(T=18).GC finished] PRINT-SUMMARY-ON-ERROR PROVE-LOOP0 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=20).GC finished] PROVE-LOOP MAKE-PSPV CHK-ASSUMPTION-FREE-TTREE PUSH-CURRENT-ACL2-WORLD POP-CURRENT-ACL2-WORLD REVERT-WORLD PROVE Finished loading "prove.lisp". [GC for 543 SFUN pages..(T=17).GC finished] ACL2 loading "defuns.lisp". "ACL2" CERT-DATA-PAIR CERT-DATA-VAL CERT-DATA-ENTRY-PAIR CERT-DATA-ENTRY [GC for 674 SYMBOL pages..(T=14).GC finished] IN-ENCAPSULATEP (CONTAINS-LAMBDA-OBJECTP CONTAINS-LAMBDA-OBJECT-LISTP) STORE-CERT-DATA WEAK-TRANSLATE-CERT-DATA-RECORD-P UPDATE-TRANSLATE-CERT-DATA-FN UPDATE-TRANSLATE-CERT-DATA *MUTUAL-RECURSION-CTX-STRING* [GC for 543 SFUN pages..(T=12).GC finished] TRANSLATE-BODIES1 CHK-NON-EXECUTABLE-BODIES COLLECT-UNTOUCHABLE-FNS COLLECT-UNTOUCHABLE-VARS GET-TRANSLATE-CERT-DATA-RECORD [GC for 543 SFUN pages..(T=13).GC finished] GET-TRANSLATE-BODIES TRANSLATE-BODIES CHK-MUTUAL-RECURSION-BAD-NAMES *CHK-MUTUAL-RECURSION-STRING* CHK-MUTUAL-RECURSION1 CHK-MUTUAL-RECURSION [GC for 543 SFUN pages..(T=19).GC finished] (FFNNAMEP-MOD-MBE FFNNAMEP-MOD-MBE-LST) PUTPROP-RECURSIVEP-LST PROPER-DUMB-OCCUR-AS-OUTPUT ALWAYS-TESTED-AND-CHANGEDP [GC for 543 SFUN pages..(T=17).GC finished] GUESS-MEASURE GUESS-MEASURE-ALIST TILDE-*-MEASURE-PHRASE1 TILDE-*-MEASURE-PHRASE FIND-?-MEASURE [GC for 6230 CONS pages..(T=13).GC finished] [GC for 6240 CONS pages..(T=13).GC finished] PROVE-TERMINATION PUTPROP-JUSTIFICATION-LST UNION-EQUAL-TO-END CROSS-TESTS-AND-CALLS3 CROSS-TESTS-AND-CALLS2 CROSS-TESTS-AND-CALLS1 [GC for 543 SFUN pages..(T=12).GC finished] SUBLIS-TESTS-REV ALL-CALLS-TEST-ALIST CROSS-TESTS-AND-CALLS MARK-LOOP$-RECURSION-NUGGET MARKED-LOOP$-RECURSION-NUGGETP [GC for 543 SFUN pages..(T=12).GC finished] (INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST) SIMPLIFY-TESTS-AND-CALLS SIMPLIFY-TESTS-AND-CALLS-LST (LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST) [GC for 2049 RELOCATABLE-BLOCKS pages..(T=17).GC finished] INDUCTION-MACHINE-FOR-FN CLEAN-UP-NOTS CLEAN-UP-NOTS-LST CLEAN-UP-CONJUNCTION1 CLEAN-UP-CONJUNCTION [GC for 543 SFUN pages..(T=17).GC finished] CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=21).GC finished] INDUCTION-MACHINES PUTPROP-INDUCTION-MACHINE-LST QUICK-BLOCK-INITIAL-SETTINGS QUICK-BLOCK-INFO1 QUICK-BLOCK-INFO2 QUICK-BLOCK-SETTINGS [GC for 543 SFUN pages..(T=14).GC finished] QUICK-BLOCK-DOWN-T-MACHINE QUICK-BLOCK-INFO PUTPROP-QUICK-BLOCK-INFO-LST BIG-MUTREC GET-SIG-FNS1 GET-SIG-FNS [GC for 543 SFUN pages..(T=12).GC finished] SELECTED-ALL-FNNAMES-LST SUBVERSIVEP SUBVERSIVE-CLIQUEP PROVE-TERMINATION-NON-RECURSIVE [GC for 543 SFUN pages..(T=13).GC finished] PROVE-TERMINATION-RECURSIVE PUT-INDUCTION-INFO-RECURSIVE MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE COLLECT-PROBLEMATIC-QUOTED-FNS [GC for 543 SFUN pages..(T=18).GC finished] MAYBE-WARN-ON-PROBLEMATIC-QUOTED-FNS PUT-INDUCTION-INFO DESTRUCTURE-DEFINITION MEMBER-REWRITE-RULE-RUNE REPLACE-REWRITE-RULE-RUNE PREPROCESS-HYP PREPROCESS-HYPS [GC for 6250 CONS pages..(T=21).GC finished] ADD-DEFINITION-RULE-WITH-TTREE ADD-DEFINITION-RULE PUTPROP-BODY-LST TYPE-SET-IMPLIED-BY-TERM1 TYPE-SET-IMPLIED-BY-TERM PUTPROP-INITIAL-TYPE-PRESCRIPTIONS MAP-RETURNED-FORMALS-VIA-FORMALS MAP-TYPE-SETS-VIA-FORMALS [GC for 6260 CONS pages..(T=21).GC finished] VECTOR-TS-UNION MAP-CONS-TAG-TREES TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1 TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE [GC for 6260 CONS pages..(T=18).GC finished] TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES [GC for 6270 CONS pages..(T=20).GC finished] (TYPE-SET-AND-RETURNED-FORMALS TYPE-SET-AND-RETURNED-FORMALS-LST) TYPE-SET-AND-RETURNED-FORMALS-TOP GUESS-TYPE-PRESCRIPTION-FOR-FN-STEP *CLIQUE-STEP-INSTALL-INTERVAL* GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE-STEP [GC for 6280 CONS pages..(T=19).GC finished] (GUARDED-TERMP GUARDED-TERM-LISTP) [GC for 6280 CONS pages..(T=18).GC finished] CONJOIN-TYPE-PRESCRIPTIONS CLEANSE-TYPE-PRESCRIPTIONS GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE GET-NORMALIZED-BODIES [GC for 6290 CONS pages..(T=17).GC finished] CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE PUTPROP-TYPE-PRESCRIPTION-LST PUTPROP-LEVEL-NO-LST PRIMITIVE-RECURSIVE-ARGP PRIMITIVE-RECURSIVE-CALLP [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=22).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 553 SFUN 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 [GC for 102 CFUN pages..(T=18).GC finished] CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP GUARD-SIMPLIFY-MSG GUARD-SIMPLIFY-P CHK-ACCEPTABLE-VERIFY-GUARDS-CMP [GC for 6290 CONS pages..(T=15).GC finished] CHK-ACCEPTABLE-VERIFY-GUARDS GUARD-OBLIGATION-CLAUSES GUARD-OBLIGATION PROVE-GUARD-CLAUSES-MSG VERIFY-GUARDS-FORMULA-FN VERIFY-GUARDS-FORMULA [GC for 6300 CONS pages..(T=21).GC finished] [GC for 6300 CONS pages..(T=11).GC finished] PROVE-GUARD-CLAUSES MAYBE-REMOVE-INVARIANT-RISK VERIFY-GUARDS-FN1 CONVERT-RUNES-TO-UNORDERED-MAPPING-PAIRS AUGMENT-THEORY-WEAK [GC for 6310 CONS pages..(T=20).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 PRINT-RUNE [GC for 553 SFUN pages..(T=16).GC finished] USELESS-RUNES-REPORT-P PRINT-USELESS-RUNES-TUPLES-REC PRINT-USELESS-RUNES-TUPLES PRINT-USELESS-RUNES AUGMENTED-RUNES-AFTER-1 [GC for 6310 CONS pages..(T=19).GC finished] AUGMENTED-RUNES-AFTER EXTEND-SET-DIFFERENCE-THEORIES USELESS-RUNES-ENS WITH-USELESS-RUNES VERIFY-GUARDS-FN *SUPER-DEFUN-WART-TABLE* [GC for 6320 CONS pages..(T=18).GC finished] 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 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] COLLECT-OLD-NAMEPS PUT-INVARIANT-RISK1 STOBJS-GUARD-ONLY-LST STOBJS-GUARD-ONLY REMOVE-GUARD-T *BOOT-STRAP-INVARIANT-RISK-ALIST* PUT-INVARIANT-RISK DEFUNS-FN-SHORT-CUT PRINT-DEFUN-MSG/COLLECT-TYPE-PRESCRIPTIONS [GC for 553 SFUN pages..(T=18).GC finished] PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS1 PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS SIMPLE-SIGNATUREP ALL-SIMPLE-SIGNATURESP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=18).GC finished] PRINT-DEFUN-MSG/SIGNATURES1 PRINT-DEFUN-MSG/SIGNATURES PRINT-DEFUN-MSG GET-IGNORES GET-IGNORABLES IRRELEVANT-VARS GET-IRRELEVANTS [GC for 553 SFUN pages..(T=18).GC finished] CHK-ALL-STOBJ-NAMES GET-DECLARED-STOBJ-NAMES GET-STOBJS-IN-LST CHK-STOBJS-OUT-BOUND STORE-STOBJS-OUT UNPARSE-SIGNATURE [GC for 6320 CONS pages..(T=17).GC finished] CHK-DEFUN-MODE SCAN-TO-CLTL-COMMAND DCL-FIELDS1 DCL-FIELDS SET-EQUALP-EQ NON-IDENTICAL-DEFP-CHK-MEASURES [GC for 6330 CONS pages..(T=19).GC finished] NON-IDENTICAL-DEFP IDENTICAL-DEFP REDUNDANT-OR-RECLASSIFYING-DEFUNP0 [GC for 6340 CONS pages..(T=19).GC finished] REDUNDANT-OR-RECLASSIFYING-DEFUNP REDUNDANT-OR-RECLASSIFYING-DEFUNSP10 REDUNDANT-OR-RECLASSIFYING-DEFUNSP1 RECOVER-DEFS-LST GET-CLIQUE [GC for 684 SYMBOL pages..(T=20).GC finished] REDUNDANT-OR-RECLASSIFYING-DEFUNSP0 STRIP-LAST-ELEMENTS REDUNDANT-OR-RECLASSIFYING-DEFUNSP COLLECT-WHEN-CADR-EQ ALL-PROGRAMP FORMAL-POSITION MAKE-POSNS [GC for 553 SFUN pages..(T=18).GC finished] (RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST RELEVANT-POSNS-CALL) RELEVANT-POSNS-CLIQUE1 RELEVANT-POSNS-CLIQUE-RECUR RELEVANT-POSNS-CLIQUE-INIT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] (RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST) RELEVANT-POSNS-MERGE RELEVANT-POSNS-LAMBDAS-TOP RELEVANT-POSNS-CLIQUE IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1 [GC for 553 SFUN pages..(T=19).GC finished] 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 553 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 [GC for 553 SFUN pages..(T=18).GC finished] COLLECT-UNBADGED CHK-BADGED-QUOTED-SUBFUNCTIONS UNION-COLLECT-NON-X TRANSLATE-MEASURES REDUNDANT-PREDEFINED-ERROR-MSG CHK-ACCEPTABLE-DEFUNS-REDUNDANCY [GC for 6350 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 [GC for 553 SFUN pages..(T=18).GC finished] RAW-LAMBDA$S-TO-LAMBDAS *DEFAULT-STATE-VARS* 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 553 SFUN pages..(T=18).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 [GC for 6360 CONS pages..(T=18).GC finished] CHK-ACCEPTABLE-LOOP$-TRANSLATIONS1 CHK-ACCEPTABLE-LOOP$-TRANSLATIONS2 CHK-ACCEPTABLE-LOOP$-TRANSLATIONS (STATE-GLOBALS-SET-BY STATE-GLOBALS-SET-BY-LST) [GC for 6370 CONS pages..(T=17).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=21).GC finished] (CHK-LAMBDAS-FOR-LOOP$-RECURSION1 CHK-LAMBDAS-FOR-LOOP$-RECURSION1-LST) CHK-LAMBDAS-FOR-LOOP$-RECURSION WEAK-LAMBDA-INFO-P (REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST) REMOVE-LAMBDAS [GC for 553 SFUN pages..(T=18).GC finished] TYPE-PRESCRIPTION-DISJUNCTP TYPE-PRESCRIPTION-CONCLP SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL UNPRETTYIFY-TP [GC for 6380 CONS pages..(T=20).GC finished] DESTRUCTURE-TYPE-PRESCRIPTION GET-XARGS-TYPE-PRESCRIPTION-LST [GC for 6390 CONS pages..(T=18).GC finished] CHK-TYPE-PRESCRIPTION-LST GLOBAL-STOBJS-PROP [GC for 6400 CONS pages..(T=19).GC finished] [GC for 6410 CONS pages..(T=17).GC finished] [GC for 6420 CONS pages..(T=18).GC finished] [GC for 6430 CONS pages..(T=18).GC finished] CHK-ACCEPTABLE-DEFUNS1 CONDITIONALLY-MEMOIZED-FNS CHK-ACCEPTABLE-DEFUNS UNION-EQ1-REV [GC for 6440 CONS pages..(T=18).GC finished] COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST [GC for 6440 CONS pages..(T=21).GC finished] DEFUNS-FN1 DEFUNS-FN0 STRIP-NON-HIDDEN-PACKAGE-NAMES IN-PACKAGE-FN [GC for 553 SFUN pages..(T=18).GC finished] DEFSTOBJ-FUNCTIONSP INDEX-OF-NON-NUMBER MAKE-UDF-INSIGS INTRO-UDF INTRO-UDF-LST1 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=18).GC finished] INTRO-UDF-LST2 INTRO-UDF-LST DEFUN-CTX INSTALL-EVENT-DEFUNS [GC for 6450 CONS pages..(T=18).GC finished] DEFUNS-FN DEFUN-FN ARGS-FN ARGS MAKE-VERIFY-TERMINATION-DEF [GC for 553 SFUN pages..(T=17).GC finished] MAKE-VERIFY-TERMINATION-DEFS-LST CHK-ACCEPTABLE-VERIFY-TERMINATION1 UNIFORM-DEFUN-MODES CHK-ACCEPTABLE-VERIFY-TERMINATION [GC for 553 SFUN pages..(T=20).GC finished] VERIFY-TERMINATION1 VERIFY-TERMINATION-BOOT-STRAP-FN1 VERIFY-TERMINATION-BOOT-STRAP-FN WHEN-LOGIC3 VERIFY-TERMINATION-FN FNS-USED-IN-AXIOMS [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] CHECK-OUT-INSTANTIABLEP1 CHECK-OUT-INSTANTIABLEP *AVOID-ONEIFY-FNS* Finished loading "defuns.lisp". ACL2 loading "proof-builder-a.lisp". "ACL2" PC-VALUE PC-ASSIGN INITIALIZE-PC-ACL2 STATE-STACK OLD-SS SS-ALIST WEAK-PC-INFO-P PC-PRINT-PROMPT-AND-INSTR-FLG PC-PRINT-MACROEXPANSION-FLG PC-PROMPT PC-PROMPT-DEPTH-PREFIX WEAK-PC-STATE-P *PC-STATE-FIELDS-FOR-PRIMITIVES* INSTRUCTION GOALS ABBREVIATIONS LOCAL-TAG-TREE PC-ENS TAG-TREE [GC for 6450 CONS pages..(T=20).GC finished] WEAK-GOAL-P *GOAL-FIELDS* 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 CHECK-FORMALS-LENGTH [GC for 6460 CONS pages..(T=19).GC finished] CHECK-&OPTIONAL-AND-&REST MAKE-LET-PAIRS-FROM-FORMALS (ALL-SYMBOLS ALL-SYMBOLS-LIST) MAKE-ACCESS-BINDINGS LET-FORM-FOR-PC-STATE-VARS CHECK-FIELD-NAMES PRINT-NO-CHANGE PRINT-NO-CHANGE2 [GC for 6470 CONS pages..(T=19).GC finished] PRINT-NO-CHANGE-FN MAYBE-UPDATE-INSTRUCTION PC-PRIMITIVE-DEFUN-FORM PC-COMMAND-TABLE-GUARD PC-COMMAND-TABLE ADD-PC-COMMAND PC-COMMAND-TYPE PRINT-NO-CHANGE3 ADD-PC-COMMAND-1 TOGGLE-PC-MACRO-FN PC-META-OR-MACRO-DEFUN GOAL-NAMES INSTRUCTIONS-OF-STATE-STACK FMS0 WITH-OUTPUT-FORCED [GC for 6480 CONS pages..(T=19).GC finished] PRINT-PC-PROMPT PC-MACROEXPAND FIND-GOAL PRINT-ALL-GOALS-PROVED-MESSAGE WHEN-GOALS WHEN-GOALS-TRIP CURRENT-IMMEDIATE-DEPS GOAL-DEPENDENT-P CURRENT-ALL-DEPS [GC for 6490 CONS pages..(T=19).GC finished] MAYBE-PRINT-PROVED-GOAL-MESSAGE ACCUMULATE-TTREE-IN-PC-STATE PC-PROCESS-ASSUMPTIONS MAKE-IMPLICATION CL-SET-TO-IMPLICATIONS KNOWN-ASSUMPTIONS ADD-ASSUMPTIONS-TO-TOP-GOAL UNPROVED-GOALS [GC for 563 SFUN pages..(T=19).GC finished] MAKE-PC-ENS INITIAL-RCNST-FROM-ENS MAKE-NEW-GOALS-FIXED-HYPS [GC for 6500 CONS pages..(T=17).GC finished] [GC for 6510 CONS pages..(T=18).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] PC-SINGLE-STEP-PRIMITIVE MAYBE-PRINT-MACROEXPANSION PC-SINGLE-STEP-1 [GC for 6520 CONS pages..(T=18).GC finished] UNION-LASTN-PC-TAG-TREES PC-SINGLE-STEP *PC-COMPLETE-SIGNAL* PRINT-RE-ENTERING-PROOF-BUILDER CHK-ABSSTOBJ-INVARIANTS [GC for 6520 CONS pages..(T=22).GC finished] PC-MAIN-LOOP MAKE-INITIAL-GOAL INITIAL-STATE-STACK EVENT-NAME-AND-TYPES-AND-RAW-TERM INSTALL-INITIAL-STATE-STACK PC-MAIN1 [GC for 694 SYMBOL pages..(T=19).GC finished] PC-MAIN PC-TOP (ILLEGAL-FNP ILLEGAL-FNP-LIST) VERIFY-FN [GC for 6520 CONS pages..(T=19).GC finished] PRINT-UNPROVED-GOALS-MESSAGE STATE-STACK-FROM-INSTRUCTIONS STATE-FROM-INSTRUCTIONS PRINT-PC-DEFTHM PRINT-PC-GOAL PRINT-PC-STATE [GC for 6520 CONS pages..(T=20).GC finished] PROOF-BUILDER VERIFY GUARD-MSG-TABLE (SUBLIS-EXPR-NON-QUOTEPS SUBLIS-EXPR-NON-QUOTEPS-LST) INVERT-ABBREVIATIONS-ALIST ABBREVIATE UNTRANS0 UNTRANS0-LST-FN UNTRANS0-LST Finished loading "proof-builder-a.lisp". ACL2 loading "defthm.lisp". "ACL2" [GC for 563 SFUN pages..(T=19).GC finished] FORM-OF-REWRITE-QUOTED-CONSTANT-RULE INTERPRET-TERM-AS-REWRITE-RULE2 INTERPRET-TERM-AS-REWRITE-RULE1 [GC for 6520 CONS pages..(T=20).GC finished] 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 HIDE-LAMBDAS1 HIDE-LAMBDAS VARIANTP [GC for 563 SFUN pages..(T=19).GC finished] (SURROUNDING-FNS1 SURROUNDING-FNS-LST) SURROUNDING-FNS LOOP-STOPPER1 LOOP-STOPPER [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS 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 6530 CONS pages..(T=20).GC finished] ALL-VARS-IN-HYPS MATCH-FREE-VALUE MATCH-FREE-FC-VALUE RULE-BACKCHAIN-LIMIT-LST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=19).GC finished] CREATE-REWRITE-RULE HYPS-THAT-INSTANTIATE-FREE-VARS (MAYBE-ONE-WAY-UNIFY MAYBE-ONE-WAY-UNIFY-LST) MAYBE-ONE-WAY-UNIFY-WITH-SOME MAYBE-SUBSUMES SUBSUMES-REWRITE-RULE [GC for 563 SFUN pages..(T=19).GC finished] FIND-SUBSUMED-RULE-NAMES FIND-SUBSUMING-RULE-NAMES FORCED-HYPS STRIP-TOP-LEVEL-NOTS-AND-FORCES FREE-VARIABLE-ERROR? EXTEND-GENEQV-ALIST [GC for 563 SFUN pages..(T=18).GC finished] (COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST) UNCOVERED-EQUIVS (UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST) DOUBLE-REWRITE-OPPORTUNITIES [GC for 6540 CONS pages..(T=18).GC finished] 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 6550 CONS pages..(T=20).GC finished] CHK-REWRITE-RULE-WARNINGS CHK-ACCEPTABLE-REWRITE-RULE2 CHK-ACCEPTABLE-REWRITE-RULE1 CHK-ACCEPTABLE-REWRITE-RULE [GC for 6560 CONS pages..(T=18).GC finished] ADD-REWRITE-RULE2 ADD-REWRITE-RULE1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] ADD-REWRITE-RULE EXPAND-INEQUALITY-FNCALL1 EXPAND-INEQUALITY-FNCALL ALL-VARS-IN-POLY-LST SUBBAGP-EQ ALWAYS-BIGGERP-DATA ALWAYS-BIGGERP-DATA-LST [GC for 563 SFUN pages..(T=18).GC finished] ALWAYS-BIGGERP NO-ELEMENT-ALWAYS-BIGGERP MAXIMAL-TERMS1 MAXIMAL-TERMS COLLECT-WHEN-FFNNAMESP MAKE-FREE-MAX-TERMS-MSG1 [GC for 563 SFUN pages..(T=20).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 563 SFUN pages..(T=18).GC finished] CHK-ACCEPTABLE-LINEAR-RULE2 CHK-ACCEPTABLE-LINEAR-RULE1 CHK-ACCEPTABLE-LINEAR-RULE ADD-LINEAR-RULE3 ADD-LINEAR-RULE2 [GC for 563 SFUN pages..(T=18).GC finished] ADD-LINEAR-RULE1 ADD-LINEAR-RULE [GC for 6560 CONS pages..(T=19).GC finished] DESTRUCTURE-WELL-FOUNDED-RELATION-RULE [GC for 6570 CONS pages..(T=18).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 [GC for 563 SFUN pages..(T=18).GC finished] (FN-AND-MAXIMAL-LEVEL-NO FN-AND-MAXIMAL-LEVEL-NO-LST) BUILT-IN-CLAUSE-DISCRIMINATOR-FN ALL-FNNAMES-SUBSUMER MAKE-BUILT-IN-CLAUSE-RULES1 CHK-INITIAL-BUILT-IN-CLAUSES [GC for 563 SFUN pages..(T=17).GC finished] MAKE-BUILT-IN-CLAUSE-RULES [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] CLASSIFY-AND-STORE-BUILT-IN-CLAUSE-RULES ADD-BUILT-IN-CLAUSE-RULE [GC for 6580 CONS pages..(T=20).GC finished] DESTRUCTURE-COMPOUND-RECOGNIZER [GC for 6590 CONS pages..(T=20).GC finished] MAKE-RECOGNIZER-TUPLE COMMENT-ON-NEW-RECOG-TUPLE1 [GC for 6600 CONS pages..(T=23).GC finished] COMMENT-ON-NEW-RECOG-TUPLE CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE ADD-COMPOUND-RECOGNIZER-RULE [GC for 6600 CONS pages..(T=21).GC finished] CHK-TRIGGERS DESTRUCTURE-FORWARD-CHAINING-TERM CHK-ACCEPTABLE-FORWARD-CHAINING-RULE PUTPROP-FORWARD-CHAINING-RULES-LST ADD-FORWARD-CHAINING-RULE [GC for 563 SFUN pages..(T=21).GC finished] EVALUATOR-CLAUSE/ARGLIST EVALUATOR-CLAUSE EVALUATOR-CLAUSES1 EVALUATOR-CLAUSES CDRP [GC for 563 SFUN pages..(T=16).GC finished] EXPAND-EQ-AND-ATOM-TERM-LST NORMALIZE-ALLEGED-EVALUATOR-CLAUSE NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET SHALLOW-CLAUSIFY1 SHALLOW-CLAUSIFY FIND-EVFN-LST-IN-CLAUSE [GC for 563 SFUN pages..(T=18).GC finished] GUESS-EVFN-LST-FOR-EVFN FIND-FN-IN-CLAUSE GUESS-FN-ARGS-LST-FOR-EVFN NORMALIZED-EVALUATOR-CL-SET CHK-EVALUATOR NAMEDP-PREFIX [GC for 563 SFUN pages..(T=21).GC finished] DEFEVALUATOR-FORM/DEFTHM-NAME DEFEVALUATOR-FORM/DEFTHM-HINTS DEFEVALUATOR-FORM/DEFTHM DEFEVALUATOR-FORM/DEFTHMS CAR-CADR-CADDR-ETC [GC for 563 SFUN pages..(T=21).GC finished] DEFEVALUATOR-FORM/FNS-CLAUSES *DEFEVALUATOR-FORM-BASE-THEORY* DEFEVALUATOR-FORM [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] PAIRS-TO-MACRO-ALIAS-MSGS DEFEVALUATOR-CHECK-MSG DEFEVALUATOR-CHECK DEFEVALUATOR-CHECK-FORM DEFEVALUATOR TERM-TABLE TERM-TABLE [GC for 563 SFUN pages..(T=23).GC finished] REMOVE-META-EXTRACT-CONTEXTUAL-HYPS REMOVE-META-EXTRACT-GLOBAL-HYPS META-RULE-HYPOTHESIS-FUNCTIONS META-FN-ARGS CHK-META-FUNCTION EV-LST-FROM-EV ATTACHED-FNS [GC for 6610 CONS pages..(T=18).GC finished] SIBLINGS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=19).GC finished] CANONICAL-SIBLING (CANONICAL-FFN-SYMBS CANONICAL-FFN-SYMBS-LST) COLLECT-CANONICAL-SIBLINGS CONSTRAINTS-LIST CONSTRAINT-INFO+ IMMEDIATE-CANONICAL-ANCESTORS CANONICAL-ANCESTORS-REC CANONICAL-ANCESTORS CANONICAL-ANCESTORS-LST [GC for 6620 CONS pages..(T=19).GC finished] CHK-EVALUATOR-USE-IN-RULE CHK-RULE-FN-GUARD ADD-NEW-NEVER-UNTOUCHABLE-FNS COLLECT-NEVER-UNTOUCHABLE-FNS-ENTRIES [GC for 6630 CONS pages..(T=19).GC finished] INTERPRET-TERM-AS-META-RULE [GC for 6640 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-META-RULE ADD-META-RULE1 MAYBE-PUTPROP-LST MARK-ATTACHMENT-DISALLOWED2 MARK-ATTACHMENT-DISALLOWED1 MARK-ATTACHMENT-DISALLOWED ADD-META-RULE [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] (DESTRUCTORS DESTRUCTORS-LST) STRIP-FFN-SYMBS CHK-ACCEPTABLE-ELIM-RULE1 CHK-ACCEPTABLE-ELIM-RULE ADD-ELIM-RULE1 ADD-ELIM-RULE CHK-ACCEPTABLE-GENERALIZE-RULE [GC for 704 SYMBOL pages..(T=24).GC finished] ADD-GENERALIZE-RULE 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 6650 CONS pages..(T=21).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 573 SFUN pages..(T=22).GC finished] FIND-CANDIDATE-EQUIVALENCE-RELATION COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES CHK-ACCEPTABLE-EQUIVALENCE-RULE ADD-EQUIVALENCE-RULE [GC for 6660 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-REFINEMENT-RULE COLLECT-COARSENINGS PUTPROP-COARSENINGS UNION-VALUES EXTEND-VALUE-SET EXTEND-EACH-VALUE-SET [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] CLOSE-VALUE-SETS ADD-REFINEMENT-RULE CORRESPONDING-ARGS-EQ-EXCEPT (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 [GC for 573 SFUN pages..(T=22).GC finished] SPLIT-AT-POSITION MAKE-PEQUIV-PATTERN MAKE-PEQUIV (VAR-ADDRESS VAR-ADDRESS-LST) [GC for 6670 CONS pages..(T=22).GC finished] INTERPRET-TERM-AS-CONGRUENCE-RULE SOME-CONGRUENCE-RULE-SAME SOME-CONGRUENCE-RULE-HAS-REFINEMENT [GC for 6680 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-CONGRUENCE-RULE ADD-CONGRUENCE-RULE-TO-CONGRUENCE CONS-ASSOC-EQ-REC CONS-ASSOC-EQ ADD-CONGRUENCE-RULE CHK-DESTRUCTURE-DEFINITION [GC for 6690 CONS pages..(T=18).GC finished] CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY CHK-ACCEPTABLE-DEFINITION-RULE CHK-ACCEPTABLE-INDUCTION-RULE ADD-INDUCTION-RULE CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE ADD-TYPE-SET-INVERTER-RULE [GC for 6690 CONS pages..(T=20).GC finished] TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG DESTRUCTURE-CLAUSE-PROCESSOR-RULE CHK-ACCEPTABLE-CLAUSE-PROCESSOR-RULE [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] ADD-CLAUSE-PROCESSOR-RULE TRUSTED-CL-PROC-TABLE-GUARD TRUSTED-CL-PROC-TABLE DEFINE-TRUSTED-CLAUSE-PROCESSOR PRIMITIVE-INSTRUCTIONP NON-PRIMITIVE-INSTRUCTIONS CHK-PRIMITIVE-INSTRUCTION-LISTP TRANSLATE-INSTRUCTIONS CONTROLLER-ALISTP [GC for 573 SFUN pages..(T=23).GC finished] ALIST-TO-KEYWORD-ALIST ELIMINATE-MACRO-ALIASES FIX-LOOP-STOPPER-ALIST GUESS-CONTROLLER-ALIST-FOR-DEFINITION-RULE CHK-LEGAL-LINEAR-TRIGGER-TERMS1 CHK-LEGAL-LINEAR-TRIGGER-TERMS BACKCHAIN-LIMIT-LISTP [GC for 573 SFUN pages..(T=24).GC finished] RECOVER-METAFUNCTION-OR-CLAUSE-PROCESSOR-SIGNATURES EQUAL-EXCEPT-ON-NON-STOBJS ARITY-ALISTP COMPATIBLE-ARITY-ALISTSP COLLECT-DISAGREEING-ARITY-ASSUMPTIONS [GC for 6700 CONS pages..(T=21).GC finished] [GC for 6710 CONS pages..(T=19).GC finished] [GC for 6720 CONS pages..(T=18).GC finished] [GC for 6730 CONS pages..(T=21).GC finished] INTERPRET-TERM-AS-WELL-FORMEDNESS-GUARANTEE-THM [GC for 6740 CONS pages..(T=20).GC finished] TRANSLATE-WELL-FORMEDNESS-GUARANTEE [GC for 6740 CONS pages..(T=19).GC finished] [GC for 6750 CONS pages..(T=15).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=15).GC finished] [GC for 6760 CONS pages..(T=16).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] TRANSLATE-RULE-CLASS-ALIST TRANSLATE-RULE-CLASS1 REASON-FOR-NON-KEYWORD-VALUE-LISTP TRANSLATE-RULE-CLASS TRANSLATE-RULE-CLASSES1 TRANSLATE-RULE-CLASSES [GC for 6770 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-X-RULE CHK-ACCEPTABLE-X-RULES COLLECT-KEYS-EQ CHK-ACCEPTABLE-RULES ADD-X-RULE [GC for 573 SFUN pages..(T=24).GC finished] ADD-RULES1 TRUNCATE-CLASS-ALIST TRUNCATE-CLASSES MAKE-RUNES1 MAKE-RUNES MAKE-RUNIC-MAPPING-PAIRS ADD-RULES [GC for 573 SFUN pages..(T=21).GC finished] REDUNDANT-THEOREMP NON-TAUTOLOGICAL-CLASSES PROVE-COROLLARIES1 PROVE-COROLLARIES ENABLED-RUNEP-STRING [GC for 6770 CONS pages..(T=21).GC finished] UNTRANSLATE-HYPS INFO-FOR-LEMMAS ASSOC-EQ-EQ INFO-FOR-WELL-FOUNDED-RELATION-RULES INFO-FOR-BUILT-IN-CLAUSE-RULES1 INFO-FOR-BUILT-IN-CLAUSE-RULES [GC for 573 SFUN pages..(T=25).GC finished] INFO-FOR-COMPOUND-RECOGNIZER-RULES INFO-FOR-GENERALIZE-RULES INFO-FOR-LINEAR-LEMMAS INFO-FOR-ELIMINATE-DESTRUCTORS-RULE INFO-FOR-CONGRUENCES [GC for 573 SFUN pages..(T=23).GC finished] INFO-FOR-PEQUIVS INFO-FOR-COARSENINGS INFO-FOR-FORWARD-CHAINING-RULES DECODE-TYPE-SET-LST INFO-FOR-TYPE-PRESCRIPTIONS [GC for 573 SFUN pages..(T=20).GC finished] INFO-FOR-INDUCTION-RULES INFO-FOR-TYPE-SET-INVERTER-RULES INFO-FOR-X-RULES INFO-FOR-RULES [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] PRINT-INFO-FOR-RULES-ENTRY PRINT-INFO-FOR-RULES REPLACE-PROP RESTRICT-PKG-IMPORTS PR-BODY PR-FN [GC for 573 SFUN pages..(T=20).GC finished] PRINT-CLAUSE-PROCESSOR-RULES1 PRINT-CLAUSE-PROCESSOR-RULES NEW-NUMES WORLD-TO-NEXT-COMMAND PR!-FN PR PR! DISABLEDP-FN-LST DISABLEDP-FN DISABLEDP [GC for 573 SFUN pages..(T=20).GC finished] COLLECT-ABBREVIATION-SUBCLASS RUNES-TO-MONITOR1 *MONITORABLE-RUNE-TYPES* MONITORABLE-RUNES MONITORABLE-RUNES-FROM-MAPPING-PAIRS RUNES-TO-MONITOR [GC for 573 SFUN pages..(T=25).GC finished] REMOVE1-ASSOC-EQUAL? REMOVE1-ASSOC-EQUAL?-LST MONITOR1 REMOVE1-ASSOC-EQUAL-LST SET-DIFFERENCE-ASSOC-EQUAL [GC for 573 SFUN pages..(T=19).GC finished] UNMONITOR1 MONITOR-FN UNMONITOR-FN [GC for 573 SFUN pages..(T=18).GC finished] MONITORED-RUNES-FN BRR-FN BRR MONITOR! BRR@ MONITOR UNMONITOR MONITORED-RUNES PROCEED-FROM-BRKPT1 EXIT-BRR OK-IF-FN OK-IF [GC for 573 SFUN pages..(T=20).GC finished] PRINT-RULE-STORAGE-DEPENDENCIES DEFAXIOM-SUPPORTERS WHEN-LOGIC-OR-BOOT-STRAP DEFAXIOM-FN WARN-ON-INAPPROPRIATE-DEFUN-MODE [GC for 6770 CONS pages..(T=20).GC finished] WITH-WATERFALL-PARALLELISM-TIMINGS TRANSLATE-FOR-DEFTHM [GC for 6780 CONS pages..(T=18).GC finished] [GC for 6790 CONS pages..(T=18).GC finished] [GC for 6800 CONS pages..(T=19).GC finished] DEFTHM-FN1 DEFTHM-FN [GC for 6810 CONS pages..(T=21).GC finished] THM-FN THM CHK-EXTENSIBLE-RULE-CLASSES EXTEND-RULE-CLASSES *DEFEQUIV-PACKAGE-VALUES* DEFEQUIV-FORM [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] DEFEQUIV-FN DEFEQUIV *DEFREFINEMENT-PACKAGE-VALUES* DEFREFINEMENT-FORM DEFREFINEMENT-FN DEFREFINEMENT *DEFCONG-PACKAGE-VALUES* [GC for 573 SFUN pages..(T=20).GC finished] DEFCONG-FORM DEFCONG-FN DEFCONG Finished loading "defthm.lisp". ACL2 loading "other-events.lisp". "ACL2" MACRO-VARS-KEY MACRO-VARS-AFTER-REST MACRO-VARS-OPTIONAL MACRO-VARS [GC for 6810 CONS pages..(T=19).GC finished] CHK-LEGAL-DEFCONST-NAME DEFCONST-FN1 WEAK-HCOMP-BOOK-HT-ENTRY-P DEFCONST-VAL LARGE-CONSP DEFCONST-FN CHK-LEGAL-INIT-MSG [GC for 6820 CONS pages..(T=20).GC finished] CHK-LEGAL-INIT CHK-MACRO-ARGLIST-KEYS CHK-MACRO-ARGLIST-AFTER-REST CHK-MACRO-ARGLIST-OPTIONAL CHK-MACRO-ARGLIST1 [GC for 6820 CONS pages..(T=22).GC finished] CHK-MACRO-ARGLIST-MSG [GC for 2049 RELOCATABLE-BLOCKS pages..(T=17).GC finished] CHK-MACRO-ARGLIST DEFMACRO-FN1 CHK-DEFMACRO-WIDTH REDUNDANT-DEFMACROP COLLECT-NON-APPLY$-PRIMPS2 (COLLECT-NON-APPLY$-PRIMPS1 COLLECT-NON-APPLY$-PRIMPS1-LST) [GC for 714 SYMBOL pages..(T=21).GC finished] COLLECT-NON-APPLY$-PRIMPS CHK-DEFMACRO-UNTOUCHABLE DEFMACRO-FN [GC for 6830 CONS pages..(T=24).GC finished] *INITIAL-EVENT-DEFMACROS* BOOT-TRANSLATE PRIMORDIAL-EVENT-MACRO-AND-FN1 PRIMORDIAL-EVENT-MACRO-AND-FN PRIMORDIAL-EVENT-MACROS-AND-FNS *INITIAL-TYPE-PRESCRIPTIONS* COLLECT-WORLD-GLOBALS [GC for 6830 CONS pages..(T=25).GC finished] PRIMORDIAL-WORLD-GLOBALS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] ARGLISTS-TO-NILS *UNATTACHABLE-PRIMITIVES* PUTPROP-RECOGNIZER-ALIST [GC for 112 CFUN pages..(T=21).GC finished] PRIMORDIAL-WORLD SAME-NAME-TWICE CONFLICTING-IMPORTS CHK-NEW-STRINGP-NAME CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS REMOVE-LISP-SUFFIX CONVERT-BOOK-NAME-TO-CERT-NAME UNRELATIVIZE-BOOK-PATH TILDE-@-DEFPKG-ERROR-PHRASE *1*-PKG-PREFIX* [GC for 6840 CONS pages..(T=27).GC finished] CHK-ACCEPTABLE-DEFPKG DEFPKG-FN THEORY-FN-CALLP [GC for 6850 CONS pages..(T=19).GC finished] INTERSECTION-AUGMENTED-THEORIES-FN1 CHECK-THEORY-MSG1 CHECK-THEORY-MSG CHECK-THEORY-ACTION CHECK-THEORY MAYBE-CHECK-THEORY INTERSECTION-THEORIES-FN INTERSECTION-THEORIES UNION-AUGMENTED-THEORIES-FN1 UNION-THEORIES-FN1 UNION-THEORIES-FN UNION-AUGMENTED-THEORIES-FN1+ [GC for 583 SFUN pages..(T=19).GC finished] SET-DIFFERENCE-AUGMENTED-THEORIES-FN1 SET-DIFFERENCE-AUGMENTED-THEORIES-FN1+ SET-DIFFERENCE-THEORIES-FN1 SET-DIFFERENCE-THEORIES-FN NO-AUGMENTED-RUNE-BASED-ON REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS1 REVAPPEND-DELETE-AUGMENTED-RUNES-BASED-ON-SYMBOLS CURRENT-THEORY-FN1 CURRENT-THEORY-FN [GC for 583 SFUN pages..(T=19).GC finished] CURRENT-THEORY1-AUGMENTED UNION-CURRENT-THEORY-FN UNION-THEORIES SET-DIFFERENCE-CURRENT-THEORY-FN SET-DIFFERENCE-THEORIES UNIVERSAL-THEORY-FN1 UNIVERSAL-THEORY-FN UNIVERSAL-THEORY FUNCTION-THEORY-FN1 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] FUNCTION-THEORY-FN FUNCTION-THEORY EXECUTABLE-COUNTERPART-THEORY-FN EXECUTABLE-COUNTERPART-THEORY STANDARD-THEORIES CURRENT-THEORY END-PREHISTORIC-WORLD THEORY-NAMEP THEORY-FN THEORY REDUNDANT-DEFTHEORY-P [GC for 6850 CONS pages..(T=22).GC finished] DEFTHEORY-FN :REDUNDANT SET-IN-THEORY-REDUNDANT-OKP IN-THEORY-FN [GC for 6860 CONS pages..(T=26).GC finished] IN-ARITHMETIC-THEORY-FN DISABLE ENABLE THEORY-INVARIANT-TABLE-GUARD THEORY-INVARIANT-TABLE [GC for 6870 CONS pages..(T=24).GC finished] [GC for 6880 CONS pages..(T=20).GC finished] THEORY-INVARIANT-FN THEORY-INVARIANT INCOMPATIBLE INCOMPATIBLE! *GENERIC-BAD-SIGNATURE-STRING* *SIGNATURE-KEYWORDS* DUPLICATE-KEY-IN-KEYWORD-VALUE-LISTP FORMALS-PRETTY-FLAGS-MISMATCH-MSG [GC for 6890 CONS pages..(T=21).GC finished] CHK-GLOBAL-STOBJS-VALUE [GC for 6890 CONS pages..(T=21).GC finished] CHK-SIGNATURE CHK-SIGNATURES [GC for 6900 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-ENCAPSULATE1 NAME-INTRODUCED CHK-EMBEDDED-EVENT-FORM-ORIG-FORM-MSG *ACL2-DEFAULTS-TABLE-MACROS* [GC for 6900 CONS pages..(T=21).GC finished] CHK-EMBEDDED-EVENT-FORM DESTRUCTURE-EXPANSION REBUILD-EXPANSION SET-RAW-MODE-ON SET-RAW-MODE-OFF SET-RAW-MODE-ON! SET-RAW-MODE ALIST-TO-BINDINGS [GC for 583 SFUN pages..(T=22).GC finished] ACL2-RAW-EVAL GET-AND-CHK-LAST-MAKE-EVENT-EXPANSION *LOCAL-VALUE-TRIPLE-ELIDED* ELIDE-LOCALS (ELIDE-LOCALS-REC ELIDE-LOCALS-LST) MAKE-RECORD-EXPANSION? ACL2-SYSTEM-TABLE MAYBE-ADD-EVENT-LANDMARK [GC for 6910 CONS pages..(T=19).GC finished] [GC for 6920 CONS pages..(T=16).GC finished] EVAL-EVENT-LST EQUAL-INSIG BAD-SIGNATURE-ALIST IF-NS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] TILDE-*-BAD-INSIGS-PHRASE1 TILDE-*-BAD-INSIGS-PHRASE UNION-EQ-CARS CHK-ACCEPTABLE-ENCAPSULATE2 CONJOIN-INTO-ALIST CLASSES-THEOREMS CONSTRAINTS-INTRODUCED1 [GC for 583 SFUN pages..(T=20).GC finished] NEW-TRIPS-REC NEW-TRIPS CONSTRAINTS-INTRODUCED PUTPROP-CONSTRAINTS MAYBE-INSTALL-ACL2-DEFAULTS-TABLE UPDATE-FOR-REDO-FLAT REDO-FLAT CERT-OP [GC for 583 SFUN pages..(T=22).GC finished] EVAL-EVENT-LST-ENVIRONMENT [GC for 2049 RELOCATABLE-BLOCKS pages..(T=22).GC finished] PROCESS-EMBEDDED-EVENTS CONSTRAINED-FUNCTIONS COLLECT-LOGICALS EXPORTED-FUNCTION-NAMES GET-SUBVERSIVES [GC for 583 SFUN pages..(T=24).GC finished] ANCESTRAL-FFN-SYMBS-LST ENCAPSULATE-CONSTRAINT BOGUS-EXPORTED-COMPLIANTS REMOVE-TYPE-PRESCRIPTION-CERT-DATA ENCAPSULATE-RETURN-VALUE-P [GC for 6930 CONS pages..(T=20).GC finished] ENCAPSULATE-PASS-2 TILDE-@-ABBREVIATE-OBJECT-PHRASE ENCAPSULATE-CTX PRINT-ENCAPSULATE-MSG1 [GC for 6940 CONS pages..(T=25).GC finished] PRINT-ENCAPSULATE-MSG2 PRINT-ENCAPSULATE-MSG3/EXPORTED-NAMES [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] PRINT-ENCAPSULATE-MSG3/CONSTRAINTS PRINT-ENCAPSULATE-MSG3 (FIND-FIRST-NON-LOCAL-NAME FIND-FIRST-NON-LOCAL-NAME-LST) [GC for 6950 CONS pages..(T=22).GC finished] EQUAL-MOD-ELIDE-LOCALS1 (EQUAL-MOD-ELIDE-LOCALS EQUAL-MOD-ELIDE-LOCALS-LST) CORRESPONDING-ENCAP-EVENTS CORRESPONDING-ENCAPS [GC for 583 SFUN pages..(T=20).GC finished] REDUNDANT-ENCAPSULATE-TUPLEP REDUNDANT-ENCAPSULATEP MARK-MISSING-AS-HIDDEN-P KNOWN-PACKAGE-ALIST-INCLUDED-P ENCAPSULATE-FIX-KNOWN-PACKAGE-ALIST [GC for 583 SFUN pages..(T=19).GC finished] SUBST-BY-POSITION1 SUBST-BY-POSITION INTRO-UDF-GUARDS INTRO-UDF-GLOBAL-STOBJS INTRO-UDF-NON-CLASSICALP ASSOC-PROOF-SUPPORTERS-ALIST [GC for 583 SFUN pages..(T=22).GC finished] UPDATE-PROOF-SUPPORTERS-ALIST-3 POSN-FIRST-NON-EVENT UPDATE-PROOF-SUPPORTERS-ALIST-2 UPDATE-PROOF-SUPPORTERS-ALIST-1 UPDATE-PROOF-SUPPORTERS-ALIST INSTALL-PROOF-SUPPORTERS-ALIST EMPTY-ENCAPSULATE [GC for 583 SFUN pages..(T=19).GC finished] CERT-DATA-TP-FROM-RUNIC-TYPE-PRESCRIPTION CERT-DATA-TPS-FROM-FNS CERT-DATA-FOR-CERTIFICATE NEWLY-DEFINED-TOP-LEVEL-FNS-REC NEWLY-DEFINED-TOP-LEVEL-FNS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] CERT-DATA-TPS-1 CERT-DATA-TPS CERT-DATA-PASS1-SAVED FUNCTIONAL-SUBSTITUTION-P NEW-PROVED-FUNCTIONAL-INSTANCES-ALIST FAST-ALIST-FREE-CERT-DATA-ON-EXIT [GC for 6950 CONS pages..(T=20).GC finished] [GC for 6960 CONS pages..(T=21).GC finished] ENCAPSULATE-FN [GC for 6970 CONS pages..(T=17).GC finished] PROGN-FN1 PROGN-FN PROGN!-FN [GC for 583 SFUN pages..(T=12).GC finished] CHK-BOOK-NAME INCLUDE-BOOK-ALIST-SUBSETP CBD-FN CBD GET-PORTCULLIS-CMDS OUR-MERGE-PATHNAMES CANONICAL-PATHNAME [GC for 583 SFUN pages..(T=22).GC finished] CANONICAL-DIRNAME! DIRECTORY-OF-ABSOLUTE-PATHNAME EXTEND-PATHNAME MAYBE-ADD-SEPARATOR SET-CBD-FN SET-CBD [GC for 583 SFUN pages..(T=21).GC finished] SET-CBD-STATE PARSE-BOOK-NAME SYSFILE-P SYSFILE-FILENAME FILENAME-TO-SYSFILE [GC for 583 SFUN pages..(T=21).GC finished] SYSFILE-TO-FILENAME (MAKE-INCLUDE-BOOKS-ABSOLUTE-1 MAKE-INCLUDE-BOOKS-ABSOLUTE-LST) MAKE-INCLUDE-BOOKS-ABSOLUTE FIRST-KNOWN-PACKAGE-ALIST [GC for 583 SFUN pages..(T=24).GC finished] DEFPKG-ITEMS-REC NEW-DEFPKG-P [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] DEFPKG-ITEMS NEW-DEFPKG-LIST2 MAKE-HIDDEN-DEFPKG NEW-DEFPKG-LIST1 NEW-DEFPKG-LIST [GC for 583 SFUN pages..(T=20).GC finished] (TERM-IGNORE-OKP TERM-LIST-IGNORE-OKP) HIDDEN-DEFPKG-EVENTS1 HIDDEN-DEFPKG-EVENTS FIX-PORTCULLIS-CMDS1 FIX-PORTCULLIS-CMDS COLLECT-UNCERTIFIED-BOOKS [GC for 6980 CONS pages..(T=21).GC finished] CHK-IN-PACKAGE ILL-FORMED-CERTIFICATE-ER INCLUDE-BOOK-ER-WARNING-SUMMARY INCLUDE-BOOK-ER1 INCLUDE-BOOK-ER POST-ALIST-FROM-CHANNEL CERTIFICATE-FILE-AND-INPUT-CHANNEL1 PCERT-OP-P [GC for 724 SYMBOL pages..(T=19).GC finished] CERTIFICATE-FILE-AND-INPUT-CHANNEL CERT-ANNOTATIONS-AND-CHECKSUM-FROM-CERT-FILE TILDE-@-CERT-POST-ALIST-PHRASE ASSOC-FAMILIAR-NAME TILDE-*-BOOK-HASH-PHRASE1 TILDE-*-BOOK-HASH-PHRASE GET-CMDS-FROM-PORTCULLIS1 HIDDEN-DEFPKG-EVENTS-SIMPLE [GC for 6990 CONS pages..(T=20).GC finished] GET-CMDS-FROM-PORTCULLIS CONVERT-BOOK-NAME-TO-PORT-NAME CHK-RAISE-PORTCULLIS2 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] CHK-RAISE-PORTCULLIS1 MARK-LOCAL-INCLUDED-BOOKS UNMARK-AND-DELETE-LOCAL-INCLUDED-BOOKS EARLIER-ACL2-VERSIONP ACL2-VERSION-R-P SYSFILE-OR-STRING-LISTP TTAG-ALISTP CERT-ANNOTATIONSP [GC for 7000 CONS pages..(T=26).GC finished] WEAK-CERT-OBJ-P *TRIVIAL-BOOK-HASH* CERT-HASH INCLUDE-BOOK-ALIST-ENTRY-P [GC for 2049 RELOCATABLE-BLOCKS pages..(T=27).GC finished] SYSFILE-TO-FILENAME-TTAG-ALIST-VAL SYSFILE-TO-FILENAME-TTAG-ALISTP SYSFILE-TO-FILENAME-CERT-ANNOTATIONS SYSFILE-TO-FILENAME-INCLUDE-BOOK-ENTRY SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST1 SYSFILE-TO-FILENAME-INCLUDE-BOOK-ALIST FILENAME-TO-SYSFILE-TTAG-ALIST-VAL FILENAME-TO-SYSFILE-TTAG-ALISTP [GC for 593 SFUN pages..(T=20).GC finished] FILENAME-TO-SYSFILE-CERT-ANNOTATIONS FILENAME-TO-SYSFILE-INCLUDE-BOOK-ENTRY FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST1 FILENAME-TO-SYSFILE-INCLUDE-BOOK-ALIST KEYWORD-LISTP READ-FILE-INTO-TEMPLATE FAST-CERT-DATA [GC for 7010 CONS pages..(T=21).GC finished] CHK-RAISE-PORTCULLIS CHK-CERTIFICATE-FILE1 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] CERTIFICATE-FILE CHK-CERTIFICATE-FILE EQUAL-MODULO-HIDDEN-DEFPKGS CERT-OBJ-FOR-CONVERT [GC for 7020 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-CERTIFY-BOOK1 TRANSLATE-BOOK-NAMES FIX-TTAGS CHK-WELL-FORMED-TTAGS CHECK-CERTIFICATE-FILE-EXISTS ILLEGAL-TO-CERTIFY-CHECK [GC for 7030 CONS pages..(T=20).GC finished] CHK-ACCEPTABLE-CERTIFY-BOOK PRINT-OBJECTS REPLACE-INITIAL-SUBSTRING REPLACE-STRING-PREFIX-IN-TREE WITH-OUTPUT-OBJECT-CHANNEL-SHARING ELIDE-LOCALS-AND-SPLIT-EXPANSION-ALIST [GC for 7040 CONS pages..(T=23).GC finished] MAKE-CERTIFICATE-FILE1 MAKE-CERTIFICATE-FILE MAKE-CERTIFICATE-FILES OPEN-INPUT-OBJECT-FILE READ-OBJECT-FILE1 [GC for 7050 CONS pages..(T=20).GC finished] READ-OBJECT-FILE CHK-CERT-ANNOTATIONS CHK-CERT-ANNOTATIONS-POST-ALIST CHK-INPUT-OBJECT-FILE [GC for 7050 CONS pages..(T=19).GC finished] INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR-WITH-CHK ACCUMULATE-POST-ALIST SKIPPED-PROOFSP-IN-POST-ALIST [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] BOOK-HASH-ALIST BOOK-HASH WITH-HCOMP-BINDINGS WITH-HCOMP-HT-BINDINGS GET-DECLAIM-LIST TILDE-@-BOOK-STACK-MSG CONVERT-BOOK-NAME-TO-ACL2X-NAME ACL2X-ALISTP READ-ACL2X-FILE [GC for 7060 CONS pages..(T=21).GC finished] EVAL-PORT-FILE GETENV! UPDATE-PCERT-BOOKS CONVERT-NON-NIL-SYMBOLS-TO-KEYWORDS [GC for 7070 CONS pages..(T=21).GC finished] [GC for 7080 CONS pages..(T=20).GC finished] [GC for 7090 CONS pages..(T=18).GC finished] INCLUDE-BOOK-FN1 CHK-INCLUDE-BOOK-INPUTS [GC for 7100 CONS pages..(T=15).GC finished] INCLUDE-BOOK-FN SPONTANEOUS-DECERTIFICATIONP1 SPONTANEOUS-DECERTIFICATIONP REMOVE-DUPLICATES-EQUAL-FROM-END INCLUDE-BOOK-ALIST-SUBSETP-FAILURE-WITNESSES EXPANSION-FILENAME TOP-LEVEL-LOOP$-ALIST-REC TOP-LEVEL-LOOP$-ALIST [GC for 7100 CONS pages..(T=21).GC finished] WRITE-EXPANSION-FILE COLLECT-IDEAL-USER-DEFUNS1 COLLECT-IDEAL-USER-DEFUNS SET-DIFFERENCE-EQ-SORTED PKG-NAMES0 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] HONS-UNION-ORDERED-STRING-LISTS PKG-NAMES DELETE-NAMES-FROM-KPA-REC DELETE-NAMES-FROM-KPA PRINT-CERTIFY-BOOK-STEP-2 PRINT-CERTIFY-BOOK-STEP-3 [GC for 593 SFUN pages..(T=23).GC finished] PRINT-CERTIFY-BOOK-GUARDS-WARNING CHK-CERTIFY-BOOK-STEP-3 PRINT-CERTIFY-BOOK-STEP-4 PRINT-CERTIFY-BOOK-STEP-5 HCOMP-BUILD-FROM-STATE ACL2X-EXPANSION-ALIST [GC for 593 SFUN pages..(T=17).GC finished] HONS-COPY-WITH-STATE IDENTITY-WITH-STATE :ATTACHMENTS-RECORDED WRITE-ACL2X-FILE [GC for 7100 CONS pages..(T=21).GC finished] MERGE-INTO-EXPANSION-ALIST1 ACL2X-ALISTP-DOMAINS-SUBSETP MERGE-INTO-EXPANSION-ALIST RESTRICT-EXPANSION-ALIST ELIDE-LOCALS-FROM-EXPANSION-ALIST [GC for 7100 CONS pages..(T=22).GC finished] WRITE-PORT-FILE SAVE-PARALLELISM-SETTINGS INCLUDE-BOOK-ALIST-EQUAL-MODULO-LOCAL COPY-OBJECT-CHANNEL-UNTIL-MARKER [GC for 7110 CONS pages..(T=19).GC finished] COPY-PCERT0-TO-PCERT1 TOUCH? [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] CONVERT-BOOK-NAME-TO-COMPILED-NAME CERTIFY-BOOK-FINISH-CONVERT INCLUDE-BOOK-ALIST-UNCERTIFIED-BOOKS COUNT-FORMS-IN-CHANNEL SKIP-FORMS-IN-CHANNEL POST-ALIST-FROM-PCERT1-1 [GC for 593 SFUN pages..(T=20).GC finished] POST-ALIST-FROM-PCERT1 CERTIFICATE-POST-ALIST CERTIFY-BOOK-FINISH-COMPLETE EXPANSION-ALIST-CONFLICT SYMBOL-PACKAGE-NAME-SET NAMES-OF-SYMBOLS-IN-PACKAGE [GC for 593 SFUN pages..(T=22).GC finished] SYMBOL-LIST-TO-PACKAGE-ALIST1 SYMBOL-LIST-TO-PACKAGE-ALIST BOOKDATA-ALIST1 BOOKDATA-ALIST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=23).GC finished] MAYBE-WRITE-BOOKDATA FROMTO REMOVE-SMALLER-KEYS-FROM-SORTED-ALIST CERT-INCLUDE-EXPANSION-ALIST EVAL-HIDDEN-PACKAGES WITH-PACKAGES-UNHIDDEN READ-USELESS-RUNES2 [GC for 593 SFUN pages..(T=19).GC finished] READ-USELESS-RUNES1 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] READ-FILE-ITERATE-SAFE USELESS-RUNES-ENV-INFO USELESS-RUNES-SOURCE-MSG READ-USELESS-RUNES FREE-USELESS-RUNES [GC for 7120 CONS pages..(T=20).GC finished] USELESS-RUNES-VALUE INITIAL-USELESS-RUNES MAYBE-REFRESH-USELESS-RUNES UPDATE-USELESS-RUNES [GC for 593 SFUN pages..(T=20).GC finished] EVAL-SOME-PORTCULLIS-CMDS [GC for 7130 CONS pages..(T=22).GC finished] [GC for 7140 CONS pages..(T=20).GC finished] [GC for 7150 CONS pages..(T=20).GC finished] [GC for 7160 CONS pages..(T=20).GC finished] [GC for 7170 CONS pages..(T=19).GC finished] [GC for 7180 CONS pages..(T=19).GC finished] [GC for 7190 CONS pages..(T=20).GC finished] [GC for 7200 CONS pages..(T=19).GC finished] [GC for 7200 CONS pages..(T=22).GC finished] CERTIFY-BOOK-FN CERTIFY-BOOK CERTIFY-BOOK! REDUNDANT-DEFCHOOSEP CHK-ARGLIST-FOR-DEFCHOOSE WITHOUT-WARNINGS-FN WITHOUT-WARNINGS TRANSLATE-IGNORE-OK TRANSLATE-WITHOUT-WARNINGS-IGNORE-OK [GC for 593 SFUN pages..(T=21).GC finished] DEFCHOOSE-CONSTRAINT-BASIC GENERATE-VARIABLE-LST-SIMPLE DEFCHOOSE-CONSTRAINT-EXTRA DEFCHOOSE-CONSTRAINT [GC for 7200 CONS pages..(T=21).GC finished] DEFCHOOSE-FN *DEFUN-SK-KEYWORDS* NON-ACCEPTABLE-DEFUN-SK-P DEFINITION-RULE-NAME VERIFY-GUARDS? [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] PARSE-DEFUN-SK-DCLS MAP-WITH-OUTPUT DEFUN-SK-FN [GC for 593 SFUN pages..(T=21).GC finished] TAMENESS-CONDITIONS SUCCESSIVE-CADRS MAKE-APPLY$-WARRANT-DEFUN-SK DEFUN-SK DOUBLET-STYLE-SYMBOL-TO-SYMBOL-ALISTP CHK-LEGAL-DEFSTOBJ-NAME CHK-UNRESTRICTED-GUARDS-FOR-TYPE-SPEC-TERM CHK-STOBJ-FIELD-TYPE-TERM [GC for 734 SYMBOL pages..(T=24).GC finished] CHK-STOBJ-FIELD-ETYPE CHK-STOBJ-FIELD-DESCRIPTOR CHK-ACCEPTABLE-DEFSTOBJ-RENAMING [GC for 7200 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-DEFSTOBJ1 OLD-FIELD-DESCRIPTORS REDUNDANT-DEFSTOBJP CONGRUENT-STOBJ-FIELDS [GC for 7200 CONS pages..(T=19).GC finished] CHK-ACCEPTABLE-DEFSTOBJ [GC for 7200 CONS pages..(T=23).GC finished] DEFSTOBJ-FIELD-FNS-AXIOMATIC-DEFS DEFSTOBJ-AXIOMATIC-INIT-FIELDS DEFSTOBJ-CREATOR-DEF [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] DEFSTOBJ-AXIOMATIC-DEFS PUT-STOBJS-IN-AND-OUTS1 PUT-STOBJS-IN-AND-OUTS DEFCONST-NAME-ALIST ACCESSOR-ARRAY PUT-DEFSTOBJ-INVARIANT-RISK [GC for 7210 CONS pages..(T=22).GC finished] DEFSTOBJ-FN DEFABSSTOBJ CONCRETE-STOBJ DEFABSSTOBJ-MISSING-EVENTS REDUNDANT-DEFABSSTOBJP ABSSTOBJ-CORRESPONDENCE-CONCL-LST FLATTEN-ANDS-IN-LIT! ABSSTOBJ-CORRESPONDENCE-FORMULA [GC for 7210 CONS pages..(T=22).GC finished] ABSSTOBJ-PRESERVED-FORMULA WEAK-ABSSTOBJ-METHOD-P (FN-STOBJ-UPDATES-P STOBJ-UPDATES-P STOBJ-UPDATES-LISTP) UNPROTECTED-EXPORT-P [GC for 7210 CONS pages..(T=19).GC finished] TRANSLATE-ABSSTOBJ-FIELD [GC for 7220 CONS pages..(T=20).GC finished] SIMPLE-TRANSLATE-ABSSTOBJ-FIELDS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] ONE-WAY-UNIFY-P OBVIOUSLY-EQUAL-LAMBDA-ARGS (OBVIOUSLY-EQUIV-TERMS OBVIOUSLY-EQUIV-TERMS-LST) OBVIOUSLY-IFF-EQUIV-TERMS CHK-DEFABSSTOBJ-METHOD-LEMMAS [GC for 7220 CONS pages..(T=24).GC finished] CHK-DEFABSSTOBJ-METHOD INTERSPERSE SORT-ABSSTOBJ-NAMES CHK-ACCEPTABLE-DEFABSSTOBJ1 FIRST-KEYWORD COLLECT-DEFABSSTOBJ-UPDATERS CHK-DEFABSSTOBJ-UPDATERS-1 [GC for 7230 CONS pages..(T=24).GC finished] CHK-DEFABSSTOBJ-UPDATERS CHK-ACCEPTABLE-DEFABSSTOBJ DEFABSSTOBJ-AXIOMATIC-DEFS WITH-INSIDE-ABSSTOBJ-UPDATE DEFABSSTOBJ-RAW-DEF DEFABSSTOBJ-RAW-DEFS-REC [GC for 7230 CONS pages..(T=19).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] DEFABSSTOBJ-RAW-DEFS EXPAND-RECOGNIZER PUT-ABSSTOBJS-IN-AND-OUTS METHOD-EXEC DEFABSSTOBJ-RAW-INIT DEFABSSTOBJ-MISSING-MSG UPDATE-GUARD-POST DEFABSSTOBJ-LOGIC-SUBST [GC for 603 SFUN pages..(T=21).GC finished] CHK-DEFABSSTOBJ-GUARD CHK-DEFABSSTOBJ-GUARDS1 CHK-DEFABSSTOBJ-GUARDS MAKE-ABSSTOBJ-TUPLES PUT-DEFABSSTOBJ-INVARIANT-RISK KEY-POSITION-FROM-END-EQ CONGRUENT-ABSSTOBJ-TUPLES-REC [GC for 2049 RELOCATABLE-BLOCKS pages..(T=21).GC finished] CONGRUENT-ABSSTOBJ-TUPLES [GC for 7240 CONS pages..(T=20).GC finished] DEFABSSTOBJ-FN1 DEFABSSTOBJ-FN [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=23).GC finished] CREATE-STATE WITH-LOCAL-STATE STOBJ-LET COLLECT-BADGED-FNS COLLECT-MACROS PUSH-UNTOUCHABLE-FN REMOVE-UNTOUCHABLE-FN DEF-BODY-LEMMAS [GC for 7250 CONS pages..(T=20).GC finished] SHOW-BODIES SET-BODY-FN1 SET-BODY-FN TRACE-MULTIPLICITY *1*DEFP TRACE$-ER-MSG DECLS-AND-DOC TRACE$-WHEN-GCOND STOBJ-EVISCERATION-ALIST [GC for 603 SFUN pages..(T=19).GC finished] TRACE-EVISCERATION-ALIST SET-TRACE-EVISC-TUPLE CHK-TRACE-OPTIONS-AUX [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] TRACE$-VALUE-MSGP CHK-TRACE-OPTIONS MEMOIZE-OFF-TRACE-ERROR UNTRACE$-FN1 UNTRACE$-REC UNTRACE$-FN [GC for 603 SFUN pages..(T=19).GC finished] MAYBE-UNTRACE$-FN MAYBE-UNTRACE$ TRACE$-FN-GENERAL TRACE$-FN-SIMPLE *TRACE-KEYWORDS* *TRACE-KEYWORDS-NEEDING-TTAG* FIRST-ASSOC-KEYWORD *ILLEGAL-TRACE-SPEC-FMT-STRING* TRACE$-FN TRACE$-LST TRACE$ WITH-UBT! TRACE! UNTRACE$ [GC for 7260 CONS pages..(T=20).GC finished] OPEN-TRACE-FILE-FN OPEN-TRACE-FILE CLOSE-TRACE-FILE-FN CLOSE-TRACE-FILE BREAK-ON-ERROR DEFEXEC-EXTRACT-KEY PARSE-DEFEXEC-DCLS-1 FIX-EXEC-XARGS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] PARSE-DEFEXEC-DCLS DEFEXEC WEAK-SAR-P APPLICABLE-REWRITE-RULES1 [GC for 7270 CONS pages..(T=20).GC finished] APPLICABLE-LINEAR-RULES1 PC-RELIEVE-HYP (PC-RELIEVE-HYPS1-ITER PC-RELIEVE-HYPS1) PC-RELIEVE-HYPS REMOVE-TRIVIAL-LITS [GC for 603 SFUN pages..(T=20).GC finished] UNRELIEVED-HYPS UNTRANSLATE-SUBST-ABB SHOW-REWRITE-LINEAR [GC for 7280 CONS pages..(T=21).GC finished] SHOW-REWRITES-LINEARS EXPAND-ASSUMPTIONS-1 EXPAND-ASSUMPTIONS HYPS-TYPE-ALIST [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] SHOW-REWRITES-LINEARS-FN SHOW-META-LEMMAS1 SHOW-META-LEMMAS DECODED-TYPE-SET-FROM-TP-RULE [GC for 7290 CONS pages..(T=20).GC finished] SHOW-TYPE-PRESCRIPTION-RULE SHOW-TYPE-PRESCRIPTION-RULES1 SHOW-TYPE-PRESCRIPTION-RULES PL2-FN PL-FN PL PL2 [GC for 603 SFUN pages..(T=20).GC finished] ACL2-DEFAULTS-TABLE-LOCAL-CTX-P CHANGE-INCLUDE-BOOK-DIR ADD-CUSTOM-KEYWORD-HINT-FN RESET-PREHISTORY DISABLE-UBT [GC for 7300 CONS pages..(T=20).GC finished] RESET-KILL-RING RESET-PREHISTORY-FN [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=24).GC finished] MEMOIZE-TABLE-CHK-COMMUTATIVE-MSG NON-MEMOIZABLE-STOBJS FILTER-ABSSTOBJS REMOVE-STOBJS-IN-BY-POSITION ADD-SUFFIX-TO-FN [GC for 603 SFUN pages..(T=19).GC finished] (FSUBCOR-VAR FSUBCOR-VAR-LST) (PRINT-GV-SUBSTITUTE-P1 PRINT-GV-SUBSTITUTE-P1-LST) PRINT-GV-SUBSTITUTE-P PRINT-GV-FORM PRINT-GV-CONJUNCT [GC for 603 SFUN pages..(T=20).GC finished] PRINT-GV1 PRINT-GV-FN SET-PRINT-GV-DEFAULTS-FN SET-PRINT-GV-DEFAULTS PRINT-GV-EVISC-TUPLE PRINT-GV-DEFAULT PRINT-GV [GC for 7310 CONS pages..(T=19).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] DISABLE-IPRINT-AR ENABLE-IPRINT-AR *IPRINT-ACTIONS* SET-IPRINT-FN1 INIT-IPRINT-FAL+ [GC for 603 SFUN pages..(T=22).GC finished] SET-IPRINT-FN SET-IPRINT *EVISC-TUPLE-SITES* SET-SITE-EVISC-TUPLE CHK-EVISC-TUPLE SET-EVISC-TUPLE-LST SET-EVISC-TUPLE-FN1 IPRINT-VIRGINP [GC for 7320 CONS pages..(T=20).GC finished] SET-EVISC-TUPLE-FN SET-EVISC-TUPLE TOP-LEVEL NECC-NAME-ARGS-INSTANCE [GC for 7330 CONS pages..(T=20).GC finished] DEFWARRANT-EVENTS [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] TRANSLATE-DEFATTACH-HELPERS *DEFATTACH-KEYS* DEFATTACH-UNKNOWN-CONSTRAINTS-ERROR INTERSECTION-DOMAINS [GC for 7340 CONS pages..(T=22).GC finished] PROCESS-DEFATTACH-ARGS1 DUPLICATE-KEYSP-EQ SPLIT-AT-FIRST-KEYWORD [GC for 7350 CONS pages..(T=21).GC finished] MAYBE-REMOVE1-EQ FILTER-FOR-ATTACHMENT *DEFATTACH-KEYS-EXTENDED* PROCESS-DEFATTACH-ARGS [GC for 7360 CONS pages..(T=20).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=19).GC finished] PROVE-DEFATTACH-GUARDS1 PROVE-DEFATTACH-GUARDS TRUE-APPLY$-WARRANT [GC for 7370 CONS pages..(T=22).GC finished] DEFATTACH-CONSTRAINT-REC DEFATTACH-CONSTRAINT [GC for 7380 CONS pages..(T=22).GC finished] PROVE-DEFATTACH-CONSTRAINT ATTACHMENT-COMPONENT-OWNER DEFATTACH-COMPONENT-HAS-OWNER [GC for 744 SYMBOL pages..(T=22).GC finished] DEFATTACH-MERGE-INTO-COMPONENT DEFATTACH-MERGE-COMPONENTS DEFATTACH-MERGE DEFATTACH-MERGE-LST DEFATTACH-MERGE-LST-LST DEFATTACH-LOOP-ERROR-MSG DEFATTACH-LOOP-ERROR [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] DEFATTACH-CLOSE DEFATTACH-ERASE-COMPONENTS DEFATTACH-ERASE-P DEFATTACH-ERASE1 DEFATTACH-ERASE COLLECT-EXT-ANC EXTEND-ATTACHMENT-COMPONENTS [GC for 7390 CONS pages..(T=22).GC finished] COMPONENT-PATH-EXTENSION EXTEND-ATTACHMENT-RECORD UPDATE-ATTACHMENT-RECORDS1 UPDATE-ATTACHMENT-RECORDS ATTACHMENT-RECORDS CHK-DEFATTACH-LOOP DEFAXIOM-SUPPORTER-MSG-LIST [GC for 7400 CONS pages..(T=21).GC finished] DEFATTACH-GLOBAL-STOBJS-MSG CHK-ACCEPTABLE-DEFATTACH ATTACHMENT-CLTL-CMD [GC for 7410 CONS pages..(T=20).GC finished] DEFATTACH-FN DEFATTACH-SYSTEM [GC for 7420 CONS pages..(T=20).GC finished] CHK-RETURN-LAST-ENTRY RETURN-LAST-TABLE DEFMACRO-LAST *FMT-CONTROL-DEFAULTS* *FIXED-FMT-CONTROLS* FMT-CONTROL-BINDINGS1 FMT-CONTROL-BINDINGS SET-IPRINT-AR OVERRIDE-GLOBAL-EVISC-TABLE CHANNEL-TO-STRING *FMT-CONTROL-DEFAULTS-KEYS* [GC for 7420 CONS pages..(T=16).GC finished] [GC for 7430 CONS pages..(T=15).GC finished] [GC for 7440 CONS pages..(T=15).GC finished] FMS-TO-STRING-FN FMS-TO-STRING [GC for 7450 CONS pages..(T=13).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] [GC for 7450 CONS pages..(T=14).GC finished] FMS!-TO-STRING-FN FMS!-TO-STRING [GC for 7460 CONS pages..(T=17).GC finished] [GC for 7460 CONS pages..(T=18).GC finished] [GC for 7470 CONS pages..(T=16).GC finished] FMT-TO-STRING-FN FMT-TO-STRING [GC for 7480 CONS pages..(T=24).GC finished] [GC for 7480 CONS pages..(T=23).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=20).GC finished] [GC for 613 SFUN pages..(T=17).GC finished] FMT!-TO-STRING-FN FMT!-TO-STRING [GC for 7490 CONS pages..(T=21).GC finished] [GC for 7490 CONS pages..(T=22).GC finished] [GC for 613 SFUN pages..(T=20).GC finished] FMT1-TO-STRING-FN FMT1-TO-STRING [GC for 7500 CONS pages..(T=23).GC finished] [GC for 7500 CONS pages..(T=23).GC finished] [GC for 613 SFUN pages..(T=18).GC finished] FMT1!-TO-STRING-FN FMT1!-TO-STRING ATTACHMENT-PAIRS SIBLING-ATTACHMENTS EXT-ANCESTORS-ATTACHMENTS4 [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] EXT-ANCESTORS-ATTACHMENTS3 EXT-ANCESTORS-ATTACHMENTS2 CANONICAL-CDRS EXT-ANCESTORS-ATTACHMENTS1 ATTACHMENT-RECORDS-FAL EXT-ANCESTORS-ATTACHMENTS EXT-ANC-ATTACHMENT-MISSING EXT-ANC-ATTACHMENTS-VALID-P-1 [GC for 613 SFUN pages..(T=17).GC finished] EXT-ANC-ATTACHMENTS-VALID-P *INLINE-SUFFIX-LEN-MINUS-1* *NOTINLINE-SUFFIX* *NOTINLINE-SUFFIX-LEN-MINUS-1* *NON-STOBJ-VAR-ROOT* DEFUN-INLINE-FORM DEFUN-INLINE DEFUND-INLINE DEFUN-NOTINLINE DEFUND-NOTINLINE REGENERATE-TAU-DATABASE-FN0 REGENERATE-TAU-DATABASE-FN1 REGENERATE-TAU-DATABASE-FN RATIONAL-TO-DECIMAL-STRING DEFUND MAGIC-EV-FNCALL MAKE-EVENT-CTX [GC for 7510 CONS pages..(T=22).GC finished] [GC for 7510 CONS pages..(T=15).GC finished] [GC for 7510 CONS pages..(T=13).GC finished] [GC for 7510 CONS pages..(T=13).GC finished] [GC for 7510 CONS pages..(T=13).GC finished] [GC for 7520 CONS pages..(T=13).GC finished] [GC for 7530 CONS pages..(T=13).GC finished] [GC for 7540 CONS pages..(T=13).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] PROTECTED-EVAL MAKE-EVENT-DEBUG-PRE MAKE-EVENT-DEBUG-POST DO-PROOFS? MAKE-EVENT-FN2 MAKE-EVENT-FN2-LST MAKE-EVENT-FN1 [GC for 613 SFUN pages..(T=25).GC finished] ULTIMATE-EXPANSION MAKE-EVENT-FN GET-CHECK-INVARIANT-RISK SET-CHECK-INVARIANT-RISK SET-CHECK-INVARIANT-RISK-FN GET-REGISTER-INVARIANT-RISK SET-REGISTER-INVARIANT-RISK SORT-FBOUNDPS DOPPELGANGER-BADGE-USERFN [GC for 7550 CONS pages..(T=22).GC finished] DOPPELGANGER-APPLY$-USERFN APPLY$-LAMBDA-LOGICAL OUR-QUOTE-MACRO [GC for 7550 CONS pages..(T=19).GC finished] [GC for 7550 CONS pages..(T=22).GC finished] [GC for 7550 CONS pages..(T=21).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=21).GC finished] [GC for 7550 CONS pages..(T=24).GC finished] [GC for 7560 CONS pages..(T=22).GC finished] [GC for 7570 CONS pages..(T=22).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] VALUE-TRIPLE-FN1 CHK-VALUE-TRIPLE VALUE-TRIPLE-FN COLLECT-NON-REDUNDANT REMOVE-VAR-FROM-TYPE-DCLS MEMOIZE-PARTIAL-DEF [GC for 7580 CONS pages..(T=22).GC finished] MEMOIZE-PARTIAL-DECLARE MEMOIZE-PARTIAL-SUPPORTING-EVENTS-1 MEMOIZE-PARTIAL-SUPPORTING-EVENTS-REC FLET-BINDINGS MEMOIZE-PARTIAL-SUPPORTING-EVENTS MEMOIZE-PARTIAL-TUPLE-SHAPE-P [GC for 613 SFUN pages..(T=22).GC finished] MEMOIZE-PARTIAL-TRANSLATIONS-MSG-FORMALS (FREE-EXACTLY-IN-LAST-ARG-OF-CALLS FREE-EXACTLY-IN-LAST-ARG-OF-CALLS-LST) MEMOIZE-PARTIAL-TRANSLATIONS-MSG-BODIES MEMOIZE-PARTIAL-TRANSLATIONS-MSG PARTIAL-FUNCTIONS-TABLE-GUARD-MSG PARTIAL-FUNCTIONS-TABLE-GUARD PARTIAL-FUNCTIONS-TABLE [GC for 613 SFUN pages..(T=23).GC finished] MEMOIZE-INVOKE-EQUALITY-P MEMOIZE-INVOKE-EQUALITY-EXISTS MEMOIZE-INVOKE-GUARD-IMPLICATION-DEFAULT-NAME MEMOIZE-INVOKE-GUARD-IMPLICATION-TERM VERIFY-GUARD-IMPLICATION MEMOIZE-INVOKE-GUARD-THM-EXISTS-1 MEMOIZE-INVOKE-GUARD-THM-EXISTS [GC for 613 SFUN pages..(T=20).GC finished] MEMOIZE-TABLE-CHK-INVOKE-MSG [GC for 613 SFUN pages..(T=22).GC finished] MEMOIZE-TABLE-CHK MEMOIZE-TABLE MEMOIZE-PARTIAL-CALLS MEMOIZE-PARTIAL-TUPLE-1 MEMOIZE-PARTIAL-TUPLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] MEMOIZE-PARTIAL-TUPLES MEMOIZE-PARTIAL-BASIC-CHECKS MEMOIZE-PARTIAL Finished loading "other-events.lisp". ACL2 loading "ld.lisp". "ACL2" WEAK-LD-PROMPT-MEMO-P DEFAULT-PRINT-PROMPT [GC for 613 SFUN pages..(T=20).GC finished] PRINT-PROMPT INITIALIZE-TIMERS MAYBE-ADD-COMMAND-LANDMARK [GC for 122 CFUN pages..(T=21).GC finished] REPLACE-LAST-CDR LD-STANDARD-OI-MISSING CHK-ACCEPTABLE-LD-FN1-PAIR CLOSE-CHANNELS [GC for 613 SFUN pages..(T=21).GC finished] CHK-ACCEPTABLE-LD-FN1 CHK-ACCEPTABLE-LD-FN F-PUT-LD-SPECIALS F-GET-LD-SPECIALS LD-READ-KEYWORD-COMMAND1 [GC for 754 SYMBOL pages..(T=22).GC finished] EXIT-LD LD-READ-KEYWORD-COMMAND LD-FIX-COMMAND LD-READ-COMMAND LD-PRINT-COMMAND CONTINUE-FROM-ILLEGAL-STATE LD-FILTER-COMMAND LD-PRINT-RESULTS LD-PRINT-PROMPT [GC for 623 SFUN pages..(T=24).GC finished] LD-RETURN-ERROR INITIALIZE-ACCUMULATED-WARNINGS *EMPTY-LD-HISTORY-ENTRY* LD-HISTORY [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] LD-HISTORY-ENTRY-INPUT LD-HISTORY-ENTRY-ERROR-FLG LD-HISTORY-ENTRY-STOBJS-OUT/VALUE LD-HISTORY-ENTRY-STOBJS-OUT LD-HISTORY-ENTRY-VALUE LD-HISTORY-ENTRY-USER-DATA SET-LD-HISTORY-ENTRY-USER-DATA SET-LD-HISTORY-ENTRY-USER-DATA-DEFAULT ADJUST-LD-HISTORY [GC for 623 SFUN pages..(T=25).GC finished] EXTEND-LD-HISTORY LD-READ-EVAL-PRINT LD-LOOP GET-DIRECTORY-OF-FILE UPDATE-CBD LD-FN-BODY [GC for 7580 CONS pages..(T=23).GC finished] LD-FN1 LD-FN-ALIST LD-FN0 LD-FN LD QUICK-TEST WORMHOLE-PROMPT RESET-LD-SPECIALS-FN RESET-LD-SPECIALS MAYBE-RESET-DEFAULTS-TABLE1 [GC for 623 SFUN pages..(T=21).GC finished] MAYBE-RESET-DEFAULTS-TABLE2 MAYBE-RESET-DEFAULTS-TABLE DELETE-SOMETHING STORE-IN-KILL-RING ROTATE-KILL-RING1 [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] ROTATE-KILL-RING UBT-UBU-FN1 UBT?-UBU?-FN UBT-UBU-FN UBT!-UBU!-FN UBT-PREHISTORY UBT-PREHISTORY-FN OOPS-WARNING [GC for 7580 CONS pages..(T=22).GC finished] OOPS-FN OOPS I-AM-HERE REBUILD-FN-READ-FILTER REBUILD-FN REBUILD *BASIC-SWEEP-ERROR-STR* SWEEP-SYMBOL-BINDING-FOR-BAD-SYMBOL SWEEP-GLOBAL-LST SWEEP-STACK-ENTRY-FOR-BAD-SYMBOL SWEEP-T-STACK [GC for 2049 RELOCATABLE-BLOCKS pages..(T=23).GC finished] SWEEP-ACL2-ORACLE SWEEP-GLOBAL-STATE-FOR-LISP-OBJECTS WET DISASSEMBLE$ NEAR-MISSES COMPILE-FUNCTION KEEP-TMP-FILES COMP-FN COMP COMP-GCL SCAN-PAST-DEEPER-EVENT-LANDMARKS PUFFABLE-ENCAPSULATE-P PUFFABLE-COMMAND-BLOCKP [GC for 623 SFUN pages..(T=21).GC finished] PUFFABLE-COMMAND-NUMBERP PUFF-INCLUDE-BOOK [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] PUFF-COMMAND-BLOCK1 PUFF-COMMAND-BLOCK COMMANDS-BACK-TO-1 COMMANDS-BACK-TO PUFFED-COMMAND-SEQUENCE LD-READ-EVAL-PRINT-SIMPLE LD-LOOP-SIMPLE [GC for 7580 CONS pages..(T=21).GC finished] LD-SIMPLE PUFF-FN1 [GC for 7590 CONS pages..(T=24).GC finished] PUFF-REPORT PUFF-FN PUFF*-FN11 PUFF*-FN1 PUFF*-FN PUFF PUFF* MINI-PROVEALL SET-GUARD-CHECKING GET-GUARD-CHECKING DMR-STOP-FN DMR-STOP DMR-START-FN DMR-START *META-LEVEL-FUNCTION-PROBLEM-1* *META-LEVEL-FUNCTION-PROBLEM-1A* [GC for 623 SFUN pages..(T=22).GC finished] *META-LEVEL-FUNCTION-PROBLEM-1B* *META-LEVEL-FUNCTION-PROBLEM-1C* *META-LEVEL-FUNCTION-PROBLEM-1D* *META-LEVEL-FUNCTION-PROBLEM-1E* *META-LEVEL-FUNCTION-PROBLEM-2* *META-LEVEL-FUNCTION-PROBLEM-3* MFC-AP-FN MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN MFC-RW-TTREE MFC-TS-FN MFC-TS-TTREE TRUST-MFC MFC-TS MFC-RW MFC-RW+ MFC-RELIEVE-HYP MFC-AP CONGRUENCE-RULE-LISTP TERM-ALISTP-FAILURE-MSG FIND-RUNED-LINEAR-LEMMA MFC-FORCE-FLG UPDATE-RNCST-FOR-FORCEP PRINT-SAVED-OUTPUT-LST [GC for 7590 CONS pages..(T=23).GC finished] [GC for 7600 CONS pages..(T=18).GC finished] PRINT-SAVED-OUTPUT CONVERT-IO-MARKERS-LST [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] CONVERT-IO-MARKERS PSO PSOG PSO! SET-RAW-PROOF-FORMAT SET-RAW-WARNING-FORMAT SET-STANDARD-CO-STATE SET-PROOFS-CO-STATE WITH-STANDARD-CO-AND-PROOFS-CO-TO-FILE WOF PSOF SET-LD-EVISC-TUPLE SET-LD-EVISC-TUPLE-STATE SET-ABBREV-EVISC-TUPLE SET-ABBREV-EVISC-TUPLE-STATE [GC for 623 SFUN pages..(T=22).GC finished] SET-GAG-MODE-EVISC-TUPLE SET-GAG-MODE-EVISC-TUPLE-STATE SET-TERM-EVISC-TUPLE SET-TERM-EVISC-TUPLE-STATE WITHOUT-EVISC-FN WITHOUT-EVISC Finished loading "ld.lisp". ACL2 loading "proof-builder-b.lisp". "ACL2" INSTALL-NEW-PC-META-OR-MACRO DEFINE-PC-META-OR-MACRO-FN DEFINE-PC-META DEFINE-PC-MACRO DEFINE-PC-ATOMIC-MACRO TOGGLE-PC-MACRO DEFINE-PC-PRIMITIVE PC-COMMAND-TABLE [GC for 623 SFUN pages..(T=24).GC finished] NON-BOUNDED-NUMS DELETE-BY-POSITION PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7610 CONS pages..(T=27).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHK-ASSUMPTION-FREE-TTREE-1 PUT-CDR-ASSOC-QUERY-ID [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] SET-QUERY-VAL QUERY-ON-EXIT REPLAY-QUERY [GC for 7620 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 7630 CONS pages..(T=21).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7640 CONS pages..(T=24).GC finished] PRINT-COMMANDS MAKE-PRETTY-START-INSTR RAW-INDEXED-INSTRS PC-COMMAND-TABLE PC-COMMAND-TABLE DEFINE-PC-HELP EVISC-INDEXED-INSTRS-1 [GC for 623 SFUN pages..(T=22).GC finished] EVISC-INDEXED-INSTRS-REC MARK-UNFINISHED-INSTRS EVISC-INDEXED-INSTRS PC-COMMAND-TABLE PC-COMMAND-TABLE PROMOTE-GUTS [GC for 7650 CONS pages..(T=22).GC finished] PC-COMMAND-TABLE REMOVE-BY-INDICES PC-COMMAND-TABLE BOUNDED-INTEGER-LISTP [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] FETCH-TERM-AND-CL FETCH-TERM GOVERNORS TERM-ID-IFF ? ?-FN ABBREVIATIONS-ALIST [GC for 623 SFUN pages..(T=24).GC finished] (CHK-?S CHK-?S-LST) REMOVE-?S TRANSLATE-ABB TRANS0 P-BODY PC-COMMAND-TABLE [GC for 7660 CONS pages..(T=19).GC finished] PC-COMMAND-TABLE TAKE-BY-INDICES PRINT-HYPS SOME-> PRINT-HYPS-TOP [GC for 7670 CONS pages..(T=15).GC finished] PRINT-GOVERNORS-TOP PAIR-INDICES [GC for 7680 CONS pages..(T=16).GC finished] PC-COMMAND-TABLE [GC for 7690 CONS pages..(T=16).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=18).GC finished] PC-COMMAND-TABLE PAIR-KEYWORDS NULL-POOL INITIAL-PSPV PC-PROVE ABBREVIATIONS-ALIST-? FIND-?-FN [GC for 2049 RELOCATABLE-BLOCKS pages..(T=16).GC finished] UNPROVED-PC-PROVE-CLAUSES PROVER-CALL MAKE-NEW-GOALS SAME-GOAL REMOVE-BYES-FROM-TAG-TREE [GC for 7690 CONS pages..(T=16).GC finished] PC-COMMAND-TABLE ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST-1 ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST ADD-STRING-VAL-PAIR-TO-STRING-VAL-ALIST! *BASH-SKIP-FORCING-ROUND-HINTS* PC-COMMAND-TABLE [GC for 623 SFUN pages..(T=18).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=18).GC finished] PC-COMMAND-TABLE NOT-IN-DOMAIN-EQ PC-COMMAND-TABLE [GC for 7690 CONS pages..(T=15).GC finished] PRINT-ABBREVIATIONS [GC for 7700 CONS pages..(T=17).GC finished] PC-COMMAND-TABLE DROP-FROM-END PC-COMMAND-TABLE PC-COMMAND-TABLE EXPAND-ADDRESS-RECURSE DIVE-ONCE-MORE-ERROR [GC for 764 SYMBOL pages..(T=17).GC finished] ABBREVIATION-RAW-TERM-P ADDR-RECUR OR-ADDR AND-ADDR DIVE-INTO-MACROS-TABLE ADD-DIVE-INTO-MACRO REMOVE-DIVE-INTO-MACRO DIVE-INTO-MACROS-TABLE RASSOC-EQ-AS-CAR *CAR-ALIST* CAR/CDR^N EXPAND-ADDRESS-MSG [GC for 7700 CONS pages..(T=16).GC finished] [GC for 7710 CONS pages..(T=16).GC finished] EXPAND-ADDRESS DV-ERROR PC-COMMAND-TABLE (DEPOSIT-TERM DEPOSIT-TERM-LST) [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] GENEQV-AT-SUBTERM GENEQV-AT-SUBTERM-TOP MAYBE-TRUNCATE-CURRENT-ADDRESS DEPOSIT-TERM-IN-GOAL SPLIT-IMPLIES FIND-EQUIVALENCE-HYP-TERM [GC for 623 SFUN pages..(T=17).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7720 CONS pages..(T=17).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 623 SFUN pages..(T=16).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PRINT-ON-SEPARATE-LINES PC-COMMAND-TABLE [GC for 7720 CONS pages..(T=17).GC finished] MODIFIED-ERROR-TRIPLE-FOR-SEQUENCE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 623 SFUN pages..(T=21).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE EXTRACT-GOAL [GC for 7730 CONS pages..(T=21).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-BY-POSITION PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7740 CONS pages..(T=21).GC finished] PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7740 CONS pages..(T=22).GC finished] PC-COMMAND-TABLE DEFINE-PC-BIND* PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7750 CONS pages..(T=20).GC finished] PC-COMMAND-TABLE FIND-EQUIVALENCE-HYP-TERM-NO-TARGET PC-COMMAND-TABLE [GC for 7750 CONS pages..(T=22).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] APPLICABLE-REWRITE-RULES PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7760 CONS pages..(T=22).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7760 CONS pages..(T=20).GC finished] TRANSLATE-SUBST-ABB1 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=20).GC finished] SINGLE-VALUED-SYMBOLP-ALISTP CHECK-CARS-ARE-VARIABLES TRANSLATE-SUBST-ABB [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=22).GC finished] MAKE-REWRITE-INSTR [GC for 7770 CONS pages..(T=18).GC finished] PC-COMMAND-TABLE APPLICABLE-LINEAR-RULES MAKE-LINEAR-INSTR [GC for 7780 CONS pages..(T=21).GC finished] [GC for 7780 CONS pages..(T=20).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7790 CONS pages..(T=16).GC finished] PC-COMMAND-TABLE PC-REWRITE*-1 PC-REWRITE* MAKE-GOALS-FROM-ASSUMPTIONS MAKE-NEW-GOALS-FROM-ASSUMPTIONS *DEFAULT-S-REPEAT-LIMIT* [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] HYPS-TYPE-ALIST-AND-POT-LST [GC for 7790 CONS pages..(T=15).GC finished] PC-COMMAND-TABLE BUILD-PC-ENABLED-STRUCTURE-FROM-ENS [GC for 7800 CONS pages..(T=15).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7810 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-LAST ASSIGN-EVENT-NAME-AND-RULE-CLASSES [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] SAVE-FN PC-COMMAND-TABLE RETRIEVE PC-COMMAND-TABLE UNSAVE-FN UNSAVE PC-COMMAND-TABLE SHOW-RETRIEVED-GOAL [GC for 7810 CONS pages..(T=21).GC finished] RETRIEVE-FN [GC for 7810 CONS pages..(T=21).GC finished] PRINT-ALL-GOALS PC-COMMAND-TABLE PRINT-CONC PRINT-ALL-CONCS [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] PC-COMMAND-TABLE GEN-VAR-MARKER TRANSLATE-GENERALIZE-ALIST-1 NON-GEN-VAR-MARKERS FIND-DUPLICATE-GENERALIZE-ENTRIES TRANSLATE-GENERALIZE-ALIST-2 TRANSLATE-GENERALIZE-ALIST ALL-VARS-GOALS [GC for 633 SFUN pages..(T=22).GC finished] PC-STATE-VARS PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 633 SFUN pages..(T=15).GC finished] RUN-INSTR-ON-GOALS-GUTS PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE INSTR-NAME PC-FREE-INSTR-P FIND-POSSIBLE-PUT PC-COMMAND-TABLE [GC for 633 SFUN pages..(T=15).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=19).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE SAVE-FC-REPORT-SETTINGS RESTORE-FC-REPORT-SETTINGS [GC for 7810 CONS pages..(T=16).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7820 CONS pages..(T=15).GC finished] PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE ACL2-WRAP PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7830 CONS pages..(T=21).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE GOAL-TERMS WRAP1-AUX1 WRAP1-AUX2 PC-COMMAND-TABLE [GC for 7840 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE SHOW-GENEQV [GC for 2049 RELOCATABLE-BLOCKS pages..(T=21).GC finished] PC-COMMAND-TABLE GOALS-TO-CLAUSE-LIST PROOF-BUILDER-CLAUSE-LIST TTREE-TO-SUMMARY-DATA [GC for 7840 CONS pages..(T=21).GC finished] [GC for 19456 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] PROOF-BUILDER-CL-PROC-1 PROOF-BUILDER-CL-PROC T ((:INSTRUCTIONS (SPLICE-KEYWORD-ALIST :INSTRUCTIONS (LIST :CLAUSE-PROCESSOR (LIST :FUNCTION # :HINT #)) KEYWORD-ALIST) (VALUE T))) Finished loading "proof-builder-b.lisp". ACL2 loading "defpkgs.lisp". "ACL2" *ACL2-EXPORTS* [GC for 7850 CONS pages..(T=22).GC finished] [GC for 7860 CONS pages..(T=21).GC finished] "ACL2-USER" Finished loading "defpkgs.lisp". ACL2 loading '((IN-PACKAGE "ACL2") (DEFUN TAILS-AC (LST AC) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# #) (T #))) (DEFUN TAILS (LST) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (MBE :LOGIC (COND # #) :EXEC (TAILS-AC LST NIL))) (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (# T) (T #))) (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (T #))) (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (T #))) (DEFUN LOOP$-AS-AC (TUPLE AC) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# #) (# #) (T #))) ...). "ACL2" TAILS-AC TAILS EMPTY-LOOP$-AS-TUPLEP CAR-LOOP$-AS-TUPLE [GC for 774 SYMBOL pages..(T=21).GC finished] CDR-LOOP$-AS-TUPLE LOOP$-AS-AC LOOP$-AS FROM-TO-BY-MEASURE FROM-TO-BY-AC FROM-TO-BY [GC for 633 SFUN pages..(T=22).GC finished] REVAPPEND-TRUE-LIST-FIX *APPLY$-USERFN-CALLERS* *BLACKLISTED-APPLY$-FNS* SPLIT-SYSTEM-VERIFY-GUARDS-ALIST *SYSTEM-VERIFY-GUARDS-ALIST* NIL COMPUTE-BADGE-OF-PRIMITIVES NIL APPLY$-BADGEP N-CAR-CADR-CADDR-ETC MAKE-APPLY$-PRIM-BODY-FN NIL NIL Finished loading '((IN-PACKAGE "ACL2") (DEFUN TAILS-AC (LST AC) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# #) (T #))) (DEFUN TAILS (LST) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (MBE :LOGIC (COND # #) :EXEC (TAILS-AC LST NIL))) (DEFUN EMPTY-LOOP$-AS-TUPLEP (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (# T) (T #))) (DEFUN CAR-LOOP$-AS-TUPLE (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (T #))) (DEFUN CDR-LOOP$-AS-TUPLE (TUPLE) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# NIL) (T #))) (DEFUN LOOP$-AS-AC (TUPLE AC) (DECLARE (XARGS :GUARD # :MODE :PROGRAM)) (COND (# #) (# #) (T #))) ...). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). "ACL2" NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #) (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #)) ...)). "ACL2" NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (DEFABBREV TAMEP-LAMBDAP (FN) (AND # # #)) (MUTUAL-RECURSION (DEFUN TAMEP # # #) (DEFUN TAMEP-FUNCTIONP # # #) (DEFUN SUITABLY-TAMEP-LISTP # # #)) (MUTUAL-RECURSION (DEFUN APPLY$ # # #) (DEFUN APPLY$-LAMBDA # # #) (DEFUN EV$ # # #) (DEFUN EV$-LIST # # #)) (MUTUAL-RECURSION (DEFUN QUICK-CHECK-FOR-TAMENESSP # # #) (DEFUN QUICK-CHECK-FOR-TAMENESSP-LISTP # # #)) ...)). [GC for 19712 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] ACL2 loading '((LOGIC)). Finished loading '((LOGIC)). ACL2 loading '((IN-PACKAGE "ACL2") (DEFCONST *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* '(&ALLOW-OTHER-KEYS *PRINT-MISER-WIDTH* &AUX *PRINT-PPRINT-DISPATCH* &BODY *PRINT-PRETTY* &ENVIRONMENT ...)) (DEFCONST *COMMON-LISP-SPECIALS-AND-CONSTANTS* '(* ** *** *BREAK-ON-SIGNALS* *COMPILE-FILE-PATHNAME* *COMPILE-FILE-TRUENAME* *COMPILE-PRINT* ...)) (DEFCONST NIL 'NIL) (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" :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT IFF XOR :REDUNDANT :REDUNDANT IFF-IS-AN-EQUIVALENCE :REDUNDANT IFF-IMPLIES-EQUAL-IMPLIES-1 IFF-IMPLIES-EQUAL-IMPLIES-2 :REDUNDANT IFF-IMPLIES-EQUAL-NOT HIDE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT LIST-MACRO :REDUNDANT AND-MACRO :REDUNDANT OR-MACRO :REDUNDANT :REDUNDANT BOOLEANP-COMPOUND-RECOGNIZER (:NUMBER-OF-ENABLED-RUNES 887) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT COND-CLAUSESP [GC for 633 SFUN pages..(T=16).GC finished] COND-MACRO :REDUNDANT :REDUNDANT EQLABLEP-RECOG (:NUMBER-OF-ENABLED-RUNES 895) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ALISTP-FORWARD-TO-TRUE-LISTP EQLABLE-ALISTP-FORWARD-TO-ALISTP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=16).GC finished] ACONS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP SYMBOL-DOUBLET-LISTP REVERSE-STRIP-CARS :REDUNDANT REVERSE-STRIP-CDRS STRIP-CDRS :REDUNDANT ILLEGAL :REDUNDANT [GC for 633 SFUN pages..(T=15).GC finished] RETURN-LAST-FN :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT TRUE-LISTP-APPEND :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT APPEND-TO-NIL :REDUNDANT :REDUNDANT STRING-LISTP STRING-APPEND-LST GUARD-CHECK-FN :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT MEMBER-EQ-EXEC-IS-MEMBER-EQUAL MEMBER-EQL-EXEC-IS-MEMBER-EQUAL :REDUNDANT SUBSETP-EQ-EXEC :REDUNDANT :REDUNDANT :REDUNDANT SUBSETP-EQ-EXEC-IS-SUBSETP-EQUAL SUBSETP-EQL-EXEC-IS-SUBSETP-EQUAL :REDUNDANT :REDUNDANT SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP [GC for 7870 CONS pages..(T=19).GC finished] CHARACTER-ALISTP CHARACTER-ALISTP-FORWARD-TO-EQLABLE-ALISTP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ASSOC-EQ-EXEC-IS-ASSOC-EQUAL ASSOC-EQL-EXEC-IS-ASSOC-EQUAL :REDUNDANT ASSOC-EQ-EQUAL-ALISTP ASSOC-EQ-SAFE [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=18).GC finished] ASSOC-EQ-EQUAL ASSOC-EQ-CADR ASSOC-EQUAL-CADR :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ZP-COMPOUND-RECOGNIZER ZP-OPEN (:NUMBER-OF-ENABLED-RUNES 976) :REDUNDANT ZIP-COMPOUND-RECOGNIZER ZIP-OPEN (:NUMBER-OF-ENABLED-RUNES 977) :REDUNDANT :REDUNDANT SLEEP PROPER-CONSP IMPROPER-CONSP [GC for 7880 CONS pages..(T=15).GC finished] :REDUNDANT :REDUNDANT CONJUGATE ADD-SUFFIX :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT (:NUMBER-OF-ENABLED-RUNES 991) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT COMPLEX-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT (:NUMBER-OF-ENABLED-RUNES 991) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 7890 CONS pages..(T=17).GC finished] :REDUNDANT :REDUNDANT EXTRA-INFO (:NUMBER-OF-ENABLED-RUNES 991) :REDUNDANT :REDUNDANT :REDUNDANT (:NUMBER-OF-ENABLED-RUNES 991) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT BASIC-TAU-RULES :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NO-DUPLICATESP-EQ-EXEC-IS-NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQL-EXEC-IS-NO-DUPLICATESP-EQUAL :REDUNDANT R-EQLABLE-ALISTP [GC for 7900 CONS pages..(T=22).GC finished] R-SYMBOL-ALISTP RASSOC-EQ-EXEC RASSOC-EQL-EXEC RASSOC-EQUAL :REDUNDANT RASSOC-EQ-EXEC-IS-RASSOC-EQUAL RASSOC-EQL-EXEC-IS-RASSOC-EQUAL :REDUNDANT :REDUNDANT RFIX :REDUNDANT :REDUNDANT :REDUNDANT [GC for 7910 CONS pages..(T=22).GC finished] :REDUNDANT :REDUNDANT NATP-COMPOUND-RECOGNIZER NAT-ALISTP NAT-ALISTP-FORWARD-TO-EQLABLE-ALISTP :REDUNDANT BITP-COMPOUND-RECOGNIZER BITP-AS-INEQUALITY :REDUNDANT POSP-COMPOUND-RECOGNIZER :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT O-P O-P-IMPLIES-O CHAR<= CHAR>= STRING<-L [GC for 633 SFUN pages..(T=25).GC finished] STRING< STRING> STRING<= STRING>= SYMBOL< STRING<-L-IRREFLEXIVE STRING<-IRREFLEXIVE SUBSTITUTE-AC [GC for 8210 CONS pages..(T=31).GC finished] SUBSTITUTE STRINGP-SUBSTITUTE-TYPE-PRESCRIPTION TRUE-LISTP-SUBSTITUTE-TYPE-PRESCRIPTION :REDUNDANT SUBST :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8220 CONS pages..(T=25).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT PLIST-WORLDP-FORWARD-TO-ASSOC-EQ-EQUAL-ALISTP PUTPROP :REDUNDANT [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] GETPROP-DEFAULT :REDUNDANT :REDUNDANT ORDERED-SYMBOL-ALISTP (:NUMBER-OF-ENABLED-RUNES 1672) ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP ADD-PAIR REMOVE1-ASSOC-EQ-EXEC [GC for 8230 CONS pages..(T=26).GC finished] REMOVE1-ASSOC-EQL-EXEC REMOVE1-ASSOC-EQUAL :REDUNDANT REMOVE1-ASSOC-EQ-EXEC-IS-REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQL-EXEC-IS-REMOVE1-ASSOC-EQUAL :REDUNDANT REMOVE-ASSOC-EQ-EXEC [GC for 633 SFUN pages..(T=27).GC finished] REMOVE-ASSOC-EQL-EXEC REMOVE-ASSOC-EQUAL :REDUNDANT REMOVE-ASSOC-EQ-EXEC-IS-REMOVE-ASSOC-EQUAL REMOVE-ASSOC-EQL-EXEC-IS-REMOVE-ASSOC-EQUAL :REDUNDANT GETPROPS1 :REDUNDANT [GC for 8240 CONS pages..(T=26).GC finished] GETPROPS (:NUMBER-OF-ENABLED-RUNES 1724) EQUAL-CHAR-CODE HAS-PROPSP1 [GC for 8250 CONS pages..(T=29).GC finished] HAS-PROPSP [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] EXTEND-WORLD RETRACT-WORLD GLOBAL-VAL :REDUNDANT :REDUNDANT CONJOIN2 CONJOIN CONJOIN-UNTRANSLATED-TERMS [GC for 633 SFUN pages..(T=29).GC finished] DISJOIN2 DISJOIN DISJOIN-LST KWOTE? CONJOIN? <=? [GC for 633 SFUN pages..(T=26).GC finished] >? DISJOIN? :REDUNDANT :REDUNDANT WEAK-SATISFIES-TYPE-SPEC-P :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT THE-CHECK :REDUNDANT :REDUNDANT THE-CHECK-FOR-*1* :REDUNDANT :REDUNDANT :REDUNDANT [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] BOUNDED-INTEGER-ALISTP BOUNDED-INTEGER-ALISTP-FORWARD-TO-EQLABLE-ALISTP KEYWORD-VALUE-LISTP-ASSOC-KEYWORD CONSP-ASSOC-EQUAL :REDUNDANT ARRAY1P ARRAY1P-FORWARD ARRAY1P-LINEAR [GC for 8260 CONS pages..(T=24).GC finished] BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P ARRAY2P-FORWARD [GC for 8270 CONS pages..(T=24).GC finished] ARRAY2P-LINEAR HEADER DIMENSIONS MAXIMUM-LENGTH [GC for 8280 CONS pages..(T=22).GC finished] DEFAULT AREF1 COMPRESS11 [GC for 8290 CONS pages..(T=23).GC finished] ARRAY-ORDER COMPRESS1 ARRAY1P-CONS ASET1 ASET1-TRUSTED [GC for 8300 CONS pages..(T=14).GC finished] AREF2 [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] COMPRESS211 COMPRESS21 COMPRESS2 ARRAY2P-CONS ASET2 FLUSH-COMPRESS [GC for 8310 CONS pages..(T=21).GC finished] MAYBE-FLUSH-AND-COMPRESS1 CDRN :REDUNDANT :REDUNDANT UPDATE-NTH UPDATE-NTH-ARRAY :REDUNDANT :REDUNDANT 32-BIT-INTEGERP 32-BIT-INTEGERP-FORWARD-TO-INTEGERP [GC for 8320 CONS pages..(T=23).GC finished] ACL2-NUMBER-LISTP ACL2-NUMBER-LISTP-FORWARD-TO-TRUE-LISTP [GC for 132 CFUN pages..(T=25).GC finished] RATIONAL-LISTP RATIONAL-LISTP-FORWARD-TO-ACL2-NUMBER-LISTP INTEGER-LISTP INTEGER-LISTP-FORWARD-TO-RATIONAL-LISTP NAT-LISTP NAT-LISTP-FORWARD-TO-INTEGER-LISTP 32-BIT-INTEGER-LISTP 32-BIT-INTEGER-LISTP-FORWARD-TO-INTEGER-LISTP OPEN-INPUT-CHANNELS [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS UPDATE-OPEN-OUTPUT-CHANNELS GLOBAL-TABLE UPDATE-GLOBAL-TABLE T-STACK [GC for 8330 CONS pages..(T=23).GC finished] UPDATE-T-STACK 32-BIT-INTEGER-STACK UPDATE-32-BIT-INTEGER-STACK BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY IDATES [GC for 633 SFUN pages..(T=25).GC finished] UPDATE-IDATES ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] UPDATE-FILE-CLOCK READABLE-FILES WRITTEN-FILES UPDATE-WRITTEN-FILES READ-FILES [GC for 8340 CONS pages..(T=26).GC finished] UPDATE-READ-FILES WRITEABLE-FILES LIST-ALL-PACKAGE-NAMES-LST UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 UPDATE-USER-STOBJ-ALIST1 [GC for 8350 CONS pages..(T=24).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UNTOUCHABLE-MARKER :REDUNDANT :REDUNDANT INIT-IPRINT-AR :REDUNDANT :REDUNDANT DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT :REDUNDANT :REDUNDANT :REDUNDANT T :REDUNDANT ALL-BOUNDP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=21).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=18).GC finished] KNOWN-PACKAGE-ALISTP KNOWN-PACKAGE-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP TIMER-ALISTP TIMER-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-SYMBOL-ALISTP TYPED-IO-LISTP TYPED-IO-LISTP-FORWARD-TO-TRUE-LISTP :REDUNDANT OPEN-CHANNEL1 OPEN-CHANNEL1-FORWARD-TO-TRUE-LISTP-AND-CONSP [GC for 8360 CONS pages..(T=31).GC finished] OPEN-CHANNEL-LISTP OPEN-CHANNELS-P OPEN-CHANNELS-P-FORWARD FILE-CLOCK-P FILE-CLOCK-P-FORWARD-TO-INTEGERP READABLE-FILE READABLE-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP [GC for 8370 CONS pages..(T=24).GC finished] READABLE-FILES-LISTP READABLE-FILES-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP READABLE-FILES-P READABLE-FILES-P-FORWARD-TO-READABLE-FILES-LISTP WRITTEN-FILE WRITTEN-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP WRITTEN-FILE-LISTP WRITTEN-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP [GC for 8380 CONS pages..(T=23).GC finished] WRITTEN-FILES-P WRITTEN-FILES-P-FORWARD-TO-WRITTEN-FILE-LISTP READ-FILE-LISTP1 READ-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP READ-FILE-LISTP READ-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP READ-FILES-P READ-FILES-P-FORWARD-TO-READ-FILE-LISTP [GC for 8390 CONS pages..(T=23).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] WRITABLE-FILE-LISTP1 WRITABLE-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP WRITABLE-FILE-LISTP WRITABLE-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP WRITEABLE-FILES-P WRITEABLE-FILES-P-FORWARD-TO-WRITABLE-FILE-LISTP [GC for 8400 CONS pages..(T=24).GC finished] STATE-P1 STATE-P1-FORWARD STATE-P (:NUMBER-OF-ENABLED-RUNES 2094) STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 :REDUNDANT :REDUNDANT [GC for 8410 CONS pages..(T=23).GC finished] BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE CREATE-STATE GLOBAL-TABLE-CARS1 [GC for 8420 CONS pages..(T=22).GC finished] GLOBAL-TABLE-CARS BOUNDP-GLOBAL1 BOUNDP-GLOBAL :REDUNDANT [GC for 8430 CONS pages..(T=24).GC finished] MAKUNBOUND-GLOBAL GET-GLOBAL [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] PUT-GLOBAL :REDUNDANT :REDUNDANT ALWAYS-BOUNDP-GLOBAL STATE-GLOBAL-LET*-BINDINGS-P [GC for 8440 CONS pages..(T=24).GC finished] STATE-GLOBAL-LET*-GET-GLOBALS STATE-GLOBAL-LET*-PUT-GLOBALS [GC for 8450 CONS pages..(T=23).GC finished] STATE-GLOBAL-LET*-CLEANUP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT T STANDARD-CHAR-P-NTH STRING-EQUAL ASSOC-STRING-EQUAL [GC for 8460 CONS pages..(T=23).GC finished] MEMBER-STRING-EQUAL XXXJOIN NIL EXPLODE-NONNEGATIVE-INTEGER TRUE-LISTP-EXPLODE-NONNEGATIVE-INTEGER NIL NIL EXPLODE-NONNEGATIVE-INTEGER [GC for 8470 CONS pages..(T=23).GC finished] T MAKE-VAR-LST TRUE-LISTP-TAKE T [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BUTLAST DEFUN-NX-FORM DEFUN-NX-FN UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 [GC for 8480 CONS pages..(T=23).GC finished] UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX PROGRAM-DECLARED-P SOME-PROGRAM-DECLARED-P [GC for 8490 CONS pages..(T=25).GC finished] PARSE-ARGS-AND-TEST INTEGER-RANGE-P NIL SIGNED-BYTE-P UNSIGNED-BYTE-P INTEGER-RANGE-P-FORWARD SIGNED-BYTE-P-FORWARD-TO-INTEGERP UNSIGNED-BYTE-P-FORWARD-TO-NONNEGATIVE-INTEGERP :REDUNDANT ZPF NIL SUBSTITUTE NIL ALL-VARS1 ALL-VARS NIL [GC for 8500 CONS pages..(T=22).GC finished] CHECK-VARS-NOT-FREE-TEST :REDUNDANT DEFAULT-SYMBOL-NAME :REDUNDANT DEFAULT-SYMBOL-PACKAGE-NAME SYMBOL-EQUALITY T :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT INTEGER-LENGTH [GC for 8510 CONS pages..(T=24).GC finished] BINARY-LOGAND LOGNAND [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] BINARY-LOGIOR LOGORC1 LOGORC2 LOGANDC1 LOGANDC2 [GC for 633 SFUN pages..(T=23).GC finished] BINARY-LOGEQV BINARY-LOGXOR LOGNOR LOGTEST :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8520 CONS pages..(T=25).GC finished] BOOLE$ SET-FORMS-FROM-BINDINGS :REDUNDANT ALIST-DIFFERENCE-EQ :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8530 CONS pages..(T=24).GC finished] EXPLODE-ATOM :REDUNDANT EXPLODE-ATOM+ TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP-ASSOC-EQUAL TRUE-LISTP-CADR-ASSOC-EQ-FOR-OPEN-CHANNELS-P NIL [GC for 8540 CONS pages..(T=23).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] OPEN-INPUT-CHANNEL-P1 OPEN-OUTPUT-CHANNEL-P1 OPEN-INPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-P [GC for 8550 CONS pages..(T=28).GC finished] OPEN-OUTPUT-CHANNEL-ANY-P1 OPEN-OUTPUT-CHANNEL-ANY-P OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES [GC for 633 SFUN pages..(T=27).GC finished] FREE-VAR-RUNES NATP-POSITION-AC :REDUNDANT :REDUNDANT :REDUNDANT OS ABSOLUTE-PATHNAME-STRING-P [GC for 8560 CONS pages..(T=24).GC finished] ILLEGAL-RULER-EXTENDERS-VALUES :REDUNDANT [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] RULER-EXTENDERS-MSG-AUX RULER-EXTENDERS-MSG STRICT-SYMBOL<-SORTEDP :REDUNDANT :REDUNDANT :REDUNDANT INCLUDE-BOOK-DIR-ALIST-ENTRY-P INCLUDE-BOOK-DIR-ALISTP :REDUNDANT [GC for 8570 CONS pages..(T=25).GC finished] TTAG GET-REGISTER-INVARIANT-RISK-WORLD :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SET-PRINT-CASE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8580 CONS pages..(T=25).GC finished] SET-PRINT-BASE SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] SET-PRINT-READABLY :REDUNDANT SET-PRINT-LENGTH SET-PRINT-LEVEL SET-PRINT-LINES SET-PRINT-RIGHT-MARGIN [GC for 633 SFUN pages..(T=25).GC finished] RAW-PRINT-VARS-ALIST :REDUNDANT PRINC$ [GC for 8590 CONS pages..(T=24).GC finished] WRITE-BYTE$ W GET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-FN [GC for 8600 CONS pages..(T=23).GC finished] SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM ALL-BOUNDP-PRESERVES-ASSOC-EQUAL NIL [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] PRINT-OBJECT$+-ALIST MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL [GC for 8610 CONS pages..(T=22).GC finished] OPEN-INPUT-CHANNEL NTH-UPDATE-NTH TRUE-LISTP-UPDATE-NTH NIL NTH-UPDATE-NTH-ARRAY CLOSE-INPUT-CHANNEL [GC for 8620 CONS pages..(T=22).GC finished] OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL! :REDUNDANT :REDUNDANT COMMENT-WINDOW-CO FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! FMT-TO-COMMENT-WINDOW+ FMT-TO-COMMENT-WINDOW!+ [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PAIRLIS2 :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT LOCK-SYMBOL-NAME-P ASSIGN-LOCK :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8630 CONS pages..(T=24).GC finished] GET-OUTPUT-STREAM-STRING$-FN :REDUNDANT CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ [GC for 8640 CONS pages..(T=32).GC finished] READ-CHAR$ PEEK-CHAR$ READ-BYTE$ RAW-MODE-P READ-OBJECT [GC for 8650 CONS pages..(T=27).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] READ-OBJECT-WITH-CASE READ-OBJECT-SUPPRESS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SOME-SLASHABLE PRIN1-WITH-SLASHES1 [GC for 8660 CONS pages..(T=24).GC finished] PRIN1-WITH-SLASHES :REDUNDANT :REDUNDANT MAY-NEED-SLASHES1 NIL ALL-DOTS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=26).GC finished] MAY-NEED-SLASHES-FN :REDUNDANT NEEDS-SLASHES T-STACK-LENGTH1 T-STACK-LENGTH [GC for 633 SFUN pages..(T=25).GC finished] MAKE-LIST-AC :REDUNDANT EXTEND-T-STACK T STRINGP-SUBSEQ-TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION NIL W SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM :REDUNDANT :REDUNDANT [GC for 8670 CONS pages..(T=25).GC finished] SHRINK-T-STACK AREF-T-STACK ASET-T-STACK 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH [GC for 633 SFUN pages..(T=27).GC finished] EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK ASET-32-BIT-INTEGER-STACK :REDUNDANT :REDUNDANT [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] BIG-CLOCK-NEGATIVE-P DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES USER-STOBJ-ALIST UPDATE-USER-STOBJ-ALIST [GC for 633 SFUN pages..(T=29).GC finished] POWER-EVAL READ-IDATE READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR [GC for 8680 CONS pages..(T=25).GC finished] GETENV$ SETENV$ RANDOM$ NATP-RANDOM$ RANDOM$-LINEAR (:NUMBER-OF-ENABLED-RUNES 2608) SYS-CALL (:NUMBER-OF-ENABLED-RUNES 2610) [GC for 8690 CONS pages..(T=25).GC finished] SYS-CALL-STATUS T UPDATE-ACL2-ORACLE-PRESERVES-STATE-P1 (:NUMBER-OF-ENABLED-RUNES 2614) SYS-CALL+ SYS-CALL* NIL READ-RUN-TIME-PRESERVES-STATE-P1 READ-ACL2-ORACLE-PRESERVES-STATE-P1 (:NUMBER-OF-ENABLED-RUNES 2621) NIL NTH-0-READ-RUN-TIME-TYPE-PRESCRIPTION [GC for 8700 CONS pages..(T=25).GC finished] (:NUMBER-OF-ENABLED-RUNES 2621) NIL MAIN-TIMER PUT-ASSOC-EQ-EXEC [GC for 8710 CONS pages..(T=24).GC finished] PUT-ASSOC-EQL-EXEC PUT-ASSOC-EQUAL :REDUNDANT :REDUNDANT PUT-ASSOC-EQ-EXEC-IS-PUT-ASSOC-EQUAL PUT-ASSOC-EQL-EXEC-IS-PUT-ASSOC-EQUAL :REDUNDANT NIL NIL NIL SET-TIMER [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] GET-TIMER NIL PUSH-TIMER RATIONALP-+ RATIONALP-* RATIONALP-UNARY-- RATIONALP-UNARY-/ RATIONALP-IMPLIES-ACL2-NUMBERP POP-TIMER [GC for 8720 CONS pages..(T=25).GC finished] ADD-TIMERS NTH-0-CONS NIL NTH-ADD1 ORDERED-SYMBOL-ALISTP-ADD-PAIR-FORWARD ASSOC-ADD-PAIR ADD-PAIR-PRESERVES-ALL-BOUNDP STATE-P1-UPDATE-MAIN-TIMER INCREMENT-TIMER [GC for 8730 CONS pages..(T=24).GC finished] PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER STATE-P1-UPDATE-PRINT-BASE SET-PRINT-BASE-RADIX [GC for 784 SYMBOL pages..(T=23).GC finished] KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 8740 CONS pages..(T=26).GC finished] PRIN1$ NIL CURRENT-PACKAGE STATE-P1-UPDATE-NTH-2-WORLD :REDUNDANT :REDUNDANT LD-SKIP-PROOFSP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8750 CONS pages..(T=29).GC finished] INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC INTERSECTION-EQUAL [GC for 8760 CONS pages..(T=24).GC finished] :REDUNDANT INTERSECTION-EQ-EXEC-IS-INTERSECTION-EQUAL INTERSECTION-EQL-EXEC-IS-INTERSECTION-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT GET-ENFORCE-REDUNDANCY :REDUNDANT DEFAULT-VERIFY-GUARDS-EAGERNESS :REDUNDANT DEFAULT-COMPILE-FNS :REDUNDANT [GC for 8770 CONS pages..(T=27).GC finished] SET-COMPILER-ENABLED [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] SET-PORT-FILE-ENABLED DEFAULT-MEASURE-FUNCTION :REDUNDANT DEFAULT-WELL-FOUNDED-RELATION :REDUNDANT :REDUNDANT DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE :REDUNDANT :REDUNDANT [GC for 8780 CONS pages..(T=27).GC finished] INVISIBLE-FNS-TABLE :REDUNDANT UNARY-FUNCTION-SYMBOL-LISTP INVISIBLE-FNS-ENTRYP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT REMOVE1-ASSOC-STRING-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8790 CONS pages..(T=27).GC finished] :REDUNDANT BACKCHAIN-LIMIT :REDUNDANT DEFAULT-BACKCHAIN-LIMIT STEP-LIMIT-FROM-TABLE :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8800 CONS pages..(T=27).GC finished] REWRITE-STACK-LIMIT CASE-SPLIT-LIMITATIONS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UNTRANS-TABLE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT MATCH-FREE-DEFAULT :REDUNDANT :REDUNDANT [GC for 633 SFUN pages..(T=27).GC finished] MATCH-FREE-OVERRIDE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT RAW-INCLUDE-BOOK-DIR-P :REDUNDANT :REDUNDANT :REDUNDANT NON-LINEARP :REDUNDANT :REDUNDANT TAU-AUTO-MODEP :REDUNDANT [GC for 8810 CONS pages..(T=28).GC finished] GET-IN-THEORY-REDUNDANT-OKP :REDUNDANT :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8820 CONS pages..(T=25).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] NTH-ALIASES :REDUNDANT :REDUNDANT DEFAULT-HINTS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT T (:NUMBER-OF-ENABLED-RUNES 2803) :REDUNDANT MACRO-ALIASES-TABLE [GC for 8830 CONS pages..(T=25).GC finished] PAIRLIS$-TRUE-LIST-FIX BOOLEAN-LISTP BOOLEAN-LISTP-CONS BOOLEAN-LISTP-FORWARD BOOLEAN-LISTP-FORWARD-TO-SYMBOL-LISTP :REDUNDANT DEFAULT-+-1 DEFAULT-+-2 :REDUNDANT DEFAULT-*-1 DEFAULT-*-2 :REDUNDANT DEFAULT-UNARY-MINUS :REDUNDANT DEFAULT-UNARY-/ :REDUNDANT DEFAULT-<-1 DEFAULT-<-2 :REDUNDANT DEFAULT-CAR :REDUNDANT DEFAULT-CDR CONS-CAR-CDR :REDUNDANT DEFAULT-CHAR-CODE :REDUNDANT DEFAULT-CODE-CHAR :REDUNDANT DEFAULT-COMPLEX-1 DEFAULT-COMPLEX-2 COMPLEX-0 ADD-DEF-COMPLEX REALPART-+ IMAGPART-+ :EMPTY-ENCAPSULATE :REDUNDANT DEFAULT-COERCE-1 [GC for 8840 CONS pages..(T=26).GC finished] MAKE-CHARACTER-LIST-MAKE-CHARACTER-LIST DEFAULT-COERCE-2 DEFAULT-COERCE-3 :REDUNDANT DEFAULT-DENOMINATOR :REDUNDANT DEFAULT-IMAGPART :REDUNDANT DEFAULT-INTERN-IN-PACKAGE-OF-SYMBOL :REDUNDANT DEFAULT-NUMERATOR :REDUNDANT DEFAULT-REALPART DOUBLE-REWRITE CHK-WITH-PROVER-TIME-LIMIT-ARG :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT TIME-LIMIT5-REACHED-P :REDUNDANT :REDUNDANT CHK-WITH-GUARD-CHECKING-ARG :REDUNDANT WITH-GUARD-CHECKING-GATE :REDUNDANT :REDUNDANT :REDUNDANT ABORT! :REDUNDANT [GC for 633 SFUN pages..(T=25).GC finished] P! (:NUMBER-OF-ENABLED-RUNES 2854) :REDUNDANT :REDUNDANT WORMHOLE1 WORMHOLE-P [GC for 8850 CONS pages..(T=24).GC finished] DUPLICATES SET-EQUALP-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT RECORD-ACCESSOR-FUNCTION-NAME :REDUNDANT [GC for 8860 CONS pages..(T=25).GC finished] MFC-CLAUSE MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP MFC-TYPE-ALIST MFC-ANCESTORS [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] MFC-UNIFY-SUBST MFC-WORLD PSEUDO-TERM-LISTP-MFC-CLAUSE TYPE-ALISTP-MFC-TYPE-ALIST :REDUNDANT BAD-ATOM-COMPOUND-RECOGNIZER [GC for 8870 CONS pages..(T=28).GC finished] (:NUMBER-OF-ENABLED-RUNES 2897) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ALPHORDER [GC for 8880 CONS pages..(T=27).GC finished] LEXORDER NIL NIL NIL ALPHORDER-REFLEXIVE NIL ALPHORDER-TRANSITIVE ALPHORDER-ANTI-SYMMETRIC ALPHORDER-TOTAL (:NUMBER-OF-ENABLED-RUNES 2907) LEXORDER-REFLEXIVE LEXORDER-ANTI-SYMMETRIC LEXORDER-TRANSITIVE LEXORDER-TOTAL (:NUMBER-OF-ENABLED-RUNES 2909) MERGE-LEXORDER [GC for 8890 CONS pages..(T=27).GC finished] NIL NIL TRUE-LISTP-MERGE-SORT-LEXORDER MERGE-SORT-LEXORDER :REDUNDANT RESIZE-LIST-EXEC RESIZE-LIST [GC for 8900 CONS pages..(T=34).GC finished] RESIZE-LIST-EXEC-IS-RESIZE-LIST RESIZE-LIST E/D-FN :REDUNDANT To verify that the 30 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOGIC) The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant. See :DOC redundant-events. :INVISIBLE ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALISTP) The event ( DEFUN ALISTP ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN ALISTP ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP) The event ( DEFUN SYMBOL-ALISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-ALISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP) The event ( DEFUN TRUE-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TRUE-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN) The event ( DEFUN LEN ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LEN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH) The event ( DEFUN LENGTH ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LENGTH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH) The event ( DEFUN NTH ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN NTH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP CHAR) The event ( DEFUN CHAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN CHAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP EQLABLE-ALISTP) The event ( DEFUN EQLABLE-ALISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN EQLABLE-ALISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC) The event ( DEFUN ASSOC-EQL-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ASSOC-EQL-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQL-EXEC$GUARD-CHECK) The event ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN ASSOC-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL) The event ( DEFUN ASSOC-EQUAL ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ASSOC-EQUAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBLIS) The event ( DEFUN SUBLIS ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN SUBLIS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NFIX) The event ( DEFUN NFIX ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN NFIX ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP IFIX) The event ( DEFUN IFIX ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN IFIX ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP INTEGER-ABS) The event ( DEFUN INTEGER-ABS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN INTEGER-ABS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ACL2-COUNT) The event ( DEFUN ACL2-COUNT ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ACL2-COUNT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NONNEGATIVE-INTEGER-QUOTIENT) The event ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN NONNEGATIVE-INTEGER-QUOTIENT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR) The event ( DEFUN FLOOR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN FLOOR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-LISTP) [GC for 8910 CONS pages..(T=29).GC finished] The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-LISTP ...) Rules: NIL Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND) The event ( DEFUN BINARY-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN BINARY-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND) The event ( DEFUN STRING-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRING-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP) The event ( DEFUN PLIST-WORLDP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP) The event ( DEFUN FGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP) The event ( DEFUN SGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP) The event ( DEFUN FUNCTION-SYMBOLP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS) The event ( DEFUN STRIP-CARS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRIP-CARS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK) The event ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC) The event ( DEFUN ASSOC-EQ-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST) The event ( DEFUN TABLE-ALIST ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TABLE-ALIST ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT End of Encapsulated Events. ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...): The submitted encapsulate event has created no new ACL2 events, and thus is leaving the ACL2 logical world unchanged. See :DOC encapsulate. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 0.31 seconds (prove: 0.00, print: 0.00, other: 0.31) :EMPTY-ENCAPSULATE Since MOD-EXPT is non-recursive, its admission is trivial. We observe that the type of MOD-EXPT is described by the theorem (ACL2-NUMBERP (MOD-EXPT BASE EXP MOD)). We used the :type-prescription rule MOD. Computing the guard conjecture for MOD-EXPT.... [GC for 8920 CONS pages..(T=23).GC finished] The guard conjecture for MOD-EXPT is trivial to prove, given the :executable- counterpart of EQLABLEP and the :type-prescription rules EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE and RATIONALP-EXPT-TYPE-PRESCRIPTION. MOD-EXPT is compliant with Common Lisp. Summary Form: ( DEFUN MOD-EXPT ...) Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP) (:TYPE-PRESCRIPTION EXPT-TYPE-PRESCRIPTION-NON-ZERO-BASE) (:TYPE-PRESCRIPTION MOD) (:TYPE-PRESCRIPTION RATIONALP-EXPT-TYPE-PRESCRIPTION)) Time: 0.39 seconds (prove: 0.00, print: 0.00, other: 0.39) MOD-EXPT Since CONJOIN-CLAUSES is non-recursive, its admission is trivial. We could deduce no constraints on the type of CONJOIN-CLAUSES. Computing the guard conjecture for CONJOIN-CLAUSES.... The guard conjecture for CONJOIN-CLAUSES is trivial to prove, given the :type-prescription rule DISJOIN-LST. CONJOIN-CLAUSES is compliant with Common Lisp. Summary Form: ( DEFUN CONJOIN-CLAUSES ...) Rules: ((:TYPE-PRESCRIPTION DISJOIN-LST)) Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) CONJOIN-CLAUSES The event ( DEFCONST *TRUE-CLAUSE* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *TRUE-CLAUSE* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *FALSE-CLAUSE* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *FALSE-CLAUSE* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since CLAUSES-RESULT is non-recursive, its admission is trivial. We could deduce no constraints on the type of CLAUSES-RESULT. Computing the guard conjecture for CLAUSES-RESULT.... The guard conjecture for CLAUSES-RESULT is trivial to prove, given primitive type reasoning. CLAUSES-RESULT is compliant with Common Lisp. Summary Form: ( DEFUN CLAUSES-RESULT ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) CLAUSES-RESULT The event ( TABLE EVISC-TABLE ...) is redundant. See :DOC redundant- events. Summary Form: ( TABLE EVISC-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *TOP-HINT-KEYWORDS* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *TOP-HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *HINT-KEYWORDS* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( TABLE CUSTOM-KEYWORDS-TABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( TABLE CUSTOM-KEYWORDS-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT For the admission of SPLICE-KEYWORD-ALIST we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT KEYWORD-ALIST). The non-trivial part of the measure conjecture is Goal (IMPLIES (AND (NOT (ENDP KEYWORD-ALIST)) (NOT (EQ KEY (CAR KEYWORD-ALIST)))) (O< (ACL2-COUNT (CDDR KEYWORD-ALIST)) (ACL2-COUNT KEYWORD-ALIST))). By the simple :definitions ENDP and EQ we reduce the conjecture to Goal' (IMPLIES (AND (CONSP KEYWORD-ALIST) (NOT (EQUAL KEY (CAR KEYWORD-ALIST)))) (O< (ACL2-COUNT (CDDR KEYWORD-ALIST)) (ACL2-COUNT KEYWORD-ALIST))). [GC for 8930 CONS pages..(T=27).GC finished] This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<, primitive type reasoning and the :type-prescription rule ACL2-COUNT, to Goal'' (IMPLIES (AND (CONSP KEYWORD-ALIST) (NOT (EQUAL KEY (CAR KEYWORD-ALIST)))) (< (ACL2-COUNT (CDDR KEYWORD-ALIST)) (+ 1 (ACL2-COUNT (CAR KEYWORD-ALIST)) (ACL2-COUNT (CDR KEYWORD-ALIST))))). [GC for 8940 CONS pages..(T=22).GC finished] The destructor terms (CAR KEYWORD-ALIST) and (CDR KEYWORD-ALIST) can be eliminated. Furthermore, those terms are at the root of a chain of two rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace KEYWORD-ALIST by (CONS KEYWORD-ALIST1 KEYWORD-ALIST2), (CAR KEYWORD-ALIST) by KEYWORD-ALIST1 and (CDR KEYWORD-ALIST) by KEYWORD-ALIST2. (2) Use CAR-CDR-ELIM, again, to replace KEYWORD-ALIST2 by (CONS KEYWORD-ALIST3 KEYWORD-ALIST4), (CAR KEYWORD-ALIST2) by KEYWORD-ALIST3 and (CDR KEYWORD-ALIST2) by KEYWORD-ALIST4. These steps produce the following two goals. Subgoal 2 (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2)) (CONSP (CONS KEYWORD-ALIST1 KEYWORD-ALIST2)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< (ACL2-COUNT (CDR KEYWORD-ALIST2)) (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT KEYWORD-ALIST2)))). This simplifies, using the :executable-counterpart of ACL2-COUNT, primitive type reasoning and the :rewrite rule DEFAULT-CDR, to Subgoal 2' (IMPLIES (AND (NOT (CONSP KEYWORD-ALIST2)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< 0 (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT KEYWORD-ALIST2)))). But simplification reduces this to T, using primitive type reasoning and the :type-prescription rule ACL2-COUNT. Subgoal 1 (IMPLIES (AND (CONSP (CONS KEYWORD-ALIST3 KEYWORD-ALIST4)) (CONSP (LIST* KEYWORD-ALIST1 KEYWORD-ALIST3 KEYWORD-ALIST4)) (NOT (EQUAL KEY KEYWORD-ALIST1))) (< (ACL2-COUNT KEYWORD-ALIST4) (+ 1 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT (CONS KEYWORD-ALIST3 KEYWORD-ALIST4))))). This simplifies, using the :definitions ACL2-COUNT and SYNP, the :executable- counterpart of BINARY-+, primitive type reasoning and the :rewrite rules CAR-CONS, CDR-CONS, COMMUTATIVITY-2-OF-+ and FOLD-CONSTS-IN-+, to Subgoal 1' (IMPLIES (NOT (EQUAL KEY KEYWORD-ALIST1)) (< (ACL2-COUNT KEYWORD-ALIST4) (+ 2 (ACL2-COUNT KEYWORD-ALIST1) (ACL2-COUNT KEYWORD-ALIST3) (ACL2-COUNT KEYWORD-ALIST4)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule ACL2-COUNT. Q.E.D. That completes the proof of the measure theorem for SPLICE-KEYWORD-ALIST. Thus, we admit this function under the principle of definition. We could deduce no constraints on the type of SPLICE-KEYWORD-ALIST. Computing the guard conjecture for SPLICE-KEYWORD-ALIST.... The non-trivial part of the guard conjecture for SPLICE-KEYWORD-ALIST, given primitive type reasoning, the :forward-chaining rules KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP and KEYWORDP-FORWARD-TO-SYMBOLP and the :type-prescription rules KEYWORD-VALUE-LISTP and KEYWORDP, is Goal (IMPLIES (AND (TRUE-LISTP NEW-SEGMENT) (KEYWORD-VALUE-LISTP KEYWORD-ALIST) (KEYWORDP KEY) (NOT (ENDP KEYWORD-ALIST)) (NOT (EQ KEY (CAR KEYWORD-ALIST)))) (KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))). By the simple :definitions ENDP, EQ and KEYWORDP we reduce the conjecture to Goal' (IMPLIES (AND (TRUE-LISTP NEW-SEGMENT) (KEYWORD-VALUE-LISTP KEYWORD-ALIST) (SYMBOLP KEY) (EQUAL (SYMBOL-PACKAGE-NAME KEY) "KEYWORD") (CONSP KEYWORD-ALIST) (NOT (EQUAL KEY (CAR KEYWORD-ALIST)))) (KEYWORD-VALUE-LISTP (CDDR KEYWORD-ALIST))). But simplification reduces this to T, using the :definitions KEYWORD-VALUE-LISTP and KEYWORDP. Q.E.D. That completes the proof of the guard theorem for SPLICE-KEYWORD-ALIST. [GC for 8950 CONS pages..(T=21).GC finished] SPLICE-KEYWORD-ALIST is compliant with Common Lisp. Summary Form: ( DEFUN SPLICE-KEYWORD-ALIST ...) Rules: ((:DEFINITION ACL2-COUNT) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION KEYWORD-VALUE-LISTP) (:DEFINITION KEYWORDP) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O<) (:DEFINITION SYNP) (:ELIM CAR-CDR-ELIM) (:EXECUTABLE-COUNTERPART ACL2-COUNT) (:EXECUTABLE-COUNTERPART BINARY-+) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING KEYWORD-VALUE-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING KEYWORDP-FORWARD-TO-SYMBOLP) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE DEFAULT-CDR) (:REWRITE FOLD-CONSTS-IN-+) (:TYPE-PRESCRIPTION ACL2-COUNT) (:TYPE-PRESCRIPTION KEYWORD-VALUE-LISTP) (:TYPE-PRESCRIPTION KEYWORDP)) Time: 0.91 seconds (prove: 0.51, print: 0.00, other: 0.40) Prover steps counted: 1844 SPLICE-KEYWORD-ALIST The event ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SEARCH-FN-GUARD is non-recursive, its admission is trivial. We observe that the type of SEARCH-FN-GUARD is described by the theorem (OR (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) T) (EQUAL (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) NIL)). We used primitive type reasoning and the :type-prescription rules HARD-ERROR and STANDARD-CHAR-LISTP. Computing the guard conjecture for SEARCH-FN-GUARD.... [GC for 8960 CONS pages..(T=24).GC finished] The non-trivial part of the guard conjecture for SEARCH-FN-GUARD, given the :executable-counterpart of HARD-ERROR, is Goal (AND (LET ((X TEST) (L '(EQUAL CHAR-EQUAL))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))) (IMPLIES (COND ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))) (HARD-ERROR 'SEARCH "For the macro ~x0, only the :test values ~x1 and ~x2 are ~ supported; ~x3 is not. If you need other tests supported, ~ please contact the ACL2 implementors." (LIST '(#\0 . SEARCH) '(#\1 . EQUAL) '(#\2 . CHAR-EQUAL) (CONS #\3 TEST)))) ((AND (STRINGP SEQ1) (STRINGP SEQ2)) (OR (EQ TEST 'EQUAL) (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (HARD-ERROR 'SEARCH "When ~x0 is called on two strings, they must both ~ consist of standard characters. However, this is not ~ the case for ~x1." (LIST '(#\0 . SEARCH) (CONS #\1 (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) SEQ2 SEQ1)))))) ((EQ TEST 'CHAR-EQUAL) NIL) ((AND (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2)) T) (T NIL)) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (RATIONALP END1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (RATIONALP START1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (RATIONALP END2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (RATIONALP START2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (RATIONALP (LENGTH SEQ1))) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (RATIONALP END1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (RATIONALP (LENGTH SEQ2))) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (RATIONALP END2))))) (IMPLIES (AND (COND ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))) (HARD-ERROR 'SEARCH "For the macro ~x0, only the :test values ~x1 and ~x2 are ~ supported; ~x3 is not. If you need other tests supported, ~ please contact the ACL2 implementors." (LIST '(#\0 . SEARCH) '(#\1 . EQUAL) '(#\2 . CHAR-EQUAL) (CONS #\3 TEST)))) ((AND (STRINGP SEQ1) (STRINGP SEQ2)) (OR (EQ TEST 'EQUAL) (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (HARD-ERROR 'SEARCH "When ~x0 is called on two strings, they must both ~ consist of standard characters. However, this is not ~ the case for ~x1." (LIST '(#\0 . SEARCH) (CONS #\1 (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) SEQ2 SEQ1)))))) ((EQ TEST 'CHAR-EQUAL) NIL) ((AND (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2)) T) (T NIL)) (NOT END1P) (NOT (TRUE-LISTP SEQ1))) (STRINGP SEQ1)) (IMPLIES (AND (COND ((NOT (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL))) (HARD-ERROR 'SEARCH "For the macro ~x0, only the :test values ~x1 and ~x2 are ~ supported; ~x3 is not. If you need other tests supported, ~ please contact the ACL2 implementors." (LIST '(#\0 . SEARCH) '(#\1 . EQUAL) '(#\2 . CHAR-EQUAL) (CONS #\3 TEST)))) ((AND (STRINGP SEQ1) (STRINGP SEQ2)) (OR (EQ TEST 'EQUAL) (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (HARD-ERROR 'SEARCH "When ~x0 is called on two strings, they must both ~ consist of standard characters. However, this is not ~ the case for ~x1." (LIST '(#\0 . SEARCH) (CONS #\1 (IF (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) SEQ2 SEQ1)))))) ((EQ TEST 'CHAR-EQUAL) NIL) ((AND (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2)) T) (T NIL)) (NOT END2P) (NOT (TRUE-LISTP SEQ2))) (STRINGP SEQ2))). [GC for 8970 CONS pages..(T=19).GC finished] [GC for 8980 CONS pages..(T=17).GC finished] [GC for 8990 CONS pages..(T=16).GC finished] [GC for 9000 CONS pages..(T=17).GC finished] By the simple :definitions EQ and HARD-ERROR, the :executable-counterparts of IF, SYMBOL-LISTP, TAU-SYSTEM and TRUE-LISTP and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to Goal' (IMPLIES (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)) (COND ((AND (STRINGP SEQ1) (STRINGP SEQ2)) (OR (EQUAL TEST 'EQUAL) (AND (AND (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))))) ((EQUAL TEST 'CHAR-EQUAL) NIL) ((TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2)) (T NIL))) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (RATIONALP END1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (RATIONALP START1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (RATIONALP END2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (RATIONALP START2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (RATIONALP (LENGTH SEQ1))) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (RATIONALP END1)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (RATIONALP (LENGTH SEQ2))) (OR (NOT (NATP START1)) (NOT (NATP START2)) (NOT (NATP END1)) (NOT (NATP END2)) (< END1 START1) (< END2 START2) (< (LENGTH SEQ1) END1) (RATIONALP END2))))). [GC for 9010 CONS pages..(T=17).GC finished] [GC for 9020 CONS pages..(T=15).GC finished] [GC for 9030 CONS pages..(T=17).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.18 secs; see :DOC time-tracker-tau. But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition MEMBER-EQUAL, the :executable- counterparts of CAR, CDR, CONSP and EQUAL, primitive type reasoning and the :type-prescription rules LENGTH and STANDARD-CHAR-LISTP. Q.E.D. That completes the proof of the guard theorem for SEARCH-FN-GUARD. SEARCH-FN-GUARD is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION EQ) (:DEFINITION HARD-ERROR) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART HARD-ERROR) (:EXECUTABLE-COUNTERPART IF) (:EXECUTABLE-COUNTERPART SYMBOL-LISTP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION HARD-ERROR) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)) Time: 1.50 seconds (prove: 1.18, print: 0.01, other: 0.31) Prover steps counted: 1480 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.18 seconds. See :DOC time-tracker-tau. SEARCH-FN-GUARD For the admission of SEARCH-FROM-START we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (NFIX (+ 1 END2 (- START2))). The non-trivial part of the measure conjecture is Goal (AND (O-P (NFIX (+ 1 END2 (- START2)))) (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1))))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 (- (+ 1 START2)))) (NFIX (+ 1 END2 (- START2)))))). By the :executable-counterpart of UNARY-- and the simple :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END2 (- START2)))). [GC for 9040 CONS pages..(T=22).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (NOT (EQUAL SEQ1 (SUBSEQ SEQ2 START2 (+ START2 (LENGTH SEQ1))))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 -1 (- START2))) (NFIX (+ 1 END2 (- START2))))). This simplifies, using the :definitions FIX, LENGTH (if-intro), NFIX (if-intro), NOT (if-intro), O-FINP, O< (if-intro), SUBSEQ (if-intro), SUBSEQ-LIST and SYNP, the :executable-counterparts of BINARY-+ and NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0 and the :type- prescription rule LEN, to the following twelve conjectures. Subgoal 1.12 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.11 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.10 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.9 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.8 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.7 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.6 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN SEQ1)) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.5 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN SEQ1)) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.4 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ2) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN SEQ1)) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.3 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN SEQ1)) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN SEQ1)) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ2)) (NOT (STRINGP SEQ1)) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN SEQ1)) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for SEARCH-FROM-START. Thus, we admit this function under the principle of definition. We observe that the type of SEARCH-FROM-START is described by the theorem (OR (INTEGERP (SEARCH-FROM-START SEQ1 SEQ2 START2 END2)) (EQUAL (SEARCH-FROM-START SEQ1 SEQ2 START2 END2) NIL)). Computing the guard conjecture for SEARCH-FROM-START.... [GC for 9050 CONS pages..(T=18).GC finished] The non-trivial part of the guard conjecture for SEARCH-FROM-START, given primitive type reasoning and the :type-prescription rule LENGTH, is Goal (AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NULL BOUND2) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2)))))). [GC for 9060 CONS pages..(T=15).GC finished] [GC for 9070 CONS pages..(T=16).GC finished] [GC for 9080 CONS pages..(T=16).GC finished] [GC for 9080 CONS pages..(T=15).GC finished] [GC for 9080 CONS pages..(T=14).GC finished] [GC for 9080 CONS pages..(T=15).GC finished] [GC for 9080 CONS pages..(T=15).GC finished] By the simple :definition NULL and the simple :rewrite rule ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures. Subgoal 4 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9080 CONS pages..(T=14).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.06 secs; see :DOC time-tracker-tau. [GC for 9090 CONS pages..(T=16).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 4.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (NOT (EQUAL SEQ1 (TAKE (+ START2 (- START2) (LEN SEQ1)) (NTHCDR START2 SEQ2)))) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=16).GC finished] [GC for 9090 CONS pages..(T=15).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rules LEN and TRUE-LISTP-TAKE, to the following three conjectures. Subgoal 3.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=16).GC finished] [GC for 9090 CONS pages..(T=15).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 2.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (<= 0 START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (INTEGERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (NOT BOUND2) (<= START2 BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) BOUND2 (<= START2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP BOUND2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (RATIONALP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))) (EQUAL SEQ1 (SUBSEQ SEQ2 START2 BOUND2)) (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=16).GC finished] [GC for 9090 CONS pages..(T=15).GC finished] [GC for 9090 CONS pages..(T=15).GC finished] This simplifies, using the :definitions LENGTH, NOT (if-intro), SUBSEQ and SUBSEQ-LIST, the :executable-counterpart of NOT, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following three conjectures. Subgoal 1.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (EQUAL SEQ1 (COERCE (TAKE (+ START2 (- START2) (LEN (COERCE SEQ1 'LIST))) (NTHCDR START2 (COERCE SEQ2 'LIST))) 'STRING))) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for SEARCH-FROM-START. SEARCH-FROM-START is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION FIX) (:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:DEFINITION SUBSEQ) (:DEFINITION SUBSEQ-LIST) (:DEFINITION SYNP) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART UNARY--) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<) (:DEFINITION SUBSEQ)) Time: 3.18 seconds (prove: 2.72, print: 0.02, other: 0.44) Prover steps counted: 12127 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.70 seconds. See :DOC time-tracker-tau. SEARCH-FROM-START For the admission of SEARCH-FROM-END we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (NFIX (+ 1 END2 (- START2))). The non-trivial part of the measure conjecture is Goal (AND (O-P (NFIX (+ 1 END2 (- START2)))) (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 (- (+ 1 START2)))) (NFIX (+ 1 END2 (- START2)))))). By the :executable-counterpart of UNARY-- and the simple :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END2 (- START2)))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (AND (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2)))) (< (+ START2 (LENGTH SEQ1)) END2)) (O< (NFIX (+ 1 END2 -1 (- START2))) (NFIX (+ 1 END2 (- START2))))). [GC for 9090 CONS pages..(T=28).GC finished] This simplifies, using the :definitions FIX, LENGTH (if-intro), NFIX (if-intro), NOT (if-intro), O-FINP, O< (if-intro) and SYNP, the :executable- counterparts of BINARY-+ and NOT, primitive type reasoning and the :rewrite rules COMMUTATIVITY-2-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0, to the following six conjectures. Subgoal 1.6 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.5 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.4 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.3 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2)) (<= 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2) (< (+ END2 (- START2)) 0)) (< 0 (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP END2) (INTEGERP START2) (NOT (STRINGP SEQ1)) (< (+ START2 (LEN SEQ1)) END2) (<= 0 (+ END2 (- START2)))) (< (+ END2 (- START2)) (+ 1 END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for SEARCH-FROM-END. Thus, we admit this function under the principle of definition. We observe that the type of SEARCH-FROM-END is described by the theorem (OR (OR (INTEGERP (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC)) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) NIL)) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) ACC) (EQUAL (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 ACC) START2)). We used primitive type reasoning. Computing the guard conjecture for SEARCH-FROM-END.... The non-trivial part of the guard conjecture for SEARCH-FROM-END, given primitive type reasoning and the :type-prescription rule LENGTH, is Goal (AND (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))) (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (NULL BOUND2) (<= BOUND2 (LENGTH SEQ2))) (OR (NULL BOUND2) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ (+ 1 START2) (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2)))))). [GC for 9090 CONS pages..(T=27).GC finished] [GC for 9090 CONS pages..(T=20).GC finished] [GC for 9090 CONS pages..(T=21).GC finished] [GC for 9090 CONS pages..(T=19).GC finished] By the simple :definition NULL and the simple :rewrite rule ASSOCIATIVITY-OF-+ we reduce the conjecture to the following four conjectures. Subgoal 4 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=17).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.07 secs; see :DOC time-tracker-tau. This simplifies, using the :definitions LENGTH and NOT (if-intro), the :executable-counterpart of NOT, primitive type reasoning and the :type-prescription rule LEN, to the following three conjectures. Subgoal 4.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 4.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (TRUE-LISTP SEQ1) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=17).GC finished] This simplifies, using the :definitions LENGTH and NOT (if-intro), the :executable-counterpart of NOT, primitive type reasoning and the :type-prescription rule LEN, to the following three conjectures. Subgoal 3.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (TRUE-LISTP SEQ2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=16).GC finished] This simplifies, using the :definitions LENGTH and NOT (if-intro), the :executable-counterpart of NOT, primitive type reasoning and the :type-prescription rule LEN, to the following three conjectures. Subgoal 2.3 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= (+ START2 (LEN SEQ1)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.2 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1)) (<= START2 (+ START2 (LEN SEQ1)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2.1 (IMPLIES (AND (<= (+ START2 (LEN SEQ1)) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (TRUE-LISTP SEQ1) (< (+ START2 (LEN SEQ1)) END2)) (<= (+ 1 START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= (+ START2 (LENGTH SEQ1)) END2) (<= END2 (LENGTH SEQ2)) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (NOT (OR (NOT (INTEGERP END2)) (NOT (INTEGERP START2))))) (LET ((BOUND2 (+ START2 (LENGTH SEQ1)))) (AND (<= 0 START2) (INTEGERP START2) (OR (EQUAL BOUND2 NIL) (<= BOUND2 (LENGTH SEQ2))) (OR (EQUAL BOUND2 NIL) (INTEGERP BOUND2)) (OR (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (NOT BOUND2) (<= START2 BOUND2)) (OR BOUND2 (<= START2 (LENGTH SEQ2))) (RATIONALP BOUND2) (RATIONALP END2) (OR (<= END2 BOUND2) (ACL2-NUMBERP START2)) (OR (<= END2 BOUND2) (INTEGERP END2)) (OR (<= END2 BOUND2) (INTEGERP (+ 1 START2))) (OR (<= END2 BOUND2) (<= (+ 1 START2 (LENGTH SEQ1)) END2)) (OR (<= END2 BOUND2) (<= END2 (LENGTH SEQ2))) (OR (<= END2 BOUND2) (<= 0 (+ 1 START2))) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (<= END2 BOUND2) (TRUE-LISTP SEQ2) (STRINGP SEQ2))))). [GC for 9090 CONS pages..(T=15).GC finished] [GC for 9090 CONS pages..(T=16).GC finished] This simplifies, using the :definitions LENGTH and NOT (if-intro), the :executable-counterpart of NOT, primitive type reasoning and the :type-prescription rule LEN, to the following three conjectures. Subgoal 1.3 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1)) (<= START2 (+ START2 (LEN (COERCE SEQ1 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (<= (+ START2 (LEN (COERCE SEQ1 'LIST))) END2) (<= END2 (LEN (COERCE SEQ2 'LIST))) (INTEGERP END2) (<= 0 START2) (INTEGERP START2) (STRINGP SEQ2) (STRINGP SEQ1) (< (+ START2 (LEN (COERCE SEQ1 'LIST))) END2)) (<= (+ 1 START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for SEARCH-FROM-END. SEARCH-FROM-END is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION FIX) (:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:DEFINITION SYNP) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART UNARY--) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION LENGTH) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<)) Time: 2.31 seconds (prove: 2.00, print: 0.04, other: 0.27) Prover steps counted: 5163 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.40 seconds. See :DOC time-tracker-tau. SEARCH-FROM-END To verify that the 18 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1 (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (LEN X). This suggestion was produced using the :induction rules LEN and STRING-DOWNCASE1. If we let (:P X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P X)) (IMPLIES (AND (CONSP X) (:P (CDR X))) (:P X))). This induction is justified by the same argument used to admit LEN. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X))). But simplification reduces this to T, using the :definitions LEN and STRING-DOWNCASE1 and the :executable-counterparts of EQUAL and LEN. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (STRING-DOWNCASE1 (CDR X))) (LEN (CDR X)))) (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X))). But simplification reduces this to T, using the :definitions LEN and STRING-DOWNCASE1, primitive type reasoning, the :rewrite rule CDR-CONS and the :type-prescription rule STRING-DOWNCASE1. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-STRING-DOWNCASE1 ...) Rules: ((:DEFINITION LEN) (:DEFINITION STRING-DOWNCASE1) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART LEN) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION STRING-DOWNCASE1) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION STRING-DOWNCASE1)) Time: 0.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 190 LEN-STRING-DOWNCASE1 ACL2 !>>(LOCAL (DEFTHM STRINGP-SUBSEQ (IMPLIES (STRINGP STR) (STRINGP (SUBSEQ STR START END))))) ACL2 Warning [Non-rec] in ( DEFTHM STRINGP-SUBSEQ ...): A :REWRITE rule generated from STRINGP-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. But we reduce the conjecture to T, by the :type-prescription rule STRINGP-SUBSEQ-TYPE-PRESCRIPTION. Q.E.D. Summary Form: ( DEFTHM STRINGP-SUBSEQ ...) Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION)) Warnings: Non-rec Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) STRINGP-SUBSEQ ACL2 !>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-NTHCDR (IMPLIES (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP (NTHCDR N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9090 CONS pages..(T=17).GC finished] Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTHCDR N X). This suggestion was produced using the :induction rules NTHCDR and STANDARD-CHAR-LISTP. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit NTHCDR. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces three nontautological subgoals. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (STANDARD-CHAR-LISTP (NTHCDR (+ N -1) (CDR X))) (STANDARD-CHAR-LISTP X)) (STANDARD-CHAR-LISTP (NTHCDR N X))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions NTHCDR and STANDARD-CHAR-LISTP, the :executable-counterparts of CDR and CONSP, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule STANDARD-CHAR-LISTP, to Subgoal *1/3' (IMPLIES (AND (NOT (ZP N)) (STANDARD-CHAR-LISTP (NTHCDR (+ N -1) NIL)) (NOT X)) (STANDARD-CHAR-LISTP (NTHCDR (+ -1 N) NIL))). But simplification reduces this to T, using the :rewrite rule COMMUTATIVITY-OF-+. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (STANDARD-CHAR-LISTP (CDR X))) (STANDARD-CHAR-LISTP X)) (STANDARD-CHAR-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :definition STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP and STANDARD-CHAR-LISTP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (STANDARD-CHAR-LISTP X)) (STANDARD-CHAR-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions NTHCDR and STANDARD-CHAR-LISTP, the :executable-counterparts of CONSP and STANDARD-CHAR-LISTP, primitive type reasoning and the :type-prescription rules STANDARD-CHAR-LISTP and STANDARD-CHAR-P. That completes the proof of *1. Q.E.D. The storage of STANDARD-CHAR-LISTP-NTHCDR depends upon the :type-prescription rule STANDARD-CHAR-LISTP. Summary Form: ( DEFTHM STANDARD-CHAR-LISTP-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION NTHCDR) (:DEFINITION STANDARD-CHAR-LISTP) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION NTHCDR) (:INDUCTION STANDARD-CHAR-LISTP) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION STANDARD-CHAR-P)) Time: 0.17 seconds (prove: 0.17, print: 0.00, other: 0.00) Prover steps counted: 565 STANDARD-CHAR-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND (IMPLIES (AND (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) [Note: A hint was supplied for our processing of the goal above. Thanks!] Name the formula above *1. [GC for 9090 CONS pages..(T=17).GC finished] Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into two derived induction schemes. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X AC). This suggestion was produced using the :induction rules REVAPPEND and STANDARD-CHAR-LISTP. If we let (:P AC X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CONS (CAR X) AC) (CDR X))) (:P AC X)) (IMPLIES (ENDP X) (:P AC X))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable AC is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP X)) (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP X) (STANDARD-CHAR-LISTP (REVAPPEND (CDR X) (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definitions REVAPPEND and STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP X)) (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP X) (NOT (STANDARD-CHAR-LISTP (CONS (CAR X) AC))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definition STANDARD-CHAR-LISTP, primitive type reasoning, the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP, the :rewrite rules CAR-CONS and CDR-CONS and the :type-prescription rules ATOM-LISTP, CHARACTER-LISTP, EQLABLE-LISTP, STANDARD-CHAR-LISTP and STANDARD-CHAR-P. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (NOT (STANDARD-CHAR-LISTP (CDR X))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (NOT (STANDARD-CHAR-LISTP (CDR X))) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definition STANDARD-CHAR-LISTP. Subgoal *1/1 (IMPLIES (AND (ENDP X) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP X)) (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))). But simplification reduces this to T, using the :definitions REVAPPEND and STANDARD-CHAR-LISTP, the :executable-counterpart of CONSP, primitive type reasoning and the :type-prescription rule STANDARD-CHAR-LISTP. That completes the proof of *1. Q.E.D. The storage of STANDARD-CHAR-LISTP-REVAPPEND depends upon the :type- prescription rule STANDARD-CHAR-LISTP. Summary Form: ( DEFTHM STANDARD-CHAR-LISTP-REVAPPEND ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION REVAPPEND) (:DEFINITION STANDARD-CHAR-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP) (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP) (:FORWARD-CHAINING STANDARD-CHAR-LISTP-FORWARD-TO-CHARACTER-LISTP) (:INDUCTION REVAPPEND) (:INDUCTION STANDARD-CHAR-LISTP) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION ATOM-LISTP) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION STANDARD-CHAR-P)) Time: 0.18 seconds (prove: 0.18, print: 0.00, other: 0.00) Prover steps counted: 760 STANDARD-CHAR-LISTP-REVAPPEND ACL2 !>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE (IMPLIES (AND (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9090 CONS pages..(T=17).GC finished] Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. Subsumption reduces that number to two. These merge into one derived induction scheme. We will induct according to a scheme suggested by (TAKE N X). This suggestion was produced using the :induction rules LEN, STANDARD-CHAR-LISTP and TAKE. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit TAKE. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ZP N)) (STANDARD-CHAR-LISTP (TAKE (+ -1 N) (CDR X))) (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type- prescription rules STANDARD-CHAR-LISTP, STANDARD-CHAR-P and TRUE-LISTP-TAKE. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (< (LEN (CDR X)) (+ -1 N)) (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN and STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP and LEN, primitive type reasoning and the :type-prescription rule LEN. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (STANDARD-CHAR-LISTP (CDR X))) (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))). But simplification reduces this to T, using the :definition STANDARD-CHAR-LISTP, the :executable-counterparts of CDR, CONSP, LEN and STANDARD-CHAR-LISTP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, STANDARD-CHAR-LISTP and TAKE, the :executable-counterparts of CONSP, LEN and STANDARD-CHAR-LISTP and primitive type reasoning. That completes the proof of *1. Q.E.D. The storage of STANDARD-CHAR-LISTP-OF-TAKE depends upon the :type- prescription rule STANDARD-CHAR-LISTP. Summary Form: ( DEFTHM STANDARD-CHAR-LISTP-OF-TAKE ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION LEN) (:DEFINITION NOT) (:DEFINITION STANDARD-CHAR-LISTP) (:DEFINITION TAKE) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART LEN) (:EXECUTABLE-COUNTERPART STANDARD-CHAR-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION STANDARD-CHAR-LISTP) (:INDUCTION TAKE) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION STANDARD-CHAR-P) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Time: 0.18 seconds (prove: 0.18, print: 0.00, other: 0.00) Prover steps counted: 587 STANDARD-CHAR-LISTP-OF-TAKE ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))))) [GC for 9090 CONS pages..(T=18).GC finished] Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (TAKE N X). This suggestion was produced using the :induction rules CHARACTER-LISTP, LEN and TAKE. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ -1 N) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit TAKE. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (TAKE (+ -1 N) (CDR X))) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN and TAKE, the :executable-counterparts of CDR, CONSP and LEN, primitive type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type- prescription rules CHARACTER-LISTP and TRUE-LISTP-TAKE. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (< (LEN (CDR X)) (+ -1 N)) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and LEN, the :executable-counterparts of CDR, CONSP and LEN, primitive type reasoning and the :type-prescription rule LEN. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (CHARACTER-LISTP (CDR X))) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). But simplification reduces this to T, using the :definition CHARACTER-LISTP, the :executable-counterparts of CDR, CHARACTER-LISTP, CONSP and LEN and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, LEN and TAKE, the :executable-counterparts of CHARACTER-LISTP, CONSP and LEN and primitive type reasoning. That completes the proof of *1. Q.E.D. The storage of CHARACTER-LISTP-OF-TAKE depends upon the :type-prescription rule CHARACTER-LISTP. Summary Form: ( DEFTHM CHARACTER-LISTP-OF-TAKE ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION LEN) (:DEFINITION NOT) (:DEFINITION TAKE) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART LEN) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION CHARACTER-LISTP) (:INDUCTION LEN) (:INDUCTION TAKE) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Time: 0.18 seconds (prove: 0.18, print: 0.00, other: 0.00) Prover steps counted: 532 CHARACTER-LISTP-OF-TAKE ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTHCDR N X). This suggestion was produced using the :induction rules CHARACTER-LISTP and NTHCDR. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit NTHCDR. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces three nontautological subgoals. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CDR and CONSP, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule CHARACTER-LISTP, to Subgoal *1/3' (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) NIL)) (NOT X)) (CHARACTER-LISTP (NTHCDR (+ -1 N) NIL))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (CHARACTER-LISTP (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :definition CHARACTER-LISTP, the :executable-counterparts of CDR, CHARACTER-LISTP and CONSP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CHARACTER-LISTP and CONSP, primitive type reasoning and the :type-prescription rule CHARACTER-LISTP. That completes the proof of *1. Q.E.D. The storage of CHARACTER-LISTP-NTHCDR depends upon the :type-prescription rule CHARACTER-LISTP. Summary Form: ( DEFTHM CHARACTER-LISTP-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION CHARACTER-LISTP) (:INDUCTION NTHCDR) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION CHARACTER-LISTP)) Time: 0.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 447 CHARACTER-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL))) By case analysis we reduce the conjecture to Goal' (NOT (NTHCDR N NIL)). Name the formula above *1. Perhaps we can prove *1 by induction. One induction scheme is suggested by this conjecture. We will induct according to a scheme suggested by (NTHCDR N NIL). This suggestion was produced using the :induction rule NTHCDR. If we let (:P N) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1))) (:P N)) (IMPLIES (ZP N) (:P N))). This induction is justified by the same argument used to admit NTHCDR. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (NTHCDR (+ N -1) NIL))) (NOT (NTHCDR N NIL))). [GC for 9090 CONS pages..(T=16).GC finished] But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR. Subgoal *1/1 (IMPLIES (ZP N) (NOT (NTHCDR N NIL))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and the :definition NTHCDR. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM NTHCDR-NIL ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:INDUCTION NTHCDR)) Time: 0.16 seconds (prove: 0.16, print: 0.00, other: 0.00) Prover steps counted: 135 NTHCDR-NIL ACL2 !>>(LOCAL (DEFTHM LEN-NTHCDR (EQUAL (LEN (NTHCDR N X)) (NFIX (- (LEN X) (NFIX N)))))) This simplifies, using the :definition NFIX (if-intro), to the following three conjectures. Subgoal 3 (IMPLIES (NOT (INTEGERP N)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) 0)))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, NFIX and NTHCDR, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal 2 (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- N))))). This simplifies, using the :definition NFIX (if-intro), primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule LEN, to the following two conjectures. Subgoal 2.2 (IMPLIES (AND (INTEGERP N) (<= 0 N) (< (+ (- N) (LEN X)) 0)) (EQUAL (LEN (NTHCDR N X)) 0)). Name the formula above *1. Subgoal 2.1 (IMPLIES (AND (INTEGERP N) (<= 0 N) (<= 0 (+ (- N) (LEN X)))) (EQUAL (LEN (NTHCDR N X)) (+ (- N) (LEN X)))). Normally we would attempt to prove Subgoal 2.1 by induction. However, we prefer in this instance to focus on the original input conjecture rather than this simplified special case. We therefore abandon our previous work on this conjecture and reassign the name *1 to the original conjecture. (See :DOC otf-flg.) Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (LEN X), but modified to accommodate (NTHCDR N X). These suggestions were produced using the :induction rules LEN and NTHCDR. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P N X)) (IMPLIES (AND (CONSP X) (:P (+ N -1) (CDR X))) (:P N X))). This induction is justified by the same argument used to admit LEN. Note, however, that the unmeasured variable N is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- (NFIX N)))))). This simplifies, using the :definitions FIX (if-intro), LEN, NFIX (if- intro) and NTHCDR (if-intro), primitive type reasoning and the :rewrite rule UNICITY-OF-0, to the following two conjectures. Subgoal *1/2.2 (IMPLIES (AND (NOT (CONSP X)) (ZP N)) (EQUAL (LEN X) 0)). But simplification reduces this to T, using the :definition LEN and the :executable-counterpart of EQUAL. Subgoal *1/2.1 (IMPLIES (AND (NOT (CONSP X)) (NOT (ZP N))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) 0)). But simplification reduces this to T, using the :executable-counterparts of EQUAL and LEN and the :rewrite rules COMMUTATIVITY-OF-+, DEFAULT-CDR and NTHCDR-NIL. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (NFIX (+ N -1))))))) (EQUAL (LEN (NTHCDR N X)) (NFIX (+ (LEN X) (- (NFIX N)))))). [GC for 9090 CONS pages..(T=17).GC finished] This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions LEN, NFIX (if-intro), NTHCDR (if-intro) and SYNP, the :executable-counterparts of BINARY-+ and UNARY--, primitive type reasoning, the :rewrite rules ASSOCIATIVITY-OF-+, COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+ and the :type-prescription rule LEN, to the following eight conjectures. Subgoal *1/1.8 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (+ -1 N))))) (< (+ 1 (- N) (LEN (CDR X))) 0)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) 0)). By the :executable-counterpart of UNARY-- and the simple :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to Subgoal *1/1.8' (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 1 (- N)))) (< (+ 1 (- N) (LEN (CDR X))) 0)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) 0)). But simplification reduces this to T, using the :definition NFIX, the :executable-counterpart of EQUAL, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rule LEN. Subgoal *1/1.7 (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) (- (+ -1 N))))) (<= 0 (+ 1 (- N) (LEN (CDR X))))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (+ 1 (- N) (LEN (CDR X))))). By the :executable-counterpart of UNARY-- and the simple :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to Subgoal *1/1.7' (IMPLIES (AND (CONSP X) (INTEGERP (+ -1 N)) (<= 0 (+ -1 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 1 (- N)))) (<= 0 (+ 1 (- N) (LEN (CDR X))))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (+ 1 (- N) (LEN (CDR X))))). But simplification reduces this to T, using the :definition NFIX, primitive type reasoning, the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+ and the :type-prescription rule LEN. Subgoal *1/1.6 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (NOT (INTEGERP N))) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.5 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (NOT (INTEGERP N))) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) 0)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.4 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) (- N))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.3 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (INTEGERP N) (<= 0 N)) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) (- N))))). [GC for 9090 CONS pages..(T=16).GC finished] This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :executable-counterparts of <, BINARY-+, INTEGERP, NOT, UNARY-- and ZP and linear arithmetic, to Subgoal *1/1.3' (IMPLIES (AND (CONSP X) (EQUAL (LEN (NTHCDR -1 (CDR X))) (NFIX (+ (LEN (CDR X)) 0)))) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). But simplification reduces this to T, using the :definitions FIX, LEN, NFIX and NTHCDR, the :executable-counterpart of ZP, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.2 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (ZP N) (< N 0)) (EQUAL (LEN X) (NFIX (+ 1 (LEN (CDR X)) 0)))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN and NFIX, primitive type reasoning, the :rewrite rules COMMUTATIVITY-OF-+ and UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1.1 (IMPLIES (AND (CONSP X) (< (+ -1 N) 0) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ (LEN (CDR X)) 0))) (NOT (ZP N)) (< N 0)) (EQUAL (LEN (NTHCDR (+ N -1) (CDR X))) (NFIX (+ 1 (LEN (CDR X)) 0)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION FIX) (:DEFINITION LEN) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:DEFINITION SYNP) (:EXECUTABLE-COUNTERPART <) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART INTEGERP) (:EXECUTABLE-COUNTERPART LEN) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART UNARY--) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION NTHCDR) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE DEFAULT-CDR) (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE NTHCDR-NIL) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION FIX) (:DEFINITION NFIX) (:DEFINITION NTHCDR)) Time: 0.35 seconds (prove: 0.33, print: 0.02, other: 0.00) Prover steps counted: 2644 LEN-NTHCDR ACL2 !>>(LOCAL (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))))) ACL2 Warning [Non-rec] in ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ...): A :REWRITE rule generated from SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))). This simplifies, using the :definitions LENGTH, SUBSEQ and SUBSEQ-LIST, to Goal'' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (COERCE (TAKE (+ END (- START)) (NTHCDR START (COERCE SEQ 'LIST))) 'STRING) 'LIST))). [GC for 9090 CONS pages..(T=16).GC finished] But simplification reduces this to T, using the :definition NFIX, linear arithmetic, primitive type reasoning, the :forward-chaining rule CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR, CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR, STANDARD-CHAR-LISTP-NTHCDR and STANDARD-CHAR-LISTP-OF-TAKE and the :type-prescription rules CHARACTER-LISTP, LEN and STANDARD-CHAR-LISTP. Q.E.D. The storage of SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP depends upon the :type-prescription rule STANDARD-CHAR-LISTP. Summary Form: ( DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ...) Rules: ((:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION SUBSEQ) (:DEFINITION SUBSEQ-LIST) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CHARACTER-LISTP-COERCE) (:REWRITE CHARACTER-LISTP-NTHCDR) (:REWRITE CHARACTER-LISTP-OF-TAKE) (:REWRITE COERCE-INVERSE-1) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE LEN-NTHCDR) (:REWRITE STANDARD-CHAR-LISTP-NTHCDR) (:REWRITE STANDARD-CHAR-LISTP-OF-TAKE) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)) Warnings: Non-rec Time: 0.17 seconds (prove: 0.16, print: 0.01, other: 0.00) Prover steps counted: 582 SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X Y). This suggestion was produced using the :induction rule REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y)) (IMPLIES (ENDP X) (:P X Y))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). But simplification reduces this to T, using the :definitions REVAPPEND and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS. Subgoal *1/1 (IMPLIES (ENDP X) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (NOT (CONSP X)) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). But simplification reduces this to T, using the :definition REVAPPEND and primitive type reasoning. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM TRUE-LISTP-REVAPPEND ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION REVAPPEND) (:DEFINITION TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION REVAPPEND) (:REWRITE CDR-CONS)) Time: 0.01 seconds (prove: 0.00, print: 0.01, other: 0.00) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-NTHCDR ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in ( DEFTHM TRUE-LISTP-SUBSEQ ...): Our heuristics choose (SUBSEQ SEQ START END) as the :TYPED-TERM. ACL2 Warning [Non-rec] in ( DEFTHM TRUE-LISTP-SUBSEQ ...): A :REWRITE rule generated from TRUE-LISTP-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-SUBSEQ depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-SUBSEQ ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION)) Warnings: Non-rec Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-SUBSEQ ACL2 !>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into two derived induction schemes. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (LEN X), but modified to accommodate (REVAPPEND X Y). These suggestions were produced using the :induction rules LEN and REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P X Y)) (IMPLIES (AND (CONSP X) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y))). This induction is justified by the same argument used to admit LEN. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y)))). But simplification reduces this to T, using the :definitions FIX, LEN and REVAPPEND, primitive type reasoning, the :rewrite rule UNICITY-OF-0 and the :type-prescription rule LEN. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (REVAPPEND (CDR X) (CONS (CAR X) Y))) (+ (LEN (CDR X)) (LEN (CONS (CAR X) Y))))) (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y)))). [GC for 9090 CONS pages..(T=16).GC finished] But simplification reduces this to T, using the :definitions LEN and REVAPPEND, primitive type reasoning and the :rewrite rules CDR-CONS, COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-REVAPPEND ...) Rules: ((:DEFINITION FIX) (:DEFINITION LEN) (:DEFINITION REVAPPEND) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION REVAPPEND) (:REWRITE CDR-CONS) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION LEN)) Time: 0.16 seconds (prove: 0.16, print: 0.00, other: 0.00) Prover steps counted: 331 LEN-REVAPPEND ACL2 !>>(LOCAL (DEFTHM LEN-OF-TAKE (EQUAL (LEN (TAKE N LST)) (NFIX N)))) This simplifies, using the :definition NFIX (if-intro), to the following three conjectures. Subgoal 3 (IMPLIES (NOT (INTEGERP N)) (EQUAL (LEN (TAKE N LST)) 0)). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable- counterparts of EQUAL and LEN. Subgoal 2 (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). Name the formula above *1. Subgoal 1 (IMPLIES (< N 0) (EQUAL (LEN (TAKE N LST)) 0)). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definition TAKE and the :executable- counterparts of EQUAL and LEN. So we now return to *1, which is (IMPLIES (AND (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). Perhaps we can prove *1 by induction. One induction scheme is suggested by this conjecture. We will induct according to a scheme suggested by (TAKE N LST). This suggestion was produced using the :induction rule TAKE. If we let (:P LST N) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (CDR LST) (+ -1 N))) (:P LST N)) (IMPLIES (ZP N) (:P LST N))). This induction is justified by the same argument used to admit TAKE. Note, however, that the unmeasured variable LST is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ZP N)) (EQUAL (LEN (TAKE (+ -1 N) (CDR LST))) (+ -1 N)) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions FIX, LEN, SYNP and TAKE, the :executable-counterpart of BINARY-+, primitive type reasoning, the :rewrite rules CDR-CONS, FOLD-CONSTS-IN-+ and UNICITY-OF-0 and the :type-prescription rule TRUE-LISTP-TAKE. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (< (+ -1 N) 0) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). But we reduce the conjecture to T, by the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER and primitive type reasoning. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (INTEGERP (+ -1 N))) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). But we reduce the conjecture to T, by the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER. Subgoal *1/1 (IMPLIES (AND (ZP N) (INTEGERP N) (<= 0 N)) (EQUAL (LEN (TAKE N LST)) N)). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :executable-counterparts of <, INTEGERP, NOT and ZP and linear arithmetic, to Subgoal *1/1' (EQUAL (LEN (TAKE 0 LST)) 0). But simplification reduces this to T, using the :definition TAKE and the :executable-counterparts of EQUAL, LEN and ZP. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-OF-TAKE ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION FIX) (:DEFINITION LEN) (:DEFINITION NFIX) (:DEFINITION SYNP) (:DEFINITION TAKE) (:EXECUTABLE-COUNTERPART <) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART INTEGERP) (:EXECUTABLE-COUNTERPART LEN) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION TAKE) (:REWRITE CDR-CONS) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION TRUE-LISTP-TAKE)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION NFIX)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) Prover steps counted: 380 LEN-OF-TAKE ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ (IMPLIES (AND (TRUE-LISTP SEQ) (NATP START) (NATP END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (- END START))))) ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ ...): A :REWRITE rule generated from LEN-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (TRUE-LISTP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (+ END (- START)))). This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST, primitive type reasoning and the :rewrite rule LEN-OF-TAKE, to Goal'' (IMPLIES (AND (TRUE-LISTP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (< (+ END (- START)) 0)) (EQUAL 0 (+ END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. Summary Form: ( DEFTHM LEN-SUBSEQ ...) Rules: ((:DEFINITION NATP) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION SUBSEQ) (:DEFINITION SUBSEQ-LIST) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE LEN-OF-TAKE)) Warnings: Non-rec Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) Prover steps counted: 286 LEN-SUBSEQ ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ-STRING (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (- END START))) :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ))))) ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ-STRING ...): A :REWRITE rule generated from LEN-SUBSEQ-STRING will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9090 CONS pages..(T=16).GC finished] By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (+ END (- START)))). This simplifies, using the :definitions NFIX, SUBSEQ and SUBSEQ-LIST, linear arithmetic, primitive type reasoning, the :forward-chaining rule CHARACTER-LISTP-COERCE, the :rewrite rules CHARACTER-LISTP-NTHCDR, CHARACTER-LISTP-OF-TAKE, COERCE-INVERSE-1, COMMUTATIVITY-OF-+, LEN-NTHCDR and LEN-OF-TAKE and the :type-prescription rules CHARACTER-LISTP and LEN, to Goal'' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST))) (< (+ END (- START)) 0)) (EQUAL 0 (+ END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. Summary Form: ( DEFTHM LEN-SUBSEQ-STRING ...) Rules: ((:DEFINITION NATP) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION SUBSEQ) (:DEFINITION SUBSEQ-LIST) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CHARACTER-LISTP-COERCE) (:REWRITE CHARACTER-LISTP-NTHCDR) (:REWRITE CHARACTER-LISTP-OF-TAKE) (:REWRITE COERCE-INVERSE-1) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE LEN-NTHCDR) (:REWRITE LEN-OF-TAKE) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION LEN)) Warnings: Non-rec Time: 0.17 seconds (prove: 0.16, print: 0.01, other: 0.00) Prover steps counted: 384 LEN-SUBSEQ-STRING ACL2 !>>(DEFUN SEARCH-FN (SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (DECLARE (XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ))))) (LET* ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2))) (SEQ1 (SUBSEQ SEQ1 START1 END1))) (MV-LET (SEQ1 SEQ2) (COND ((EQ TEST 'CHAR-EQUAL) (MV (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2))) (T (MV SEQ1 SEQ2))) (AND (<= (- END1 START1) (- END2 START2)) (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL)) (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))))))) Since SEARCH-FN is non-recursive, its admission is trivial. We observe that the type of SEARCH-FN is described by the theorem (OR (OR (INTEGERP (SEARCH-FN SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P)) (EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) NIL)) (EQUAL (SEARCH-FN SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) START2)). We used the :type-prescription rules SEARCH-FROM-END and SEARCH-FROM-START. Computing the guard conjecture for SEARCH-FN.... The non-trivial part of the guard conjecture for SEARCH-FN is Goal (AND (IMPLIES (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))) (AND (OR END2P (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (LET ((END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (<= 0 START1) (INTEGERP START1) (OR (NULL END1) (<= END1 (LENGTH SEQ1))) (OR (NULL END1) (INTEGERP END1)) (OR (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (NOT END1) (<= START1 END1)) (OR END1 (<= START1 (LENGTH SEQ1))) (LET ((SEQ1 (SUBSEQ SEQ1 START1 END1))) (AND (OR (NOT (EQ TEST 'CHAR-EQUAL)) (STRINGP SEQ1)) (OR (NOT (EQ TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))) (OR (NOT (EQ TEST 'CHAR-EQUAL)) (STRINGP SEQ2)) (OR (NOT (EQ TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (MV-LET (SEQ1 SEQ2) (IF (EQ TEST 'CHAR-EQUAL) (MV (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2)) (MV SEQ1 SEQ2)) (AND (ACL2-NUMBERP START2) (ACL2-NUMBERP END2) (ACL2-NUMBERP (- START2)) (ACL2-NUMBERP START1) (ACL2-NUMBERP END1) (ACL2-NUMBERP (- START1)) (RATIONALP (+ END2 (- START2))) (RATIONALP (+ END1 (- START1))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))))))) (IMPLIES (AND (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (NOT END1P) (NOT (TRUE-LISTP SEQ1))) (STRINGP SEQ1))). [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9090 CONS pages..(T=17).GC finished] [GC for 9090 CONS pages..(T=16).GC finished] [GC for 9100 CONS pages..(T=16).GC finished] By the simple :definitions EQ, NULL, SEARCH-FN-GUARD and STRING-DOWNCASE and the :executable-counterpart of TAU-SYSTEM we reduce the conjecture to Goal' (IMPLIES (AND (MEMBER-EQUAL TEST '(EQUAL CHAR-EQUAL)) (COND ((STRINGP SEQ1) (AND (STRINGP SEQ2) (COND ((EQUAL TEST 'EQUAL) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) ((STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (AND (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))))) (T NIL)))) ((EQUAL TEST 'CHAR-EQUAL) NIL) ((TRUE-LISTP SEQ1) (AND (TRUE-LISTP SEQ2) (LET ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))))) (T NIL))) (LET ((END1 (IF END1P END1 (LENGTH SEQ1)))) (AND (OR END2P (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (LET ((END2 (IF END2P END2 (LENGTH SEQ2)))) (AND (<= 0 START1) (INTEGERP START1) (OR (EQUAL END1 NIL) (<= END1 (LENGTH SEQ1))) (OR (EQUAL END1 NIL) (INTEGERP END1)) (OR (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (NOT END1) (<= START1 END1)) (OR END1 (<= START1 (LENGTH SEQ1))) (LET ((SEQ1 (SUBSEQ SEQ1 START1 END1))) (AND (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STRINGP SEQ1)) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST))) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STRINGP SEQ2)) (OR (NOT (EQUAL TEST 'CHAR-EQUAL)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST))) (MV-LET (SEQ1 SEQ2) (IF (EQUAL TEST 'CHAR-EQUAL) (MV (COERCE (STRING-DOWNCASE1 (COERCE SEQ1 'LIST)) 'STRING) (COERCE (STRING-DOWNCASE1 (COERCE SEQ2 'LIST)) 'STRING)) (MV SEQ1 SEQ2)) (AND (ACL2-NUMBERP START2) (ACL2-NUMBERP END2) (ACL2-NUMBERP (- START2)) (ACL2-NUMBERP START1) (ACL2-NUMBERP END1) (ACL2-NUMBERP (- START1)) (RATIONALP (+ END2 (- START2))) (RATIONALP (+ END1 (- START1))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) (NOT FROM-END) (TRUE-LISTP SEQ2) (STRINGP SEQ2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (INTEGERP START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= (+ START2 (LENGTH SEQ1)) END2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= END2 (LENGTH SEQ2))) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (<= 0 START2)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ1) (STRINGP SEQ1)) (OR (< (+ END2 (- START2)) (+ END1 (- START1))) FROM-END (TRUE-LISTP SEQ2) (STRINGP SEQ2))))))))))). [GC for 9110 CONS pages..(T=16).GC finished] [GC for 9110 CONS pages..(T=16).GC finished] [GC for 9110 CONS pages..(T=15).GC finished] [GC for 9110 CONS pages..(T=15).GC finished] [GC for 9110 CONS pages..(T=16).GC finished] [GC for 9110 CONS pages..(T=16).GC finished] [GC for 9110 CONS pages..(T=16).GC finished] [GC for 9120 CONS pages..(T=16).GC finished] [GC for 9120 CONS pages..(T=17).GC finished] [GC for 9120 CONS pages..(T=17).GC finished] [GC for 9120 CONS pages..(T=16).GC finished] [GC for 9120 CONS pages..(T=16).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH, MEMBER-EQUAL (if-intro), MV-NTH and NOT (if- intro), the :executable-counterparts of ACL2-NUMBERP, CAR, CDR, CONSP, EQUAL and NOT, linear arithmetic, primitive type reasoning, the :rewrite rules CHARACTER-LISTP-STRING-DOWNCASE-1, COERCE-INVERSE-1, COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+, LEN-STRING-DOWNCASE1, LEN-SUBSEQ, LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rules LEN, STANDARD-CHAR-LISTP, STRINGP-SUBSEQ-TYPE-PRESCRIPTION and TRUE-LISTP-SUBSEQ, to the following 183 conjectures. Subgoal 183 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 182 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 181 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 180 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 179 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 178 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 177 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 176 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 175 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 175' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=17).GC finished] But simplification reduces this to T, using the :definition LENGTH. Subgoal 174 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). By the simple :definition NATP we reduce the conjecture to Subgoal 174' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING, to Subgoal 174'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= END2 (LEN (COERCE SEQ2 'LIST))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ END1 (- START1) START2) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 173 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 172 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 171 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 170 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 169 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). [GC for 9120 CONS pages..(T=16).GC finished] But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 168 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 167 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 166 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 165 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 164 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 164' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 163 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 162 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 161 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 160 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 159 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 158 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 157 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 156 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 155 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 154 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 153 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). [GC for 9120 CONS pages..(T=16).GC finished] But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 152 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= (+ (- START1) START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 151 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 151' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP (LEN (COERCE SEQ1 'LIST))) (<= 0 (LEN (COERCE SEQ1 'LIST))) (INTEGERP END2) (<= 0 END2) (<= START1 (LEN (COERCE SEQ1 'LIST))) (<= START2 END2) (<= (LEN (COERCE SEQ1 'LIST)) (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 150 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 149 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 148 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 147 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). [GC for 9120 CONS pages..(T=17).GC finished] But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 146 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 145 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 144 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 143 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 142 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 141 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 141' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN (COERCE SEQ2 'LIST))) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LENGTH SEQ1)) (<= (LEN (COERCE SEQ2 'LIST)) (LENGTH SEQ2)) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 140 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 139 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 138 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 137 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 136 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 135 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=15).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 135' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN (COERCE SEQ2 'LIST))) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LENGTH SEQ1)) (<= (LEN (COERCE SEQ2 'LIST)) (LENGTH SEQ2)) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (LEN (COERCE SEQ2 'LIST)))). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to Subgoal 135'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ END1 (- START1) START2) (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 134 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. [GC for 9120 CONS pages..(T=16).GC finished] Subgoal 133 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 132 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 131 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 130 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 129 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 128 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 127 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 126 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 125 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 124 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 123 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ (- START1) START2 (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 122 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 121 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 120 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 119 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 118 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 117 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 116 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 115 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 114 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). [GC for 9120 CONS pages..(T=15).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 114' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 113 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) END2)). By the simple :definition NATP we reduce the conjecture to Subgoal 113' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) END2)). [GC for 9120 CONS pages..(T=16).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and LEN-SUBSEQ, to Subgoal 113'' (IMPLIES (AND (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN SEQ1)) (<= END2 (LEN SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ END1 (- START1) START2) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 112 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 111 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 110 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 109 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 108 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN SEQ1))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 107 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 106 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 105 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 104 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 103 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN SEQ1))). By the simple :definition NATP we reduce the conjecture to Subgoal 103' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) END1) (<= END1 (LEN SEQ1))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 102 [GC for 9120 CONS pages..(T=18).GC finished] (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 NIL))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 101 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 100 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 99 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 98 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 97 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 96 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 95 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 94 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN SEQ1) (LEN SEQ1))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 93 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 92 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 91 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= (+ (- START1) START2 (LEN SEQ1)) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 90 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). By the simple :definition NATP we reduce the conjecture to Subgoal 90' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP (LEN SEQ1)) (<= 0 (LEN SEQ1)) (INTEGERP END2) (<= 0 END2) (<= START1 (LEN SEQ1)) (<= START2 END2) (<= (LEN SEQ1) (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). [GC for 9120 CONS pages..(T=17).GC finished] But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 89 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 88 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 87 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 86 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 85 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 84 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 83 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN SEQ1))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 82 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ (- START2) (LEN SEQ2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 81 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 80 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN SEQ1))). By the simple :definition NATP we reduce the conjecture to Subgoal 80' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN SEQ2)) (<= 0 (LEN SEQ2)) (<= START1 END1) (<= START2 (LEN SEQ2)) (<= END1 (LENGTH SEQ1)) (<= (LEN SEQ2) (LENGTH SEQ2)) END1) (<= END1 (LEN SEQ1))). But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 79 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 78 [GC for 9120 CONS pages..(T=16).GC finished] (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 77 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 76 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 75 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (LEN SEQ2) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 74 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) (LEN SEQ2))). By the simple :definition NATP we reduce the conjecture to Subgoal 74' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN SEQ2)) (<= 0 (LEN SEQ2)) (<= START1 END1) (<= START2 (LEN SEQ2)) (<= END1 (LENGTH SEQ1)) (<= (LEN SEQ2) (LENGTH SEQ2)) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) (LEN SEQ2))). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and LEN-SUBSEQ and the :type-prescription rule LEN, to Subgoal 74'' (IMPLIES (AND (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN SEQ2)) (<= START1 END1) (<= START2 (LEN SEQ2)) (<= END1 (LEN SEQ1)) (<= (LEN SEQ2) (LEN SEQ2)) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (+ END1 (- START1) START2) (LEN SEQ2))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 73 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (RATIONALP (+ (- START2) (LEN SEQ2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 72 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (ACL2-NUMBERP START2)). [GC for 9120 CONS pages..(T=15).GC finished] But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 71 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2)) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 70 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 69 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 68 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN SEQ2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 67 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN SEQ1) (LEN SEQ1))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 66 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 65 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 64 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 63 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= (LEN SEQ2) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 62 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) (NOT END2P) (LET ((END1 (LEN SEQ1)) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ (- START2) (LEN SEQ2)))) (<= (+ (- START1) START2 (LEN SEQ1)) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 61 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 60 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 59 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 58 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 58' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). [GC for 9120 CONS pages..(T=16).GC finished] But simplification reduces this to T, using the :definition LENGTH. Subgoal 57 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 56 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 55 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 54 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 53 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 52 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 51 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 50 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 49 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 48 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 47 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 46 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 45 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 44 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). By the simple :definition NATP we reduce the conjecture to Subgoal 44' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). [GC for 9120 CONS pages..(T=15).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP. Subgoal 43 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 42 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 41 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 40 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 39 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 38 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 37 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). [GC for 9120 CONS pages..(T=16).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 37' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+, LEN-SUBSEQ-STRING and SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP, to Subgoal 37'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= END2 (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ END1 (- START1) START2) END2)). But simplification reduces this to T, using linear arithmetic and primitive type reasoning. Subgoal 36 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=17).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.11 secs; see :DOC time-tracker-tau. By the simple :definition NATP we reduce the conjecture to Subgoal 36' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 35 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 34 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 33 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 32 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 31 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). [GC for 9120 CONS pages..(T=17).GC finished] But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 30 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 29 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 28 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= (+ (- START1) START2 (LEN (COERCE SEQ1 'LIST))) END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 27 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 27' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP (LEN (COERCE SEQ1 'LIST))) (<= 0 (LEN (COERCE SEQ1 'LIST))) (INTEGERP END2) (<= 0 END2) (<= START1 (LEN (COERCE SEQ1 'LIST))) (<= START2 END2) (<= (LEN (COERCE SEQ1 'LIST)) (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=16).GC finished] But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 26 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 25 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 24 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 23 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 22 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). By the simple :definition NATP we reduce the conjecture to Subgoal 22' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN (COERCE SEQ2 'LIST))) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LENGTH SEQ1)) (<= (LEN (COERCE SEQ2 'LIST)) (LENGTH SEQ2))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). [GC for 9120 CONS pages..(T=19).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rules LEN and STANDARD-CHAR-LISTP. Subgoal 21 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 20 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 19 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 18 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 17 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 16 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 15 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 14 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 14' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN (COERCE SEQ2 'LIST))) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LENGTH SEQ1)) (<= (LEN (COERCE SEQ2 'LIST)) (LENGTH SEQ2)) END1) (<= END1 (LEN (COERCE SEQ1 'LIST)))). [GC for 9120 CONS pages..(T=18).GC finished] But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 13 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 12 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 11 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 10 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (LEN (COERCE SEQ2 'LIST)))). By the simple :definition NATP we reduce the conjecture to Subgoal 10' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P (NOT END2P) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP (LEN (COERCE SEQ2 'LIST))) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LENGTH SEQ1)) (<= (LEN (COERCE SEQ2 'LIST)) (LENGTH SEQ2)) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=18).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and LEN-SUBSEQ-STRING and the :type-prescription rule LEN, to Subgoal 10'' (IMPLIES (AND (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (<= 0 (LEN (COERCE SEQ2 'LIST))) (<= START1 END1) (<= START2 (LEN (COERCE SEQ2 'LIST))) (<= END1 (LEN (COERCE SEQ1 'LIST))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST))) (<= (+ END1 (- START1)) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ END1 (- START1) START2) (LEN (COERCE SEQ2 'LIST)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule LEN. Subgoal 9 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 8 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 7 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ (- START2) (LEN (COERCE SEQ2 'LIST))))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 6 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 5 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 4 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 3 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 2 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (LEN (COERCE SEQ2 'LIST)) (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) (NOT END1P) (NOT END2P) (LET ((END1 (LEN (COERCE SEQ1 'LIST))) (END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ (- START2) (LEN (COERCE SEQ2 'LIST))))) (<= (+ (- START1) START2 (LEN (COERCE SEQ1 'LIST))) (LEN (COERCE SEQ2 'LIST)))). [GC for 9120 CONS pages..(T=21).GC finished] But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the guard theorem for SEARCH-FN. SEARCH-FN is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION EQ) (:DEFINITION LENGTH) (:DEFINITION MEMBER-EQUAL) (:DEFINITION MV-NTH) (:DEFINITION NATP) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION SEARCH-FN-GUARD) (:DEFINITION STRING-DOWNCASE) (:EXECUTABLE-COUNTERPART ACL2-NUMBERP) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART NATP) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE CHARACTER-LISTP-STRING-DOWNCASE-1) (:REWRITE COERCE-INVERSE-1) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE LEN-STRING-DOWNCASE1) (:REWRITE LEN-SUBSEQ) (:REWRITE LEN-SUBSEQ-STRING) (:REWRITE SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION SEARCH-FROM-END) (:TYPE-PRESCRIPTION SEARCH-FROM-START) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP) (:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION) (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT)) Time: 6.54 seconds (prove: 5.73, print: 0.57, other: 0.24) Prover steps counted: 63983 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.50 seconds. See :DOC time-tracker-tau. 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 Warnings: Non-rec Time: 8.57 seconds (prove: 7.43, print: 0.62, other: 0.52) Prover steps counted: 72117 T The event ( DEFMACRO SEARCH ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO SEARCH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT [Note: A hint was supplied for our processing of the goal above. Thanks!] Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTH N X). This suggestion was produced using the :induction rules EQLABLE-LISTP and NTH. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (:P (+ -1 N) (CDR X))) (:P N X)) (IMPLIES (AND (NOT (ENDP X)) (ZP N)) (:P N X)) (IMPLIES (ENDP X) (:P N X))). This induction is justified by the same argument used to admit NTH. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (EQLABLEP (NTH (+ -1 N) (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP X) (NOT (ZP N)) (EQLABLEP (NTH (+ -1 N) (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :compound-recognizer rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions EQLABLE-LISTP and NTH. Subgoal *1/3 (IMPLIES (AND (NOT (ENDP X)) (NOT (ZP N)) (NOT (EQLABLE-LISTP (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/3' (IMPLIES (AND (CONSP X) (NOT (ZP N)) (NOT (EQLABLE-LISTP (CDR X))) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). [GC for 9120 CONS pages..(T=31).GC finished] But simplification reduces this to T, using the :definition EQLABLE-LISTP. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (ZP N) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (ZP N) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :compound-recognizer rules EQLABLEP-RECOG and ZP-COMPOUND-RECOGNIZER and the :definitions EQLABLE-LISTP and NTH. Subgoal *1/1 (IMPLIES (AND (ENDP X) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP X)) (EQLABLE-LISTP X)) (EQLABLEP (NTH N X))). But simplification reduces this to T, using the :definitions EQLABLE-LISTP and NTH, the :executable-counterparts of CONSP and EQLABLEP and primitive type reasoning. That completes the proof of *1. Q.E.D. The storage of EQLABLEP-NTH depends upon the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription rule EQLABLEP. Summary Form: ( DEFTHM EQLABLEP-NTH ...) Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG) (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION ENDP) (:DEFINITION EQLABLE-LISTP) (:DEFINITION NOT) (:DEFINITION NTH) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION EQLABLE-LISTP) (:INDUCTION NTH) (:TYPE-PRESCRIPTION EQLABLEP)) Time: 0.31 seconds (prove: 0.31, print: 0.00, other: 0.00) Prover steps counted: 481 EQLABLEP-NTH For the admission of COUNT-STRINGP we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (NFIX (+ (+ 1 END) (- START))). The non-trivial part of the measure conjecture is Goal (AND (O-P (NFIX (+ (+ 1 END) (- START)))) (IMPLIES (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (O< (NFIX (+ (+ 1 END) (- (+ 1 START)))) (NFIX (+ (+ 1 END) (- START)))))). By the :executable-counterpart of UNARY-- and the simple :rewrite rules ASSOCIATIVITY-OF-+ and DISTRIBUTIVITY-OF-MINUS-OVER-+ we reduce the conjecture to the following two conjectures. Subgoal 2 (O-P (NFIX (+ 1 END (- START)))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions NFIX, O-FINP and O-P and primitive type reasoning. Subgoal 1 (IMPLIES (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (O< (NFIX (+ 1 END -1 (- START))) (NFIX (+ 1 END (- START))))). This simplifies, using the :definitions FIX, NFIX (if-intro), NOT (if- intro), O-FINP, O< (if-intro) and SYNP, the :executable-counterparts of BINARY-+ and NOT, primitive type reasoning and the :rewrite rules COMMUTATIVITY-2-OF-+, FOLD-CONSTS-IN-+ and UNICITY-OF-0, to the following three conjectures. Subgoal 1.3 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END)) (<= 0 (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.2 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END) (< (+ END (- START)) 0)) (< 0 (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1.1 (IMPLIES (AND (INTEGERP START) (INTEGERP END) (< START END) (<= 0 (+ END (- START)))) (< (+ END (- START)) (+ 1 END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for COUNT-STRINGP. Thus, we admit this function under the principle of definition. We observe that the type of COUNT-STRINGP is described by the theorem (AND (INTEGERP (COUNT-STRINGP ITEM X START END)) (<= 0 (COUNT-STRINGP ITEM X START END))). We used primitive type reasoning. Computing the guard conjecture for COUNT-STRINGP.... The non-trivial part of the guard conjecture for COUNT-STRINGP, given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription rules COUNT-STRINGP and LENGTH, is Goal (AND (IMPLIES (AND (<= END (LENGTH X)) (NATP END) (NATP START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START)))) (< START (LENGTH X))) (IMPLIES (AND (<= END (LENGTH X)) (NATP END) (NATP START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (NOT (EQLABLEP ITEM))) (EQLABLEP (CHAR X START)))). By the simple :definitions CHAR and NATP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (<= END (LENGTH X)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START)))) (< START (LENGTH X))). This simplifies, using the :definitions LENGTH and NOT and the :executable- counterpart of NOT, to Subgoal 2' (IMPLIES (AND (<= END (LEN (COERCE X 'LIST))) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (< START END)) (< START (LEN (COERCE X 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= END (LENGTH X)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP X) (NOT (OR (NOT (INTEGERP START)) (NOT (INTEGERP END)) (<= END START))) (NOT (EQLABLEP ITEM))) (EQLABLEP (NTH START (COERCE X 'LIST)))). [GC for 9120 CONS pages..(T=24).GC finished] But simplification reduces this to T, using the :definitions LENGTH and NOT, the :executable-counterpart of NOT, the :forward-chaining rules CHARACTER-LISTP-COERCE and CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, the :rewrite rule EQLABLEP-NTH and the :type-prescription rules CHARACTER-LISTP and EQLABLE-LISTP. Q.E.D. That completes the proof of the guard theorem for COUNT-STRINGP. COUNT-STRINGP is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-STRINGP ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION CHAR) (:DEFINITION FIX) (:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O-P) (:DEFINITION O<) (:DEFINITION SYNP) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART UNARY--) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CHARACTER-LISTP-COERCE) (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP) (:REWRITE ASSOCIATIVITY-OF-+) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE DISTRIBUTIVITY-OF-MINUS-OVER-+) (:REWRITE EQLABLEP-NTH) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION COUNT-STRINGP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION LENGTH)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION NFIX) (:DEFINITION NOT) (:DEFINITION O<)) Time: 0.46 seconds (prove: 0.24, print: 0.01, other: 0.21) Prover steps counted: 929 COUNT-STRINGP For the admission of COUNT-LISTP we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). The non-trivial part of the measure conjecture is Goal (IMPLIES (NOT (OR (ENDP X) (ZP END))) (O< (ACL2-COUNT (CDR X)) (ACL2-COUNT X))). By case analysis we reduce the conjecture to Goal' (IMPLIES (NOT (OR (ENDP X) (ZP END))) (O< (ACL2-COUNT (CDR X)) (ACL2-COUNT X))). This simplifies, using the :definitions ENDP, O-FINP and O< and the :type-prescription rule ACL2-COUNT, to Goal'' (IMPLIES (AND (CONSP X) (NOT (ZP END))) (< (ACL2-COUNT (CDR X)) (ACL2-COUNT X))). The destructor terms (CAR X) and (CDR X) can be eliminated by using CAR-CDR-ELIM to replace X by (CONS X1 X2), (CAR X) by X1 and (CDR X) by X2. This produces the following goal. Goal''' (IMPLIES (AND (CONSP (CONS X1 X2)) (NOT (ZP END))) (< (ACL2-COUNT X2) (ACL2-COUNT (CONS X1 X2)))). This simplifies, using the :definition ACL2-COUNT, primitive type reasoning and the :rewrite rules CAR-CONS and CDR-CONS, to Goal'4' (IMPLIES (NOT (ZP END)) (< (ACL2-COUNT X2) (+ 1 (ACL2-COUNT X1) (ACL2-COUNT X2)))). But simplification reduces this to T, using linear arithmetic, primitive type reasoning and the :type-prescription rule ACL2-COUNT. Q.E.D. That completes the proof of the measure theorem for COUNT-LISTP. Thus, we admit this function under the principle of definition. We observe that the type of COUNT-LISTP is described by the theorem (AND (INTEGERP (COUNT-LISTP ITEM X END)) (<= 0 (COUNT-LISTP ITEM X END))). We used primitive type reasoning. Computing the guard conjecture for COUNT-LISTP.... The guard conjecture for COUNT-LISTP is trivial to prove, given the :compound-recognizer rules NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, primitive type reasoning and the :type-prescription rule COUNT-LISTP. COUNT-LISTP is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-LISTP ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION ACL2-COUNT) (:DEFINITION ENDP) (:DEFINITION O-FINP) (:DEFINITION O<) (:ELIM CAR-CDR-ELIM) (:FAKE-RUNE-FOR-LINEAR NIL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION ACL2-COUNT) (:TYPE-PRESCRIPTION COUNT-LISTP)) Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) Prover steps counted: 754 COUNT-LISTP To verify that the two encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-NTHCDR ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-NTHCDR ACL2 !>>(DEFUN COUNT-FN (ITEM SEQUENCE START END) (DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE) T (STRINGP SEQUENCE)) (NATP START) (OR (NULL END) (AND (NATP END) (<= END (LENGTH SEQUENCE))))))) (LET ((END (OR END (LENGTH SEQUENCE)))) (COND ((<= END START) 0) ((STRINGP SEQUENCE) (COUNT-STRINGP ITEM SEQUENCE START END)) (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE) (- END START)))))) Since COUNT-FN is non-recursive, its admission is trivial. We observe that the type of COUNT-FN is described by the theorem (AND (INTEGERP (COUNT-FN ITEM SEQUENCE START END)) (<= 0 (COUNT-FN ITEM SEQUENCE START END))). We used the :type-prescription rules COUNT-LISTP and COUNT-STRINGP. Computing the guard conjecture for COUNT-FN.... [GC for 9120 CONS pages..(T=27).GC finished] The non-trivial part of the guard conjecture for COUNT-FN, given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER and the :type-prescription rule LENGTH, is Goal (AND (IMPLIES (AND (EQUAL END NIL) (NATP START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (EQUAL END NIL) (NATP START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (NATP END) (NATP START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (NATP END) (NATP START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START)))))))). [GC for 9120 CONS pages..(T=23).GC finished] [GC for 9120 CONS pages..(T=21).GC finished] [GC for 9120 CONS pages..(T=21).GC finished] By the simple :definition NATP we reduce the conjecture to the following four conjectures. Subgoal 4 (IMPLIES (AND (NOT END) (INTEGERP START) (<= 0 START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))). [GC for 9120 CONS pages..(T=17).GC finished] This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT, the :executable-counterpart of NOT and the :type-prescription rule LEN, to Subgoal 4' (IMPLIES (AND (INTEGERP START) (<= 0 START) (STRINGP SEQUENCE) (< START (LEN (COERCE SEQUENCE 'LIST)))) (<= (LEN (COERCE SEQUENCE 'LIST)) (LEN (COERCE SEQUENCE 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 3 (IMPLIES (AND (NOT END) (INTEGERP START) (<= 0 START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))). [GC for 9120 CONS pages..(T=17).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.00 secs; see :DOC time-tracker-tau. [GC for 9120 CONS pages..(T=17).GC finished] This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable- counterpart of NOT, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rules LEN and TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to Subgoal 3' (IMPLIES (AND (INTEGERP START) (<= 0 START) (TRUE-LISTP SEQUENCE) (< START (LEN SEQUENCE))) (<= 0 (+ (- START) (LEN SEQUENCE)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 2 (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))). This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable- counterpart of NOT, primitive type reasoning and the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to Subgoal 2' (IMPLIES (AND (<= END (LEN SEQUENCE)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (TRUE-LISTP SEQUENCE) (< START END)) (<= 0 (+ END (- START)))). [GC for 9120 CONS pages..(T=16).GC finished] But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT and the :executable-counterpart of NOT. Q.E.D. That completes the proof of the guard theorem for COUNT-FN. COUNT-FN is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION COUNT-LISTP) (:TYPE-PRESCRIPTION COUNT-STRINGP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 1.85 seconds (prove: 1.35, print: 0.02, other: 0.48) Prover steps counted: 2976 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.01 seconds. See :DOC time-tracker-tau. COUNT-FN End of Encapsulated Events. [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=20).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 COUNT-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 2.28 seconds (prove: 1.35, print: 0.02, other: 0.91) Prover steps counted: 2976 T The event ( DEFMACRO COUNT ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO COUNT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since CPU-CORE-COUNT is non-recursive, its admission is trivial. We observe that the type of CPU-CORE-COUNT is described by the theorem (AND (CONSP (CPU-CORE-COUNT STATE)) (TRUE-LISTP (CPU-CORE-COUNT STATE))). We used primitive type reasoning. (CPU-CORE-COUNT STATE) => (MV * STATE). Computing the guard conjecture for CPU-CORE-COUNT.... The guard conjecture for CPU-CORE-COUNT is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. CPU-CORE-COUNT is compliant with Common Lisp. Summary Form: ( DEFUN CPU-CORE-COUNT ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) CPU-CORE-COUNT The event ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN GET-IN-THEORY-REDUNDANT-OKP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The admission of DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT TERM) for DUMB-OCCUR-VAR and (ACL2-COUNT LST) for DUMB-OCCUR-VAR-LST. We observe that the type of DUMB-OCCUR-VAR is described by the theorem (OR (EQUAL (DUMB-OCCUR-VAR VAR TERM) T) (EQUAL (DUMB-OCCUR-VAR VAR TERM) NIL)) and the type of DUMB-OCCUR-VAR-LST is described by the theorem (OR (EQUAL (DUMB-OCCUR-VAR-LST VAR LST) T) (EQUAL (DUMB-OCCUR-VAR-LST VAR LST) NIL)). Computing the guard conjecture for DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST.... The non-trivial part of the guard conjecture for DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST, given the :forward-chaining rule PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule PSEUDO-TERM-LISTP, is Goal (AND (IMPLIES (AND (PSEUDO-TERM-LISTP LST) (SYMBOLP VAR) (NOT (ENDP LST))) (PSEUDO-TERMP (CAR LST))) (IMPLIES (AND (PSEUDO-TERM-LISTP LST) (SYMBOLP VAR) (NOT (ENDP LST)) (NOT (DUMB-OCCUR-VAR VAR (CAR LST)))) (PSEUDO-TERM-LISTP (CDR LST))) (IMPLIES (AND (PSEUDO-TERMP TERM) (SYMBOLP VAR) (NOT (EQ VAR TERM)) (NOT (ATOM TERM)) (NOT (EQ 'QUOTE (CAR TERM)))) (PSEUDO-TERM-LISTP (CDR TERM)))). By the simple :definitions ATOM, ENDP and EQ we reduce the conjecture to the following three conjectures. Subgoal 3 (IMPLIES (AND (PSEUDO-TERM-LISTP LST) (SYMBOLP VAR) (CONSP LST)) (PSEUDO-TERMP (CAR LST))). But simplification reduces this to T, using the :definition PSEUDO-TERM-LISTP. Subgoal 2 (IMPLIES (AND (PSEUDO-TERM-LISTP LST) (SYMBOLP VAR) (CONSP LST) (NOT (DUMB-OCCUR-VAR VAR (CAR LST)))) (PSEUDO-TERM-LISTP (CDR LST))). But simplification reduces this to T, using the :definition PSEUDO-TERM-LISTP. Subgoal 1 (IMPLIES (AND (PSEUDO-TERMP TERM) (SYMBOLP VAR) (NOT (EQUAL VAR TERM)) (CONSP TERM) (NOT (EQUAL 'QUOTE (CAR TERM)))) (PSEUDO-TERM-LISTP (CDR TERM))). But simplification reduces this to T, using the :definitions PSEUDO-TERMP and TRUE-LISTP and primitive type reasoning. Q.E.D. That completes the proof of the guard theorem for DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST. DUMB-OCCUR-VAR and DUMB-OCCUR-VAR-LST are compliant with Common Lisp. Summary Form: ( MUTUAL-RECURSION ( DEFUN DUMB-OCCUR-VAR ...) ...) Rules: ((:DEFINITION ATOM) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PSEUDO-TERM-LISTP) (:DEFINITION PSEUDO-TERMP) (:DEFINITION TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING PSEUDO-TERM-LISTP-FORWARD-TO-TRUE-LISTP) (:TYPE-PRESCRIPTION PSEUDO-TERM-LISTP)) Time: 0.35 seconds (prove: 0.00, print: 0.01, other: 0.34) Prover steps counted: 299 (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST) Since TRIVIAL-LAMBDA-P is non-recursive, its admission is trivial. We observe that the type of TRIVIAL-LAMBDA-P is described by the theorem (OR (EQUAL (TRIVIAL-LAMBDA-P FORMALS ARGS BODY) T) (EQUAL (TRIVIAL-LAMBDA-P FORMALS ARGS BODY) NIL)). We used primitive type reasoning. Computing the guard conjecture for TRIVIAL-LAMBDA-P.... The guard conjecture for TRIVIAL-LAMBDA-P is trivial to prove, given the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP and the :type-prescription rules ATOM-LISTP, EQLABLE-LISTP and SYMBOL-LISTP. TRIVIAL-LAMBDA-P is compliant with Common Lisp. Summary Form: ( DEFUN TRIVIAL-LAMBDA-P ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP) (:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP) (:TYPE-PRESCRIPTION ATOM-LISTP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION SYMBOL-LISTP)) Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) TRIVIAL-LAMBDA-P The event ( DEFUN MAKE-SHARP-ATSIGN ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN MAKE-SHARP-ATSIGN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT [GC for 633 SFUN pages..(T=30).GC finished] The event ( DEFUN SHARP-ATSIGN-ALIST ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO TIME$1 ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME$1 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO TIME$ ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME$ ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT To verify that the six encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (REVAPPEND X Y). This suggestion was produced using the :induction rule REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP X)) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y)) (IMPLIES (ENDP X) (:P X Y))). This induction is justified by the same argument used to admit REVAPPEND. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (AND (NOT (ENDP X)) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/2' (IMPLIES (AND (CONSP X) (EQUAL (TRUE-LISTP (REVAPPEND (CDR X) (CONS (CAR X) Y))) (TRUE-LISTP (CONS (CAR X) Y)))) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). But simplification reduces this to T, using the :definitions REVAPPEND and TRUE-LISTP, primitive type reasoning and the :rewrite rule CDR-CONS. Subgoal *1/1 (IMPLIES (ENDP X) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (NOT (CONSP X)) (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y))). But simplification reduces this to T, using the :definition REVAPPEND and primitive type reasoning. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM TRUE-LISTP-REVAPPEND ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION REVAPPEND) (:DEFINITION TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION REVAPPEND) (:REWRITE CDR-CONS)) Time: 0.01 seconds (prove: 0.00, print: 0.01, other: 0.00) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(VERIFY-GUARDS THROW-NONEXEC-ERROR) Computing the guard conjecture for THROW-NONEXEC-ERROR.... The guard conjecture for THROW-NONEXEC-ERROR is trivial to prove. THROW-NONEXEC-ERROR is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS THROW-NONEXEC-ERROR) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) THROW-NONEXEC-ERROR ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FORM) The event ( VERIFY-GUARDS DEFUN-NX-FORM) is redundant. See :DOC redundant- events. Summary Form: ( VERIFY-GUARDS DEFUN-NX-FORM) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-GUARDS DEFUN-NX-FN) The event ( VERIFY-GUARDS DEFUN-NX-FN) is redundant. See :DOC redundant- events. Summary Form: ( VERIFY-GUARDS DEFUN-NX-FN) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) The event ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) is redundant. See :DOC redundant-events. Summary Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) The event ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) is redundant. See :DOC redundant-events. Summary Form: ( VERIFY-GUARDS UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT End of Encapsulated Events. Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 0.02 seconds (prove: 0.00, print: 0.01, other: 0.01) Prover steps counted: 311 T Since GC$-FN is non-recursive, its admission is trivial. We observe that the type of GC$-FN is described by the theorem (EQUAL (GC$-FN ARGS) NIL). Computing the guard conjecture for GC$-FN.... The guard conjecture for GC$-FN is trivial to prove. GC$-FN is compliant with Common Lisp. Summary Form: ( DEFUN GC$-FN ...) Rules: NIL Time: 0.08 seconds (prove: 0.00, print: 0.00, other: 0.08) GC$-FN The event ( DEFMACRO GC$ ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO GC$ ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since GC-VERBOSE-FN is non-recursive, its admission is trivial. We observe that the type of GC-VERBOSE-FN is described by the theorem (EQUAL (GC-VERBOSE-FN ARG1 ARG2) NIL). Computing the guard conjecture for GC-VERBOSE-FN.... The guard conjecture for GC-VERBOSE-FN is trivial to prove. GC-VERBOSE-FN is compliant with Common Lisp. Summary Form: ( DEFUN GC-VERBOSE-FN ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) GC-VERBOSE-FN The event ( DEFMACRO GC-VERBOSE ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO GC-VERBOSE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since GET-WORMHOLE-STATUS is non-recursive, its admission is trivial. We observe that the type of GET-WORMHOLE-STATUS is described by the theorem (AND (CONSP (GET-WORMHOLE-STATUS NAME STATE)) (TRUE-LISTP (GET-WORMHOLE-STATUS NAME STATE))). We used the :type-prescription rule READ-ACL2-ORACLE. (GET-WORMHOLE-STATUS * STATE) => (MV * * STATE). Computing the guard conjecture for GET-WORMHOLE-STATUS.... The guard conjecture for GET-WORMHOLE-STATUS is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. GET-WORMHOLE-STATUS is compliant with Common Lisp. Summary Form: ( DEFUN GET-WORMHOLE-STATUS ...) Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION READ-ACL2-ORACLE) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) GET-WORMHOLE-STATUS Since FILE-WRITE-DATE$ is non-recursive, its admission is trivial. We observe that the type of FILE-WRITE-DATE$ is described by the theorem (AND (CONSP (FILE-WRITE-DATE$ FILE STATE)) (TRUE-LISTP (FILE-WRITE-DATE$ FILE STATE))). We used primitive type reasoning. (FILE-WRITE-DATE$ * STATE) => (MV * STATE). Computing the guard conjecture for FILE-WRITE-DATE$.... The guard conjecture for FILE-WRITE-DATE$ is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. FILE-WRITE-DATE$ is compliant with Common Lisp. Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) FILE-WRITE-DATE$ Since DELETE-FILE$ is non-recursive, its admission is trivial. We observe that the type of DELETE-FILE$ is described by the theorem (AND (CONSP (DELETE-FILE$ FILE STATE)) (TRUE-LISTP (DELETE-FILE$ FILE STATE))). We used primitive type reasoning. (DELETE-FILE$ * STATE) => (MV * STATE). Computing the guard conjecture for DELETE-FILE$.... The guard conjecture for DELETE-FILE$ is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. DELETE-FILE$ is compliant with Common Lisp. Summary Form: ( DEFUN DELETE-FILE$ ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) DELETE-FILE$ Since DEBUGGER-ENABLE is non-recursive, its admission is trivial. We could deduce no constraints on the type of DEBUGGER-ENABLE. (DEBUGGER-ENABLE STATE) => *. Computing the guard conjecture for DEBUGGER-ENABLE.... The non-trivial part of the guard conjecture for DEBUGGER-ENABLE, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)). [GC for 9120 CONS pages..(T=29).GC finished] But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GLOBAL-TABLE and STATE-P. Q.E.D. That completes the proof of the guard theorem for DEBUGGER-ENABLE. DEBUGGER-ENABLE is compliant with Common Lisp. Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: ((:DEFINITION BOUNDP-GLOBAL) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION GLOBAL-TABLE) (:DEFINITION NOT) (:DEFINITION STATE-P) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.41 seconds (prove: 0.29, print: 0.00, other: 0.12) Prover steps counted: 50 DEBUGGER-ENABLE Since BREAK$ is non-recursive, its admission is trivial. We observe that the type of BREAK$ is described by the theorem (EQUAL (BREAK$) NIL). Computing the guard conjecture for BREAK$.... The guard conjecture for BREAK$ is trivial to prove. BREAK$ is compliant with Common Lisp. Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) BREAK$ Since PRINT-CALL-HISTORY is non-recursive, its admission is trivial. We observe that the type of PRINT-CALL-HISTORY is described by the theorem (EQUAL (PRINT-CALL-HISTORY) NIL). Computing the guard conjecture for PRINT-CALL-HISTORY.... The guard conjecture for PRINT-CALL-HISTORY is trivial to prove. PRINT-CALL-HISTORY is compliant with Common Lisp. Summary Form: ( DEFUN PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) PRINT-CALL-HISTORY The event ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since DEBUGGER-ENABLEDP is non-recursive, its admission is trivial. We observe that the type of DEBUGGER-ENABLEDP is described by the theorem (OR (EQUAL (DEBUGGER-ENABLEDP STATE) T) (EQUAL (DEBUGGER-ENABLEDP STATE) NIL)). (DEBUGGER-ENABLEDP STATE) => *. Computing the guard conjecture for DEBUGGER-ENABLEDP.... The non-trivial part of the guard conjecture for DEBUGGER-ENABLEDP, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)) (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE)) (L '(T :BREAK :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))))). But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable- counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for DEBUGGER-ENABLEDP. DEBUGGER-ENABLEDP is compliant with Common Lisp. [GC for 2049 RELOCATABLE-BLOCKS pages..(T=26).GC finished] Summary Form: ( DEFUN DEBUGGER-ENABLEDP ...) Rules: ((:DEFINITION BOUNDP-GLOBAL) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION GET-GLOBAL) (:DEFINITION GLOBAL-TABLE) (:DEFINITION NOT) (:DEFINITION STATE-P) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.46 seconds (prove: 0.00, print: 0.00, other: 0.46) Prover steps counted: 129 DEBUGGER-ENABLEDP Since MAYBE-PRINT-CALL-HISTORY is non-recursive, its admission is trivial. We observe that the type of MAYBE-PRINT-CALL-HISTORY is described by the theorem (EQUAL (MAYBE-PRINT-CALL-HISTORY STATE) NIL). We used the :type-prescription rule PRINT-CALL-HISTORY. (MAYBE-PRINT-CALL-HISTORY STATE) => *. Computing the guard conjecture for MAYBE-PRINT-CALL-HISTORY.... The non-trivial part of the guard conjecture for MAYBE-PRINT-CALL-HISTORY, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)) (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE)) (L '(:BT :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))))). But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable- counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for MAYBE-PRINT-CALL-HISTORY. MAYBE-PRINT-CALL-HISTORY is compliant with Common Lisp. Summary Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...) Rules: ((:DEFINITION BOUNDP-GLOBAL) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION GET-GLOBAL) (:DEFINITION GLOBAL-TABLE) (:DEFINITION NOT) (:DEFINITION STATE-P) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION PRINT-CALL-HISTORY) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) Prover steps counted: 129 MAYBE-PRINT-CALL-HISTORY The event ( DEFMACRO WITH-RECKLESS-READTABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SET-DEBUGGER-ENABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SET-DEBUGGER-ENABLE-FN is non-recursive, its admission is trivial. We observe that the type of SET-DEBUGGER-ENABLE-FN is described by the theorem (CONSP (SET-DEBUGGER-ENABLE-FN VAL STATE)). We used the :type-prescription rule PUT-GLOBAL. (SET-DEBUGGER-ENABLE-FN * STATE) => STATE. Computing the guard conjecture for SET-DEBUGGER-ENABLE-FN.... [GC for 9120 CONS pages..(T=29).GC finished] The non-trivial part of the guard conjecture for SET-DEBUGGER-ENABLE-FN, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rules MEMBER-EQ-EXEC$GUARD-CHECK and STATE-P, is Goal (AND (IMPLIES (STATE-P STATE) (LET ((X VAL) (L '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (IMPLIES (AND (LET ((X VAL) (L '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK))) (MEMBER-EQUAL X L)) (STATE-P STATE)) (LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE VAL STATE))) (AND (BOUNDP-GLOBAL1 'DMRP STATE) (STATE-P1 STATE) (OR (NOT (CONSP (GET-GLOBAL 'DMRP STATE))) (STATE-P1 STATE)))))). [Note: A hint was supplied for our processing of the goal above. Thanks!] By the simple :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE, BIG-CLOCK-ENTRY, FILE-CLOCK, FILE-CLOCK-P, GET-GLOBAL, GLOBAL-TABLE, IDATES, LIST-ALL-PACKAGE-NAMES-LST, NATP, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, READ-FILES, READ-FILES-P, READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES and WRITTEN-FILES-P, the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to Goal' (IMPLIES (AND (MEMBER-EQUAL VAL '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK)) (TRUE-LISTP STATE) (EQUAL (LENGTH STATE) 15) (ORDERED-SYMBOL-ALISTP (NTH 0 STATE)) (OPEN-CHANNEL-LISTP (NTH 0 STATE)) (ORDERED-SYMBOL-ALISTP (NTH 1 STATE)) (OPEN-CHANNEL-LISTP (NTH 1 STATE)) (ORDERED-SYMBOL-ALISTP (NTH 2 STATE)) (ALL-BOUNDP '((ABBREV-EVISC-TUPLE . :DEFAULT) (ABORT-SOFT . T) (ACCUMULATED-TTREE) (ACL2-RAW-MODE-P) (ACL2-SOURCES-DIR) (ACL2-VERSION . "ACL2 Version 8.5") (ACL2-WORLD-ALIST) (ACL2P-CHECKPOINTS-FOR-SUMMARY) (AXIOMSP) (BDDNOTES) (BOOK-HASH-ALISTP) (BOOT-STRAP-FLG . T) (BRR-EVISC-TUPLE-INITIALIZED) (CERT-DATA) (CERTIFY-BOOK-INFO) (CHECK-INVARIANT-RISK . :WARNING) (CHECK-SUM-WEIRDNESS) (CHECKPOINT-FORCED-GOALS) (CHECKPOINT-PROCESSORS ELIMINATE-DESTRUCTORS-CLAUSE FERTILIZE-CLAUSE GENERALIZE-CLAUSE ELIMINATE-IRRELEVANCE-CLAUSE PUSH-CLAUSE :INDUCT) (CHECKPOINT-SUMMARY-LIMIT NIL . 3) (COMPILED-FILE-EXTENSION) (COMPILER-ENABLED) (CONNECTED-BOOK-DIRECTORY) (CURRENT-ACL2-WORLD) (CURRENT-PACKAGE . "ACL2") (DEBUG-PSPV) (DEBUGGER-ENABLE) (DEFAXIOMS-OKP-CERT . T) (DEFERRED-TTAG-NOTES . :NOT-DEFERRED) (DEFERRED-TTAG-NOTES-SAVED) (DMRP) (EVISC-HITP-WITHOUT-IPRINT) (EVISCERATE-HIDE-TERMS) (FMT-HARD-RIGHT-MARGIN . 77) (FMT-SOFT-RIGHT-MARGIN . 65) (GAG-MODE) (GAG-MODE-EVISC-TUPLE) (GAG-STATE) (GAG-STATE-SAVED) (GET-INTERNAL-TIME-AS-REALTIME) (GLOBAL-CTX) (GLOBAL-ENABLED-STRUCTURE) (GSTACKP) (GUARD-CHECKING-ON . T) (HOST-LISP) (IGNORE-CERT-FILES) (ILLEGAL-TO-CERTIFY-MESSAGE) (IN-LOCAL-FLG) (IN-PROVE-FLG) (IN-VERIFY-FLG) (INCLUDING-UNCERTIFIED-P) (INHIBIT-ER-HARD) (INHIBIT-OUTPUT-LST SUMMARY) (INHIBIT-OUTPUT-LST-STACK) (INHIBITED-SUMMARY-TYPES) (INSIDE-SKIP-PROOFS) (IPRINT-AR (:HEADER :DIMENSIONS (10001) :MAXIMUM-LENGTH 40004 :DEFAULT NIL :NAME IPRINT-AR :ORDER :NONE) (0 0)) (IPRINT-FAL) (IPRINT-HARD-BOUND . 10000) (IPRINT-SOFT-BOUND . 1000) (KEEP-TMP-FILES) (LAST-EVENT-DATA) (LAST-MAKE-EVENT-EXPANSION) (LAST-STEP-LIMIT . -1) (LD-HISTORY) (LD-LEVEL . 0) (LD-OKP . :DEFAULT) (LD-REDEFINITION-ACTION) (LD-SKIP-PROOFSP) (LOGIC-FNS-WITH-RAW-CODE MOD-EXPT HEADER SEARCH-FN STATE-P1 AREF2 AREF1 FGETPROP GETENV$ WORMHOLE-EVAL WORMHOLE1 GET-WORMHOLE-STATUS ASET2 SGETPROP SETENV$ GETPROPS COMPRESS1 TIME-LIMIT5-REACHED-P FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! FMT-TO-COMMENT-WINDOW+ FMT-TO-COMMENT-WINDOW!+ LEN CPU-CORE-COUNT NONNEGATIVE-INTEGER-QUOTIENT CHECK-PRINT-BASE RETRACT-WORLD ASET1 ARRAY1P BOOLE$ ARRAY2P STRIP-CDRS COMPRESS2 STRIP-CARS PLIST-WORLDP PLIST-WORLDP-WITH-FORMALS WORMHOLE-P MAY-NEED-SLASHES-FN HAS-PROPSP HARD-ERROR ABORT! P! FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 ALPHORDER EXTEND-WORLD DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT USER-STOBJ-ALIST READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR UPDATE-USER-STOBJ-ALIST DECREMENT-BIG-CLOCK PUT-GLOBAL CLOSE-INPUT-CHANNEL MAKUNBOUND-GLOBAL OPEN-INPUT-CHANNEL OPEN-INPUT-CHANNEL-P1 BOUNDP-GLOBAL1 GLOBAL-TABLE-CARS1 EXTEND-T-STACK LIST-ALL-PACKAGE-NAMES CLOSE-OUTPUT-CHANNEL WRITE-BYTE$ SHRINK-T-STACK ASET-32-BIT-INTEGER-STACK GET-GLOBAL 32-BIT-INTEGER-STACK-LENGTH1 EXTEND-32-BIT-INTEGER-STACK ASET-T-STACK AREF-T-STACK READ-CHAR$ AREF-32-BIT-INTEGER-STACK OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL-P1 PRINC$ READ-OBJECT BIG-CLOCK-NEGATIVE-P PEEK-CHAR$ SHRINK-32-BIT-INTEGER-STACK READ-RUN-TIME READ-BYTE$ READ-IDATE T-STACK-LENGTH1 PRINT-OBJECT$-FN GET-OUTPUT-STREAM-STRING$-FN MV-LIST RETURN-LAST ZPF IDENTITY ENDP NTHCDR LAST REVAPPEND NULL BUTLAST STRING NOT MOD PLUSP ATOM LISTP ZP FLOOR CEILING TRUNCATE ROUND REM LOGBITP ASH LOGCOUNT SIGNUM INTEGER-LENGTH EXPT SUBSTITUTE ZEROP MINUSP ODDP EVENP = /= MAX MIN CONJUGATE LOGANDC1 LOGANDC2 LOGNAND LOGNOR LOGNOT LOGORC1 LOGORC2 LOGTEST ABS STRING-EQUAL STRING< STRING> STRING<= STRING>= STRING-UPCASE STRING-DOWNCASE KEYWORDP EQ EQL CHAR SUBST SUBLIS ACONS NTH SUBSEQ LENGTH REVERSE ZIP STANDARD-CHAR-P ALPHA-CHAR-P UPPER-CASE-P LOWER-CASE-P CHAR< CHAR> CHAR<= CHAR>= CHAR-EQUAL CHAR-UPCASE CHAR-DOWNCASE RANDOM$ THROW-NONEXEC-ERROR GC$-FN SET-COMPILER-ENABLED GOOD-BYE-FN TAKE FILE-WRITE-DATE$ PRINT-CALL-HISTORY SET-DEBUGGER-ENABLE-FN BREAK$ PRIN1$ PRIN1-WITH-SLASHES MEMBER-EQUAL ASSOC-EQUAL SUBSETP-EQUAL RASSOC-EQUAL REMOVE-EQUAL POSITION-EQUAL MAYBE-FINISH-OUTPUT$ SYMBOL-IN-CURRENT-PACKAGE-P SLEEP FAST-ALIST-LEN HONS-COPY-PERSISTENT HONS-SUMMARY HONS-CLEAR HONS-CLEAR! HONS-WASH HONS-WASH! FAST-ALIST-CLEAN FAST-ALIST-FORK HONS-EQUAL-LITE NUMBER-SUBTREES FAST-ALIST-SUMMARY HONS-ACONS! CLEAR-MEMOIZE-TABLES HONS-COPY HONS-ACONS CLEAR-MEMOIZE-TABLE FAST-ALIST-FREE HONS-EQUAL HONS-RESIZE-FN HONS-GET HONS FAST-ALIST-CLEAN! FAST-ALIST-FORK! MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MAKE-FAST-ALIST SERIALIZE-READ-FN SERIALIZE-WRITE-FN READ-OBJECT-SUPPRESS READ-OBJECT-WITH-CASE PRINT-OBJECT$-PRESERVING-CASE ASSIGN-LOCK THROW-OR-ATTACH-CALL TIME-TRACKER-FN GC-VERBOSE-FN SET-ABSSTOBJ-DEBUG-FN SYS-CALL-STATUS SYS-CALL SYS-CALL+ SYS-CALL* CANONICAL-PATHNAME DOPPELGANGER-BADGE-USERFN DOPPELGANGER-APPLY$-USERFN EV-FNCALL-W-GUARD1 PRINT-CL-CACHE-FN MFC-ANCESTORS MFC-CLAUSE MFC-RDEPTH MFC-TYPE-ALIST MFC-UNIFY-SUBST MFC-WORLD MFC-AP-FN MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN MFC-RW-TTREE MFC-TS-FN MFC-TS-TTREE MAGIC-EV-FNCALL NEVER-MEMOIZE-FN BIG-N ZP-BIG-N DECREMENT-BIG-N ANCESTORS-CHECK ONCEP-TP PRINT-CLAUSE-ID-OKP TOO-MANY-IFS-POST-REWRITE TOO-MANY-IFS-PRE-REWRITE SET-GC-STRATEGY-FN GC-STRATEGY READ-FILE-INTO-STRING2 CONS-WITH-HINT FILE-LENGTH$ DELETE-FILE$ SET-BAD-LISP-CONSP-MEMOIZE RETRACT-STOBJ-TABLES APPLY$-LAMBDA APPLY$-PRIM) (MACROS-WITH-RAW-CODE THEORY-INVARIANT SET-LET*-ABSTRACTIONP DEFAXIOM SET-BOGUS-MUTUAL-RECURSION-OK SET-RULER-EXTENDERS DELETE-INCLUDE-BOOK-DIR DELETE-INCLUDE-BOOK-DIR! CERTIFY-BOOK PROGN! F-PUT-GLOBAL PUSH-UNTOUCHABLE SET-BACKCHAIN-LIMIT SET-DEFAULT-HINTS! SET-RW-CACHE-STATE! SET-INDUCTION-DEPTH-LIMIT! SET-OVERRIDE-HINTS-MACRO DEFTHEORY PSTK VERIFY-GUARDS DEFCHOOSE SET-DEFAULT-BACKCHAIN-LIMIT SET-STATE-OK SET-IGNORE-OK SET-NON-LINEARP SET-TAU-AUTO-MODE WITH-OUTPUT SET-COMPILE-FNS ADD-INCLUDE-BOOK-DIR ADD-INCLUDE-BOOK-DIR! CLEAR-PSTK ADD-CUSTOM-KEYWORD-HINT INITIAL-GSTACK ACL2-UNWIND-PROTECT SET-WELL-FOUNDED-RELATION CATCH-TIME-LIMIT5 CATCH-TIME-LIMIT5@PAR DEFUNS ADD-DEFAULT-HINTS! LOCAL ENCAPSULATE REMOVE-DEFAULT-HINTS! INCLUDE-BOOK PPROGN SET-ENFORCE-REDUNDANCY LOGIC ER DEFLABEL MV-LET PROGRAM VALUE-TRIPLE SET-BODY COMP SET-BOGUS-DEFUN-HINTS-OK DMR-STOP DEFPKG SET-MEASURE-FUNCTION SET-INHIBIT-WARNINGS! SET-INHIBIT-ER-SOFT! DEFTHM MV F-BIG-CLOCK-NEGATIVE-P RESET-PREHISTORY MUTUAL-RECURSION SET-REWRITE-STACK-LIMIT SET-PROVER-STEP-LIMIT ADD-MATCH-FREE-OVERRIDE SET-MATCH-FREE-DEFAULT THE-MV TABLE IN-ARITHMETIC-THEORY REGENERATE-TAU-DATABASE SET-CASE-SPLIT-LIMITATIONS SET-IRRELEVANT-FORMALS-OK REMOVE-UNTOUCHABLE IN-THEORY WITH-OUTPUT-FORCED DMR-START REWRITE-ENTRY SKIP-PROOFS F-BOUNDP-GLOBAL MAKE-EVENT SET-VERIFY-GUARDS-EAGERNESS WORMHOLE VERIFY-TERMINATION-BOOT-STRAP START-PROOF-TREE F-DECREMENT-BIG-CLOCK DEFABSSTOBJ DEFSTOBJ DEFUND DEFTTAG PUSH-GFRAME DEFTHMD F-GET-GLOBAL CAAR CADR CDAR CDDR CAAAR CAADR CADAR CADDR CDAAR CDADR CDDAR CDDDR CAAAAR CAAADR CAADAR CAADDR CADAAR CADADR CADDAR CADDDR CDAAAR CDAADR CDADAR CDADDR CDDAAR CDDADR CDDDAR CDDDDR REST MAKE-LIST LIST OR AND * LOGIOR LOGXOR LOGAND SEARCH LOGEQV CONCATENATE LET* DEFUN THE > <= >= + - / 1+ 1- PROGN DEFMACRO COND CASE LIST* APPEND DEFCONST IN-PACKAGE INTERN FIRST SECOND THIRD FOURTH FIFTH SIXTH SEVENTH EIGHTH NINTH TENTH DIGIT-CHAR-P UNMEMOIZE MEMOIZE DEFUNS-STD DEFTHM-STD DEFUN-STD POR PAND PLET PARGS SPEC-MV-LET TRACE! WITH-LIVE-STATE WITH-OUTPUT-OBJECT-CHANNEL-SHARING WITH-HCOMP-BINDINGS WITH-HCOMP-HT-BINDINGS REDEF+ REDEF- BIND-ACL2-TIME-LIMIT DEFATTACH DEFPROXY COUNT MEMBER ASSOC SUBSETP RASSOC REMOVE REMOVE-DUPLICATES POSITION CATCH-STEP-LIMIT STEP-LIMIT-ERROR WATERFALL-PRINT-CLAUSE-ID@PAR DEFLOCK F-PUT-GLOBAL@PAR SET-WATERFALL-PARALLELISM WITH-PROVER-STEP-LIMIT WATERFALL1-WRAPPER@PAR WITH-WATERFALL-PARALLELISM-TIMINGS WITH-PARALLELISM-HAZARD-WARNINGS WARN-ABOUT-PARALLELISM-HAZARD WITH-ENSURED-PARALLELISM-FINISHING STATE-GLOBAL-LET* WITH-RECKLESS-READTABLE WITH-LOCK WITH-FAST-ALIST-RAW WITH-STOLEN-ALIST-RAW FAST-ALIST-FREE-ON-EXIT-RAW STOBJ-LET ADD-LD-KEYWORD-ALIAS! SET-LD-KEYWORD-ALIASES! WITH-GUARD-CHECKING-EVENT WHEN-PASS-2 LOOP$ OUR-WITH-TERMINAL-INPUT TRUST-MFC WITH-GLOBAL-STOBJ) (MAIN-TIMER . 0) (MAKE-EVENT-DEBUG) (MAKE-EVENT-DEBUG-DEPTH . 0) (MATCH-FREE-ERROR) (MODIFYING-INCLUDE-BOOK-DIR-ALIST) (PARALLEL-EXECUTION-ENABLED) (PARALLELISM-HAZARDS-ACTION) (PC-ERP) (PC-INFO) (PC-OUTPUT) (PC-SS-ALIST) (PC-VAL) (PORT-FILE-ENABLED . T) (PPR-FLAT-RIGHT-MARGIN . 40) (PRINT-BASE . 10) (PRINT-CASE . :UPCASE) (PRINT-CIRCLE) (PRINT-CIRCLE-FILES . T) (PRINT-CLAUSE-IDS) (PRINT-ESCAPE . T) (PRINT-GV-DEFAULTS) (PRINT-LENGTH) (PRINT-LEVEL) (PRINT-LINES) (PRINT-PRETTY) (PRINT-RADIX) (PRINT-READABLY) (PRINT-RIGHT-MARGIN) (PROGRAM-FNS-WITH-RAW-CODE RELIEVE-HYP-SYNP EV-W-LST SIMPLIFY-CLAUSE1 EV-REC-ACL2-UNWIND-PROTECT ALLOCATE-FIXNUM-RANGE TRACE$-FN-GENERAL EV-FNCALL! OPEN-TRACE-FILE-FN SET-TRACE-EVISC-TUPLE EV-FNCALL-W-BODY EV-REC SETUP-SIMPLIFY-CLAUSE-POT-LST1 SAVE-EXEC-FN CW-GSTACK-FN RECOMPRESS-GLOBAL-ENABLED-STRUCTURE EV-W VERBOSE-PSTACK COMP-FN ACL2-RAW-EVAL PSTACK-FN DMR-START-FN EV-FNCALL-META LD-LOOP PRINT-SUMMARY EV EV-LST ALLEGRO-ALLOCATE-SLOWLY-FN CERTIFY-BOOK-FN TRANSLATE11-FLET-ALIST1 INCLUDE-BOOK-FN1 INCLUDE-BOOK-FN SET-W PROVE-LOOP CHK-VIRGIN-MSG W-OF-ANY-STATE LD-FN-BODY UNTRANSLATE LONGEST-COMMON-TAIL-LENGTH-REC COMPILE-FUNCTION UNTRANSLATE-LST EV-SYNP ADD-POLYS DMR-STOP-FN LD-PRINT-RESULTS CLOSE-TRACE-FILE-FN EV-FNCALL-REC EV-FNCALL LD-FN0 LD-FN WRITE-EXPANSION-FILE LATCH-STOBJS1 CHK-PACKAGE-REINCARNATION-IMPORT-RESTRICTIONS UNTRACE$-FN1 BDD-TOP DEFSTOBJ-FIELD-FNS-RAW-DEFS TIMES-MOD-M31 IPRINT-AR-AREF1 PROVE MAKE-EVENT-FN OOPS-WARNING UBT-PREHISTORY-FN GET-DECLAIM-LIST PATHNAME-UNIX-TO-OS HCOMP-BUILD-FROM-STATE DEFCONST-VAL PUSH-WARNING-FRAME POP-WARNING-FRAME PUSH-WARNING INITIALIZE-ACCUMULATED-WARNINGS EV-REC-RETURN-LAST CHK-RETURN-LAST-ENTRY FCHECKSUM-ATOM STEP-LIMIT-ERROR1 WATERFALL1-LST@PAR WATERFALL1-WRAPPER@PAR-BEFORE WATERFALL1-WRAPPER@PAR-AFTER INCREMENT-WATERFALL-PARALLELISM-COUNTER FLUSH-WATERFALL-PARALLELISM-HASHTABLES CLEAR-CURRENT-WATERFALL-PARALLELISM-HT SETUP-WATERFALL-PARALLELISM-HT-FOR-NAME SET-WATERFALL-PARALLELISM-FN FIX-STOBJ-ARRAY-TYPE SET-GC-THRESHOLD$-FN CERTIFY-BOOK-FINISH-COMPLETE CHK-ABSSTOBJ-INVARIANTS GET-STOBJ-CREATOR IPRINT-ORACLE-UPDATES IPRINT-ORACLE-UPDATES@PAR LD-FIX-COMMAND UPDATE-ENABLED-STRUCTURE-ARRAY UPDATE-ENABLED-STRUCTURE FCHECKSUM-OBJ2 CHECK-SUM-OBJ VERIFY-GUARDS-FN1 EV-FNCALL+-W EXTEND-CURRENT-THEORY DEFSTOBJ-FN APPLY-USER-STOBJ-ALIST-OR-KWOTE ACCP-INFO READ-FILE-ITERATE-SAFE) (PROMPT-FUNCTION . DEFAULT-PRINT-PROMPT) (PROMPT-MEMO) (PROOF-TREE) (PROOF-TREE-BUFFER-WIDTH . 65) (PROOF-TREE-CTX) (PROOF-TREE-INDENT . "| ") (PROOF-TREE-START-PRINTED) (PROOFS-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (PROTECT-MEMOIZE-STATISTICS) (RAW-GUARD-WARNINGP) (RAW-INCLUDE-BOOK-DIR!-ALIST . :IGNORE) (RAW-INCLUDE-BOOK-DIR-ALIST . :IGNORE) (RAW-PROOF-FORMAT) (RAW-WARNING-FORMAT) (REDO-FLAT-FAIL) (REDO-FLAT-SUCC) (REDUNDANT-WITH-RAW-CODE-OKP) (RETRACE-P) (SAFE-MODE) (SAVE-EXPANSION-FILE) (SAVED-OUTPUT-P) (SAVED-OUTPUT-REVERSED) (SAVED-OUTPUT-TOKEN-LST) (SCRIPT-MODE) (SERIALIZE-CHARACTER) (SERIALIZE-CHARACTER-SYSTEM) (SHOW-CUSTOM-KEYWORD-HINT-EXPANSION) (SKIP-NOTIFY-ON-DEFTTAG) (SKIP-PROOFS-BY-SYSTEM) (SKIP-PROOFS-OKP-CERT . T) (SKIP-RESET-PREHISTORY) (SLOW-APPLY$-ACTION . T) (SLOW-ARRAY-ACTION . :BREAK) (SPLITTER-OUTPUT . T) (STANDARD-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (STANDARD-OI . ACL2-OUTPUT-CHANNEL::STANDARD-OBJECT-INPUT-0) (STEP-LIMIT-RECORD) (SYSTEM-ATTACHMENTS-CACHE) (SYSTEM-BOOKS-DIR) (TEMP-TOUCHABLE-FNS) (TEMP-TOUCHABLE-VARS) (TERM-EVISC-TUPLE . :DEFAULT) (TIMER-ALIST) (TMP-DIR) (TOTAL-PARALLELISM-WORK-LIMIT . 8000) (TOTAL-PARALLELISM-WORK-LIMIT-ERROR . T) (TRACE-CO . ACL2-OUTPUT-CHANNEL::STANDARD-CHARACTER-OUTPUT-0) (TRACE-SPECS) (TRIPLE-PRINT-PREFIX . " ") (TTAGS-ALLOWED . :ALL) (UNDONE-WORLDS-KILL-RING NIL NIL NIL) (USELESS-RUNES) (USER-HOME-DIR) (VERBOSE-THEORY-WARNING . T) (VERIFY-TERMINATION-ON-RAW-PROGRAM-OKP APPLY$-LAMBDA APPLY$-PRIM PLIST-WORLDP-WITH-FORMALS) (WALKABOUT-ALIST) (WATERFALL-PARALLELISM) (WATERFALL-PARALLELISM-TIMING-THRESHOLD . 10000) (WATERFALL-PRINTING . :FULL) (WATERFALL-PRINTING-WHEN-FINISHED) (WINDOW-INTERFACE-POSTLUDE . "#>\\>#<\\\\>") (WINDOW-INTERFACE-PRELUDE . "~%#<\\\\>#<\\<~sw") (WINDOW-INTERFACEP) (WORMHOLE-NAME) (WORMHOLE-STATUS) (WRITE-ACL2X) (WRITE-BOOKDATA) (WRITE-FOR-READ) (WRITES-OKP . T)) (NTH 2 STATE)) (PLIST-WORLDP (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD (NTH 2 STATE)))) (SYMBOL-ALISTP (FGETPROP 'ACL2-DEFAULTS-TABLE 'TABLE-ALIST NIL (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD (NTH 2 STATE))))) (TIMER-ALISTP (CDR (ASSOC-EQUAL 'TIMER-ALIST (NTH 2 STATE)))) (KNOWN-PACKAGE-ALISTP (FGETPROP 'KNOWN-PACKAGE-ALIST 'GLOBAL-VALUE NIL (CDR (ASSOC-EQUAL 'CURRENT-ACL2-WORLD (NTH 2 STATE))))) (TRUE-LISTP (NTH 3 STATE)) (32-BIT-INTEGER-LISTP (NTH 4 STATE)) (INTEGERP (NTH 5 STATE)) (INTEGER-LISTP (NTH 6 STATE)) (TRUE-LISTP (NTH 7 STATE)) (INTEGERP (NTH 8 STATE)) (<= 0 (NTH 8 STATE)) (READABLE-FILES-LISTP (NTH 9 STATE)) (WRITTEN-FILE-LISTP (NTH 10 STATE)) (READ-FILE-LISTP (NTH 11 STATE)) (WRITABLE-FILE-LISTP (NTH 12 STATE)) (TRUE-LIST-LISTP (NTH 13 STATE)) (SYMBOL-ALISTP (NTH 14 STATE))) (LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE VAL STATE))) (AND (BOUNDP-GLOBAL1 'DMRP STATE) (STATE-P1 STATE) (OR (NOT (CONSP (CDR (ASSOC-EQUAL 'DMRP (NTH 2 STATE))))) (STATE-P1 STATE))))). [GC for 9120 CONS pages..(T=24).GC finished] [GC for 9130 CONS pages..(T=20).GC finished] [GC for 9130 CONS pages..(T=19).GC finished] [GC for 9140 CONS pages..(T=18).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=16).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=16).GC finished] [GC for 9150 CONS pages..(T=28).GC finished] [GC for 9150 CONS pages..(T=24).GC finished] [GC for 9150 CONS pages..(T=22).GC finished] [GC for 9150 CONS pages..(T=20).GC finished] [GC for 9150 CONS pages..(T=17).GC finished] [GC for 9150 CONS pages..(T=16).GC finished] [GC for 9150 CONS pages..(T=15).GC finished] [GC for 9160 CONS pages..(T=15).GC finished] [GC for 9160 CONS pages..(T=16).GC finished] [GC for 9160 CONS pages..(T=17).GC finished] [GC for 9160 CONS pages..(T=33).GC finished] [GC for 9160 CONS pages..(T=20).GC finished] [GC for 9160 CONS pages..(T=16).GC finished] [GC for 9160 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=19).GC finished] [GC for 9170 CONS pages..(T=26).GC finished] [GC for 9170 CONS pages..(T=26).GC finished] [GC for 9170 CONS pages..(T=20).GC finished] [GC for 9170 CONS pages..(T=21).GC finished] [GC for 9170 CONS pages..(T=25).GC finished] [GC for 9170 CONS pages..(T=26).GC finished] [GC for 9170 CONS pages..(T=20).GC finished] [GC for 9170 CONS pages..(T=19).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=22).GC finished] [GC for 9170 CONS pages..(T=24).GC finished] [GC for 9170 CONS pages..(T=20).GC finished] [GC for 9170 CONS pages..(T=19).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=18).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=14).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=15).GC finished] [GC for 9170 CONS pages..(T=16).GC finished] [GC for 9170 CONS pages..(T=17).GC finished] [GC for 9170 CONS pages..(T=24).GC finished] [GC for 9170 CONS pages..(T=27).GC finished] [GC for 9170 CONS pages..(T=24).GC finished] [GC for 9170 CONS pages..(T=25).GC finished] [GC for 9170 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=24).GC finished] [GC for 9180 CONS pages..(T=24).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=27).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=24).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=24).GC finished] [GC for 9180 CONS pages..(T=27).GC finished] [GC for 9180 CONS pages..(T=29).GC finished] [GC for 9180 CONS pages..(T=27).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=27).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=25).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] [GC for 9180 CONS pages..(T=27).GC finished] [GC for 9180 CONS pages..(T=26).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE, ALL-BOUNDP, BIG-CLOCK-ENTRY, BOUNDP-GLOBAL1, FILE-CLOCK, FILE-CLOCK-P, GLOBAL-TABLE, IDATES, LENGTH, LIST-ALL-PACKAGE-NAMES-LST, MEMBER-EQUAL, NOT, NTH, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, PUT-GLOBAL, READ-FILES, READ-FILES-P, READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, UPDATE-GLOBAL-TABLE, USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES and WRITTEN-FILES-P, the :executable-counterparts of ALL-BOUNDP, BINARY-+, CAR, CDR, CONSP, EQUAL, MAX, NFIX, NTH, OPEN-CHANNEL-LISTP, ORDERED-SYMBOL-ALISTP and ZP, primitive type reasoning, the :forward- chaining rules CONSP-ASSOC-EQUAL, EQLABLE-ALISTP-FORWARD-TO-ALISTP, ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP and SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP, the :rewrite rules ADD-PAIR-PRESERVES-ALL-BOUNDP, ASSOC-ADD-PAIR, LEN-UPDATE-NTH, NTH-UPDATE-NTH, ORDERED-SYMBOL-ALISTP-ADD-PAIR and STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rules 32-BIT-INTEGER-LISTP, ALISTP, CONSP-ASSOC-EQUAL, EQLABLE-ALISTP, INTEGER-LISTP, KNOWN-PACKAGE-ALISTP, OPEN-CHANNEL-LISTP, ORDERED-SYMBOL-ALISTP, PLIST-WORLDP, READ-FILE-LISTP, READABLE-FILES-LISTP, SYMBOL-ALISTP, TIMER-ALISTP, TRUE-LIST-LISTP, TRUE-LISTP-UPDATE-NTH, UPDATE-NTH, WRITABLE-FILE-LISTP and WRITTEN-FILE-LISTP. Q.E.D. That completes the proof of the guard theorem for SET-DEBUGGER-ENABLE-FN. SET-DEBUGGER-ENABLE-FN is compliant with Common Lisp. Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION 32-BIT-INTEGER-STACK) (:DEFINITION ACL2-ORACLE) (:DEFINITION ALL-BOUNDP) (:DEFINITION BIG-CLOCK-ENTRY) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION FILE-CLOCK) (:DEFINITION FILE-CLOCK-P) (:DEFINITION GET-GLOBAL) (:DEFINITION GLOBAL-TABLE) (:DEFINITION IDATES) (:DEFINITION LENGTH) (:DEFINITION LIST-ALL-PACKAGE-NAMES-LST) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NATP) (:DEFINITION NOT) (:DEFINITION NTH) (:DEFINITION OPEN-CHANNELS-P) (:DEFINITION OPEN-INPUT-CHANNELS) (:DEFINITION OPEN-OUTPUT-CHANNELS) (:DEFINITION PUT-GLOBAL) (:DEFINITION READ-FILES) (:DEFINITION READ-FILES-P) (:DEFINITION READABLE-FILES) (:DEFINITION READABLE-FILES-P) (:DEFINITION STATE-P) (:DEFINITION STATE-P1) (:DEFINITION T-STACK) (:DEFINITION UPDATE-GLOBAL-TABLE) (:DEFINITION USER-STOBJ-ALIST1) (:DEFINITION WRITEABLE-FILES) (:DEFINITION WRITEABLE-FILES-P) (:DEFINITION WRITTEN-FILES) (:DEFINITION WRITTEN-FILES-P) (:EXECUTABLE-COUNTERPART ALL-BOUNDP) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART MAX) (:EXECUTABLE-COUNTERPART NFIX) (:EXECUTABLE-COUNTERPART NTH) (:EXECUTABLE-COUNTERPART OPEN-CHANNEL-LISTP) (:EXECUTABLE-COUNTERPART ORDERED-SYMBOL-ALISTP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CONSP-ASSOC-EQUAL) (:FORWARD-CHAINING EQLABLE-ALISTP-FORWARD-TO-ALISTP) (:FORWARD-CHAINING ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:FORWARD-CHAINING SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP) (:REWRITE ADD-PAIR-PRESERVES-ALL-BOUNDP) (:REWRITE ASSOC-ADD-PAIR) (:REWRITE LEN-UPDATE-NTH) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:REWRITE NTH-UPDATE-NTH) (:REWRITE ORDERED-SYMBOL-ALISTP-ADD-PAIR) (:REWRITE STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION 32-BIT-INTEGER-LISTP) (:TYPE-PRESCRIPTION ALISTP) (:TYPE-PRESCRIPTION CONSP-ASSOC-EQUAL) (:TYPE-PRESCRIPTION EQLABLE-ALISTP) (:TYPE-PRESCRIPTION INTEGER-LISTP) (:TYPE-PRESCRIPTION KNOWN-PACKAGE-ALISTP) (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK) (:TYPE-PRESCRIPTION OPEN-CHANNEL-LISTP) (:TYPE-PRESCRIPTION ORDERED-SYMBOL-ALISTP) (:TYPE-PRESCRIPTION PLIST-WORLDP) (:TYPE-PRESCRIPTION PUT-GLOBAL) (:TYPE-PRESCRIPTION READ-FILE-LISTP) (:TYPE-PRESCRIPTION READABLE-FILES-LISTP) (:TYPE-PRESCRIPTION STATE-P) (:TYPE-PRESCRIPTION SYMBOL-ALISTP) (:TYPE-PRESCRIPTION TIMER-ALISTP) (:TYPE-PRESCRIPTION TRUE-LIST-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-UPDATE-NTH) (:TYPE-PRESCRIPTION UPDATE-NTH) (:TYPE-PRESCRIPTION WRITABLE-FILE-LISTP) (:TYPE-PRESCRIPTION WRITTEN-FILE-LISTP)) Time: 40.01 seconds (prove: 39.56, print: 0.03, other: 0.42) Prover steps counted: 281055 SET-DEBUGGER-ENABLE-FN [GC for 9180 CONS pages..(T=24).GC finished] Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24) (:NUMBER-OF-ENABLED-RUNES 3016) Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) (:NUMBER-OF-ENABLED-RUNES 3015) Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) (:NUMBER-OF-ENABLED-RUNES 3014) Since ADD-@PAR-SUFFIX is non-recursive, its admission is trivial. We observe that the type of ADD-@PAR-SUFFIX is described by the theorem (SYMBOLP (ADD-@PAR-SUFFIX SYMBOL)). We used the :type-prescription rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL. Computing the guard conjecture for ADD-@PAR-SUFFIX.... The guard conjecture for ADD-@PAR-SUFFIX is trivial to prove, given primitive type reasoning and the :type-prescription rule STRING-APPEND. ADD-@PAR-SUFFIX is compliant with Common Lisp. Summary Form: ( DEFUN ADD-@PAR-SUFFIX ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION STRING-APPEND) (:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) ADD-@PAR-SUFFIX The admission of GENERATE-@PAR-MAPPINGS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT SYMBOLS). We observe that the type of GENERATE-@PAR-MAPPINGS is described by the theorem (TRUE-LISTP (GENERATE-@PAR-MAPPINGS SYMBOLS)). We used primitive type reasoning. Computing the guard conjecture for GENERATE-@PAR-MAPPINGS.... The non-trivial part of the guard conjecture for GENERATE-@PAR-MAPPINGS, given the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP and the :type-prescription rules ATOM-LISTP, EQLABLE-LISTP and SYMBOL-LISTP, is Goal (AND (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (NOT (ENDP SYMBOLS))) (SYMBOLP (CAR SYMBOLS))) (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (NOT (ENDP SYMBOLS))) (SYMBOL-LISTP (CDR SYMBOLS)))). By the simple :definition ENDP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (CONSP SYMBOLS)) (SYMBOLP (CAR SYMBOLS))). But simplification reduces this to T, using the :definition SYMBOL-LISTP. Subgoal 1 (IMPLIES (AND (SYMBOL-LISTP SYMBOLS) (CONSP SYMBOLS)) (SYMBOL-LISTP (CDR SYMBOLS))). But simplification reduces this to T, using the :definition SYMBOL-LISTP. Q.E.D. That completes the proof of the guard theorem for GENERATE-@PAR-MAPPINGS. GENERATE-@PAR-MAPPINGS is compliant with Common Lisp. Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION SYMBOL-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP) (:FORWARD-CHAINING SYMBOL-LISTP-FORWARD-TO-EQLABLE-LISTP) (:TYPE-PRESCRIPTION ATOM-LISTP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION SYMBOL-LISTP)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) Prover steps counted: 115 GENERATE-@PAR-MAPPINGS The event ( DEFCONST *@PAR-MAPPINGS* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *@PAR-MAPPINGS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The admission of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT MAPPINGS). We observe that the type of MAKE-IDENTITY-FOR-@PAR-MAPPINGS is described by the theorem (TRUE-LISTP (MAKE-IDENTITY-FOR-@PAR-MAPPINGS MAPPINGS)). We used primitive type reasoning. Computing the guard conjecture for MAKE-IDENTITY-FOR-@PAR-MAPPINGS.... The non-trivial part of the guard conjecture for MAKE-IDENTITY-FOR-@PAR-MAPPINGS, given the :forward-chaining rule ALISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule ALISTP, is Goal (AND (IMPLIES (AND (ALISTP MAPPINGS) (NOT (ENDP MAPPINGS))) (ALISTP (CDR MAPPINGS))) (IMPLIES (AND (ALISTP MAPPINGS) (NOT (ENDP MAPPINGS)) (NOT (CONSP (CAR MAPPINGS)))) (EQUAL (CAR MAPPINGS) NIL))). By the simple :definition ENDP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (ALISTP MAPPINGS) (CONSP MAPPINGS)) (ALISTP (CDR MAPPINGS))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 1 (IMPLIES (AND (ALISTP MAPPINGS) (CONSP MAPPINGS) (NOT (CONSP (CAR MAPPINGS)))) (EQUAL (CAR MAPPINGS) NIL)). But simplification reduces this to T, using the :definition ALISTP. Q.E.D. That completes the proof of the guard theorem for MAKE-IDENTITY-FOR-@PAR-MAPPINGS. MAKE-IDENTITY-FOR-@PAR-MAPPINGS is compliant with Common Lisp. Summary Form: ( DEFUN MAKE-IDENTITY-FOR-@PAR-MAPPINGS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP) (:TYPE-PRESCRIPTION ALISTP)) Time: 0.16 seconds (prove: 0.00, print: 0.01, other: 0.15) Prover steps counted: 127 MAKE-IDENTITY-FOR-@PAR-MAPPINGS The event ( DEFMACRO DEFINE-@PAR-MACROS ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO DEFINE-@PAR-MACROS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CATCH-TIME-LIMIT5@PAR (&REST RST) (CONS 'CATCH-TIME-LIMIT5 RST)) The event ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CATCH-TIME-LIMIT5@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR (&REST RST) (CONS 'CMP-AND-VALUE-TO-ERROR-QUADRUPLE RST)) The event ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CMP-AND-VALUE-TO-ERROR-QUADRUPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CMP-TO-ERROR-TRIPLE@PAR (&REST RST) (CONS 'CMP-TO-ERROR-TRIPLE RST)) The event ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CMP-TO-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ER@PAR (&REST RST) (CONS 'ER RST)) The event ( DEFMACRO ER@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO ER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ER-LET*@PAR (&REST RST) (CONS 'ER-LET* RST)) The event ( DEFMACRO ER-LET*@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO ER-LET*@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ER-PROGN@PAR (&REST RST) (CONS 'ER-PROGN RST)) The event ( DEFMACRO ER-PROGN@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO ER-PROGN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ERROR-FMS@PAR (&REST RST) (CONS 'ERROR-FMS RST)) The event ( DEFMACRO ERROR-FMS@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO ERROR-FMS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR (&REST RST) (CONS 'ERROR-IN-PARALLELISM-MODE RST)) The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ERROR1@PAR (&REST RST) (CONS 'ERROR1 RST)) The event ( DEFMACRO ERROR1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO ERROR1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO F-PUT-GLOBAL@PAR (&REST RST) (CONS 'F-PUT-GLOBAL RST)) The event ( DEFMACRO F-PUT-GLOBAL@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO F-PUT-GLOBAL@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO IO?@PAR (&REST RST) (CONS 'IO? RST)) The event ( DEFMACRO IO?@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO IO?@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO IO?-PROVE@PAR (&REST RST) (CONS 'IO?-PROVE RST)) The event ( DEFMACRO IO?-PROVE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO IO?-PROVE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MV@PAR (&REST RST) (CONS 'MV RST)) The event ( DEFMACRO MV@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO MV@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MV-LET@PAR (&REST RST) (CONS 'MV-LET RST)) The event ( DEFMACRO MV-LET@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO MV-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST) (CONS 'PARALLEL-ONLY RST)) The event ( DEFMACRO PARALLEL-ONLY@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PARALLEL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PPROGN@PAR (&REST RST) (CONS 'PPROGN RST)) The event ( DEFMACRO PPROGN@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PPROGN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR (&REST RST) (CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM RST)) The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST) (CONS 'SERIAL-ONLY RST)) The event ( DEFMACRO SERIAL-ONLY@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO SERIAL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO SL-LET@PAR (&REST RST) (CONS 'SL-LET RST)) The event ( DEFMACRO SL-LET@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO SL-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO STATE-MAC@PAR (&REST RST) (CONS 'STATE-MAC RST)) The event ( DEFMACRO STATE-MAC@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO STATE-MAC@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO VALUE@PAR (&REST RST) (CONS 'VALUE RST)) The event ( DEFMACRO VALUE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WARNING$@PAR (&REST RST) (CONS 'WARNING$ RST)) The event ( DEFMACRO WARNING$@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WARNING$@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'ADD-CUSTOM-KEYWORD-HINT RST)) The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST) (CONS 'EVAL-CLAUSE-PROCESSOR RST)) The event ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO EVAL-THEORY-EXPR@PAR (&REST RST) (CONS 'EVAL-THEORY-EXPR RST)) The event ( DEFMACRO EVAL-THEORY-EXPR@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO EVAL-THEORY-EXPR@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO FORMAL-VALUE-TRIPLE@PAR (&REST RST) (CONS 'FORMAL-VALUE-TRIPLE RST)) The event ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO FORMAL-VALUE-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO INCREMENT-TIMER@PAR (&REST RST) (CONS 'INCREMENT-TIMER RST)) The event ( DEFMACRO INCREMENT-TIMER@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO INCREMENT-TIMER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR (&REST RST) (CONS 'SIMPLE-TRANSLATE-AND-EVAL RST)) The event ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SIMPLE-TRANSLATE-AND-EVAL@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-IN-THEORY-HINT RST)) The event ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-IN-THEORY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE-ID RST)) The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL RST)) The event ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE-ID-FMT1-CALL@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR (&REST RST) (CONS 'WATERFALL-UPDATE-GAG-STATE RST)) The event ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-UPDATE-GAG-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL1-LST@PAR (&REST RST) (CONS 'WATERFALL1-LST RST)) The event ( DEFMACRO WATERFALL1-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL1-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL1-WRAPPER@PAR (&REST RST) (CONS 'WATERFALL1-WRAPPER RST)) The event ( DEFMACRO WATERFALL1-WRAPPER@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL1-WRAPPER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO XTRANS-EVAL@PAR (&REST RST) (CONS 'XTRANS-EVAL RST)) The event ( DEFMACRO XTRANS-EVAL@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO XTRANS-EVAL@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR (&REST RST) (CONS 'ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE RST)) The event ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR (&REST RST) (CONS 'ADD-CUSTOM-KEYWORD-HINT-FN RST)) The event ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT-FN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT@PAR (&REST RST) (CONS 'APPLY-OVERRIDE-HINT RST)) The event ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-OVERRIDE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINT1@PAR (&REST RST) (CONS 'APPLY-OVERRIDE-HINT1 RST)) The event ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-OVERRIDE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-OVERRIDE-HINTS@PAR (&REST RST) (CONS 'APPLY-OVERRIDE-HINTS RST)) The event ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-OVERRIDE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-REORDER-HINT@PAR (&REST RST) (CONS 'APPLY-REORDER-HINT RST)) The event ( DEFMACRO APPLY-REORDER-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR (&REST RST) (CONS 'APPLY-TOP-HINTS-CLAUSE RST)) The event ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO APPLY-TOP-HINTS-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR (&REST RST) (CONS 'CHECK-TRANSLATED-OVERRIDE-HINT RST)) The event ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHECK-TRANSLATED-OVERRIDE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-ARGLIST@PAR (&REST RST) (CONS 'CHK-ARGLIST RST)) The event ( DEFMACRO CHK-ARGLIST@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO CHK-ARGLIST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-DO-NOT-EXPR-VALUE RST)) The event ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-DO-NOT-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-EQUAL-ARITIES@PAR (&REST RST) (CONS 'CHK-EQUAL-ARITIES RST)) The event ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST) (CONS 'CHK-EQUIV-CLASSICALP RST)) The event ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE RST)) The event ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE1 RST)) The event ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT RST)) The event ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT1 RST)) The event ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER RST)) The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1 RST)) The event ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'EVAL-AND-TRANSLATE-HINT-EXPRESSION RST)) The event ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO EVAL-AND-TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS RST)) The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR (&REST RST) (CONS 'FIND-APPLICABLE-HINT-SETTINGS1 RST)) The event ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO FIND-APPLICABLE-HINT-SETTINGS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO GAG-STATE-EXITING-CL-ID@PAR (&REST RST) (CONS 'GAG-STATE-EXITING-CL-ID RST)) The event ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO GAG-STATE-EXITING-CL-ID@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-PSPV RST)) The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-PSPV@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR (&REST RST) (CONS 'LOAD-HINT-SETTINGS-INTO-RCNST RST)) The event ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-HINT-SETTINGS-INTO-RCNST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR (&REST RST) (CONS 'LOAD-THEORY-INTO-ENABLED-STRUCTURE RST)) The event ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO LOAD-THEORY-INTO-ENABLED-STRUCTURE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-FROM-RCNSTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR (&REST RST) (CONS 'MAYBE-WARN-ABOUT-THEORY-SIMPLE RST)) The event ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-ABOUT-THEORY-SIMPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR (&REST RST) (CONS 'MAYBE-WARN-FOR-USE-HINT RST)) The event ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MAYBE-WARN-FOR-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR (&REST RST) (CONS 'PAIR-CL-ID-WITH-HINT-SETTING RST)) The event ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PAIR-CL-ID-WITH-HINT-SETTING@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PROCESS-BACKTRACK-HINT@PAR (&REST RST) (CONS 'PROCESS-BACKTRACK-HINT RST)) The event ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PROCESS-BACKTRACK-HINT@PAR ...) Rules: NIL [GC for 9180 CONS pages..(T=24).GC finished] Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST) (CONS 'PUSH-CLAUSE RST)) The event ( DEFMACRO PUSH-CLAUSE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PUSH-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR (&REST RST) (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM RST)) The event ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST) (CONS 'RECORD-GAG-STATE RST)) The event ( DEFMACRO RECORD-GAG-STATE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST) (CONS 'THANKS-FOR-THE-HINT RST)) The event ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE@PAR (&REST RST) (CONS 'TRANSLATE RST)) The event ( DEFMACRO TRANSLATE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE1@PAR (&REST RST) (CONS 'TRANSLATE1 RST)) The event ( DEFMACRO TRANSLATE1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKTRACK-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT1 RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BY-HINT RST)) The event ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT RST)) The event ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASES-HINT RST)) The event ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT RST)) The event ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT RST)) The event ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) The event ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HINT RST)) The event ( DEFMACRO TRANSLATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST) (CONS 'TRANSLATE-HINTS RST)) The event ( DEFMACRO TRANSLATE-HINTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS1 RST)) The event ( DEFMACRO TRANSLATE-HINTS1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST) (CONS 'TRANSLATE-HINTS2 RST)) The event ( DEFMACRO TRANSLATE-HINTS2@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS+1 RST)) The event ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSION RST)) The event ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-EXPRESSIONS RST)) The event ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-EXPRESSIONS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT-SETTINGS@PAR (&REST RST) (CONS 'TRANSLATE-HINT-SETTINGS RST)) The event ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-INDUCT-HINT RST)) The event ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI@PAR (&REST RST) (CONS 'TRANSLATE-LMI RST)) The event ( DEFMACRO TRANSLATE-LMI@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/FUNCTIONAL-INSTANCE RST)) The event ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI/FUNCTIONAL-INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/INSTANCE RST)) The event ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-OP-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-THANKS-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NONLINEARP-HINT RST)) The event ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-OR-HINT RST)) The event ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST) (CONS 'TRANSLATE-REORDER-HINT RST)) The event ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RESTRICT-HINT RST)) The event ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RW-CACHE-STATE-HINT RST)) The event ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR (&REST RST) (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE RST)) The event ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) The event ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) The event ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) The event ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) The event ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) The event ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0