Fri Aug 4 00:35:53 UTC 2023 I: starting to build acl2/unstable/amd64 on jenkins on '2023-08-04 00:35' Fri Aug 4 00:35:53 UTC 2023 I: The jenkins build log is/was available at https://jenkins.debian.net/userContent/reproducible/debian/build_service/amd64_7/3975/console.log Fri Aug 4 00:35:53 UTC 2023 I: Downloading source for unstable/acl2=8.5dfsg-5 --2023-08-04 00:35:54-- http://deb.debian.org/debian/pool/main/a/acl2/acl2_8.5dfsg-5.dsc Connecting to 78.137.99.97:3128... connected. Proxy request sent, awaiting response... 200 OK Length: 2268 (2.2K) [text/prs.lines.tag] Saving to: ‘acl2_8.5dfsg-5.dsc’ 0K .. 100% 205M=0s 2023-08-04 00:35:54 (205 MB/s) - ‘acl2_8.5dfsg-5.dsc’ saved [2268/2268] Fri Aug 4 00:35:54 UTC 2023 I: acl2_8.5dfsg-5.dsc -----BEGIN PGP SIGNED MESSAGE----- Hash: SHA256 Format: 3.0 (quilt) Source: acl2 Binary: acl2, acl2-source, elpa-acl2, acl2-infix, acl2-infix-source, acl2-books, acl2-books-source, acl2-books-certs, acl2-doc Architecture: any all Version: 8.5dfsg-5 Maintainer: Camm Maguire Homepage: https://www.cs.utexas.edu/users/moore/acl2/ Standards-Version: 4.5.1 Build-Depends: debhelper-compat (= 13), gcl (>= 2.6.14-1), debhelper (>= 13), texlive-latex-recommended, time, texinfo Build-Depends-Indep: dh-elpa Package-List: acl2 deb math optional arch=any acl2-books deb math optional arch=any acl2-books-certs deb math optional arch=all acl2-books-source deb math optional arch=all acl2-doc deb doc optional arch=all acl2-infix deb math optional arch=any acl2-infix-source deb math optional arch=all acl2-source deb math optional arch=all elpa-acl2 deb lisp optional arch=all Checksums-Sha1: 2c44f1f16e4d40bc93ad07e38dc2b7eb6626b28f 223546594 acl2_8.5dfsg.orig.tar.gz 41b11782380e7becf6a5cf1222bee0fdcac5b42e 312896 acl2_8.5dfsg-5.debian.tar.xz Checksums-Sha256: 6e9c7a3c75111429e8009369a28593aa91d84f668e7918980f33bd9996c1d819 223546594 acl2_8.5dfsg.orig.tar.gz 68b7e667901b0b77e27f9884f8b96b5571858a1e0a3a38ca3289440f39f93008 312896 acl2_8.5dfsg-5.debian.tar.xz Files: ac4cf2aefbdbc7436cf745fa05b8d373 223546594 acl2_8.5dfsg.orig.tar.gz 217b5de7bf23c4901da5c804eb348d30 312896 acl2_8.5dfsg-5.debian.tar.xz -----BEGIN PGP SIGNATURE----- iQIzBAEBCAAdFiEE/iFPNjaXdzJC6BbsuEXOUQ+bcU0FAmPEpfkACgkQuEXOUQ+b cU19aA//a9JhcVzZenXyFtw7vygCQoqnP5a2v2h7Ad02fBXb0mNvufthY/z0cyO0 Gz6KQzAZAnSnMVWFzdEiaPevtR4B1znXKFTJaTbWvCftEWmFa0r75OtQbe+VSG1o abKbeXEHM8fT2x4Ode4HPvbtii7re2jFGnVD9SG3HkB9dTUyZz8St8v+NQBcy6JH HfxEJx1E19V6OzCCj4K0LQR9Tar4oDMrrIwrxGRtD0avf7EbPOXd1ug9DKkeBac4 ChehBzxhVpXr6Z7FqLnPyzegru0YIEQqjJWA1erLqtEN3a1sKNhI54qrg2Sd8Dpx lBdLC1g3XBtGgO5tQAV95k+LczOGV9aJF0EB7/rb+UL2I2ZrPyBMTL3EK0zyCWGl Hf0iuPrA8Os2JkYE0xLSIVk2Vpwxwdg92VfAEZMHpzlijMKtsHfdDOGhBzsB+/KN w4apID1hRr9AYWGamTuAiOEgT0ZBi/dzijplikGV1l3TBobpNMVJbMtxfGJpQfNO GV1J3BYmqb8BUrd0j5XJrPJieHI3PLlpB4Z5wYLuDFovmzEs+2mmuQ3jae29yBVt tv6w8GM1bZFx+khBwu1h7x9K9wclmWMOplP71mkPdzn2knbo7i9d5scYMN1+uvmt OI0UUowI+47/y1QqxqZVR+ReA+DaJCLUMFHNCz6ahUxhUb/87AQ= =uRvy -----END PGP SIGNATURE----- Fri Aug 4 00:35:54 UTC 2023 I: Checking whether the package is not for us Fri Aug 4 00:35:54 UTC 2023 I: Starting 1st build on remote node ionos11-amd64.debian.net. Fri Aug 4 00:35:54 UTC 2023 I: Preparing to do remote build '1' on ionos11-amd64.debian.net. Fri Aug 4 18:36:11 UTC 2023 I: Deleting $TMPDIR on ionos11-amd64.debian.net. I: pbuilder: network access will be disabled during build I: Current time: Thu Aug 3 12:36:01 -12 2023 I: pbuilder-time-stamp: 1691109361 I: Building the build Environment I: extracting base tarball [/var/cache/pbuilder/unstable-reproducible-base.tgz] I: copying local configuration W: --override-config is not set; not updating apt.conf Read the manpage for details. I: mounting /proc filesystem I: mounting /sys filesystem I: creating /{dev,run}/shm I: mounting /dev/pts filesystem I: redirecting /dev/ptmx to /dev/pts/ptmx I: policy-rc.d already exists I: Copying source file I: copying [acl2_8.5dfsg-5.dsc] I: copying [./acl2_8.5dfsg.orig.tar.gz] I: copying [./acl2_8.5dfsg-5.debian.tar.xz] I: Extracting source gpgv: Signature made Sun Jan 15 13:18:49 2023 -12 gpgv: using RSA key FE214F363697773242E816ECB845CE510F9B714D gpgv: Can't check signature: No public key dpkg-source: warning: cannot verify inline signature for ./acl2_8.5dfsg-5.dsc: no acceptable signature found dpkg-source: info: extracting acl2 in acl2-8.5dfsg dpkg-source: info: unpacking acl2_8.5dfsg.orig.tar.gz dpkg-source: info: unpacking acl2_8.5dfsg-5.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 dpkg-source: info: applying package_name_capitalization dpkg-source: info: applying more_package_name_capitalization I: Not using root during the build. I: Installing the build-deps I: user script /srv/workspace/pbuilder/780475/tmp/hooks/D02_print_environment starting I: set BUILDDIR='/build/1st' BUILDUSERGECOS='first user,first room,first work-phone,first home-phone,first other' BUILDUSERNAME='pbuilder1' BUILD_ARCH='amd64' DEBIAN_FRONTEND='noninteractive' DEB_BUILD_OPTIONS='buildinfo=+all reproducible=+all parallel=15 ' DISTRIBUTION='unstable' HOME='/root' HOST_ARCH='amd64' IFS=' ' INVOCATION_ID='7f12119e9e264e00ae2c52896d1e260c' LANG='C' LANGUAGE='en_US:en' LC_ALL='C' MAIL='/var/mail/root' OPTIND='1' PATH='/usr/sbin:/usr/bin:/sbin:/bin:/usr/games' PBCURRENTCOMMANDLINEOPERATION='build' PBUILDER_OPERATION='build' PBUILDER_PKGDATADIR='/usr/share/pbuilder' PBUILDER_PKGLIBDIR='/usr/lib/pbuilder' PBUILDER_SYSCONFDIR='/etc' PPID='780475' PS1='# ' PS2='> ' PS4='+ ' PWD='/' SHELL='/bin/bash' SHLVL='2' SUDO_COMMAND='/usr/bin/timeout -k 18.1h 18h /usr/bin/ionice -c 3 /usr/bin/nice /usr/sbin/pbuilder --build --configfile /srv/reproducible-results/rbuild-debian/r-b-build.VSPpHGr9/pbuilderrc_2Gjk --distribution unstable --hookdir /etc/pbuilder/first-build-hooks --debbuildopts -b --basetgz /var/cache/pbuilder/unstable-reproducible-base.tgz --buildresult /srv/reproducible-results/rbuild-debian/r-b-build.VSPpHGr9/b1 --logfile b1/build.log acl2_8.5dfsg-5.dsc' SUDO_GID='111' SUDO_UID='106' SUDO_USER='jenkins' TERM='unknown' TZ='/usr/share/zoneinfo/Etc/GMT+12' USER='root' _='/usr/bin/systemd-run' http_proxy='http://78.137.99.97:3128' I: uname -a Linux ionos11-amd64 6.1.0-10-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.38-2 (2023-07-27) x86_64 GNU/Linux I: ls -l /bin total 5644 -rwxr-xr-x 1 root root 1265648 Jul 12 21:10 bash -rwxr-xr-x 3 root root 39224 Sep 18 2022 bunzip2 -rwxr-xr-x 3 root root 39224 Sep 18 2022 bzcat lrwxrwxrwx 1 root root 6 Sep 18 2022 bzcmp -> bzdiff -rwxr-xr-x 1 root root 2225 Sep 18 2022 bzdiff lrwxrwxrwx 1 root root 6 Sep 18 2022 bzegrep -> bzgrep -rwxr-xr-x 1 root root 4893 Nov 27 2021 bzexe lrwxrwxrwx 1 root root 6 Sep 18 2022 bzfgrep -> bzgrep -rwxr-xr-x 1 root root 3775 Sep 18 2022 bzgrep -rwxr-xr-x 3 root root 39224 Sep 18 2022 bzip2 -rwxr-xr-x 1 root root 14568 Sep 18 2022 bzip2recover lrwxrwxrwx 1 root root 6 Sep 18 2022 bzless -> bzmore -rwxr-xr-x 1 root root 1297 Sep 18 2022 bzmore -rwxr-xr-x 1 root root 44016 Sep 20 2022 cat -rwxr-xr-x 1 root root 68656 Sep 20 2022 chgrp -rwxr-xr-x 1 root root 64496 Sep 20 2022 chmod -rwxr-xr-x 1 root root 72752 Sep 20 2022 chown -rwxr-xr-x 1 root root 151152 Sep 20 2022 cp -rwxr-xr-x 1 root root 125640 Jun 20 23:28 dash -rwxr-xr-x 1 root root 121904 Sep 20 2022 date -rwxr-xr-x 1 root root 89240 Sep 20 2022 dd -rwxr-xr-x 1 root root 102200 Sep 20 2022 df -rwxr-xr-x 1 root root 151344 Sep 20 2022 dir -rwxr-xr-x 1 root root 82512 Jul 24 01:10 dmesg lrwxrwxrwx 1 root root 8 Dec 19 2022 dnsdomainname -> hostname lrwxrwxrwx 1 root root 8 Dec 19 2022 domainname -> hostname -rwxr-xr-x 1 root root 43856 Sep 20 2022 echo -rwxr-xr-x 1 root root 41 Jul 21 09:33 egrep -rwxr-xr-x 1 root root 35664 Sep 20 2022 false -rwxr-xr-x 1 root root 41 Jul 21 09:33 fgrep -rwxr-xr-x 1 root root 85600 Jul 24 01:10 findmnt -rwsr-xr-x 1 root root 35128 Mar 22 20:35 fusermount -rwxr-xr-x 1 root root 203152 Jul 21 09:33 grep -rwxr-xr-x 2 root root 2346 Apr 9 2022 gunzip -rwxr-xr-x 1 root root 6447 Apr 9 2022 gzexe -rwxr-xr-x 1 root root 98136 Apr 9 2022 gzip -rwxr-xr-x 1 root root 22680 Dec 19 2022 hostname -rwxr-xr-x 1 root root 72824 Sep 20 2022 ln -rwxr-xr-x 1 root root 53024 Mar 23 00:40 login -rwxr-xr-x 1 root root 151344 Sep 20 2022 ls -rwxr-xr-x 1 root root 215360 Jul 24 01:10 lsblk -rwxr-xr-x 1 root root 97552 Sep 20 2022 mkdir -rwxr-xr-x 1 root root 72912 Sep 20 2022 mknod -rwxr-xr-x 1 root root 43952 Sep 20 2022 mktemp -rwxr-xr-x 1 root root 59712 Jul 24 01:10 more -rwsr-xr-x 1 root root 63800 Jul 24 01:10 mount -rwxr-xr-x 1 root root 18744 Jul 24 01:10 mountpoint -rwxr-xr-x 1 root root 142968 Sep 20 2022 mv lrwxrwxrwx 1 root root 8 Dec 19 2022 nisdomainname -> hostname lrwxrwxrwx 1 root root 14 Jun 30 19:43 pidof -> /sbin/killall5 -rwxr-xr-x 1 root root 43952 Sep 20 2022 pwd lrwxrwxrwx 1 root root 4 Jul 12 21:10 rbash -> bash -rwxr-xr-x 1 root root 52112 Sep 20 2022 readlink -rwxr-xr-x 1 root root 72752 Sep 20 2022 rm -rwxr-xr-x 1 root root 56240 Sep 20 2022 rmdir -rwxr-xr-x 1 root root 27560 Jul 9 09:29 run-parts -rwxr-xr-x 1 root root 126424 Jan 5 2023 sed lrwxrwxrwx 1 root root 4 Jun 20 23:28 sh -> dash -rwxr-xr-x 1 root root 43888 Sep 20 2022 sleep -rwxr-xr-x 1 root root 85008 Sep 20 2022 stty -rwsr-xr-x 1 root root 76096 Jul 24 01:10 su -rwxr-xr-x 1 root root 39824 Sep 20 2022 sync -rwxr-xr-x 1 root root 531984 Apr 6 02:25 tar -rwxr-xr-x 1 root root 14520 Jul 9 09:29 tempfile -rwxr-xr-x 1 root root 109616 Sep 20 2022 touch -rwxr-xr-x 1 root root 35664 Sep 20 2022 true -rwxr-xr-x 1 root root 14568 Mar 22 20:35 ulockmgr_server -rwsr-xr-x 1 root root 35128 Jul 24 01:10 umount -rwxr-xr-x 1 root root 43888 Sep 20 2022 uname -rwxr-xr-x 2 root root 2346 Apr 9 2022 uncompress -rwxr-xr-x 1 root root 151344 Sep 20 2022 vdir -rwxr-xr-x 1 root root 72024 Jul 24 01:10 wdctl lrwxrwxrwx 1 root root 8 Dec 19 2022 ypdomainname -> hostname -rwxr-xr-x 1 root root 1984 Apr 9 2022 zcat -rwxr-xr-x 1 root root 1678 Apr 9 2022 zcmp -rwxr-xr-x 1 root root 6460 Apr 9 2022 zdiff -rwxr-xr-x 1 root root 29 Apr 9 2022 zegrep -rwxr-xr-x 1 root root 29 Apr 9 2022 zfgrep -rwxr-xr-x 1 root root 2081 Apr 9 2022 zforce -rwxr-xr-x 1 root root 8103 Apr 9 2022 zgrep -rwxr-xr-x 1 root root 2206 Apr 9 2022 zless -rwxr-xr-x 1 root root 1842 Apr 9 2022 zmore -rwxr-xr-x 1 root root 4577 Apr 9 2022 znew I: user script /srv/workspace/pbuilder/780475/tmp/hooks/D02_print_environment finished -> Attempting to satisfy build-dependencies -> Creating pbuilder-satisfydepends-dummy package Package: pbuilder-satisfydepends-dummy Version: 0.invalid.0 Architecture: amd64 Maintainer: Debian Pbuilder Team Description: Dummy package to satisfy dependencies with aptitude - created by pbuilder This package was created automatically by pbuilder to satisfy the build-dependencies of the package being currently built. Depends: debhelper-compat (= 13), gcl (>= 2.6.14-1), debhelper (>= 13), texlive-latex-recommended, time, texinfo, dh-elpa dpkg-deb: building package 'pbuilder-satisfydepends-dummy' in '/tmp/satisfydepends-aptitude/pbuilder-satisfydepends-dummy.deb'. Selecting previously unselected package pbuilder-satisfydepends-dummy. (Reading database ... 18867 files and directories currently installed.) Preparing to unpack .../pbuilder-satisfydepends-dummy.deb ... Unpacking pbuilder-satisfydepends-dummy (0.invalid.0) ... dpkg: pbuilder-satisfydepends-dummy: dependency problems, but configuring anyway as you requested: pbuilder-satisfydepends-dummy depends on debhelper-compat (= 13); however: Package debhelper-compat is not installed. pbuilder-satisfydepends-dummy depends on gcl (>= 2.6.14-1); however: Package gcl is not installed. pbuilder-satisfydepends-dummy depends on debhelper (>= 13); however: Package debhelper is not installed. pbuilder-satisfydepends-dummy depends on texlive-latex-recommended; however: Package texlive-latex-recommended is not installed. pbuilder-satisfydepends-dummy depends on time; however: Package time is not installed. pbuilder-satisfydepends-dummy depends on texinfo; however: Package texinfo is not installed. pbuilder-satisfydepends-dummy depends on dh-elpa; however: Package dh-elpa is not installed. Setting up pbuilder-satisfydepends-dummy (0.invalid.0) ... Reading package lists... Building dependency tree... Reading state information... Initializing package states... Writing extended state information... Building tag database... pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) pbuilder-satisfydepends-dummy is already installed at the requested version (0.invalid.0) The following NEW packages will be installed: adwaita-icon-theme{a} at-spi2-common{a} autoconf{a} automake{a} autopoint{a} autotools-dev{a} bsdextrautils{a} ca-certificates{a} dbus{a} dbus-bin{a} dbus-daemon{a} dbus-session-bus-common{a} dbus-system-bus-common{a} dbus-user-session{a} dconf-gsettings-backend{a} dconf-service{a} debhelper{a} dh-autoreconf{a} dh-elpa{a} dh-strip-nondeterminism{a} dmsetup{a} dwz{a} emacs{a} emacs-bin-common{a} emacs-common{a} emacs-el{a} emacs-gtk{a} emacsen-common{a} file{a} fontconfig{a} fontconfig-config{a} fonts-dejavu-core{a} fonts-lmodern{a} gcl{a} gettext{a} gettext-base{a} groff-base{a} gtk-update-icon-cache{a} hicolor-icon-theme{a} install-info{a} intltool-debian{a} libabsl20220623{a} libaom3{a} libapparmor1{a} libapt-pkg-perl{a} libarchive-zip-perl{a} libargon2-1{a} libarray-unique-perl{a} libarray-utils-perl{a} libasound2{a} libasound2-data{a} libatk-bridge2.0-0{a} libatk1.0-0{a} libatspi2.0-0{a} libavahi-client3{a} libavahi-common-data{a} libavahi-common3{a} libavif15{a} libbrotli1{a} libbsd0{a} libcairo-gobject2{a} libcairo2{a} libcgi-pm-perl{a} libclass-accessor-perl{a} libclone-perl{a} libcolord2{a} libconfig-tiny-perl{a} libcryptsetup12{a} libcups2{a} libdatrie1{a} libdav1d6{a} libdbus-1-3{a} libdconf1{a} libde265-0{a} libdebhelper-perl{a} libdebian-source-perl{a} libdeflate0{a} libdevmapper1.02.1{a} libedit2{a} libelf1{a} libencode-locale-perl{a} libepoxy0{a} liberror-perl{a} libexpat1{a} libexporter-lite-perl{a} libexporter-tiny-perl{a} libfdisk1{a} libfile-find-rule-perl{a} libfile-listing-perl{a} libfile-stripnondeterminism-perl{a} libfontconfig1{a} libfreetype6{a} libfribidi0{a} libgav1-1{a} libgccjit0{a} libgd3{a} libgdk-pixbuf-2.0-0{a} libgdk-pixbuf2.0-common{a} libgif7{a} libglib2.0-0{a} libgpm2{a} libgraphite2-3{a} libgtk-3-0{a} libgtk-3-common{a} libharfbuzz0b{a} libheif-plugin-dav1d{a} libheif-plugin-libde265{a} libheif1{a} libhtml-form-perl{a} libhtml-parser-perl{a} libhtml-tagset-perl{a} libhtml-tree-perl{a} libhttp-cookies-perl{a} libhttp-date-perl{a} libhttp-message-perl{a} libhttp-negotiate-perl{a} libice6{a} libicu72{a} libio-html-perl{a} libio-socket-ssl-perl{a} libio-stringy-perl{a} libip4tc2{a} libjbig0{a} libjpeg62-turbo{a} libjson-c5{a} libkmod2{a} libkpathsea6{a} liblcms2-2{a} liblerc4{a} liblist-moreutils-perl{a} liblist-moreutils-xs-perl{a} liblwp-mediatypes-perl{a} liblwp-protocol-https-perl{a} libm17n-0{a} libmagic-mgc{a} libmagic1{a} libnet-http-perl{a} libnet-ssleay-perl{a} libnumber-compare-perl{a} libotf1{a} libpam-systemd{a} libpango-1.0-0{a} libpangocairo-1.0-0{a} libpangoft2-1.0-0{a} libpaper-utils{a} libpaper1{a} libparse-debcontrol-perl{a} libpipeline1{a} libpixman-1-0{a} libpng16-16{a} libproc2-0{a} libptexenc1{a} librav1e0{a} librsvg2-2{a} libsm6{a} libsub-install-perl{a} libsub-name-perl{a} libsub-override-perl{a} libsvtav1enc1{a} libsynctex2{a} libsystemd-shared{a} libtcl8.6{a} libteckit0{a} libtexlua53-5{a} libtexluajit2{a} libtext-glob-perl{a} libtext-unidecode-perl{a} libthai-data{a} libthai0{a} libtie-ixhash-perl{a} libtiff6{a} libtimedate-perl{a} libtk8.6{a} libtool{a} libtree-sitter0{a} libtry-tiny-perl{a} libuchardet0{a} liburi-perl{a} libwayland-client0{a} libwayland-cursor0{a} libwayland-egl1{a} libwebp7{a} libwebpdemux2{a} libwww-mechanize-perl{a} libwww-perl{a} libwww-robotrules-perl{a} libx11-6{a} libx11-data{a} libxau6{a} libxaw7{a} libxcb-render0{a} libxcb-shm0{a} libxcb1{a} libxcomposite1{a} libxcursor1{a} libxdamage1{a} libxdmcp6{a} libxext6{a} libxfixes3{a} libxft2{a} libxi6{a} libxinerama1{a} libxkbcommon0{a} libxml-libxml-perl{a} libxml-namespacesupport-perl{a} libxml-sax-base-perl{a} libxml-sax-perl{a} libxml2{a} libxmu6{a} libxpm4{a} libxrandr2{a} libxrender1{a} libxss1{a} libxt6{a} libyuv0{a} libzzip-0-13{a} m17n-db{a} m4{a} man-db{a} netbase{a} openssl{a} perl-openssl-defaults{a} po-debconf{a} procps{a} sensible-utils{a} shared-mime-info{a} systemd{a} systemd-dev{a} systemd-sysv{a} t1utils{a} tex-common{a} texinfo{a} texinfo-lib{a} texlive-base{a} texlive-binaries{a} texlive-latex-base{a} texlive-latex-recommended{a} time{a} ucf{a} x11-common{a} xdg-utils{a} xkb-data{a} The following packages are RECOMMENDED but will NOT be installed: alsa-topology-conf alsa-ucm-conf at-spi2-core chrony curl dvisvgm fonts-noto-color-emoji libarchive-cpio-perl libcgi-fast-perl libdata-dump-perl libfile-mimeinfo-perl libgdk-pixbuf2.0-bin libglib2.0-data libgtk-3-bin libheif-plugin-aomenc libheif-plugin-x265 libhtml-format-perl libhttp-daemon-perl libio-compress-brotli-perl libltdl-dev libmail-sendmail-perl libmailtools-perl libnet-dbus-perl libnss-systemd librsvg2-common libx11-protocol-perl libxml-sax-expat-perl lmodern lynx mailutils ntpsec openntpd psmisc systemd-timesyncd wget x11-utils x11-xserver-utils xdg-user-dirs 0 packages upgraded, 242 newly installed, 0 to remove and 0 not upgraded. Need to get 204 MB of archives. After unpacking 792 MB will be used. Writing extended state information... Get: 1 http://deb.debian.org/debian unstable/main amd64 libargon2-1 amd64 0~20190702+dfsg-3 [19.8 kB] Get: 2 http://deb.debian.org/debian unstable/main amd64 dmsetup amd64 2:1.02.185-2 [82.0 kB] Get: 3 http://deb.debian.org/debian unstable/main amd64 libdevmapper1.02.1 amd64 2:1.02.185-2 [133 kB] Get: 4 http://deb.debian.org/debian unstable/main amd64 libjson-c5 amd64 0.16-2 [44.1 kB] Get: 5 http://deb.debian.org/debian unstable/main amd64 libcryptsetup12 amd64 2:2.6.1-4 [223 kB] Get: 6 http://deb.debian.org/debian unstable/main amd64 libfdisk1 amd64 2.39.1-3 [200 kB] Get: 7 http://deb.debian.org/debian unstable/main amd64 libkmod2 amd64 30+20230519-1 [57.8 kB] Get: 8 http://deb.debian.org/debian unstable/main amd64 libapparmor1 amd64 3.0.8-3 [41.2 kB] Get: 9 http://deb.debian.org/debian unstable/main amd64 libip4tc2 amd64 1.8.9-2 [19.0 kB] Get: 10 http://deb.debian.org/debian unstable/main amd64 libsystemd-shared amd64 254-1 [1837 kB] Get: 11 http://deb.debian.org/debian unstable/main amd64 systemd-dev all 254-1 [39.2 kB] Get: 12 http://deb.debian.org/debian unstable/main amd64 systemd amd64 254-1 [3250 kB] Get: 13 http://deb.debian.org/debian unstable/main amd64 systemd-sysv amd64 254-1 [43.9 kB] Get: 14 http://deb.debian.org/debian unstable/main amd64 libdbus-1-3 amd64 1.14.8-2 [200 kB] Get: 15 http://deb.debian.org/debian unstable/main amd64 dbus-bin amd64 1.14.8-2 [105 kB] Get: 16 http://deb.debian.org/debian unstable/main amd64 dbus-session-bus-common all 1.14.8-2 [77.4 kB] Get: 17 http://deb.debian.org/debian unstable/main amd64 libexpat1 amd64 2.5.0-2 [99.0 kB] Get: 18 http://deb.debian.org/debian unstable/main amd64 dbus-daemon amd64 1.14.8-2 [183 kB] Get: 19 http://deb.debian.org/debian unstable/main amd64 dbus-system-bus-common all 1.14.8-2 [78.5 kB] Get: 20 http://deb.debian.org/debian unstable/main amd64 dbus amd64 1.14.8-2 [96.5 kB] Get: 21 http://deb.debian.org/debian unstable/main amd64 install-info amd64 7.0.3-2 [256 kB] Get: 22 http://deb.debian.org/debian unstable/main amd64 netbase all 6.4 [12.8 kB] Get: 23 http://deb.debian.org/debian unstable/main amd64 libproc2-0 amd64 2:4.0.3-1 [63.2 kB] Get: 24 http://deb.debian.org/debian unstable/main amd64 procps amd64 2:4.0.3-1 [762 kB] Get: 25 http://deb.debian.org/debian unstable/main amd64 sensible-utils all 0.0.20 [19.3 kB] Get: 26 http://deb.debian.org/debian unstable/main amd64 openssl amd64 3.0.10-1 [1415 kB] Get: 27 http://deb.debian.org/debian unstable/main amd64 ca-certificates all 20230311 [153 kB] Get: 28 http://deb.debian.org/debian unstable/main amd64 libmagic-mgc amd64 1:5.44-3 [305 kB] Get: 29 http://deb.debian.org/debian unstable/main amd64 libmagic1 amd64 1:5.44-3 [104 kB] Get: 30 http://deb.debian.org/debian unstable/main amd64 file amd64 1:5.44-3 [42.5 kB] Get: 31 http://deb.debian.org/debian unstable/main amd64 gettext-base amd64 0.21-13 [160 kB] Get: 32 http://deb.debian.org/debian unstable/main amd64 libuchardet0 amd64 0.0.7-1 [67.8 kB] Get: 33 http://deb.debian.org/debian unstable/main amd64 groff-base amd64 1.23.0-2 [1176 kB] Get: 34 http://deb.debian.org/debian unstable/main amd64 libpam-systemd amd64 254-1 [241 kB] Get: 35 http://deb.debian.org/debian unstable/main amd64 bsdextrautils amd64 2.39.1-3 [88.5 kB] Get: 36 http://deb.debian.org/debian unstable/main amd64 libpipeline1 amd64 1.5.7-1 [38.5 kB] Get: 37 http://deb.debian.org/debian unstable/main amd64 man-db amd64 2.11.2-3 [1386 kB] Get: 38 http://deb.debian.org/debian unstable/main amd64 ucf all 3.0043+nmu1 [55.2 kB] Get: 39 http://deb.debian.org/debian unstable/main amd64 hicolor-icon-theme all 0.17-2 [11.4 kB] Get: 40 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf2.0-common all 2.42.10+dfsg-1 [306 kB] Get: 41 http://deb.debian.org/debian unstable/main amd64 libglib2.0-0 amd64 2.76.4-4 [1433 kB] Get: 42 http://deb.debian.org/debian unstable/main amd64 libicu72 amd64 72.1-3 [9376 kB] Get: 43 http://deb.debian.org/debian unstable/main amd64 libxml2 amd64 2.9.14+dfsg-1.3 [686 kB] Get: 44 http://deb.debian.org/debian unstable/main amd64 shared-mime-info amd64 2.2-1 [729 kB] Get: 45 http://deb.debian.org/debian unstable/main amd64 libjpeg62-turbo amd64 1:2.1.5-2 [166 kB] Get: 46 http://deb.debian.org/debian unstable/main amd64 libpng16-16 amd64 1.6.40-1 [275 kB] Get: 47 http://deb.debian.org/debian unstable/main amd64 libdeflate0 amd64 1.14-1 [61.4 kB] Get: 48 http://deb.debian.org/debian unstable/main amd64 libjbig0 amd64 2.1-6.1 [31.7 kB] Get: 49 http://deb.debian.org/debian unstable/main amd64 liblerc4 amd64 4.0.0+ds-2 [170 kB] Get: 50 http://deb.debian.org/debian unstable/main amd64 libwebp7 amd64 1.2.4-0.2 [285 kB] Get: 51 http://deb.debian.org/debian unstable/main amd64 libtiff6 amd64 4.5.1+git230720-1 [322 kB] Get: 52 http://deb.debian.org/debian unstable/main amd64 libgdk-pixbuf-2.0-0 amd64 2.42.10+dfsg-1+b1 [139 kB] Get: 53 http://deb.debian.org/debian unstable/main amd64 gtk-update-icon-cache amd64 3.24.38-2 [43.7 kB] Get: 54 http://deb.debian.org/debian unstable/main amd64 adwaita-icon-theme all 43-1 [5124 kB] Get: 55 http://deb.debian.org/debian unstable/main amd64 at-spi2-common all 2.48.3-1 [164 kB] Get: 56 http://deb.debian.org/debian unstable/main amd64 m4 amd64 1.4.19-3 [287 kB] Get: 57 http://deb.debian.org/debian unstable/main amd64 autoconf all 2.71-3 [332 kB] Get: 58 http://deb.debian.org/debian unstable/main amd64 autotools-dev all 20220109.1 [51.6 kB] Get: 59 http://deb.debian.org/debian unstable/main amd64 automake all 1:1.16.5-1.3 [823 kB] Get: 60 http://deb.debian.org/debian unstable/main amd64 autopoint all 0.21-13 [496 kB] Get: 61 http://deb.debian.org/debian unstable/main amd64 dbus-user-session amd64 1.14.8-2 [77.3 kB] Get: 62 http://deb.debian.org/debian unstable/main amd64 libdconf1 amd64 0.40.0-4 [40.9 kB] Get: 63 http://deb.debian.org/debian unstable/main amd64 dconf-service amd64 0.40.0-4 [31.6 kB] Get: 64 http://deb.debian.org/debian unstable/main amd64 dconf-gsettings-backend amd64 0.40.0-4 [27.8 kB] Get: 65 http://deb.debian.org/debian unstable/main amd64 libdebhelper-perl all 13.11.4 [81.2 kB] Get: 66 http://deb.debian.org/debian unstable/main amd64 libtool all 2.4.7-7 [517 kB] Get: 67 http://deb.debian.org/debian unstable/main amd64 dh-autoreconf all 20 [17.1 kB] Get: 68 http://deb.debian.org/debian unstable/main amd64 libarchive-zip-perl all 1.68-1 [104 kB] Get: 69 http://deb.debian.org/debian unstable/main amd64 libsub-override-perl all 0.09-4 [9304 B] Get: 70 http://deb.debian.org/debian unstable/main amd64 libfile-stripnondeterminism-perl all 1.13.1-1 [19.4 kB] Get: 71 http://deb.debian.org/debian unstable/main amd64 dh-strip-nondeterminism all 1.13.1-1 [8620 B] Get: 72 http://deb.debian.org/debian unstable/main amd64 libelf1 amd64 0.189-4 [174 kB] Get: 73 http://deb.debian.org/debian unstable/main amd64 dwz amd64 0.15-1 [109 kB] Get: 74 http://deb.debian.org/debian unstable/main amd64 gettext amd64 0.21-13 [1300 kB] Get: 75 http://deb.debian.org/debian unstable/main amd64 intltool-debian all 0.35.0+20060710.6 [22.9 kB] Get: 76 http://deb.debian.org/debian unstable/main amd64 po-debconf all 1.0.21+nmu1 [248 kB] Get: 77 http://deb.debian.org/debian unstable/main amd64 debhelper all 13.11.4 [942 kB] Get: 78 http://deb.debian.org/debian unstable/main amd64 libapt-pkg-perl amd64 0.1.40+b2 [69.2 kB] Get: 79 http://deb.debian.org/debian unstable/main amd64 libarray-unique-perl all 0.08-4 [11.2 kB] Get: 80 http://deb.debian.org/debian unstable/main amd64 libsub-name-perl amd64 0.27-1 [12.5 kB] Get: 81 http://deb.debian.org/debian unstable/main amd64 libclass-accessor-perl all 0.51-2 [22.7 kB] Get: 82 http://deb.debian.org/debian unstable/main amd64 libexporter-tiny-perl all 1.006002-1 [38.7 kB] Get: 83 http://deb.debian.org/debian unstable/main amd64 liblist-moreutils-xs-perl amd64 0.430-3+b1 [42.1 kB] Get: 84 http://deb.debian.org/debian unstable/main amd64 liblist-moreutils-perl all 0.430-2 [46.9 kB] Get: 85 http://deb.debian.org/debian unstable/main amd64 libio-stringy-perl all 2.111-3 [56.5 kB] Get: 86 http://deb.debian.org/debian unstable/main amd64 libencode-locale-perl all 1.05-3 [12.9 kB] Get: 87 http://deb.debian.org/debian unstable/main amd64 libtimedate-perl all 2.3300-2 [39.3 kB] Get: 88 http://deb.debian.org/debian unstable/main amd64 libhttp-date-perl all 6.05-2 [10.5 kB] Get: 89 http://deb.debian.org/debian unstable/main amd64 libfile-listing-perl all 6.15-1 [12.6 kB] Get: 90 http://deb.debian.org/debian unstable/main amd64 libhtml-tagset-perl all 3.20-6 [11.7 kB] Get: 91 http://deb.debian.org/debian unstable/main amd64 liburi-perl all 5.19-2 [91.0 kB] Get: 92 http://deb.debian.org/debian unstable/main amd64 libhtml-parser-perl amd64 3.81-1 [101 kB] Get: 93 http://deb.debian.org/debian unstable/main amd64 libhtml-tree-perl all 5.07-3 [211 kB] Get: 94 http://deb.debian.org/debian unstable/main amd64 libclone-perl amd64 0.46-1 [13.7 kB] Get: 95 http://deb.debian.org/debian unstable/main amd64 libio-html-perl all 1.004-3 [16.2 kB] Get: 96 http://deb.debian.org/debian unstable/main amd64 liblwp-mediatypes-perl all 6.04-2 [20.2 kB] Get: 97 http://deb.debian.org/debian unstable/main amd64 libhttp-message-perl all 6.44-2 [81.8 kB] Get: 98 http://deb.debian.org/debian unstable/main amd64 libhttp-cookies-perl all 6.10-1 [19.6 kB] Get: 99 http://deb.debian.org/debian unstable/main amd64 libhttp-negotiate-perl all 6.01-2 [13.1 kB] Get: 100 http://deb.debian.org/debian unstable/main amd64 perl-openssl-defaults amd64 7+b1 [7924 B] Get: 101 http://deb.debian.org/debian unstable/main amd64 libnet-ssleay-perl amd64 1.92-2+b1 [317 kB] Get: 102 http://deb.debian.org/debian unstable/main amd64 libio-socket-ssl-perl all 2.083-1 [218 kB] Get: 103 http://deb.debian.org/debian unstable/main amd64 libnet-http-perl all 6.22-1 [25.3 kB] Get: 104 http://deb.debian.org/debian unstable/main amd64 liblwp-protocol-https-perl all 6.11-1 [10.5 kB] Get: 105 http://deb.debian.org/debian unstable/main amd64 libtry-tiny-perl all 0.31-2 [22.6 kB] Get: 106 http://deb.debian.org/debian unstable/main amd64 libwww-robotrules-perl all 6.02-1 [12.9 kB] Get: 107 http://deb.debian.org/debian unstable/main amd64 libwww-perl all 6.72-1 [187 kB] Get: 108 http://deb.debian.org/debian unstable/main amd64 liberror-perl all 0.17029-2 [29.0 kB] Get: 109 http://deb.debian.org/debian unstable/main amd64 libexporter-lite-perl all 0.09-2 [10.7 kB] Get: 110 http://deb.debian.org/debian unstable/main amd64 libparse-debcontrol-perl all 2.005-6 [21.6 kB] Get: 111 http://deb.debian.org/debian unstable/main amd64 libsub-install-perl all 0.929-1 [10.5 kB] Get: 112 http://deb.debian.org/debian unstable/main amd64 libtie-ixhash-perl all 1.23-4 [11.7 kB] Get: 113 http://deb.debian.org/debian unstable/main amd64 libcgi-pm-perl all 4.57-1 [221 kB] Get: 114 http://deb.debian.org/debian unstable/main amd64 libhtml-form-perl all 6.11-1 [33.1 kB] Get: 115 http://deb.debian.org/debian unstable/main amd64 libwww-mechanize-perl all 2.17-1 [116 kB] Get: 116 http://deb.debian.org/debian unstable/main amd64 libdebian-source-perl all 0.122 [63.7 kB] Get: 117 http://deb.debian.org/debian unstable/main amd64 emacs-el all 1:29.1+1-2 [18.8 MB] Get: 118 http://deb.debian.org/debian unstable/main amd64 emacsen-common all 3.0.5 [12.3 kB] Get: 119 http://deb.debian.org/debian unstable/main amd64 emacs-common all 1:29.1+1-2 [15.2 MB] Get: 120 http://deb.debian.org/debian unstable/main amd64 emacs-bin-common amd64 1:29.1+1-2 [103 kB] Get: 121 http://deb.debian.org/debian unstable/main amd64 libasound2-data all 1.2.9-1 [20.4 kB] Get: 122 http://deb.debian.org/debian unstable/main amd64 libasound2 amd64 1.2.9-1 [363 kB] Get: 123 http://deb.debian.org/debian unstable/main amd64 libbrotli1 amd64 1.0.9-2+b6 [275 kB] Get: 124 http://deb.debian.org/debian unstable/main amd64 libfreetype6 amd64 2.13.0+dfsg-1 [422 kB] Get: 125 http://deb.debian.org/debian unstable/main amd64 fonts-dejavu-core all 2.37-6 [1068 kB] Get: 126 http://deb.debian.org/debian unstable/main amd64 fontconfig-config amd64 2.14.1-4 [315 kB] Get: 127 http://deb.debian.org/debian unstable/main amd64 libfontconfig1 amd64 2.14.1-4 [386 kB] Get: 128 http://deb.debian.org/debian unstable/main amd64 libpixman-1-0 amd64 0.42.2-1 [546 kB] Get: 129 http://deb.debian.org/debian unstable/main amd64 libxau6 amd64 1:1.0.9-1 [19.7 kB] Get: 130 http://deb.debian.org/debian unstable/main amd64 libbsd0 amd64 0.11.7-4 [115 kB] Get: 131 http://deb.debian.org/debian unstable/main amd64 libxdmcp6 amd64 1:1.1.2-3 [26.3 kB] Get: 132 http://deb.debian.org/debian unstable/main amd64 libxcb1 amd64 1.15-1 [144 kB] Get: 133 http://deb.debian.org/debian unstable/main amd64 libx11-data all 2:1.8.6-1 [323 kB] Get: 134 http://deb.debian.org/debian unstable/main amd64 libx11-6 amd64 2:1.8.6-1 [793 kB] Get: 135 http://deb.debian.org/debian unstable/main amd64 libxcb-render0 amd64 1.15-1 [115 kB] Get: 136 http://deb.debian.org/debian unstable/main amd64 libxcb-shm0 amd64 1.15-1 [105 kB] Get: 137 http://deb.debian.org/debian unstable/main amd64 libxext6 amd64 2:1.3.4-1+b1 [52.9 kB] Get: 138 http://deb.debian.org/debian unstable/main amd64 libxrender1 amd64 1:0.9.10-1.1 [33.2 kB] Get: 139 http://deb.debian.org/debian unstable/main amd64 libcairo2 amd64 1.16.0-7 [575 kB] Get: 140 http://deb.debian.org/debian unstable/main amd64 libgccjit0 amd64 13.2.0-1 [9090 kB] Get: 141 http://deb.debian.org/debian unstable/main amd64 libgif7 amd64 5.2.1-2.5 [46.9 kB] Get: 142 http://deb.debian.org/debian unstable/main amd64 libgpm2 amd64 1.20.7-10+b1 [14.2 kB] Get: 143 http://deb.debian.org/debian unstable/main amd64 libatk1.0-0 amd64 2.48.3-1 [49.7 kB] Get: 144 http://deb.debian.org/debian unstable/main amd64 libxi6 amd64 2:1.8-1+b1 [84.2 kB] Get: 145 http://deb.debian.org/debian unstable/main amd64 libatspi2.0-0 amd64 2.48.3-1 [75.8 kB] Get: 146 http://deb.debian.org/debian unstable/main amd64 libatk-bridge2.0-0 amd64 2.48.3-1 [65.3 kB] Get: 147 http://deb.debian.org/debian unstable/main amd64 libcairo-gobject2 amd64 1.16.0-7 [112 kB] Get: 148 http://deb.debian.org/debian unstable/main amd64 liblcms2-2 amd64 2.14-2 [154 kB] Get: 149 http://deb.debian.org/debian unstable/main amd64 libcolord2 amd64 1.4.6-2.2 [137 kB] Get: 150 http://deb.debian.org/debian unstable/main amd64 libavahi-common-data amd64 0.8-10 [107 kB] Get: 151 http://deb.debian.org/debian unstable/main amd64 libavahi-common3 amd64 0.8-10 [41.6 kB] Get: 152 http://deb.debian.org/debian unstable/main amd64 libavahi-client3 amd64 0.8-10 [45.5 kB] Get: 153 http://deb.debian.org/debian unstable/main amd64 libcups2 amd64 2.4.2-5 [244 kB] Get: 154 http://deb.debian.org/debian unstable/main amd64 libepoxy0 amd64 1.5.10-1 [189 kB] Get: 155 http://deb.debian.org/debian unstable/main amd64 libfribidi0 amd64 1.0.13-3 [71.1 kB] Get: 156 http://deb.debian.org/debian unstable/main amd64 libgraphite2-3 amd64 1.3.14-1 [81.2 kB] Get: 157 http://deb.debian.org/debian unstable/main amd64 libharfbuzz0b amd64 8.0.1-1 [2158 kB] Get: 158 http://deb.debian.org/debian unstable/main amd64 fontconfig amd64 2.14.1-4 [449 kB] Get: 159 http://deb.debian.org/debian unstable/main amd64 libthai-data all 0.1.29-1 [176 kB] Get: 160 http://deb.debian.org/debian unstable/main amd64 libdatrie1 amd64 0.2.13-2+b1 [43.3 kB] Get: 161 http://deb.debian.org/debian unstable/main amd64 libthai0 amd64 0.1.29-1 [57.5 kB] Get: 162 http://deb.debian.org/debian unstable/main amd64 libpango-1.0-0 amd64 1.50.14+ds-1 [212 kB] Get: 163 http://deb.debian.org/debian unstable/main amd64 libpangoft2-1.0-0 amd64 1.50.14+ds-1 [47.4 kB] Get: 164 http://deb.debian.org/debian unstable/main amd64 libpangocairo-1.0-0 amd64 1.50.14+ds-1 [34.1 kB] Get: 165 http://deb.debian.org/debian unstable/main amd64 libwayland-client0 amd64 1.22.0-2 [25.2 kB] Get: 166 http://deb.debian.org/debian unstable/main amd64 libwayland-cursor0 amd64 1.22.0-2 [10.9 kB] Get: 167 http://deb.debian.org/debian unstable/main amd64 libwayland-egl1 amd64 1.22.0-2 [5260 B] Get: 168 http://deb.debian.org/debian unstable/main amd64 libxcomposite1 amd64 1:0.4.5-1 [16.6 kB] Get: 169 http://deb.debian.org/debian unstable/main amd64 libxfixes3 amd64 1:6.0.0-2 [22.7 kB] Get: 170 http://deb.debian.org/debian unstable/main amd64 libxcursor1 amd64 1:1.2.1-1 [40.9 kB] Get: 171 http://deb.debian.org/debian unstable/main amd64 libxdamage1 amd64 1:1.1.6-1 [15.1 kB] Get: 172 http://deb.debian.org/debian unstable/main amd64 libxinerama1 amd64 2:1.1.4-3 [17.8 kB] Get: 173 http://deb.debian.org/debian unstable/main amd64 xkb-data all 2.38-2 [782 kB] Get: 174 http://deb.debian.org/debian unstable/main amd64 libxkbcommon0 amd64 1.5.0-1 [106 kB] Get: 175 http://deb.debian.org/debian unstable/main amd64 libxrandr2 amd64 2:1.5.2-2+b1 [39.2 kB] Get: 176 http://deb.debian.org/debian unstable/main amd64 libgtk-3-common all 3.24.38-2 [3893 kB] Get: 177 http://deb.debian.org/debian unstable/main amd64 libgtk-3-0 amd64 3.24.38-2 [2710 kB] Get: 178 http://deb.debian.org/debian unstable/main amd64 x11-common all 1:7.7+23 [252 kB] Get: 179 http://deb.debian.org/debian unstable/main amd64 libice6 amd64 2:1.0.10-1 [58.5 kB] Get: 180 http://deb.debian.org/debian unstable/main amd64 m17n-db all 1.8.2-1 [1346 kB] Get: 181 http://deb.debian.org/debian unstable/main amd64 libaom3 amd64 3.6.1-1 [1850 kB] Get: 182 http://deb.debian.org/debian unstable/main amd64 libdav1d6 amd64 1.2.1-2 [541 kB] Get: 183 http://deb.debian.org/debian unstable/main amd64 libabsl20220623 amd64 20220623.1-1 [391 kB] Get: 184 http://deb.debian.org/debian unstable/main amd64 libgav1-1 amd64 0.18.0-1+b1 [332 kB] Get: 185 http://deb.debian.org/debian unstable/main amd64 librav1e0 amd64 0.6.6-3 [894 kB] Get: 186 http://deb.debian.org/debian unstable/main amd64 libsvtav1enc1 amd64 1.6.0+dfsg-1 [2104 kB] Get: 187 http://deb.debian.org/debian unstable/main amd64 libyuv0 amd64 0.0~git20230616.a366ad7-1 [169 kB] Get: 188 http://deb.debian.org/debian unstable/main amd64 libavif15 amd64 0.11.1-3 [94.0 kB] Get: 189 http://deb.debian.org/debian unstable/main amd64 libheif-plugin-dav1d amd64 1.16.2-2 [9172 B] Get: 190 http://deb.debian.org/debian unstable/main amd64 libde265-0 amd64 1.0.12-1+b1 [186 kB] Get: 191 http://deb.debian.org/debian unstable/main amd64 libheif-plugin-libde265 amd64 1.16.2-2 [12.5 kB] Get: 192 http://deb.debian.org/debian unstable/main amd64 libheif1 amd64 1.16.2-2 [223 kB] Get: 193 http://deb.debian.org/debian unstable/main amd64 libxpm4 amd64 1:3.5.12-1.1 [48.4 kB] Get: 194 http://deb.debian.org/debian unstable/main amd64 libgd3 amd64 2.3.3-9 [124 kB] Get: 195 http://deb.debian.org/debian unstable/main amd64 libotf1 amd64 0.9.16-4 [55.5 kB] Get: 196 http://deb.debian.org/debian unstable/main amd64 libxft2 amd64 2.3.6-1 [61.8 kB] Get: 197 http://deb.debian.org/debian unstable/main amd64 libsm6 amd64 2:1.2.3-1 [35.1 kB] Get: 198 http://deb.debian.org/debian unstable/main amd64 libxt6 amd64 1:1.2.1-1.1 [186 kB] Get: 199 http://deb.debian.org/debian unstable/main amd64 libm17n-0 amd64 1.8.2-1 [254 kB] Get: 200 http://deb.debian.org/debian unstable/main amd64 librsvg2-2 amd64 2.54.7+dfsg-1 [2628 kB] Get: 201 http://deb.debian.org/debian unstable/main amd64 libtree-sitter0 amd64 0.20.8-2 [84.3 kB] Get: 202 http://deb.debian.org/debian unstable/main amd64 libwebpdemux2 amd64 1.2.4-0.2 [99.3 kB] Get: 203 http://deb.debian.org/debian unstable/main amd64 emacs-gtk amd64 1:29.1+1-2 [7201 kB] Get: 204 http://deb.debian.org/debian unstable/main amd64 emacs all 1:29.1+1-2 [16.5 kB] Get: 205 http://deb.debian.org/debian unstable/main amd64 libarray-utils-perl all 0.5-3 [6184 B] Get: 206 http://deb.debian.org/debian unstable/main amd64 libconfig-tiny-perl all 2.29-1 [16.5 kB] Get: 207 http://deb.debian.org/debian unstable/main amd64 libnumber-compare-perl all 0.03-3 [6332 B] Get: 208 http://deb.debian.org/debian unstable/main amd64 libtext-glob-perl all 0.11-3 [7676 B] Get: 209 http://deb.debian.org/debian unstable/main amd64 libfile-find-rule-perl all 0.34-3 [26.6 kB] Get: 210 http://deb.debian.org/debian unstable/main amd64 dh-elpa all 2.0.17 [31.0 kB] Get: 211 http://deb.debian.org/debian unstable/main amd64 fonts-lmodern all 2.005-1 [4540 kB] Get: 212 http://deb.debian.org/debian unstable/main amd64 libedit2 amd64 3.1-20221030-2 [93.0 kB] Get: 213 http://deb.debian.org/debian unstable/main amd64 libtcl8.6 amd64 8.6.13+dfsg-2 [1035 kB] Get: 214 http://deb.debian.org/debian unstable/main amd64 libxss1 amd64 1:1.2.3-1 [17.8 kB] Get: 215 http://deb.debian.org/debian unstable/main amd64 libtk8.6 amd64 8.6.13-2 [781 kB] Get: 216 http://deb.debian.org/debian unstable/main amd64 gcl amd64 2.6.14-4 [29.9 MB] Get: 217 http://deb.debian.org/debian unstable/main amd64 libkpathsea6 amd64 2022.20220321.62855-8 [152 kB] Get: 218 http://deb.debian.org/debian unstable/main amd64 libpaper1 amd64 1.1.29 [12.5 kB] Get: 219 http://deb.debian.org/debian unstable/main amd64 libpaper-utils amd64 1.1.29 [8868 B] Get: 220 http://deb.debian.org/debian unstable/main amd64 libptexenc1 amd64 2022.20220321.62855-8 [44.0 kB] Get: 221 http://deb.debian.org/debian unstable/main amd64 libsynctex2 amd64 2022.20220321.62855-8 [59.9 kB] Get: 222 http://deb.debian.org/debian unstable/main amd64 libteckit0 amd64 2.5.11+ds1-1+b1 [335 kB] Get: 223 http://deb.debian.org/debian unstable/main amd64 libtexlua53-5 amd64 2022.20220321.62855-8 [111 kB] Get: 224 http://deb.debian.org/debian unstable/main amd64 libtexluajit2 amd64 2022.20220321.62855-8 [247 kB] Get: 225 http://deb.debian.org/debian unstable/main amd64 libtext-unidecode-perl all 1.30-3 [101 kB] Get: 226 http://deb.debian.org/debian unstable/main amd64 libxmu6 amd64 2:1.1.3-3 [60.1 kB] Get: 227 http://deb.debian.org/debian unstable/main amd64 libxaw7 amd64 2:1.0.14-1 [201 kB] Get: 228 http://deb.debian.org/debian unstable/main amd64 libxml-namespacesupport-perl all 1.12-2 [15.1 kB] Get: 229 http://deb.debian.org/debian unstable/main amd64 libxml-sax-base-perl all 1.09-3 [20.6 kB] Get: 230 http://deb.debian.org/debian unstable/main amd64 libxml-sax-perl all 1.02+dfsg-3 [59.4 kB] Get: 231 http://deb.debian.org/debian unstable/main amd64 libxml-libxml-perl amd64 2.0207+dfsg+really+2.0134-1+b1 [322 kB] Get: 232 http://deb.debian.org/debian unstable/main amd64 libzzip-0-13 amd64 0.13.72+dfsg.1-1.1 [58.3 kB] Get: 233 http://deb.debian.org/debian unstable/main amd64 t1utils amd64 1.41-4 [62.1 kB] Get: 234 http://deb.debian.org/debian unstable/main amd64 tex-common all 6.18 [32.5 kB] Get: 235 http://deb.debian.org/debian unstable/main amd64 texinfo-lib amd64 7.0.3-2 [296 kB] Get: 236 http://deb.debian.org/debian unstable/main amd64 texinfo all 7.0.3-2 [1776 kB] Get: 237 http://deb.debian.org/debian unstable/main amd64 texlive-binaries amd64 2022.20220321.62855-8 [10.5 MB] Get: 238 http://deb.debian.org/debian unstable/main amd64 xdg-utils all 1.1.3-4.1 [75.5 kB] Get: 239 http://deb.debian.org/debian unstable/main amd64 texlive-base all 2022.20230122-3 [21.9 MB] Get: 240 http://deb.debian.org/debian unstable/main amd64 texlive-latex-base all 2022.20230122-3 [1182 kB] Get: 241 http://deb.debian.org/debian unstable/main amd64 texlive-latex-recommended all 2022.20230122-3 [8880 kB] Get: 242 http://deb.debian.org/debian unstable/main amd64 time amd64 1.9-0.2 [50.8 kB] Fetched 204 MB in 43s (4778 kB/s) debconf: delaying package configuration, since apt-utils is not installed Selecting previously unselected package libargon2-1: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 ... 18867 files and directories currently installed.) Preparing to unpack .../00-libargon2-1_0~20190702+dfsg-3_amd64.deb ... Unpacking libargon2-1:amd64 (0~20190702+dfsg-3) ... Selecting previously unselected package dmsetup. Preparing to unpack .../01-dmsetup_2%3a1.02.185-2_amd64.deb ... Unpacking dmsetup (2:1.02.185-2) ... Selecting previously unselected package libdevmapper1.02.1:amd64. Preparing to unpack .../02-libdevmapper1.02.1_2%3a1.02.185-2_amd64.deb ... Unpacking libdevmapper1.02.1:amd64 (2:1.02.185-2) ... Selecting previously unselected package libjson-c5:amd64. Preparing to unpack .../03-libjson-c5_0.16-2_amd64.deb ... Unpacking libjson-c5:amd64 (0.16-2) ... Selecting previously unselected package libcryptsetup12:amd64. Preparing to unpack .../04-libcryptsetup12_2%3a2.6.1-4_amd64.deb ... Unpacking libcryptsetup12:amd64 (2:2.6.1-4) ... Selecting previously unselected package libfdisk1:amd64. Preparing to unpack .../05-libfdisk1_2.39.1-3_amd64.deb ... Unpacking libfdisk1:amd64 (2.39.1-3) ... Selecting previously unselected package libkmod2:amd64. Preparing to unpack .../06-libkmod2_30+20230519-1_amd64.deb ... Unpacking libkmod2:amd64 (30+20230519-1) ... Selecting previously unselected package libapparmor1:amd64. Preparing to unpack .../07-libapparmor1_3.0.8-3_amd64.deb ... Unpacking libapparmor1:amd64 (3.0.8-3) ... Selecting previously unselected package libip4tc2:amd64. Preparing to unpack .../08-libip4tc2_1.8.9-2_amd64.deb ... Unpacking libip4tc2:amd64 (1.8.9-2) ... Selecting previously unselected package libsystemd-shared:amd64. Preparing to unpack .../09-libsystemd-shared_254-1_amd64.deb ... Unpacking libsystemd-shared:amd64 (254-1) ... Selecting previously unselected package systemd-dev. Preparing to unpack .../10-systemd-dev_254-1_all.deb ... Unpacking systemd-dev (254-1) ... Selecting previously unselected package systemd. Preparing to unpack .../11-systemd_254-1_amd64.deb ... Unpacking systemd (254-1) ... Setting up libargon2-1:amd64 (0~20190702+dfsg-3) ... Setting up libjson-c5:amd64 (0.16-2) ... Setting up libfdisk1:amd64 (2.39.1-3) ... Setting up libkmod2:amd64 (30+20230519-1) ... Setting up libapparmor1:amd64 (3.0.8-3) ... Setting up libip4tc2:amd64 (1.8.9-2) ... Setting up libsystemd-shared:amd64 (254-1) ... Setting up systemd-dev (254-1) ... Setting up libdevmapper1.02.1:amd64 (2:1.02.185-2) ... Setting up libcryptsetup12:amd64 (2:2.6.1-4) ... Setting up systemd (254-1) ... Created symlink /etc/systemd/system/getty.target.wants/getty@tty1.service -> /lib/systemd/system/getty@.service. Created symlink /etc/systemd/system/multi-user.target.wants/remote-fs.target -> /lib/systemd/system/remote-fs.target. Created symlink /etc/systemd/system/sysinit.target.wants/systemd-pstore.service -> /lib/systemd/system/systemd-pstore.service. Initializing machine ID from random generator. Creating group 'systemd-journal' with GID 999. Creating group 'systemd-network' with GID 998. Creating user 'systemd-network' (systemd Network Management) with UID 998 and GID 998. Setting up dmsetup (2:1.02.185-2) ... Selecting previously unselected package systemd-sysv. (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 ... 19825 files and directories currently installed.) Preparing to unpack .../0-systemd-sysv_254-1_amd64.deb ... Unpacking systemd-sysv (254-1) ... Selecting previously unselected package libdbus-1-3:amd64. Preparing to unpack .../1-libdbus-1-3_1.14.8-2_amd64.deb ... Unpacking libdbus-1-3:amd64 (1.14.8-2) ... Selecting previously unselected package dbus-bin. Preparing to unpack .../2-dbus-bin_1.14.8-2_amd64.deb ... Unpacking dbus-bin (1.14.8-2) ... Selecting previously unselected package dbus-session-bus-common. Preparing to unpack .../3-dbus-session-bus-common_1.14.8-2_all.deb ... Unpacking dbus-session-bus-common (1.14.8-2) ... Selecting previously unselected package libexpat1:amd64. Preparing to unpack .../4-libexpat1_2.5.0-2_amd64.deb ... Unpacking libexpat1:amd64 (2.5.0-2) ... Selecting previously unselected package dbus-daemon. Preparing to unpack .../5-dbus-daemon_1.14.8-2_amd64.deb ... Unpacking dbus-daemon (1.14.8-2) ... Selecting previously unselected package dbus-system-bus-common. Preparing to unpack .../6-dbus-system-bus-common_1.14.8-2_all.deb ... Unpacking dbus-system-bus-common (1.14.8-2) ... Selecting previously unselected package dbus. Preparing to unpack .../7-dbus_1.14.8-2_amd64.deb ... Unpacking dbus (1.14.8-2) ... Selecting previously unselected package install-info. Preparing to unpack .../8-install-info_7.0.3-2_amd64.deb ... Unpacking install-info (7.0.3-2) ... Setting up install-info (7.0.3-2) ... Selecting previously unselected package netbase. (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 ... 19940 files and directories currently installed.) Preparing to unpack .../000-netbase_6.4_all.deb ... Unpacking netbase (6.4) ... Selecting previously unselected package libproc2-0:amd64. Preparing to unpack .../001-libproc2-0_2%3a4.0.3-1_amd64.deb ... Unpacking libproc2-0:amd64 (2:4.0.3-1) ... Selecting previously unselected package procps. Preparing to unpack .../002-procps_2%3a4.0.3-1_amd64.deb ... Unpacking procps (2:4.0.3-1) ... Selecting previously unselected package sensible-utils. Preparing to unpack .../003-sensible-utils_0.0.20_all.deb ... Unpacking sensible-utils (0.0.20) ... Selecting previously unselected package openssl. Preparing to unpack .../004-openssl_3.0.10-1_amd64.deb ... Unpacking openssl (3.0.10-1) ... Selecting previously unselected package ca-certificates. Preparing to unpack .../005-ca-certificates_20230311_all.deb ... Unpacking ca-certificates (20230311) ... Selecting previously unselected package libmagic-mgc. Preparing to unpack .../006-libmagic-mgc_1%3a5.44-3_amd64.deb ... Unpacking libmagic-mgc (1:5.44-3) ... Selecting previously unselected package libmagic1:amd64. Preparing to unpack .../007-libmagic1_1%3a5.44-3_amd64.deb ... Unpacking libmagic1:amd64 (1:5.44-3) ... Selecting previously unselected package file. Preparing to unpack .../008-file_1%3a5.44-3_amd64.deb ... Unpacking file (1:5.44-3) ... Selecting previously unselected package gettext-base. Preparing to unpack .../009-gettext-base_0.21-13_amd64.deb ... Unpacking gettext-base (0.21-13) ... Selecting previously unselected package libuchardet0:amd64. Preparing to unpack .../010-libuchardet0_0.0.7-1_amd64.deb ... Unpacking libuchardet0:amd64 (0.0.7-1) ... Selecting previously unselected package groff-base. Preparing to unpack .../011-groff-base_1.23.0-2_amd64.deb ... Unpacking groff-base (1.23.0-2) ... Selecting previously unselected package libpam-systemd:amd64. Preparing to unpack .../012-libpam-systemd_254-1_amd64.deb ... Unpacking libpam-systemd:amd64 (254-1) ... Selecting previously unselected package bsdextrautils. Preparing to unpack .../013-bsdextrautils_2.39.1-3_amd64.deb ... Unpacking bsdextrautils (2.39.1-3) ... Selecting previously unselected package libpipeline1:amd64. Preparing to unpack .../014-libpipeline1_1.5.7-1_amd64.deb ... Unpacking libpipeline1:amd64 (1.5.7-1) ... Selecting previously unselected package man-db. Preparing to unpack .../015-man-db_2.11.2-3_amd64.deb ... Unpacking man-db (2.11.2-3) ... Selecting previously unselected package ucf. Preparing to unpack .../016-ucf_3.0043+nmu1_all.deb ... Moving old data out of the way Unpacking ucf (3.0043+nmu1) ... Selecting previously unselected package hicolor-icon-theme. Preparing to unpack .../017-hicolor-icon-theme_0.17-2_all.deb ... Unpacking hicolor-icon-theme (0.17-2) ... Selecting previously unselected package libgdk-pixbuf2.0-common. Preparing to unpack .../018-libgdk-pixbuf2.0-common_2.42.10+dfsg-1_all.deb ... Unpacking libgdk-pixbuf2.0-common (2.42.10+dfsg-1) ... Selecting previously unselected package libglib2.0-0:amd64. Preparing to unpack .../019-libglib2.0-0_2.76.4-4_amd64.deb ... Unpacking libglib2.0-0:amd64 (2.76.4-4) ... Selecting previously unselected package libicu72:amd64. Preparing to unpack .../020-libicu72_72.1-3_amd64.deb ... Unpacking libicu72:amd64 (72.1-3) ... Selecting previously unselected package libxml2:amd64. Preparing to unpack .../021-libxml2_2.9.14+dfsg-1.3_amd64.deb ... Unpacking libxml2:amd64 (2.9.14+dfsg-1.3) ... Selecting previously unselected package shared-mime-info. Preparing to unpack .../022-shared-mime-info_2.2-1_amd64.deb ... Unpacking shared-mime-info (2.2-1) ... Selecting previously unselected package libjpeg62-turbo:amd64. Preparing to unpack .../023-libjpeg62-turbo_1%3a2.1.5-2_amd64.deb ... Unpacking libjpeg62-turbo:amd64 (1:2.1.5-2) ... Selecting previously unselected package libpng16-16:amd64. Preparing to unpack .../024-libpng16-16_1.6.40-1_amd64.deb ... Unpacking libpng16-16:amd64 (1.6.40-1) ... Selecting previously unselected package libdeflate0:amd64. Preparing to unpack .../025-libdeflate0_1.14-1_amd64.deb ... Unpacking libdeflate0:amd64 (1.14-1) ... Selecting previously unselected package libjbig0:amd64. Preparing to unpack .../026-libjbig0_2.1-6.1_amd64.deb ... Unpacking libjbig0:amd64 (2.1-6.1) ... Selecting previously unselected package liblerc4:amd64. Preparing to unpack .../027-liblerc4_4.0.0+ds-2_amd64.deb ... Unpacking liblerc4:amd64 (4.0.0+ds-2) ... Selecting previously unselected package libwebp7:amd64. Preparing to unpack .../028-libwebp7_1.2.4-0.2_amd64.deb ... Unpacking libwebp7:amd64 (1.2.4-0.2) ... Selecting previously unselected package libtiff6:amd64. Preparing to unpack .../029-libtiff6_4.5.1+git230720-1_amd64.deb ... Unpacking libtiff6:amd64 (4.5.1+git230720-1) ... Selecting previously unselected package libgdk-pixbuf-2.0-0:amd64. Preparing to unpack .../030-libgdk-pixbuf-2.0-0_2.42.10+dfsg-1+b1_amd64.deb ... Unpacking libgdk-pixbuf-2.0-0:amd64 (2.42.10+dfsg-1+b1) ... Selecting previously unselected package gtk-update-icon-cache. Preparing to unpack .../031-gtk-update-icon-cache_3.24.38-2_amd64.deb ... Unpacking gtk-update-icon-cache (3.24.38-2) ... Selecting previously unselected package adwaita-icon-theme. Preparing to unpack .../032-adwaita-icon-theme_43-1_all.deb ... Unpacking adwaita-icon-theme (43-1) ... Selecting previously unselected package at-spi2-common. Preparing to unpack .../033-at-spi2-common_2.48.3-1_all.deb ... Unpacking at-spi2-common (2.48.3-1) ... Selecting previously unselected package m4. Preparing to unpack .../034-m4_1.4.19-3_amd64.deb ... Unpacking m4 (1.4.19-3) ... Selecting previously unselected package autoconf. Preparing to unpack .../035-autoconf_2.71-3_all.deb ... Unpacking autoconf (2.71-3) ... Selecting previously unselected package autotools-dev. Preparing to unpack .../036-autotools-dev_20220109.1_all.deb ... Unpacking autotools-dev (20220109.1) ... Selecting previously unselected package automake. Preparing to unpack .../037-automake_1%3a1.16.5-1.3_all.deb ... Unpacking automake (1:1.16.5-1.3) ... Selecting previously unselected package autopoint. Preparing to unpack .../038-autopoint_0.21-13_all.deb ... Unpacking autopoint (0.21-13) ... Selecting previously unselected package dbus-user-session. Preparing to unpack .../039-dbus-user-session_1.14.8-2_amd64.deb ... Unpacking dbus-user-session (1.14.8-2) ... Selecting previously unselected package libdconf1:amd64. Preparing to unpack .../040-libdconf1_0.40.0-4_amd64.deb ... Unpacking libdconf1:amd64 (0.40.0-4) ... Selecting previously unselected package dconf-service. Preparing to unpack .../041-dconf-service_0.40.0-4_amd64.deb ... Unpacking dconf-service (0.40.0-4) ... Selecting previously unselected package dconf-gsettings-backend:amd64. Preparing to unpack .../042-dconf-gsettings-backend_0.40.0-4_amd64.deb ... Unpacking dconf-gsettings-backend:amd64 (0.40.0-4) ... Selecting previously unselected package libdebhelper-perl. Preparing to unpack .../043-libdebhelper-perl_13.11.4_all.deb ... Unpacking libdebhelper-perl (13.11.4) ... Selecting previously unselected package libtool. Preparing to unpack .../044-libtool_2.4.7-7_all.deb ... Unpacking libtool (2.4.7-7) ... Selecting previously unselected package dh-autoreconf. Preparing to unpack .../045-dh-autoreconf_20_all.deb ... Unpacking dh-autoreconf (20) ... Selecting previously unselected package libarchive-zip-perl. Preparing to unpack .../046-libarchive-zip-perl_1.68-1_all.deb ... Unpacking libarchive-zip-perl (1.68-1) ... Selecting previously unselected package libsub-override-perl. Preparing to unpack .../047-libsub-override-perl_0.09-4_all.deb ... Unpacking libsub-override-perl (0.09-4) ... Selecting previously unselected package libfile-stripnondeterminism-perl. Preparing to unpack .../048-libfile-stripnondeterminism-perl_1.13.1-1_all.deb ... Unpacking libfile-stripnondeterminism-perl (1.13.1-1) ... Selecting previously unselected package dh-strip-nondeterminism. Preparing to unpack .../049-dh-strip-nondeterminism_1.13.1-1_all.deb ... Unpacking dh-strip-nondeterminism (1.13.1-1) ... Selecting previously unselected package libelf1:amd64. Preparing to unpack .../050-libelf1_0.189-4_amd64.deb ... Unpacking libelf1:amd64 (0.189-4) ... Selecting previously unselected package dwz. Preparing to unpack .../051-dwz_0.15-1_amd64.deb ... Unpacking dwz (0.15-1) ... Selecting previously unselected package gettext. Preparing to unpack .../052-gettext_0.21-13_amd64.deb ... Unpacking gettext (0.21-13) ... Selecting previously unselected package intltool-debian. Preparing to unpack .../053-intltool-debian_0.35.0+20060710.6_all.deb ... Unpacking intltool-debian (0.35.0+20060710.6) ... Selecting previously unselected package po-debconf. Preparing to unpack .../054-po-debconf_1.0.21+nmu1_all.deb ... Unpacking po-debconf (1.0.21+nmu1) ... Selecting previously unselected package debhelper. Preparing to unpack .../055-debhelper_13.11.4_all.deb ... Unpacking debhelper (13.11.4) ... Selecting previously unselected package libapt-pkg-perl. Preparing to unpack .../056-libapt-pkg-perl_0.1.40+b2_amd64.deb ... Unpacking libapt-pkg-perl (0.1.40+b2) ... Selecting previously unselected package libarray-unique-perl. Preparing to unpack .../057-libarray-unique-perl_0.08-4_all.deb ... Unpacking libarray-unique-perl (0.08-4) ... Selecting previously unselected package libsub-name-perl:amd64. Preparing to unpack .../058-libsub-name-perl_0.27-1_amd64.deb ... Unpacking libsub-name-perl:amd64 (0.27-1) ... Selecting previously unselected package libclass-accessor-perl. Preparing to unpack .../059-libclass-accessor-perl_0.51-2_all.deb ... Unpacking libclass-accessor-perl (0.51-2) ... Selecting previously unselected package libexporter-tiny-perl. Preparing to unpack .../060-libexporter-tiny-perl_1.006002-1_all.deb ... Unpacking libexporter-tiny-perl (1.006002-1) ... Selecting previously unselected package liblist-moreutils-xs-perl. Preparing to unpack .../061-liblist-moreutils-xs-perl_0.430-3+b1_amd64.deb ... Unpacking liblist-moreutils-xs-perl (0.430-3+b1) ... Selecting previously unselected package liblist-moreutils-perl. Preparing to unpack .../062-liblist-moreutils-perl_0.430-2_all.deb ... Unpacking liblist-moreutils-perl (0.430-2) ... Selecting previously unselected package libio-stringy-perl. Preparing to unpack .../063-libio-stringy-perl_2.111-3_all.deb ... Unpacking libio-stringy-perl (2.111-3) ... Selecting previously unselected package libencode-locale-perl. Preparing to unpack .../064-libencode-locale-perl_1.05-3_all.deb ... Unpacking libencode-locale-perl (1.05-3) ... Selecting previously unselected package libtimedate-perl. Preparing to unpack .../065-libtimedate-perl_2.3300-2_all.deb ... Unpacking libtimedate-perl (2.3300-2) ... Selecting previously unselected package libhttp-date-perl. Preparing to unpack .../066-libhttp-date-perl_6.05-2_all.deb ... Unpacking libhttp-date-perl (6.05-2) ... Selecting previously unselected package libfile-listing-perl. Preparing to unpack .../067-libfile-listing-perl_6.15-1_all.deb ... Unpacking libfile-listing-perl (6.15-1) ... Selecting previously unselected package libhtml-tagset-perl. Preparing to unpack .../068-libhtml-tagset-perl_3.20-6_all.deb ... Unpacking libhtml-tagset-perl (3.20-6) ... Selecting previously unselected package liburi-perl. Preparing to unpack .../069-liburi-perl_5.19-2_all.deb ... Unpacking liburi-perl (5.19-2) ... Selecting previously unselected package libhtml-parser-perl:amd64. Preparing to unpack .../070-libhtml-parser-perl_3.81-1_amd64.deb ... Unpacking libhtml-parser-perl:amd64 (3.81-1) ... Selecting previously unselected package libhtml-tree-perl. Preparing to unpack .../071-libhtml-tree-perl_5.07-3_all.deb ... Unpacking libhtml-tree-perl (5.07-3) ... Selecting previously unselected package libclone-perl:amd64. Preparing to unpack .../072-libclone-perl_0.46-1_amd64.deb ... Unpacking libclone-perl:amd64 (0.46-1) ... Selecting previously unselected package libio-html-perl. Preparing to unpack .../073-libio-html-perl_1.004-3_all.deb ... Unpacking libio-html-perl (1.004-3) ... Selecting previously unselected package liblwp-mediatypes-perl. Preparing to unpack .../074-liblwp-mediatypes-perl_6.04-2_all.deb ... Unpacking liblwp-mediatypes-perl (6.04-2) ... Selecting previously unselected package libhttp-message-perl. Preparing to unpack .../075-libhttp-message-perl_6.44-2_all.deb ... Unpacking libhttp-message-perl (6.44-2) ... Selecting previously unselected package libhttp-cookies-perl. Preparing to unpack .../076-libhttp-cookies-perl_6.10-1_all.deb ... Unpacking libhttp-cookies-perl (6.10-1) ... Selecting previously unselected package libhttp-negotiate-perl. Preparing to unpack .../077-libhttp-negotiate-perl_6.01-2_all.deb ... Unpacking libhttp-negotiate-perl (6.01-2) ... Selecting previously unselected package perl-openssl-defaults:amd64. Preparing to unpack .../078-perl-openssl-defaults_7+b1_amd64.deb ... Unpacking perl-openssl-defaults:amd64 (7+b1) ... Selecting previously unselected package libnet-ssleay-perl:amd64. Preparing to unpack .../079-libnet-ssleay-perl_1.92-2+b1_amd64.deb ... Unpacking libnet-ssleay-perl:amd64 (1.92-2+b1) ... Selecting previously unselected package libio-socket-ssl-perl. Preparing to unpack .../080-libio-socket-ssl-perl_2.083-1_all.deb ... Unpacking libio-socket-ssl-perl (2.083-1) ... Selecting previously unselected package libnet-http-perl. Preparing to unpack .../081-libnet-http-perl_6.22-1_all.deb ... Unpacking libnet-http-perl (6.22-1) ... Selecting previously unselected package liblwp-protocol-https-perl. Preparing to unpack .../082-liblwp-protocol-https-perl_6.11-1_all.deb ... Unpacking liblwp-protocol-https-perl (6.11-1) ... Selecting previously unselected package libtry-tiny-perl. Preparing to unpack .../083-libtry-tiny-perl_0.31-2_all.deb ... Unpacking libtry-tiny-perl (0.31-2) ... Selecting previously unselected package libwww-robotrules-perl. Preparing to unpack .../084-libwww-robotrules-perl_6.02-1_all.deb ... Unpacking libwww-robotrules-perl (6.02-1) ... Selecting previously unselected package libwww-perl. Preparing to unpack .../085-libwww-perl_6.72-1_all.deb ... Unpacking libwww-perl (6.72-1) ... Selecting previously unselected package liberror-perl. Preparing to unpack .../086-liberror-perl_0.17029-2_all.deb ... Unpacking liberror-perl (0.17029-2) ... Selecting previously unselected package libexporter-lite-perl. Preparing to unpack .../087-libexporter-lite-perl_0.09-2_all.deb ... Unpacking libexporter-lite-perl (0.09-2) ... Selecting previously unselected package libparse-debcontrol-perl. Preparing to unpack .../088-libparse-debcontrol-perl_2.005-6_all.deb ... Unpacking libparse-debcontrol-perl (2.005-6) ... Selecting previously unselected package libsub-install-perl. Preparing to unpack .../089-libsub-install-perl_0.929-1_all.deb ... Unpacking libsub-install-perl (0.929-1) ... Selecting previously unselected package libtie-ixhash-perl. Preparing to unpack .../090-libtie-ixhash-perl_1.23-4_all.deb ... Unpacking libtie-ixhash-perl (1.23-4) ... Selecting previously unselected package libcgi-pm-perl. Preparing to unpack .../091-libcgi-pm-perl_4.57-1_all.deb ... Unpacking libcgi-pm-perl (4.57-1) ... Selecting previously unselected package libhtml-form-perl. Preparing to unpack .../092-libhtml-form-perl_6.11-1_all.deb ... Unpacking libhtml-form-perl (6.11-1) ... Selecting previously unselected package libwww-mechanize-perl. Preparing to unpack .../093-libwww-mechanize-perl_2.17-1_all.deb ... Unpacking libwww-mechanize-perl (2.17-1) ... Selecting previously unselected package libdebian-source-perl. Preparing to unpack .../094-libdebian-source-perl_0.122_all.deb ... Unpacking libdebian-source-perl (0.122) ... Selecting previously unselected package emacs-el. Preparing to unpack .../095-emacs-el_1%3a29.1+1-2_all.deb ... Unpacking emacs-el (1:29.1+1-2) ... Selecting previously unselected package emacsen-common. Preparing to unpack .../096-emacsen-common_3.0.5_all.deb ... Unpacking emacsen-common (3.0.5) ... Selecting previously unselected package emacs-common. Preparing to unpack .../097-emacs-common_1%3a29.1+1-2_all.deb ... Unpacking emacs-common (1:29.1+1-2) ... Selecting previously unselected package emacs-bin-common. Preparing to unpack .../098-emacs-bin-common_1%3a29.1+1-2_amd64.deb ... Unpacking emacs-bin-common (1:29.1+1-2) ... Selecting previously unselected package libasound2-data. Preparing to unpack .../099-libasound2-data_1.2.9-1_all.deb ... Unpacking libasound2-data (1.2.9-1) ... Selecting previously unselected package libasound2:amd64. Preparing to unpack .../100-libasound2_1.2.9-1_amd64.deb ... Unpacking libasound2:amd64 (1.2.9-1) ... Selecting previously unselected package libbrotli1:amd64. Preparing to unpack .../101-libbrotli1_1.0.9-2+b6_amd64.deb ... Unpacking libbrotli1:amd64 (1.0.9-2+b6) ... Selecting previously unselected package libfreetype6:amd64. Preparing to unpack .../102-libfreetype6_2.13.0+dfsg-1_amd64.deb ... Unpacking libfreetype6:amd64 (2.13.0+dfsg-1) ... Selecting previously unselected package fonts-dejavu-core. Preparing to unpack .../103-fonts-dejavu-core_2.37-6_all.deb ... Unpacking fonts-dejavu-core (2.37-6) ... Selecting previously unselected package fontconfig-config. Preparing to unpack .../104-fontconfig-config_2.14.1-4_amd64.deb ... Unpacking fontconfig-config (2.14.1-4) ... Selecting previously unselected package libfontconfig1:amd64. Preparing to unpack .../105-libfontconfig1_2.14.1-4_amd64.deb ... Unpacking libfontconfig1:amd64 (2.14.1-4) ... Selecting previously unselected package libpixman-1-0:amd64. Preparing to unpack .../106-libpixman-1-0_0.42.2-1_amd64.deb ... Unpacking libpixman-1-0:amd64 (0.42.2-1) ... Selecting previously unselected package libxau6:amd64. Preparing to unpack .../107-libxau6_1%3a1.0.9-1_amd64.deb ... Unpacking libxau6:amd64 (1:1.0.9-1) ... Selecting previously unselected package libbsd0:amd64. Preparing to unpack .../108-libbsd0_0.11.7-4_amd64.deb ... Unpacking libbsd0:amd64 (0.11.7-4) ... Selecting previously unselected package libxdmcp6:amd64. Preparing to unpack .../109-libxdmcp6_1%3a1.1.2-3_amd64.deb ... Unpacking libxdmcp6:amd64 (1:1.1.2-3) ... Selecting previously unselected package libxcb1:amd64. Preparing to unpack .../110-libxcb1_1.15-1_amd64.deb ... Unpacking libxcb1:amd64 (1.15-1) ... Selecting previously unselected package libx11-data. Preparing to unpack .../111-libx11-data_2%3a1.8.6-1_all.deb ... Unpacking libx11-data (2:1.8.6-1) ... Selecting previously unselected package libx11-6:amd64. Preparing to unpack .../112-libx11-6_2%3a1.8.6-1_amd64.deb ... Unpacking libx11-6:amd64 (2:1.8.6-1) ... Selecting previously unselected package libxcb-render0:amd64. Preparing to unpack .../113-libxcb-render0_1.15-1_amd64.deb ... Unpacking libxcb-render0:amd64 (1.15-1) ... Selecting previously unselected package libxcb-shm0:amd64. Preparing to unpack .../114-libxcb-shm0_1.15-1_amd64.deb ... Unpacking libxcb-shm0:amd64 (1.15-1) ... Selecting previously unselected package libxext6:amd64. Preparing to unpack .../115-libxext6_2%3a1.3.4-1+b1_amd64.deb ... Unpacking libxext6:amd64 (2:1.3.4-1+b1) ... Selecting previously unselected package libxrender1:amd64. Preparing to unpack .../116-libxrender1_1%3a0.9.10-1.1_amd64.deb ... Unpacking libxrender1:amd64 (1:0.9.10-1.1) ... Selecting previously unselected package libcairo2:amd64. Preparing to unpack .../117-libcairo2_1.16.0-7_amd64.deb ... Unpacking libcairo2:amd64 (1.16.0-7) ... Selecting previously unselected package libgccjit0:amd64. Preparing to unpack .../118-libgccjit0_13.2.0-1_amd64.deb ... Unpacking libgccjit0:amd64 (13.2.0-1) ... Selecting previously unselected package libgif7:amd64. Preparing to unpack .../119-libgif7_5.2.1-2.5_amd64.deb ... Unpacking libgif7:amd64 (5.2.1-2.5) ... Selecting previously unselected package libgpm2:amd64. Preparing to unpack .../120-libgpm2_1.20.7-10+b1_amd64.deb ... Unpacking libgpm2:amd64 (1.20.7-10+b1) ... Selecting previously unselected package libatk1.0-0:amd64. Preparing to unpack .../121-libatk1.0-0_2.48.3-1_amd64.deb ... Unpacking libatk1.0-0:amd64 (2.48.3-1) ... Selecting previously unselected package libxi6:amd64. Preparing to unpack .../122-libxi6_2%3a1.8-1+b1_amd64.deb ... Unpacking libxi6:amd64 (2:1.8-1+b1) ... Selecting previously unselected package libatspi2.0-0:amd64. Preparing to unpack .../123-libatspi2.0-0_2.48.3-1_amd64.deb ... Unpacking libatspi2.0-0:amd64 (2.48.3-1) ... Selecting previously unselected package libatk-bridge2.0-0:amd64. Preparing to unpack .../124-libatk-bridge2.0-0_2.48.3-1_amd64.deb ... Unpacking libatk-bridge2.0-0:amd64 (2.48.3-1) ... Selecting previously unselected package libcairo-gobject2:amd64. Preparing to unpack .../125-libcairo-gobject2_1.16.0-7_amd64.deb ... Unpacking libcairo-gobject2:amd64 (1.16.0-7) ... Selecting previously unselected package liblcms2-2:amd64. Preparing to unpack .../126-liblcms2-2_2.14-2_amd64.deb ... Unpacking liblcms2-2:amd64 (2.14-2) ... Selecting previously unselected package libcolord2:amd64. Preparing to unpack .../127-libcolord2_1.4.6-2.2_amd64.deb ... Unpacking libcolord2:amd64 (1.4.6-2.2) ... Selecting previously unselected package libavahi-common-data:amd64. Preparing to unpack .../128-libavahi-common-data_0.8-10_amd64.deb ... Unpacking libavahi-common-data:amd64 (0.8-10) ... Selecting previously unselected package libavahi-common3:amd64. Preparing to unpack .../129-libavahi-common3_0.8-10_amd64.deb ... Unpacking libavahi-common3:amd64 (0.8-10) ... Selecting previously unselected package libavahi-client3:amd64. Preparing to unpack .../130-libavahi-client3_0.8-10_amd64.deb ... Unpacking libavahi-client3:amd64 (0.8-10) ... Selecting previously unselected package libcups2:amd64. Preparing to unpack .../131-libcups2_2.4.2-5_amd64.deb ... Unpacking libcups2:amd64 (2.4.2-5) ... Selecting previously unselected package libepoxy0:amd64. Preparing to unpack .../132-libepoxy0_1.5.10-1_amd64.deb ... Unpacking libepoxy0:amd64 (1.5.10-1) ... Selecting previously unselected package libfribidi0:amd64. Preparing to unpack .../133-libfribidi0_1.0.13-3_amd64.deb ... Unpacking libfribidi0:amd64 (1.0.13-3) ... Selecting previously unselected package libgraphite2-3:amd64. Preparing to unpack .../134-libgraphite2-3_1.3.14-1_amd64.deb ... Unpacking libgraphite2-3:amd64 (1.3.14-1) ... Selecting previously unselected package libharfbuzz0b:amd64. Preparing to unpack .../135-libharfbuzz0b_8.0.1-1_amd64.deb ... Unpacking libharfbuzz0b:amd64 (8.0.1-1) ... Selecting previously unselected package fontconfig. Preparing to unpack .../136-fontconfig_2.14.1-4_amd64.deb ... Unpacking fontconfig (2.14.1-4) ... Selecting previously unselected package libthai-data. Preparing to unpack .../137-libthai-data_0.1.29-1_all.deb ... Unpacking libthai-data (0.1.29-1) ... Selecting previously unselected package libdatrie1:amd64. Preparing to unpack .../138-libdatrie1_0.2.13-2+b1_amd64.deb ... Unpacking libdatrie1:amd64 (0.2.13-2+b1) ... Selecting previously unselected package libthai0:amd64. Preparing to unpack .../139-libthai0_0.1.29-1_amd64.deb ... Unpacking libthai0:amd64 (0.1.29-1) ... Selecting previously unselected package libpango-1.0-0:amd64. Preparing to unpack .../140-libpango-1.0-0_1.50.14+ds-1_amd64.deb ... Unpacking libpango-1.0-0:amd64 (1.50.14+ds-1) ... Selecting previously unselected package libpangoft2-1.0-0:amd64. Preparing to unpack .../141-libpangoft2-1.0-0_1.50.14+ds-1_amd64.deb ... Unpacking libpangoft2-1.0-0:amd64 (1.50.14+ds-1) ... Selecting previously unselected package libpangocairo-1.0-0:amd64. Preparing to unpack .../142-libpangocairo-1.0-0_1.50.14+ds-1_amd64.deb ... Unpacking libpangocairo-1.0-0:amd64 (1.50.14+ds-1) ... Selecting previously unselected package libwayland-client0:amd64. Preparing to unpack .../143-libwayland-client0_1.22.0-2_amd64.deb ... Unpacking libwayland-client0:amd64 (1.22.0-2) ... Selecting previously unselected package libwayland-cursor0:amd64. Preparing to unpack .../144-libwayland-cursor0_1.22.0-2_amd64.deb ... Unpacking libwayland-cursor0:amd64 (1.22.0-2) ... Selecting previously unselected package libwayland-egl1:amd64. Preparing to unpack .../145-libwayland-egl1_1.22.0-2_amd64.deb ... Unpacking libwayland-egl1:amd64 (1.22.0-2) ... Selecting previously unselected package libxcomposite1:amd64. Preparing to unpack .../146-libxcomposite1_1%3a0.4.5-1_amd64.deb ... Unpacking libxcomposite1:amd64 (1:0.4.5-1) ... Selecting previously unselected package libxfixes3:amd64. Preparing to unpack .../147-libxfixes3_1%3a6.0.0-2_amd64.deb ... Unpacking libxfixes3:amd64 (1:6.0.0-2) ... Selecting previously unselected package libxcursor1:amd64. Preparing to unpack .../148-libxcursor1_1%3a1.2.1-1_amd64.deb ... Unpacking libxcursor1:amd64 (1:1.2.1-1) ... Selecting previously unselected package libxdamage1:amd64. Preparing to unpack .../149-libxdamage1_1%3a1.1.6-1_amd64.deb ... Unpacking libxdamage1:amd64 (1:1.1.6-1) ... Selecting previously unselected package libxinerama1:amd64. Preparing to unpack .../150-libxinerama1_2%3a1.1.4-3_amd64.deb ... Unpacking libxinerama1:amd64 (2:1.1.4-3) ... Selecting previously unselected package xkb-data. Preparing to unpack .../151-xkb-data_2.38-2_all.deb ... Unpacking xkb-data (2.38-2) ... Selecting previously unselected package libxkbcommon0:amd64. Preparing to unpack .../152-libxkbcommon0_1.5.0-1_amd64.deb ... Unpacking libxkbcommon0:amd64 (1.5.0-1) ... Selecting previously unselected package libxrandr2:amd64. Preparing to unpack .../153-libxrandr2_2%3a1.5.2-2+b1_amd64.deb ... Unpacking libxrandr2:amd64 (2:1.5.2-2+b1) ... Selecting previously unselected package libgtk-3-common. Preparing to unpack .../154-libgtk-3-common_3.24.38-2_all.deb ... Unpacking libgtk-3-common (3.24.38-2) ... Selecting previously unselected package libgtk-3-0:amd64. Preparing to unpack .../155-libgtk-3-0_3.24.38-2_amd64.deb ... Unpacking libgtk-3-0:amd64 (3.24.38-2) ... Selecting previously unselected package x11-common. Preparing to unpack .../156-x11-common_1%3a7.7+23_all.deb ... Unpacking x11-common (1:7.7+23) ... Selecting previously unselected package libice6:amd64. Preparing to unpack .../157-libice6_2%3a1.0.10-1_amd64.deb ... Unpacking libice6:amd64 (2:1.0.10-1) ... Selecting previously unselected package m17n-db. Preparing to unpack .../158-m17n-db_1.8.2-1_all.deb ... Unpacking m17n-db (1.8.2-1) ... Selecting previously unselected package libaom3:amd64. Preparing to unpack .../159-libaom3_3.6.1-1_amd64.deb ... Unpacking libaom3:amd64 (3.6.1-1) ... Selecting previously unselected package libdav1d6:amd64. Preparing to unpack .../160-libdav1d6_1.2.1-2_amd64.deb ... Unpacking libdav1d6:amd64 (1.2.1-2) ... Selecting previously unselected package libabsl20220623:amd64. Preparing to unpack .../161-libabsl20220623_20220623.1-1_amd64.deb ... Unpacking libabsl20220623:amd64 (20220623.1-1) ... Selecting previously unselected package libgav1-1:amd64. Preparing to unpack .../162-libgav1-1_0.18.0-1+b1_amd64.deb ... Unpacking libgav1-1:amd64 (0.18.0-1+b1) ... Selecting previously unselected package librav1e0:amd64. Preparing to unpack .../163-librav1e0_0.6.6-3_amd64.deb ... Unpacking librav1e0:amd64 (0.6.6-3) ... Selecting previously unselected package libsvtav1enc1:amd64. Preparing to unpack .../164-libsvtav1enc1_1.6.0+dfsg-1_amd64.deb ... Unpacking libsvtav1enc1:amd64 (1.6.0+dfsg-1) ... Selecting previously unselected package libyuv0:amd64. Preparing to unpack .../165-libyuv0_0.0~git20230616.a366ad7-1_amd64.deb ... Unpacking libyuv0:amd64 (0.0~git20230616.a366ad7-1) ... Selecting previously unselected package libavif15:amd64. Preparing to unpack .../166-libavif15_0.11.1-3_amd64.deb ... Unpacking libavif15:amd64 (0.11.1-3) ... Selecting previously unselected package libheif-plugin-dav1d:amd64. Preparing to unpack .../167-libheif-plugin-dav1d_1.16.2-2_amd64.deb ... Unpacking libheif-plugin-dav1d:amd64 (1.16.2-2) ... Selecting previously unselected package libde265-0:amd64. Preparing to unpack .../168-libde265-0_1.0.12-1+b1_amd64.deb ... Unpacking libde265-0:amd64 (1.0.12-1+b1) ... Selecting previously unselected package libheif-plugin-libde265:amd64. Preparing to unpack .../169-libheif-plugin-libde265_1.16.2-2_amd64.deb ... Unpacking libheif-plugin-libde265:amd64 (1.16.2-2) ... Selecting previously unselected package libheif1:amd64. Preparing to unpack .../170-libheif1_1.16.2-2_amd64.deb ... Unpacking libheif1:amd64 (1.16.2-2) ... Selecting previously unselected package libxpm4:amd64. Preparing to unpack .../171-libxpm4_1%3a3.5.12-1.1_amd64.deb ... Unpacking libxpm4:amd64 (1:3.5.12-1.1) ... Selecting previously unselected package libgd3:amd64. Preparing to unpack .../172-libgd3_2.3.3-9_amd64.deb ... Unpacking libgd3:amd64 (2.3.3-9) ... Selecting previously unselected package libotf1:amd64. Preparing to unpack .../173-libotf1_0.9.16-4_amd64.deb ... Unpacking libotf1:amd64 (0.9.16-4) ... Selecting previously unselected package libxft2:amd64. Preparing to unpack .../174-libxft2_2.3.6-1_amd64.deb ... Unpacking libxft2:amd64 (2.3.6-1) ... Selecting previously unselected package libsm6:amd64. Preparing to unpack .../175-libsm6_2%3a1.2.3-1_amd64.deb ... Unpacking libsm6:amd64 (2:1.2.3-1) ... Selecting previously unselected package libxt6:amd64. Preparing to unpack .../176-libxt6_1%3a1.2.1-1.1_amd64.deb ... Unpacking libxt6:amd64 (1:1.2.1-1.1) ... Selecting previously unselected package libm17n-0:amd64. Preparing to unpack .../177-libm17n-0_1.8.2-1_amd64.deb ... Unpacking libm17n-0:amd64 (1.8.2-1) ... Selecting previously unselected package librsvg2-2:amd64. Preparing to unpack .../178-librsvg2-2_2.54.7+dfsg-1_amd64.deb ... Unpacking librsvg2-2:amd64 (2.54.7+dfsg-1) ... Selecting previously unselected package libtree-sitter0:amd64. Preparing to unpack .../179-libtree-sitter0_0.20.8-2_amd64.deb ... Unpacking libtree-sitter0:amd64 (0.20.8-2) ... Selecting previously unselected package libwebpdemux2:amd64. Preparing to unpack .../180-libwebpdemux2_1.2.4-0.2_amd64.deb ... Unpacking libwebpdemux2:amd64 (1.2.4-0.2) ... Selecting previously unselected package emacs-gtk. Preparing to unpack .../181-emacs-gtk_1%3a29.1+1-2_amd64.deb ... Unpacking emacs-gtk (1:29.1+1-2) ... Selecting previously unselected package emacs. Preparing to unpack .../182-emacs_1%3a29.1+1-2_all.deb ... Unpacking emacs (1:29.1+1-2) ... Selecting previously unselected package libarray-utils-perl. Preparing to unpack .../183-libarray-utils-perl_0.5-3_all.deb ... Unpacking libarray-utils-perl (0.5-3) ... Selecting previously unselected package libconfig-tiny-perl. Preparing to unpack .../184-libconfig-tiny-perl_2.29-1_all.deb ... Unpacking libconfig-tiny-perl (2.29-1) ... Selecting previously unselected package libnumber-compare-perl. Preparing to unpack .../185-libnumber-compare-perl_0.03-3_all.deb ... Unpacking libnumber-compare-perl (0.03-3) ... Selecting previously unselected package libtext-glob-perl. Preparing to unpack .../186-libtext-glob-perl_0.11-3_all.deb ... Unpacking libtext-glob-perl (0.11-3) ... Selecting previously unselected package libfile-find-rule-perl. Preparing to unpack .../187-libfile-find-rule-perl_0.34-3_all.deb ... Unpacking libfile-find-rule-perl (0.34-3) ... Selecting previously unselected package dh-elpa. Preparing to unpack .../188-dh-elpa_2.0.17_all.deb ... Unpacking dh-elpa (2.0.17) ... Selecting previously unselected package fonts-lmodern. Preparing to unpack .../189-fonts-lmodern_2.005-1_all.deb ... Unpacking fonts-lmodern (2.005-1) ... Selecting previously unselected package libedit2:amd64. Preparing to unpack .../190-libedit2_3.1-20221030-2_amd64.deb ... Unpacking libedit2:amd64 (3.1-20221030-2) ... Selecting previously unselected package libtcl8.6:amd64. Preparing to unpack .../191-libtcl8.6_8.6.13+dfsg-2_amd64.deb ... Unpacking libtcl8.6:amd64 (8.6.13+dfsg-2) ... Selecting previously unselected package libxss1:amd64. Preparing to unpack .../192-libxss1_1%3a1.2.3-1_amd64.deb ... Unpacking libxss1:amd64 (1:1.2.3-1) ... Selecting previously unselected package libtk8.6:amd64. Preparing to unpack .../193-libtk8.6_8.6.13-2_amd64.deb ... Unpacking libtk8.6:amd64 (8.6.13-2) ... Selecting previously unselected package gcl. Preparing to unpack .../194-gcl_2.6.14-4_amd64.deb ... Unpacking gcl (2.6.14-4) ... Selecting previously unselected package libkpathsea6:amd64. Preparing to unpack .../195-libkpathsea6_2022.20220321.62855-8_amd64.deb ... Unpacking libkpathsea6:amd64 (2022.20220321.62855-8) ... Selecting previously unselected package libpaper1:amd64. Preparing to unpack .../196-libpaper1_1.1.29_amd64.deb ... Unpacking libpaper1:amd64 (1.1.29) ... Selecting previously unselected package libpaper-utils. Preparing to unpack .../197-libpaper-utils_1.1.29_amd64.deb ... Unpacking libpaper-utils (1.1.29) ... Selecting previously unselected package libptexenc1:amd64. Preparing to unpack .../198-libptexenc1_2022.20220321.62855-8_amd64.deb ... Unpacking libptexenc1:amd64 (2022.20220321.62855-8) ... Selecting previously unselected package libsynctex2:amd64. Preparing to unpack .../199-libsynctex2_2022.20220321.62855-8_amd64.deb ... Unpacking libsynctex2:amd64 (2022.20220321.62855-8) ... Selecting previously unselected package libteckit0:amd64. Preparing to unpack .../200-libteckit0_2.5.11+ds1-1+b1_amd64.deb ... Unpacking libteckit0:amd64 (2.5.11+ds1-1+b1) ... Selecting previously unselected package libtexlua53-5:amd64. Preparing to unpack .../201-libtexlua53-5_2022.20220321.62855-8_amd64.deb ... Unpacking libtexlua53-5:amd64 (2022.20220321.62855-8) ... Selecting previously unselected package libtexluajit2:amd64. Preparing to unpack .../202-libtexluajit2_2022.20220321.62855-8_amd64.deb ... Unpacking libtexluajit2:amd64 (2022.20220321.62855-8) ... Selecting previously unselected package libtext-unidecode-perl. Preparing to unpack .../203-libtext-unidecode-perl_1.30-3_all.deb ... Unpacking libtext-unidecode-perl (1.30-3) ... Selecting previously unselected package libxmu6:amd64. Preparing to unpack .../204-libxmu6_2%3a1.1.3-3_amd64.deb ... Unpacking libxmu6:amd64 (2:1.1.3-3) ... Selecting previously unselected package libxaw7:amd64. Preparing to unpack .../205-libxaw7_2%3a1.0.14-1_amd64.deb ... Unpacking libxaw7:amd64 (2:1.0.14-1) ... Selecting previously unselected package libxml-namespacesupport-perl. Preparing to unpack .../206-libxml-namespacesupport-perl_1.12-2_all.deb ... Unpacking libxml-namespacesupport-perl (1.12-2) ... Selecting previously unselected package libxml-sax-base-perl. Preparing to unpack .../207-libxml-sax-base-perl_1.09-3_all.deb ... Unpacking libxml-sax-base-perl (1.09-3) ... Selecting previously unselected package libxml-sax-perl. Preparing to unpack .../208-libxml-sax-perl_1.02+dfsg-3_all.deb ... Unpacking libxml-sax-perl (1.02+dfsg-3) ... Selecting previously unselected package libxml-libxml-perl. Preparing to unpack .../209-libxml-libxml-perl_2.0207+dfsg+really+2.0134-1+b1_amd64.deb ... Unpacking libxml-libxml-perl (2.0207+dfsg+really+2.0134-1+b1) ... Selecting previously unselected package libzzip-0-13:amd64. Preparing to unpack .../210-libzzip-0-13_0.13.72+dfsg.1-1.1_amd64.deb ... Unpacking libzzip-0-13:amd64 (0.13.72+dfsg.1-1.1) ... Selecting previously unselected package t1utils. Preparing to unpack .../211-t1utils_1.41-4_amd64.deb ... Unpacking t1utils (1.41-4) ... Selecting previously unselected package tex-common. Preparing to unpack .../212-tex-common_6.18_all.deb ... Unpacking tex-common (6.18) ... Selecting previously unselected package texinfo-lib. Preparing to unpack .../213-texinfo-lib_7.0.3-2_amd64.deb ... Unpacking texinfo-lib (7.0.3-2) ... Selecting previously unselected package texinfo. Preparing to unpack .../214-texinfo_7.0.3-2_all.deb ... Unpacking texinfo (7.0.3-2) ... Selecting previously unselected package texlive-binaries. Preparing to unpack .../215-texlive-binaries_2022.20220321.62855-8_amd64.deb ... Unpacking texlive-binaries (2022.20220321.62855-8) ... Selecting previously unselected package xdg-utils. Preparing to unpack .../216-xdg-utils_1.1.3-4.1_all.deb ... Unpacking xdg-utils (1.1.3-4.1) ... Selecting previously unselected package texlive-base. Preparing to unpack .../217-texlive-base_2022.20230122-3_all.deb ... Unpacking texlive-base (2022.20230122-3) ... Selecting previously unselected package texlive-latex-base. Preparing to unpack .../218-texlive-latex-base_2022.20230122-3_all.deb ... Unpacking texlive-latex-base (2022.20230122-3) ... Selecting previously unselected package texlive-latex-recommended. Preparing to unpack .../219-texlive-latex-recommended_2022.20230122-3_all.deb ... Unpacking texlive-latex-recommended (2022.20230122-3) ... Selecting previously unselected package time. Preparing to unpack .../220-time_1.9-0.2_amd64.deb ... Unpacking time (1.9-0.2) ... Setting up libapt-pkg-perl (0.1.40+b2) ... Setting up libarray-utils-perl (0.5-3) ... Setting up libexpat1:amd64 (2.5.0-2) ... Setting up libpipeline1:amd64 (1.5.7-1) ... Setting up libgraphite2-3:amd64 (1.3.14-1) ... Setting up liblcms2-2:amd64 (2.14-2) ... Setting up libpixman-1-0:amd64 (0.42.2-1) ... Setting up libaom3:amd64 (3.6.1-1) ... Setting up libabsl20220623:amd64 (20220623.1-1) ... Setting up systemd-sysv (254-1) ... Setting up libxau6:amd64 (1:1.0.9-1) ... Setting up time (1.9-0.2) ... Setting up libtie-ixhash-perl (1.23-4) ... Setting up libgpm2:amd64 (1.20.7-10+b1) ... Setting up libicu72:amd64 (72.1-3) ... Setting up liblerc4:amd64 (4.0.0+ds-2) ... Setting up bsdextrautils (2.39.1-3) ... Setting up hicolor-icon-theme (0.17-2) ... Setting up libdatrie1:amd64 (0.2.13-2+b1) ... Setting up libtext-glob-perl (0.11-3) ... Setting up libmagic-mgc (1:5.44-3) ... Setting up libclone-perl:amd64 (0.46-1) ... Setting up libarchive-zip-perl (1.68-1) ... Setting up libglib2.0-0:amd64 (2.76.4-4) ... Setting up libio-stringy-perl (2.111-3) ... Setting up libhtml-tagset-perl (3.20-6) ... Setting up libtexluajit2:amd64 (2022.20220321.62855-8) ... Setting up libdebhelper-perl (13.11.4) ... Setting up libbrotli1:amd64 (1.0.9-2+b6) ... Setting up liblwp-mediatypes-perl (6.04-2) ... Setting up libgdk-pixbuf2.0-common (2.42.10+dfsg-1) ... Setting up x11-common (1:7.7+23) ... Running in chroot, ignoring request. Setting up X socket directories... /tmp/.X11-unix /tmp/.ICE-unix. Setting up libtry-tiny-perl (0.31-2) ... Setting up libmagic1:amd64 (1:5.44-3) ... Setting up libdeflate0:amd64 (1.14-1) ... Setting up m17n-db (1.8.2-1) ... Setting up perl-openssl-defaults:amd64 (7+b1) ... Setting up libxml-namespacesupport-perl (1.12-2) ... Setting up gettext-base (0.21-13) ... Setting up m4 (1.4.19-3) ... Setting up xkb-data (2.38-2) ... Setting up libencode-locale-perl (1.05-3) ... Setting up libzzip-0-13:amd64 (0.13.72+dfsg.1-1.1) ... Setting up file (1:5.44-3) ... Setting up libsvtav1enc1:amd64 (1.6.0+dfsg-1) ... Setting up texinfo-lib (7.0.3-2) ... Setting up libconfig-tiny-perl (2.29-1) ... Setting up libjbig0:amd64 (2.1-6.1) ... Setting up librav1e0:amd64 (0.6.6-3) ... Setting up libcolord2:amd64 (1.4.6-2.2) ... Setting up libsub-install-perl (0.929-1) ... Setting up libnumber-compare-perl (0.03-3) ... Setting up liberror-perl (0.17029-2) ... Setting up libdconf1:amd64 (0.40.0-4) ... Setting up libasound2-data (1.2.9-1) ... Setting up libxml-sax-base-perl (1.09-3) ... Setting up autotools-dev (20220109.1) ... Setting up libjpeg62-turbo:amd64 (1:2.1.5-2) ... Setting up libtree-sitter0:amd64 (0.20.8-2) ... Setting up emacsen-common (3.0.5) ... Setting up libx11-data (2:1.8.6-1) ... Setting up libepoxy0:amd64 (1.5.10-1) ... Setting up libfile-find-rule-perl (0.34-3) ... Setting up libteckit0:amd64 (2.5.11+ds1-1+b1) ... Setting up libavahi-common-data:amd64 (0.8-10) ... Setting up libdbus-1-3:amd64 (1.14.8-2) ... Setting up libfribidi0:amd64 (1.0.13-3) ... Setting up t1utils (1.41-4) ... Setting up libtexlua53-5:amd64 (2022.20220321.62855-8) ... Setting up libproc2-0:amd64 (2:4.0.3-1) ... Setting up libarray-unique-perl (0.08-4) ... Setting up libpng16-16:amd64 (1.6.40-1) ... Setting up libio-html-perl (1.004-3) ... Setting up libtcl8.6:amd64 (8.6.13+dfsg-2) ... Setting up autopoint (0.21-13) ... Setting up fonts-dejavu-core (2.37-6) ... Setting up libgav1-1:amd64 (0.18.0-1+b1) ... Setting up liblist-moreutils-xs-perl (0.430-3+b1) ... Setting up libdav1d6:amd64 (1.2.1-2) ... Setting up libkpathsea6:amd64 (2022.20220321.62855-8) ... Setting up autoconf (2.71-3) ... Setting up libwebp7:amd64 (1.2.4-0.2) ... Setting up libtimedate-perl (2.3300-2) ... Setting up libexporter-lite-perl (0.09-2) ... Setting up libsub-name-perl:amd64 (0.27-1) ... Setting up libgif7:amd64 (5.2.1-2.5) ... Setting up sensible-utils (0.0.20) ... Setting up at-spi2-common (2.48.3-1) ... Setting up libtiff6:amd64 (4.5.1+git230720-1) ... Setting up dbus-session-bus-common (1.14.8-2) ... Setting up libuchardet0:amd64 (0.0.7-1) ... Setting up procps (2:4.0.3-1) ... Setting up libasound2:amd64 (1.2.9-1) ... Setting up fonts-lmodern (2.005-1) ... Setting up libsub-override-perl (0.09-4) ... Setting up libthai-data (0.1.29-1) ... Setting up netbase (6.4) ... Setting up libatk1.0-0:amd64 (2.48.3-1) ... Setting up libwayland-egl1:amd64 (1.22.0-2) ... Setting up libexporter-tiny-perl (1.006002-1) ... Setting up dbus-system-bus-common (1.14.8-2) ... Setting up libclass-accessor-perl (0.51-2) ... Setting up libtext-unidecode-perl (1.30-3) ... Setting up libde265-0:amd64 (1.0.12-1+b1) ... Setting up libgccjit0:amd64 (13.2.0-1) ... Setting up openssl (3.0.10-1) ... Setting up libbsd0:amd64 (0.11.7-4) ... Setting up libyuv0:amd64 (0.0~git20230616.a366ad7-1) ... Setting up libelf1:amd64 (0.189-4) ... Setting up libxml2:amd64 (2.9.14+dfsg-1.3) ... Setting up xdg-utils (1.1.3-4.1) ... update-alternatives: using /usr/bin/xdg-open to provide /usr/bin/open (open) in auto mode Setting up liburi-perl (5.19-2) ... Setting up dbus-bin (1.14.8-2) ... Setting up libsynctex2:amd64 (2022.20220321.62855-8) ... Setting up libxkbcommon0:amd64 (1.5.0-1) ... Setting up libwayland-client0:amd64 (1.22.0-2) ... Setting up libnet-ssleay-perl:amd64 (1.92-2+b1) ... Setting up automake (1:1.16.5-1.3) ... update-alternatives: using /usr/bin/automake-1.16 to provide /usr/bin/automake (automake) in auto mode Setting up libfile-stripnondeterminism-perl (1.13.1-1) ... Setting up libice6:amd64 (2:1.0.10-1) ... Setting up libhttp-date-perl (6.05-2) ... Setting up libxdmcp6:amd64 (1:1.1.2-3) ... Setting up libxcb1:amd64 (1.15-1) ... Setting up gettext (0.21-13) ... Setting up libfile-listing-perl (6.15-1) ... Setting up libavif15:amd64 (0.11.1-3) ... Setting up libtool (2.4.7-7) ... Setting up libxcb-render0:amd64 (1.15-1) ... Setting up fontconfig-config (2.14.1-4) ... Setting up liblist-moreutils-perl (0.430-2) ... Setting up libwebpdemux2:amd64 (1.2.4-0.2) ... Setting up libedit2:amd64 (3.1-20221030-2) ... Setting up libavahi-common3:amd64 (0.8-10) ... Setting up libnet-http-perl (6.22-1) ... Setting up libxcb-shm0:amd64 (1.15-1) ... Setting up dbus-daemon (1.14.8-2) ... Setting up intltool-debian (0.35.0+20060710.6) ... Setting up dh-autoreconf (20) ... Setting up libthai0:amd64 (0.1.29-1) ... Setting up ca-certificates (20230311) ... Updating certificates in /etc/ssl/certs... 140 added, 0 removed; done. Setting up libptexenc1:amd64 (2022.20220321.62855-8) ... Setting up libfreetype6:amd64 (2.13.0+dfsg-1) ... Setting up dbus (1.14.8-2) ... Running in chroot, ignoring request. invoke-rc.d: policy-rc.d denied execution of start. Setting up shared-mime-info (2.2-1) ... Setting up ucf (3.0043+nmu1) ... Setting up dh-strip-nondeterminism (1.13.1-1) ... Setting up libwww-robotrules-perl (6.02-1) ... Setting up dwz (0.15-1) ... Setting up groff-base (1.23.0-2) ... Setting up libwayland-cursor0:amd64 (1.22.0-2) ... Setting up libhtml-parser-perl:amd64 (3.81-1) ... Setting up libpam-systemd:amd64 (254-1) ... Setting up libx11-6:amd64 (2:1.8.6-1) ... Setting up libharfbuzz0b:amd64 (8.0.1-1) ... Setting up libgdk-pixbuf-2.0-0:amd64 (2.42.10+dfsg-1+b1) ... Setting up libfontconfig1:amd64 (2.14.1-4) ... Setting up libxcomposite1:amd64 (1:0.4.5-1) ... Setting up libsm6:amd64 (2:1.2.3-1) ... Setting up libavahi-client3:amd64 (0.8-10) ... Setting up libio-socket-ssl-perl (2.083-1) ... Setting up libhttp-message-perl (6.44-2) ... Setting up libhtml-form-perl (6.11-1) ... Setting up libotf1:amd64 (0.9.16-4) ... Setting up libpaper1:amd64 (1.1.29) ... Creating config file /etc/papersize with new version Setting up gtk-update-icon-cache (3.24.38-2) ... Setting up libhttp-negotiate-perl (6.01-2) ... Setting up fontconfig (2.14.1-4) ... Regenerating fonts cache... done. Setting up libxdamage1:amd64 (1:1.1.6-1) ... Setting up libxpm4:amd64 (1:3.5.12-1.1) ... Setting up libxrender1:amd64 (1:0.9.10-1.1) ... Setting up libhttp-cookies-perl (6.10-1) ... Setting up po-debconf (1.0.21+nmu1) ... Setting up libhtml-tree-perl (5.07-3) ... Setting up libpango-1.0-0:amd64 (1.50.14+ds-1) ... Setting up libcgi-pm-perl (4.57-1) ... Setting up libxext6:amd64 (2:1.3.4-1+b1) ... Setting up libpaper-utils (1.1.29) ... Setting up man-db (2.11.2-3) ... Not building database; man-db/auto-update is not 'true'. Created symlink /etc/systemd/system/timers.target.wants/man-db.timer -> /lib/systemd/system/man-db.timer. Setting up libxml-sax-perl (1.02+dfsg-3) ... update-perl-sax-parsers: Registering Perl SAX parser XML::SAX::PurePerl with priority 10... update-perl-sax-parsers: Updating overall Perl SAX parser modules info file... Creating config file /etc/perl/XML/SAX/ParserDetails.ini with new version Setting up libcairo2:amd64 (1.16.0-7) ... Setting up tex-common (6.18) ... update-language: texlive-base not installed and configured, doing nothing! Setting up dbus-user-session (1.14.8-2) ... Setting up adwaita-icon-theme (43-1) ... update-alternatives: using /usr/share/icons/Adwaita/cursor.theme to provide /usr/share/icons/default/index.theme (x-cursor-theme) in auto mode Setting up libxfixes3:amd64 (1:6.0.0-2) ... Setting up libxinerama1:amd64 (2:1.1.4-3) ... Setting up libxrandr2:amd64 (2:1.5.2-2+b1) ... Setting up libxt6:amd64 (1:1.2.1-1.1) ... Setting up libxml-libxml-perl (2.0207+dfsg+really+2.0134-1+b1) ... update-perl-sax-parsers: Registering Perl SAX parser XML::LibXML::SAX::Parser with priority 50... update-perl-sax-parsers: Registering Perl SAX parser XML::LibXML::SAX with priority 50... update-perl-sax-parsers: Updating overall Perl SAX parser modules info file... Replacing config file /etc/perl/XML/SAX/ParserDetails.ini with new version Setting up libcups2:amd64 (2.4.2-5) ... Setting up libcairo-gobject2:amd64 (1.16.0-7) ... Setting up libxss1:amd64 (1:1.2.3-1) ... Setting up libpangoft2-1.0-0:amd64 (1.50.14+ds-1) ... Setting up libpangocairo-1.0-0:amd64 (1.50.14+ds-1) ... Setting up libxft2:amd64 (2.3.6-1) ... Setting up libxmu6:amd64 (2:1.1.3-3) ... Setting up libxi6:amd64 (2:1.8-1+b1) ... Setting up libtk8.6:amd64 (8.6.13-2) ... Setting up libxcursor1:amd64 (1:1.2.1-1) ... Setting up debhelper (13.11.4) ... Setting up dconf-service (0.40.0-4) ... Setting up libxaw7:amd64 (2:1.0.14-1) ... Setting up libatspi2.0-0:amd64 (2.48.3-1) ... Setting up librsvg2-2:amd64 (2.54.7+dfsg-1) ... Setting up libatk-bridge2.0-0:amd64 (2.48.3-1) ... Setting up texinfo (7.0.3-2) ... Running mktexlsr. This may take some time. ... done. Setting up texlive-binaries (2022.20220321.62855-8) ... update-alternatives: using /usr/bin/xdvi-xaw to provide /usr/bin/xdvi.bin (xdvi.bin) in auto mode update-alternatives: using /usr/bin/bibtex.original to provide /usr/bin/bibtex (bibtex) in auto mode Setting up texlive-base (2022.20230122-3) ... tl-paper: setting paper size for dvips to a4: /var/lib/texmf/dvips/config/config-paper.ps tl-paper: setting paper size for dvipdfmx to a4: /var/lib/texmf/dvipdfmx/dvipdfmx-paper.cfg tl-paper: setting paper size for xdvi to a4: /var/lib/texmf/xdvi/XDvi-paper tl-paper: setting paper size for pdftex to a4: /var/lib/texmf/tex/generic/tex-ini-files/pdftexconfig.tex Setting up dconf-gsettings-backend:amd64 (0.40.0-4) ... Setting up texlive-latex-base (2022.20230122-3) ... Setting up texlive-latex-recommended (2022.20230122-3) ... Setting up libgtk-3-common (3.24.38-2) ... Setting up libgtk-3-0:amd64 (3.24.38-2) ... Setting up emacs-el (1:29.1+1-2) ... Setting up emacs-common (1:29.1+1-2) ... Setting up libheif-plugin-dav1d:amd64 (1.16.2-2) ... Setting up liblwp-protocol-https-perl (6.11-1) ... Setting up libheif-plugin-libde265:amd64 (1.16.2-2) ... Setting up libwww-perl (6.72-1) ... Setting up libheif1:amd64 (1.16.2-2) ... Setting up libparse-debcontrol-perl (2.005-6) ... Setting up libwww-mechanize-perl (2.17-1) ... Setting up libgd3:amd64 (2.3.3-9) ... Setting up libdebian-source-perl (0.122) ... Setting up emacs-bin-common (1:29.1+1-2) ... update-alternatives: using /usr/bin/ctags.emacs to provide /usr/bin/ctags (ctags) in auto mode update-alternatives: using /usr/bin/ebrowse.emacs to provide /usr/bin/ebrowse (ebrowse) in auto mode update-alternatives: using /usr/bin/emacsclient.emacs to provide /usr/bin/emacsclient (emacsclient) in auto mode update-alternatives: using /usr/bin/etags.emacs to provide /usr/bin/etags (etags) in auto mode Setting up libm17n-0:amd64 (1.8.2-1) ... Setting up emacs-gtk (1:29.1+1-2) ... update-alternatives: using /usr/bin/emacs-gtk to provide /usr/bin/emacs (emacs) in auto mode update-alternatives: using /usr/bin/emacs to provide /usr/bin/editor (editor) in auto mode Install emacsen-common for emacs emacsen-common: Handling install of emacsen flavor emacs Setting up gcl (2.6.14-4) ... Creating config file /etc/default/gcl with new version Install gcl for emacs Setting up emacs (1:29.1+1-2) ... Setting up dh-elpa (2.0.17) ... Processing triggers for libc-bin (2.37-6) ... Processing triggers for install-info (7.0.3-2) ... Processing triggers for ca-certificates (20230311) ... Updating certificates in /etc/ssl/certs... 0 added, 0 removed; done. Running hooks in /etc/ca-certificates/update.d... done. Processing triggers for tex-common (6.18) ... Running updmap-sys. This may take some time... done. Running mktexlsr /var/lib/texmf ... done. Building format(s) --all. This may take some time... done. Reading package lists... Building dependency tree... Reading state information... Reading extended state information... Initializing package states... Writing extended state information... Building tag database... -> Finished parsing the build-deps I: Building the package I: Running cd /build/1st/acl2-8.5dfsg/ && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-buildpackage -us -uc -b && env PATH="/usr/sbin:/usr/bin:/sbin:/bin:/usr/games" HOME="/nonexistent/first-build" dpkg-genchanges -S > ../acl2_8.5dfsg-5_source.changes dpkg-buildpackage: info: source package acl2 dpkg-buildpackage: info: source version 8.5dfsg-5 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/1st/acl2-8.5dfsg/books/interface/infix' rm -f /build/1st/acl2-8.5dfsg/books/interface/infix/*.otl /build/1st/acl2-8.5dfsg/books/interface/infix/*.err /build/1st/acl2-8.5dfsg/books/interface/infix/*.ps /build/1st/acl2-8.5dfsg/books/interface/infix/*.aux rm -f /build/1st/acl2-8.5dfsg/books/interface/infix/*.dvi /build/1st/acl2-8.5dfsg/books/interface/infix/*.aux /build/1st/acl2-8.5dfsg/books/interface/infix/*.log /build/1st/acl2-8.5dfsg/books/interface/infix/*.idx /build/1st/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/1st/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/1st/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/1st/acl2-8.5dfsg' /usr/bin/make clean-books make[1]: Entering directory '/build/1st/acl2-8.5dfsg' ACL2_WD is /build/1st/acl2-8.5dfsg ACL2 is /build/1st/acl2-8.5dfsg/saved_acl2 Linux ionos11-amd64 6.1.0-10-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.38-2 (2023-07-27) x86_64 GNU/Linux cd books ; /usr/bin/make -k ACL2=/build/1st/acl2-8.5dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/1st/acl2-8.5dfsg/books' ACL2_SYSTEM_BOOKS is /build/1st/acl2-8.5dfsg/books Determining ACL2 features (for ACL2 = /build/1st/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.100s user 0m0.056s sys 0m0.059s Scanning for dependencies... real 6m7.319s user 2m55.541s sys 0m1.751s Done scanning. Reading book deps Makefile-deps created on Thu Aug 3 12:45:00 -12 2023 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/1st/acl2-8.5dfsg/books/build/clean.pl clean.pl: scanning for generated files clean.pl: found 4 targets (3 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/1st/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/1st/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/1st/acl2-8.5dfsg/books/build/Makefile-comp /build/1st/acl2-8.5dfsg/books/build/Makefile-comp-pre /build/1st/acl2-8.5dfsg/books/build/Makefile-deps /build/1st/acl2-8.5dfsg/books/build/Makefile-books /build/1st/acl2-8.5dfsg/books/build/Makefile-features /build/1st/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/1st/acl2-8.5dfsg/books/system/toothbrush' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/1st/acl2-8.5dfsg/. rm -f defined-syms.lsp rm -f success.txt cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/1st/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/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/examples/thacker' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/rtl' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model-2' make[3]: Leaving directory '/build/1st/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/1st/acl2-8.5dfsg/books' make[1]: Leaving directory '/build/1st/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/elpa-acl2.lintian-overrides debian/acl2.lintian-overrides debian/acl2-doc.lintian-overrides debian/acl2-books.lintian-overrides debian/acl2-books-source.lintian-overrides debian/acl2-books-certs.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 /usr/bin/make GCL_MEM_MULTIPLE=0.1 GCL_ANSI=t LISP=/usr/bin/gcl & j=$! ; tail --retry -f make.log & k=$! ; wait $j ; kill $k make[1]: Entering directory '/build/1st/acl2-8.5dfsg' tail: warning: --retry only effective for the initial open tail: cannot open 'make.log' for reading: No such file or directory 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/1st/acl2-8.5dfsg' /usr/bin/make acl2r make[3]: Entering directory '/build/1st/acl2-8.5dfsg' make[3]: Leaving directory '/build/1st/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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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/1st/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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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/1st/acl2-8.5dfsg/serialize-raw.c: In function 'L43': /build/1st/acl2-8.5dfsg/serialize-raw.c:4696:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4696 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/serialize-raw.c:4852:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4852 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c: In function 'L537': /build/1st/acl2-8.5dfsg/translate0.c:50509:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 50509 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:50889:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 50889 | if((Cnil)!=Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:51209:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 51209 | if((Cnil)!=Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:51519:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 51519 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/interface-raw.c: In function 'L156': /build/1st/acl2-8.5dfsg/interface-raw.c:24695:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 24695 | if((Cnil)!=Cnil){ | ^~ NIL >make[4]: Entering directory '/build/1st/acl2-8.5dfsg' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg' rm -f acl2-proclaims.lisp /usr/bin/make acl2-proclaims.lisp make[3]: Entering directory '/build/1st/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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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/1st/acl2-8.5dfsg' /usr/bin/make compile USE_ACL2_PROCLAIMS=t make[3]: Entering directory '/build/1st/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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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/1st/acl2-8.5dfsg/serialize-raw.c: In function 'LI43': /build/1st/acl2-8.5dfsg/serialize-raw.c:4256:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4256 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/serialize-raw.c:4386:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 4386 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c: In function 'L537': /build/1st/acl2-8.5dfsg/translate0.c:40499:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 40499 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:40816:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 40816 | if((Cnil)!=Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:41086:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 41086 | if((Cnil)!=Cnil){ | ^~ /build/1st/acl2-8.5dfsg/translate0.c:41337:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 41337 | if((Cnil)==Cnil){ | ^~ /build/1st/acl2-8.5dfsg/interface-raw.c: In function 'LI158': /build/1st/acl2-8.5dfsg/interface-raw.c:20262:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 20262 | if((Cnil)!=Cnil){ | ^~ done. NIL >make[4]: Entering directory '/build/1st/acl2-8.5dfsg' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg' make[2]: Leaving directory '/build/1st/acl2-8.5dfsg' Bootstrapping, then saving executable (may take a few minutes) ...make[2]: Entering directory '/build/1st/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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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=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=3).GC finished] [GC for 211 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=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 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=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).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=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=2).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 316 SYMBOL pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 1 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 22 CFUN pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 5 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 586 RELOCATABLE-BLOCKS pages..(T=3).GC finished] [GC for 586 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=4).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=5).GC finished] [GC for 101 SFUN pages..(T=6).GC finished] [GC for 101 SFUN pages..(T=4).GC finished] [GC for 101 SFUN pages..(T=5).GC finished] [GC for 101 SFUN pages..(T=4).GC finished] [GC for 111 SFUN pages..(T=5).GC finished] [GC for 111 SFUN pages..(T=4).GC finished] [GC for 111 SFUN pages..(T=5).GC finished] [GC for 121 SFUN pages..(T=5).GC finished] [GC for 121 SFUN pages..(T=5).GC finished] [GC for 121 SFUN pages..(T=5).GC finished] [GC for 131 SFUN pages..(T=5).GC finished] [GC for 131 SFUN pages..(T=5).GC finished] [GC for 131 SFUN pages..(T=4).GC finished] [GC for 141 SFUN pages..(T=5).GC finished] [GC for 141 SFUN pages..(T=4).GC finished] [GC for 141 SFUN pages..(T=5).GC finished] [GC for 151 SFUN pages..(T=4).GC finished] [GC for 151 SFUN pages..(T=5).GC finished] [GC for 161 SFUN pages..(T=5).GC finished] [GC for 161 SFUN pages..(T=4).GC finished] [GC for 171 SFUN pages..(T=5).GC finished] [GC for 171 SFUN pages..(T=5).GC finished] [GC for 181 SFUN pages..(T=5).GC finished] [GC for 181 SFUN pages..(T=4).GC finished] [GC for 898 CONS pages..(T=5).GC finished] [GC for 898 CONS pages..(T=4).GC finished] [GC for 191 SFUN pages..(T=4).GC finished] [GC for 898 CONS pages..(T=4).GC finished] [GC for 898 CONS pages..(T=5).GC finished] [GC for 898 CONS pages..(T=5).GC finished] [GC for 898 CONS pages..(T=5).GC finished] [GC for 201 SFUN pages..(T=5).GC finished] [GC for 898 CONS pages..(T=6).GC finished] [GC for 908 CONS pages..(T=5).GC finished] [GC for 908 CONS pages..(T=5).GC finished] [GC for 918 CONS pages..(T=5).GC finished] [GC for 918 CONS pages..(T=5).GC finished] [GC for 211 SFUN pages..(T=5).GC finished] [GC for 918 CONS pages..(T=5).GC finished] [GC for 928 CONS pages..(T=5).GC finished] [GC for 938 CONS pages..(T=5).GC finished] [GC for 948 CONS pages..(T=5).GC finished] [GC for 958 CONS pages..(T=5).GC finished] [GC for 968 CONS pages..(T=5).GC finished] [GC for 978 CONS pages..(T=6).GC finished] [GC for 988 CONS pages..(T=4).GC finished] [GC for 998 CONS pages..(T=5).GC finished] [GC for 1008 CONS pages..(T=5).GC finished] [GC for 1018 CONS pages..(T=5).GC finished] [GC for 1028 CONS pages..(T=5).GC finished] [GC for 1038 CONS pages..(T=5).GC finished] [GC for 1048 CONS pages..(T=5).GC finished] [GC for 1058 CONS pages..(T=5).GC finished] [GC for 1068 CONS pages..(T=6).GC finished] [GC for 1078 CONS pages..(T=5).GC finished] [GC for 1088 CONS pages..(T=5).GC finished] [GC for 1098 CONS pages..(T=5).GC finished] [GC for 1108 CONS pages..(T=5).GC finished] [GC for 1118 CONS pages..(T=5).GC finished] [GC for 1128 CONS pages..(T=6).GC finished] [GC for 1138 CONS pages..(T=5).GC finished] [GC for 1148 CONS pages..(T=5).GC finished] [GC for 1158 CONS pages..(T=5).GC finished] [GC for 1168 CONS pages..(T=6).GC finished] [GC for 1178 CONS pages..(T=5).GC finished] [GC for 1188 CONS pages..(T=5).GC finished] [GC for 1198 CONS pages..(T=6).GC finished] [GC for 1208 CONS pages..(T=5).GC finished] [GC for 1218 CONS pages..(T=6).GC finished] [GC for 1228 CONS pages..(T=5).GC finished] [GC for 1238 CONS pages..(T=6).GC finished] [GC for 1248 CONS pages..(T=5).GC finished] [GC for 1258 CONS pages..(T=5).GC finished] [GC for 1268 CONS pages..(T=6).GC finished] [GC for 1278 CONS pages..(T=5).GC finished] [GC for 1288 CONS pages..(T=5).GC finished] [GC for 1298 CONS pages..(T=6).GC finished] [GC for 1308 CONS pages..(T=5).GC finished] [GC for 1318 CONS pages..(T=6).GC finished] [GC for 1328 CONS pages..(T=5).GC finished] [GC for 1338 CONS pages..(T=5).GC finished] [GC for 1348 CONS pages..(T=6).GC finished] [GC for 1358 CONS pages..(T=5).GC finished] [GC for 1368 CONS pages..(T=6).GC finished] [GC for 1378 CONS pages..(T=5).GC finished] [GC for 1388 CONS pages..(T=6).GC finished] [GC for 1398 CONS pages..(T=5).GC finished] [GC for 1408 CONS pages..(T=5).GC finished] [GC for 1418 CONS pages..(T=6).GC finished] [GC for 1428 CONS pages..(T=6).GC finished] [GC for 1438 CONS pages..(T=5).GC finished] [GC for 1448 CONS pages..(T=6).GC finished] [GC for 1458 CONS pages..(T=5).GC finished] [GC for 1468 CONS pages..(T=6).GC finished] [GC for 1478 CONS pages..(T=5).GC finished] [GC for 1488 CONS pages..(T=6).GC finished] [GC for 1498 CONS pages..(T=6).GC finished] [GC for 1508 CONS pages..(T=5).GC finished] [GC for 1518 CONS pages..(T=6).GC finished] [GC for 1528 CONS pages..(T=6).GC finished] [GC for 1538 CONS pages..(T=6).GC finished] [GC for 1548 CONS pages..(T=5).GC finished] [GC for 1558 CONS pages..(T=5).GC finished] [GC for 1568 CONS pages..(T=6).GC finished] [GC for 221 SFUN pages..(T=6).GC finished] [GC for 1578 CONS pages..(T=6).GC finished] [GC for 1588 CONS pages..(T=6).GC finished] [GC for 1598 CONS pages..(T=6).GC finished] [GC for 10752 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] [GC for 1608 CONS pages..(T=6).GC finished] [GC for 1618 CONS pages..(T=5).GC finished] [GC for 231 SFUN pages..(T=6).GC finished] [GC for 1628 CONS pages..(T=6).GC finished] [GC for 241 SFUN pages..(T=5).GC finished] [GC for 1638 CONS pages..(T=6).GC finished] [GC for 251 SFUN pages..(T=6).GC finished] [GC for 1648 CONS pages..(T=6).GC finished] [GC for 11008 CONTIGUOUS-BLOCKS pages..(T=6).GC finished] [GC for 1658 CONS pages..(T=6).GC finished] [GC for 1668 CONS pages..(T=6).GC finished] [GC for 1678 CONS pages..(T=6).GC finished] [GC for 1688 CONS pages..(T=6).GC finished] [GC for 1698 CONS pages..(T=6).GC finished] [GC for 261 SFUN pages..(T=6).GC finished] [GC for 1708 CONS pages..(T=6).GC finished] [GC for 1718 CONS pages..(T=6).GC finished] [GC for 1728 CONS pages..(T=7).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=6).GC finished] [GC for 12800 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 271 SFUN pages..(T=6).GC finished] [GC for 1738 CONS pages..(T=7).GC finished] [GC for 1748 CONS pages..(T=6).GC finished] [GC for 1758 CONS pages..(T=7).GC finished] [GC for 281 SFUN pages..(T=6).GC finished] [GC for 1768 CONS pages..(T=6).GC finished] [GC for 13056 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 1778 CONS pages..(T=6).GC finished] [GC for 1788 CONS pages..(T=7).GC finished] [GC for 32 CFUN pages..(T=6).GC finished] [GC for 291 SFUN pages..(T=6).GC finished] [GC for 1798 CONS pages..(T=7).GC finished] [GC for 1808 CONS pages..(T=6).GC finished] [GC for 1818 CONS pages..(T=7).GC finished] [GC for 13312 CONTIGUOUS-BLOCKS pages..(T=7).GC finished] [GC for 1828 CONS pages..(T=7).GC finished] [GC for 1838 CONS pages..(T=7).GC finished] [GC for 301 SFUN pages..(T=7).GC finished] [GC for 1848 CONS pages..(T=7).GC finished] [GC for 1858 CONS pages..(T=8).GC finished] [GC for 1868 CONS pages..(T=7).GC finished] [GC for 1878 CONS pages..(T=7).GC finished] [GC for 1878 CONS pages..(T=7).GC finished] [GC for 311 SFUN pages..(T=7).GC finished] [GC for 1888 CONS pages..(T=7).GC finished] [GC for 1898 CONS pages..(T=7).GC finished] [GC for 13824 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] [GC for 1908 CONS pages..(T=7).GC finished] [GC for 1918 CONS pages..(T=7).GC finished] [GC for 321 SFUN pages..(T=7).GC finished] [GC for 1928 CONS pages..(T=7).GC finished] [GC for 1938 CONS pages..(T=7).GC finished] [GC for 1948 CONS pages..(T=7).GC finished] [GC for 331 SFUN pages..(T=7).GC finished] [GC for 1958 CONS pages..(T=7).GC finished] [GC for 1968 CONS pages..(T=7).GC finished] [GC for 341 SFUN pages..(T=8).GC finished] [GC for 1978 CONS pages..(T=7).GC finished] [GC for 1988 CONS pages..(T=7).GC finished] [GC for 1998 CONS pages..(T=7).GC finished] [GC for 2008 CONS pages..(T=7).GC finished] [GC for 2018 CONS pages..(T=7).GC finished] [GC for 2028 CONS pages..(T=7).GC finished] [GC for 2038 CONS pages..(T=8).GC finished] [GC for 2048 CONS pages..(T=8).GC finished] [GC for 2058 CONS pages..(T=8).GC finished] [GC for 2068 CONS pages..(T=7).GC finished] [GC for 2078 CONS pages..(T=7).GC finished] [GC for 2088 CONS pages..(T=8).GC finished] [GC for 2098 CONS pages..(T=8).GC finished] [GC for 2108 CONS pages..(T=8).GC finished] [GC for 2118 CONS pages..(T=7).GC finished] [GC for 351 SFUN pages..(T=7).GC finished] [GC for 2128 CONS pages..(T=8).GC finished] [GC for 2138 CONS pages..(T=8).GC finished] [GC for 2148 CONS pages..(T=7).GC finished] [GC for 2158 CONS pages..(T=7).GC finished] [GC for 2168 CONS pages..(T=7).GC finished] [GC for 2178 CONS pages..(T=7).GC finished] [GC for 2188 CONS pages..(T=8).GC finished] [GC for 2198 CONS pages..(T=8).GC finished] [GC for 2208 CONS pages..(T=7).GC finished] [GC for 2218 CONS pages..(T=7).GC finished] [GC for 2228 CONS pages..(T=8).GC finished] [GC for 2238 CONS pages..(T=8).GC finished] [GC for 2248 CONS pages..(T=8).GC finished] [GC for 2258 CONS pages..(T=9).GC finished] [GC for 2268 CONS pages..(T=8).GC finished] [GC for 2278 CONS pages..(T=8).GC finished] [GC for 2288 CONS pages..(T=8).GC finished] [GC for 361 SFUN pages..(T=8).GC finished] [GC for 2298 CONS pages..(T=8).GC finished] [GC for 2308 CONS pages..(T=8).GC finished] [GC for 2318 CONS pages..(T=8).GC finished] [GC for 2328 CONS pages..(T=8).GC finished] [GC for 2338 CONS pages..(T=8).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" [GC for 2348 CONS pages..(T=8).GC finished] *COMMON-LISP-SYMBOLS-FROM-MAIN-LISP-PACKAGE* *COMMON-LISP-SPECIALS-AND-CONSTANTS* NIL T *STOBJ-INLINE-DECLARE* MAKE-PACKAGE-ENTRY FIND-PACKAGE-ENTRY PACKAGE-ENTRY-NAME PACKAGE-ENTRY-IMPORTS PACKAGE-ENTRY-HIDDEN-P PACKAGE-ENTRY-BOOK-PATH PACKAGE-ENTRY-DEFPKG-EVENT-FORM PACKAGE-ENTRY-TTERM [GC for 2358 CONS pages..(T=8).GC finished] FIND-NON-HIDDEN-PACKAGE-ENTRY REMOVE-PACKAGE-ENTRY CHANGE-PACKAGE-ENTRY-HIDDEN-P GETPROP GETPROPC *STANDARD-CO* *STANDARD-OI* *STANDARD-CI* INSIST [GC for 371 SFUN pages..(T=8).GC finished] IFF XOR EQ [GC for 2368 CONS pages..(T=8).GC finished] BOOLEANP NIL IMPLIES NIL NIL NOT NIL HIDE REWRITE-EQUIV [GC for 2378 CONS pages..(T=9).GC finished] REAL/RATIONALP COMPLEX/COMPLEX-RATIONALP TRUE-LISTP LIST-MACRO LIST [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] AND-MACRO AND OR-MACRO OR - NIL NIL INTEGER-ABS XXXJOIN [GC for 2388 CONS pages..(T=8).GC finished] + LEN LENGTH ACL2-COUNT LEN [GC for 2398 CONS pages..(T=8).GC finished] LENGTH ACL2-COUNT COND-CLAUSESP COND-MACRO COND [GC for 2408 CONS pages..(T=9).GC finished] EQLABLEP NIL NIL EQLABLE-LISTP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] EQL ATOM MAKE-CHARACTER-LIST EQLABLE-ALISTP ALISTP NIL NIL ACONS [GC for 2418 CONS pages..(T=9).GC finished] ENDP 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 [GC for 2428 CONS pages..(T=8).GC finished] NULL SYMBOL-LISTP NIL SYMBOL-DOUBLET-LISTP REVERSE-STRIP-CARS STRIP-CARS REVERSE-STRIP-CDRS STRIP-CDRS [GC for 2438 CONS pages..(T=8).GC finished] [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=8).GC finished] HARD-ERROR ILLEGAL RETURN-LAST RETURN-LAST-FN MBE1 MUST-BE-EQUAL MBE MBT MBT* BINARY-APPEND APPEND NIL CAR-CDR-ELIM CAR-CONS CDR-CONS CONS-EQUAL NIL [GC for 2438 CONS pages..(T=8).GC finished] CONCATENATE STRING-APPEND STRING-LISTP STRING-APPEND-LST GUARD-CHECK-FN LET-MBE-GUARD-FORM LET-MBE DEFUN-WITH-GUARD-CHECK PROG2$ [GC for 2448 CONS pages..(T=9).GC finished] MEMBER-EQ-EXEC MEMBER-EQL-EXEC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] MEMBER-EQUAL MEMBER-EQ NIL NIL MEMBER SUBSETP-EQ-EXEC [GC for 2448 CONS pages..(T=9).GC finished] SUBSETP-EQL-EXEC SUBSETP-EQUAL SUBSETP-EQ NIL NIL SUBSETP SYMBOL-ALISTP NIL CHARACTER-ALISTP NIL [GC for 2458 CONS pages..(T=9).GC finished] ASSOC-EQ-EXEC ASSOC-EQL-EXEC ASSOC-EQUAL ASSOC-EQ NIL NIL ASSOC [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] ASSOC-EQ-EQUAL-ALISTP ASSOC-EQ-SAFE ASSOC-EQ-EQUAL ASSOC-EQ-CADR ASSOC-EQUAL-CADR <= [GC for 2458 CONS pages..(T=9).GC finished] = /= > >= INT= ZP NIL NIL NIL ZIP [GC for 2458 CONS pages..(T=9).GC finished] NIL NIL NIL NTH CHAR SLEEP [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] PROPER-CONSP IMPROPER-CONSP * NONNEGATIVE-PRODUCT CONJUGATE ADD-SUFFIX *INLINE-SUFFIX* EC-CALL1 EC-CALL NON-EXEC / CLOSURE ASSOCIATIVITY-OF-+ COMMUTATIVITY-OF-+ FIX UNICITY-OF-0 [GC for 2468 CONS pages..(T=9).GC finished] INVERSE-OF-+ ASSOCIATIVITY-OF-* COMMUTATIVITY-OF-* UNICITY-OF-1 INVERSE-OF-* DISTRIBUTIVITY <-ON-OTHERS ZERO TRICHOTOMY POSITIVE RATIONAL-IMPLIES1 RATIONAL-IMPLIES2 INTEGER-IMPLIES-RATIONAL COMPLEX-IMPLIES1 COMPLEX-DEFINITION NIL NONZERO-IMAGPART REALPART-IMAGPART-ELIM REALPART-COMPLEX IMAGPART-COMPLEX NIL FORCE *FORCE-XNUME* [GC for 2468 CONS pages..(T=8).GC finished] IMMEDIATE-FORCE-MODEP *IMMEDIATE-FORCE-MODEP-XNUME* CASE-SPLIT NIL DISABLE-FORCING ENABLE-FORCING DISABLE-IMMEDIATE-FORCE-MODEP ENABLE-IMMEDIATE-FORCE-MODEP SYNP SYNTAXP BIND-FREE EXTRA-INFO NIL *EXTRA-INFO-FN* TAU-SYSTEM *TAU-STATUS-BOOT-STRAP-SETTINGS* NIL *TAU-SYSTEM-XNUME* *TAU-ACL2-NUMBERP-PAIR* *TAU-INTEGERP-PAIR* *TAU-RATIONALP-PAIR* *TAU-BOOLEANP-PAIR* *TAU-NATP-PAIR* [GC for 2478 CONS pages..(T=9).GC finished] *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 BOOLEANP-CHARACTERP CHARACTERP-PAGE CHARACTERP-TAB CHARACTERP-RUBOUT CHARACTERP-RETURN [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] NO-DUPLICATESP-EQ-EXEC NO-DUPLICATESP-EQL-EXEC NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQ NIL NIL NO-DUPLICATESP [GC for 2488 CONS pages..(T=8).GC finished] R-EQLABLE-ALISTP R-SYMBOL-ALISTP RASSOC-EQ-EXEC RASSOC-EQL-EXEC [GC for 2498 CONS pages..(T=9).GC finished] RASSOC-EQUAL RASSOC-EQ NIL NIL RASSOC IFIX [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] RFIX REALFIX NFIX 1+ 1- NATP NIL NAT-ALISTP NIL BITP NIL NIL [GC for 381 SFUN pages..(T=8).GC finished] POSP NIL O-FINP O-INFP O-FIRST-EXPT O-FIRST-COEFF O-RST [GC for 2498 CONS pages..(T=8).GC finished] O O<= O>= [GC for 2508 CONS pages..(T=9).GC finished] O-P NIL NIL MAKE-ORD *STANDARD-CHARS* STANDARD-CHAR-P STANDARD-CHAR-P+ STANDARD-CHAR-LISTP CHARACTER-LISTP NIL NIL COERCE-INVERSE-1 COERCE-INVERSE-2 [GC for 2518 CONS pages..(T=9).GC finished] CHARACTER-LISTP-COERCE NIL STRING ALPHA-CHAR-P [GC for 14080 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] UPPER-CASE-P LOWER-CASE-P CHAR-UPCASE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=9).GC finished] CHAR-DOWNCASE NIL NIL NIL NIL NIL NIL NIL NIL NIL STRING-DOWNCASE1 NIL STRING-DOWNCASE STRING-UPCASE1 NIL [GC for 2518 CONS pages..(T=9).GC finished] STRING-UPCASE OUR-DIGIT-CHAR-P DIGIT-CHAR-P CHAR-EQUAL ATOM-LISTP NIL NIL GOOD-ATOM-LISTP NIL NIL [GC for 2528 CONS pages..(T=9).GC finished] STANDARD-STRING-P1 STANDARD-STRING-P STANDARD-STRING-LISTP STRING-EQUAL1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] STRING-EQUAL MEMBER-STRING-EQUAL STANDARD-STRING-ALISTP NIL ASSOC-STRING-EQUAL LIST*-MACRO LIST* [GC for 2528 CONS pages..(T=9).GC finished] 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 SYMBOL-PACKAGE-NAME-INTERN-IN-PACKAGE-OF-SYMBOL [GC for 2538 CONS pages..(T=9).GC finished] INTERN-IN-PACKAGE-OF-SYMBOL-IS-IDENTITY SYMBOL-LISTP-PKG-IMPORTS [GC for 2538 CONS pages..(T=9).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] T [GC for 2548 CONS pages..(T=8).GC finished] 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 REMOVE-EQ-EXEC [GC for 2558 CONS pages..(T=8).GC finished] REMOVE-EQL-EXEC REMOVE-EQUAL REMOVE-EQ NIL NIL REMOVE REMOVE1-EQ-EXEC [GC for 2568 CONS pages..(T=9).GC finished] REMOVE1-EQL-EXEC REMOVE1-EQUAL REMOVE1-EQ NIL NIL REMOVE1 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] REMOVE-DUPLICATES-EQ-EXEC REMOVE-DUPLICATES-EQL-EXEC REMOVE-DUPLICATES-EQUAL REMOVE-DUPLICATES-EQ NIL NIL REMOVE-DUPLICATES-LOGIC REMOVE-DUPLICATES NIL FIRST SECOND THIRD FOURTH FIFTH SIXTH SEVENTH EIGHTH NINTH [GC for 2568 CONS pages..(T=10).GC finished] TENTH REST IDENTITY REVAPPEND NIL NIL REVERSE PAIRLIS$-TAILREC [GC for 2568 CONS pages..(T=9).GC finished] PAIRLIS$ NIL NIL SET-DIFFERENCE-EQ-EXEC SET-DIFFERENCE-EQL-EXEC [GC for 2578 CONS pages..(T=9).GC finished] SET-DIFFERENCE-EQUAL SET-DIFFERENCE-EQ NIL NIL SET-DIFFERENCE$ *WINDOW-DESCRIPTIONS* *VALID-OUTPUT-NAMES* LISTP *SUMMARY-TYPES* WITH-EVISC-TUPLE LAST [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] FIRST-N-AC NIL TAKE BUTLAST MUTUAL-RECURSION-GUARDP [GC for 2578 CONS pages..(T=8).GC finished] COLLECT-CADRS-WHEN-CAR-MEMBER-EQ VALUE LEGAL-CONSTANTP1 VALUE-TRIPLE ASSERT-EVENT EVENT-KEYWORD-NAME [GC for 2578 CONS pages..(T=9).GC finished] EVENT-KEYWORD-NAME-LST ADD-TO-SET-EQ-EXEC ADD-TO-SET-EQL-EXEC [GC for 2588 CONS pages..(T=10).GC finished] ADD-TO-SET-EQUAL ADD-TO-SET-EQ ADD-TO-SET-EQL NIL NIL NIL ADD-TO-SET KEYWORD-VALUE-LISTP NIL THROW-NONEXEC-ERROR [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] EVENS ODDS MV-NTH MAKE-MV-NTHS MV MV? MV-LET MV?-LET [GC for 2588 CONS pages..(T=9).GC finished] LEGAL-CASE-CLAUSESP CASE-TEST CASE-LIST CASE-LIST-CHECK CASE NONNEGATIVE-INTEGER-QUOTIENT [GC for 2588 CONS pages..(T=10).GC finished] TRUE-LIST-LISTP NIL LEGAL-LET*-P WELL-FORMED-TYPE-DECLS-P SYMBOL-LIST-LISTP [GC for 2598 CONS pages..(T=10).GC finished] GET-TYPE-DECLS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] LET*-MACRO COLLECT-CDRS-WHEN-CAR-EQ APPEND-LST RESTRICT-ALIST [GC for 2598 CONS pages..(T=9).GC finished] LET* PROGN [GC for 2598 CONS pages..(T=9).GC finished] [GC for 2598 CONS pages..(T=9).GC finished] [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] [GC for 381 SFUN pages..(T=8).GC finished] LOGNOT DIGIT-TO-CHAR PRINT-BASE-P EXPLODE-NONNEGATIVE-INTEGER [GC for 2598 CONS pages..(T=9).GC finished] MAKE-VAR-LST1 MAKE-VAR-LST NTHCDR NIL [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] UNION-EQ-EXEC UNION-EQL-EXEC UNION-EQUAL UNION-EQ NIL NIL [GC for 2608 CONS pages..(T=10).GC finished] PARSE-ARGS-AND-TEST UNION-EQUAL-WITH-UNION-EQ-EXEC-GUARD UNION-EQUAL-WITH-UNION-EQL-EXEC-GUARD UNION$ *XARGS-KEYWORDS* PLAUSIBLE-DCLSP1 PLAUSIBLE-DCLSP [GC for 2618 CONS pages..(T=9).GC finished] STRIP-KEYWORD-LIST STRIP-DCLS1 STRIP-DCLS [GC for 2618 CONS pages..(T=9).GC finished] FETCH-DCL-FIELDS2 FETCH-DCL-FIELDS1 FETCH-DCL-FIELDS [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] FETCH-DCL-FIELD WITH-OUTPUT-ON-OFF-BINDING-VAL WITH-OUTPUT-ON-OFF-ARG MSGP [GC for 2618 CONS pages..(T=8).GC finished] CTXP [GC for 2618 CONS pages..(T=9).GC finished] [GC for 2628 CONS pages..(T=9).GC finished] WITH-OUTPUT-FN WITH-OUTPUT! WITH-OUTPUT DEFUN-NX-DCLS [GC for 2638 CONS pages..(T=9).GC finished] DEFUN-NX-FORM DEFUN-NX-FN DEFUN-NX DEFUND-NX UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX [GC for 381 SFUN pages..(T=9).GC finished] ASSOC-KEYWORD PROGRAM-DECLARED-P2 [GC for 14336 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=9).GC finished] PROGRAM-DECLARED-P1 PROGRAM-DECLARED-P SOME-PROGRAM-DECLARED-P PAIRLIS-X1 PAIRLIS-X2 APPEND? MUTUAL-RECURSION VARIABLEP NVARIABLEP FQUOTEP [GC for 381 SFUN pages..(T=9).GC finished] QUOTEP *T* *NIL* *0* *1* *-1* *2* KWOTE MAYBE-KWOTE KWOTE-LST UNQUOTE T [GC for 381 SFUN pages..(T=9).GC finished] (PSEUDO-TERMP PSEUDO-TERM-LISTP) NIL T PSEUDO-TERM-LIST-LISTP NIL LAMBDA-OBJECT-FORMALS LAMBDA-OBJECT-DCL LAMBDA-OBJECT-BODY [GC for 381 SFUN pages..(T=9).GC finished] LAMBDA-OBJECT-SHAPEP MAKE-LAMBDA-OBJECT FFN-SYMB FN-SYMB FARGS FARGN1 FARGN [GC for 381 SFUN pages..(T=8).GC finished] (ALL-VARS1 ALL-VARS1-LST) NIL ALL-VARS TRANSLATE-AND-TEST INTERSECTP-EQ-EXEC [GC for 381 SFUN pages..(T=9).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] INTERSECTP-EQL-EXEC INTERSECTP-EQUAL INTERSECTP-EQ NIL NIL INTERSECTP CHK-NO-STOBJ-INDEX-ALIASING MAKE-FMT-BINDINGS *BASE-10-CHARS* WARNING$ MSG [GC for 2638 CONS pages..(T=10).GC finished] CHECK-VARS-NOT-FREE-TEST CHECK-VARS-NOT-FREE ER-PROGN-FN ER-PROGN POSITION-AC-EQ-EXEC NIL [GC for 381 SFUN pages..(T=8).GC finished] POSITION-AC-EQL-EXEC NIL POSITION-EQUAL-AC NIL POSITION-AC-EQUAL POSITION-EQ-AC POSITION-AC-EQ NIL NIL POSITION-AC [GC for 2648 CONS pages..(T=9).GC finished] POSITION-EQ-EXEC POSITION-EQL-EXEC POSITION-EQUAL POSITION-EQ NIL NIL POSITION [GC for 2658 CONS pages..(T=10).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 2658 CONS pages..(T=8).GC finished] CHAR< CHAR> CHAR<= CHAR>= [GC for 381 SFUN pages..(T=8).GC finished] STRING<-L [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] STRING< STRING> STRING<= STRING>= [GC for 381 SFUN pages..(T=10).GC finished] SYMBOL< NIL NIL SUBSTITUTE-AC SUBSTITUTE NIL NIL SUBLIS [GC for 2658 CONS pages..(T=10).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 2668 CONS pages..(T=9).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 2678 CONS pages..(T=9).GC finished] FGETPROP SGETPROP ORDERED-SYMBOL-ALISTP NIL NIL ADD-PAIR [GC for 381 SFUN pages..(T=9).GC finished] REMOVE1-ASSOC-EQ-EXEC REMOVE1-ASSOC-EQL-EXEC REMOVE1-ASSOC-EQUAL REMOVE1-ASSOC-EQ NIL NIL REMOVE1-ASSOC [GC for 381 SFUN pages..(T=9).GC finished] REMOVE-ASSOC-EQ-EXEC [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] REMOVE-ASSOC-EQL-EXEC REMOVE-ASSOC-EQUAL REMOVE-ASSOC-EQ NIL NIL REMOVE-ASSOC GETPROPS1 [GC for 2688 CONS pages..(T=10).GC finished] GETPROPS NIL NIL NIL HAS-PROPSP1 HAS-PROPSP EXTEND-WORLD [GC for 2688 CONS pages..(T=9).GC finished] RETRACT-WORLD GLOBAL-VAL FUNCTION-SYMBOLP FCONS-TERM* CONJOIN2 [GC for 381 SFUN pages..(T=9).GC finished] CONJOIN CONJOIN-UNTRANSLATED-TERMS DISJOIN2 DISJOIN [GC for 381 SFUN pages..(T=9).GC finished] DISJOIN-LST KWOTE? CONJOIN? <=? >? [GC for 381 SFUN pages..(T=9).GC finished] DISJOIN? TRANSLATE-DECLARATION-TO-GUARD/INTEGER-GEN TRANSLATE-DECLARATION-TO-GUARD/INTEGER [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] WEAK-SATISFIES-TYPE-SPEC-P [GC for 2688 CONS pages..(T=10).GC finished] [GC for 2698 CONS pages..(T=10).GC finished] TRANSLATE-DECLARATION-TO-GUARD1-GEN TRANSLATE-DECLARATION-TO-GUARD1 [GC for 2708 CONS pages..(T=9).GC finished] (TRANSLATE-DECLARATION-TO-GUARD-GEN TRANSLATE-DECLARATION-TO-GUARD-GEN-LST) TRANSLATE-DECLARATION-TO-GUARD TRANSLATE-DECLARATION-TO-GUARD-LST THE-CHECK [GC for 381 SFUN pages..(T=9).GC finished] THE-FN THE THE-CHECK-FOR-*1* THE-FN-FOR-*1* THE-FOR-*1* *MAXIMUM-POSITIVE-32-BIT-INTEGER* BOUNDED-INTEGER-ALISTP NIL NIL NIL F-GET-GLOBAL [GC for 381 SFUN pages..(T=9).GC finished] ARRAY1P NIL NIL BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P NIL NIL [GC for 381 SFUN pages..(T=10).GC finished] HEADER DIMENSIONS MAXIMUM-LENGTH DEFAULT [GC for 381 SFUN pages..(T=9).GC finished] AREF1 COMPRESS11 ARRAY-ORDER [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] [GC for 42 CFUN pages..(T=9).GC finished] COMPRESS1 NIL ASET1 ASET1-TRUSTED AREF2 [GC for 2708 CONS pages..(T=9).GC finished] COMPRESS211 COMPRESS21 COMPRESS2 NIL [GC for 381 SFUN pages..(T=9).GC finished] ASET2 FLUSH-COMPRESS MAYBE-FLUSH-AND-COMPRESS1 CDRN MV-LIST SWAP-STOBJS UPDATE-NTH [GC for 381 SFUN pages..(T=9).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 [GC for 381 SFUN pages..(T=9).GC finished] INTEGER-LISTP NIL NAT-LISTP NIL 32-BIT-INTEGER-LISTP NIL OPEN-INPUT-CHANNELS UPDATE-OPEN-INPUT-CHANNELS [GC for 381 SFUN pages..(T=8).GC finished] OPEN-OUTPUT-CHANNELS [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] UPDATE-OPEN-OUTPUT-CHANNELS GLOBAL-TABLE UPDATE-GLOBAL-TABLE T-STACK [GC for 381 SFUN pages..(T=9).GC finished] UPDATE-T-STACK 32-BIT-INTEGER-STACK UPDATE-32-BIT-INTEGER-STACK [GC for 2049 RELOCATABLE-BLOCKS pages..(T=10).GC finished] BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY IDATES UPDATE-IDATES [GC for 381 SFUN pages..(T=10).GC finished] ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK UPDATE-FILE-CLOCK READABLE-FILES [GC for 381 SFUN pages..(T=9).GC finished] WRITTEN-FILES UPDATE-WRITTEN-FILES READ-FILES UPDATE-READ-FILES [GC for 381 SFUN pages..(T=9).GC finished] WRITEABLE-FILES [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] LIST-ALL-PACKAGE-NAMES-LST UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 UPDATE-USER-STOBJ-ALIST1 *INITIAL-CHECKPOINT-PROCESSORS* *INITIAL-PROGRAM-FNS-WITH-RAW-CODE* *INITIAL-LOGIC-FNS-WITH-RAW-CODE* *INITIAL-MACROS-WITH-RAW-CODE* [GC for 381 SFUN pages..(T=9).GC finished] UNTOUCHABLE-MARKER DEFMACRO-UNTOUCHABLE WITH-LIVE-STATE INIT-IPRINT-AR *IPRINT-SOFT-BOUND-DEFAULT* *IPRINT-HARD-BOUND-DEFAULT* DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT *FMT-SOFT-RIGHT-MARGIN-DEFAULT* *FMT-HARD-RIGHT-MARGIN-DEFAULT* *INITIAL-GLOBAL-TABLE* T WITH-INFIXP-NIL [GC for 2708 CONS pages..(T=10).GC finished] ALL-BOUNDP KNOWN-PACKAGE-ALISTP NIL TIMER-ALISTP NIL TYPED-IO-LISTP NIL *FILE-TYPES* [GC for 2718 CONS pages..(T=8).GC finished] OPEN-CHANNEL1 NIL OPEN-CHANNEL-LISTP OPEN-CHANNELS-P NIL FILE-CLOCK-P NIL [GC for 381 SFUN pages..(T=9).GC finished] READABLE-FILE NIL READABLE-FILES-LISTP NIL READABLE-FILES-P NIL WRITTEN-FILE NIL [GC for 381 SFUN pages..(T=9).GC finished] WRITTEN-FILE-LISTP NIL WRITTEN-FILES-P NIL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=9).GC finished] READ-FILE-LISTP1 NIL READ-FILE-LISTP NIL READ-FILES-P NIL WRITABLE-FILE-LISTP1 NIL [GC for 381 SFUN pages..(T=10).GC finished] WRITABLE-FILE-LISTP NIL WRITEABLE-FILES-P NIL STATE-P1 NIL STATE-P NIL NIL BUILD-STATE [GC for 2728 CONS pages..(T=8).GC finished] *DEFAULT-STATE* BUILD-STATE1 COERCE-STATE-TO-OBJECT COERCE-OBJECT-TO-STATE NIL GLOBAL-TABLE-CARS1 [GC for 381 SFUN pages..(T=9).GC finished] GLOBAL-TABLE-CARS BOUNDP-GLOBAL1 BOUNDP-GLOBAL F-BOUNDP-GLOBAL MAKUNBOUND-GLOBAL [GC for 381 SFUN pages..(T=9).GC finished] GET-GLOBAL PUT-GLOBAL F-PUT-GLOBAL *INITIAL-LD-SPECIAL-BINDINGS* ALWAYS-BOUNDP-GLOBAL [GC for 381 SFUN pages..(T=9).GC finished] STATE-GLOBAL-LET*-BINDINGS-P [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] STATE-GLOBAL-LET*-GET-GLOBALS STATE-GLOBAL-LET*-PUT-GLOBALS STATE-GLOBAL-LET*-CLEANUP WITH-PARALLELISM-HAZARD-WARNINGS WARN-ABOUT-PARALLELISM-HAZARD WITH-ENSURED-PARALLELISM-FINISHING STATE-GLOBAL-LET* :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2738 CONS pages..(T=10).GC finished] :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 ZPF NIL NIL NIL NIL NIL NIL NIL [GC for 381 SFUN pages..(T=10).GC finished] COMPLETION-OF-SYMBOL-NAME NIL COMPLETION-OF-SYMBOL-PACKAGE-NAME NIL NIL :EMPTY-ENCAPSULATE LOGAND LOGEQV LOGIOR LOGXOR INTEGER-LENGTH BINARY-LOGAND LOGNAND [GC for 2738 CONS pages..(T=9).GC finished] BINARY-LOGIOR LOGORC1 LOGORC2 [GC for 381 SFUN pages..(T=10).GC finished] LOGANDC1 LOGANDC2 BINARY-LOGEQV BINARY-LOGXOR [GC for 381 SFUN pages..(T=9).GC finished] 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* BOOLE$ [GC for 2748 CONS pages..(T=9).GC finished] [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SET-FORMS-FROM-BINDINGS *PRINT-CONTROL-DEFAULTS* ALIST-DIFFERENCE-EQ WITH-PRINT-DEFAULTS RESET-PRINT-CONTROL EXPLODE-ATOM NIL [GC for 381 SFUN pages..(T=9).GC finished] EXPLODE-ATOM+ NIL NIL NIL NIL OPEN-INPUT-CHANNEL-P1 [GC for 381 SFUN pages..(T=9).GC finished] OPEN-OUTPUT-CHANNEL-P1 OPEN-INPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-ANY-P1 [GC for 381 SFUN pages..(T=10).GC finished] OPEN-OUTPUT-CHANNEL-ANY-P OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P NON-FREE-VAR-RUNES [GC for 381 SFUN pages..(T=10).GC finished] FREE-VAR-RUNES NIL *DIRECTORY-SEPARATOR* *DIRECTORY-SEPARATOR-STRING* OS-ER OS ABSOLUTE-PATHNAME-STRING-P [GC for 381 SFUN pages..(T=10).GC finished] ILLEGAL-RULER-EXTENDERS-VALUES TABLE-ALIST RULER-EXTENDERS-MSG-AUX [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] RULER-EXTENDERS-MSG STRICT-SYMBOL<-SORTEDP CHK-RULER-EXTENDERS FIXNUM-BOUND *DEFAULT-STEP-LIMIT* INCLUDE-BOOK-DIR-ALIST-ENTRY-P [GC for 381 SFUN pages..(T=9).GC finished] INCLUDE-BOOK-DIR-ALISTP *CHECK-INVARIANT-RISK-VALUES* TTAG GET-REGISTER-INVARIANT-RISK-WORLD ACL2-DEFAULTS-TABLE [GC for 2758 CONS pages..(T=10).GC finished] ACL2-DEFAULTS-TABLE PRINT-CASE ACL2-PRINT-CASE CHECK-PRINT-CASE SET-PRINT-CASE PRINT-BASE ACL2-PRINT-BASE PRINT-RADIX ACL2-PRINT-RADIX CHECK-PRINT-BASE [GC for 381 SFUN pages..(T=10).GC finished] SET-PRINT-BASE SET-PRINT-CIRCLE SET-PRINT-ESCAPE SET-PRINT-PRETTY [GC for 381 SFUN pages..(T=10).GC finished] SET-PRINT-RADIX SET-PRINT-READABLY CHECK-NULL-OR-NATP [GC for 381 SFUN pages..(T=9).GC finished] SET-PRINT-LENGTH SET-PRINT-LEVEL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] SET-PRINT-LINES SET-PRINT-RIGHT-MARGIN RAW-PRINT-VARS-ALIST *RAW-PRINT-VARS-ALIST* [GC for 2768 CONS pages..(T=9).GC finished] PRINC$ WRITE-BYTE$ [GC for 381 SFUN pages..(T=9).GC finished] W GET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-FN [GC for 381 SFUN pages..(T=9).GC finished] SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM NIL NIL PRINT-OBJECT$+-ALIST [GC for 381 SFUN pages..(T=9).GC finished] MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL OPEN-INPUT-CHANNEL NIL NIL NIL NIL [GC for 2778 CONS pages..(T=10).GC finished] CLOSE-INPUT-CHANNEL OPEN-OUTPUT-CHANNEL [GC for 2788 CONS pages..(T=10).GC finished] OPEN-OUTPUT-CHANNEL! ASSERT$ ASSERT* COMMENT-WINDOW-CO [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] FMT-TO-COMMENT-WINDOW FMT-TO-COMMENT-WINDOW! FMT-TO-COMMENT-WINDOW+ FMT-TO-COMMENT-WINDOW!+ [GC for 381 SFUN pages..(T=10).GC finished] PAIRLIS2 CW CW! CW+ CW!+ CW-PRINT-BASE-RADIX CW-PRINT-BASE-RADIX! SUBSEQ-LIST SUBSEQ LOCK-SYMBOL-NAME-P ASSIGN-LOCK [GC for 2788 CONS pages..(T=10).GC finished] LOCK-TABLE WITH-LOCK DEFLOCK WITH-OUTPUT-LOCK WITH-LOCAL-STATE-LOCK GET-OUTPUT-STREAM-STRING$-FN GET-OUTPUT-STREAM-STRING$ [GC for 2798 CONS pages..(T=9).GC finished] CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ READ-CHAR$ PEEK-CHAR$ READ-BYTE$ [GC for 2808 CONS pages..(T=9).GC finished] RAW-MODE-P READ-OBJECT READ-OBJECT-WITH-CASE [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] READ-OBJECT-SUPPRESS *SUSPICIOUSLY-FIRST-NUMERIC-CHARS* *SUSPICIOUSLY-FIRST-HEX-CHARS* *HEX-CHARS* *LETTER-CHARS* *SLASHABLE-CHARS* SOME-SLASHABLE PRIN1-WITH-SLASHES1 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=9).GC finished] PRIN1-WITH-SLASHES SUSPICIOUSLY-FIRST-NUMERIC-CHARS NUMERIC-CHARS MAY-NEED-SLASHES1 NIL ALL-DOTS [GC for 2808 CONS pages..(T=10).GC finished] MAY-NEED-SLASHES-FN MAY-NEED-SLASHES NEEDS-SLASHES T-STACK-LENGTH1 T-STACK-LENGTH [GC for 2808 CONS pages..(T=9).GC finished] MAKE-LIST-AC MAKE-LIST EXTEND-T-STACK :EMPTY-ENCAPSULATE NIL NIL NIL NIL NIL NIL NIL MSWINDOWS-DRIVE1 MSWINDOWS-DRIVE [GC for 2808 CONS pages..(T=10).GC finished] SHRINK-T-STACK AREF-T-STACK ASET-T-STACK [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK [GC for 2808 CONS pages..(T=9).GC finished] ASET-32-BIT-INTEGER-STACK F-BIG-CLOCK-NEGATIVE-P F-DECREMENT-BIG-CLOCK BIG-CLOCK-NEGATIVE-P DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES USER-STOBJ-ALIST UPDATE-USER-STOBJ-ALIST [GC for 2818 CONS pages..(T=10).GC finished] POWER-EVAL READ-IDATE READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] GETENV$ SETENV$ RANDOM$ NIL NIL NIL SYS-CALL NIL SYS-CALL-STATUS :EMPTY-ENCAPSULATE NIL NIL SYS-CALL+ [GC for 2818 CONS pages..(T=9).GC finished] SYS-CALL* NIL NIL NIL NIL NIL NIL NIL NIL MAIN-TIMER PUT-ASSOC-EQ-EXEC [GC for 2818 CONS pages..(T=10).GC finished] PUT-ASSOC-EQL-EXEC PUT-ASSOC-EQUAL PUT-ASSOC-EQ PUT-ASSOC-EQL NIL NIL PUT-ASSOC NIL NIL NIL SET-TIMER [GC for 2818 CONS pages..(T=10).GC finished] GET-TIMER NIL PUSH-TIMER NIL NIL NIL NIL NIL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] POP-TIMER ADD-TIMERS NIL NIL NIL NIL NIL NIL NIL INCREMENT-TIMER [GC for 2828 CONS pages..(T=10).GC finished] PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER NIL SET-PRINT-BASE-RADIX KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 2828 CONS pages..(T=10).GC finished] PRIN1$ NIL CURRENT-PACKAGE NIL *INITIAL-UNTOUCHABLE-FNS* *INITIAL-UNTOUCHABLE-VARS* LD-SKIP-PROOFSP [GC for 2828 CONS pages..(T=10).GC finished] ASSIGN @ SUBST-FOR-NTH-ARG THE-MV THE2S INTERSECTION-EQ-EXEC [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] INTERSECTION-EQL-EXEC 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 [GC for 2828 CONS pages..(T=10).GC finished] DEFAULT-VERIFY-GUARDS-EAGERNESS SET-VERIFY-GUARDS-EAGERNESS DEFAULT-COMPILE-FNS SET-COMPILE-FNS SET-COMPILER-ENABLED SET-PORT-FILE-ENABLED [GC for 2838 CONS 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 2838 CONS pages..(T=10).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 2838 CONS pages..(T=10).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 [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] LET*-ABSTRACTIONP *INITIAL-BACKCHAIN-LIMIT* *INITIAL-DEFAULT-BACKCHAIN-LIMIT* SET-BACKCHAIN-LIMIT BACKCHAIN-LIMIT SET-DEFAULT-BACKCHAIN-LIMIT [GC for 2848 CONS pages..(T=9).GC finished] DEFAULT-BACKCHAIN-LIMIT STEP-LIMIT-FROM-TABLE SET-PROVER-STEP-LIMIT *DEFAULT-REWRITE-STACK-LIMIT* SET-REWRITE-STACK-LIMIT REWRITE-STACK-LIMIT [GC for 2858 CONS pages..(T=11).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 [GC for 2858 CONS pages..(T=10).GC finished] MATCH-FREE-OVERRIDE ADD-MATCH-FREE-OVERRIDE ADD-INCLUDE-BOOK-DIR DELETE-INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR!-TABLE RAW-INCLUDE-BOOK-DIR-P ADD-INCLUDE-BOOK-DIR! DELETE-INCLUDE-BOOK-DIR! *NON-LINEAR-ROUNDS-VALUE* NON-LINEARP SET-NON-LINEARP SET-NON-LINEAR TAU-AUTO-MODEP SET-TAU-AUTO-MODE [GC for 2868 CONS pages..(T=11).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 [GC for 2868 CONS pages..(T=10).GC finished] MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE 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 [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] NTH-ALIASES ADD-NTH-ALIAS REMOVE-NTH-ALIAS DEFAULT-HINTS SET-DEFAULT-HINTS SET-DEFAULT-HINTS! ADD-DEFAULT-HINTS ADD-DEFAULT-HINTS! REMOVE-DEFAULT-HINTS REMOVE-DEFAULT-HINTS! SET-OVERRIDE-HINTS-MACRO ADD-OVERRIDE-HINTS! ADD-OVERRIDE-HINTS 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 [GC for 2868 CONS pages..(T=10).GC finished] 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 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 [GC for 2878 CONS pages..(T=10).GC finished] COMPLETION-OF-CHAR-CODE NIL COMPLETION-OF-CODE-CHAR NIL COMPLETION-OF-COMPLEX NIL NIL NIL NIL NIL NIL 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 [GC for 2888 CONS pages..(T=9).GC finished] CATCH-TIME-LIMIT5 *INTERRUPT-STRING* TIME-LIMIT5-REACHED-P CATCH-STEP-LIMIT *GUARD-CHECKING-VALUES* CHK-WITH-GUARD-CHECKING-ARG WITH-GUARD-CHECKING1 WITH-GUARD-CHECKING-GATE WITH-GUARD-CHECKING WITH-GUARD-CHECKING-ERROR-TRIPLE WITH-GUARD-CHECKING-EVENT ABORT! A! P! NIL BIND-ACL2-TIME-LIMIT OUR-WITH-TERMINAL-INPUT [GC for 474 SYMBOL pages..(T=9).GC finished] WORMHOLE1 [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=10).GC finished] WORMHOLE-P DUPLICATES SET-EQUALP-EQUAL |Access METAFUNCTION-CONTEXT record field UNIFY-SUBST| |Access REWRITE-CONSTANT record field CURRENT-CLAUSE| RECORD-ERROR [GC for 2898 CONS pages..(T=10).GC finished] RECORD-ACCESSOR-FUNCTION-NAME ACCESS MFC-CLAUSE MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP [GC for 2908 CONS pages..(T=10).GC finished] MFC-TYPE-ALIST MFC-ANCESTORS MFC-UNIFY-SUBST MFC-WORLD NIL NIL [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] BAD-ATOM NIL NIL BOOLEANP-BAD-ATOM<= BAD-ATOM<=-ANTISYMMETRIC BAD-ATOM<=-TRANSITIVE BAD-ATOM<=-TOTAL ALPHORDER LEXORDER NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL NIL [GC for 2908 CONS pages..(T=10).GC finished] MERGE-LEXORDER NIL NIL NIL MERGE-SORT-LEXORDER IF* RESIZE-LIST-EXEC RESIZE-LIST NIL NIL E/D-FN E/D [GC for 2918 CONS pages..(T=10).GC finished] 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. Summary Form: ( DEFUN ALISTP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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. [GC for 2918 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN NTH ...) Rules: ((:DEFINITION ENDP) (:DEFINITION NOT) (:DEFINITION ZP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.27 seconds (prove: 0.00, print: 0.00, other: 0.27) 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. Summary Form: ( DEFUN CHAR ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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))). [GC for 2918 CONS pages..(T=10).GC finished] By the simple :definitions ENDP, EQ, EQL and EQLABLEP we reduce the conjecture to the following seven conjectures. Subgoal 7 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 6 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 5 (IMPLIES (AND (ALISTP ALIST) (EQLABLEP X) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 4 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST))))) (CHARACTERP (CAR (CAR ALIST)))). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal 3 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal 2 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (EQLABLE-ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal 1 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (ACL2-NUMBERP X)) (NOT (SYMBOLP X)) (NOT (CHARACTERP X)) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Q.E.D. That completes the proof of the guard theorem for ASSOC-EQL-EXEC. ASSOC-EQL-EXEC is compliant with Common Lisp. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ASSOC-EQL-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION EQL) (:DEFINITION EQLABLE-ALISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 0.36 seconds (prove: 0.10, print: 0.00, other: 0.26) 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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) ASSOC-EQL-EXEC$GUARD-CHECK ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQUAL) The admission of ASSOC-EQUAL is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT ALIST). We could deduce no constraints on the type of ASSOC-EQUAL. Computing the guard conjecture for ASSOC-EQUAL.... The non-trivial part of the guard conjecture for ASSOC-EQUAL is Goal (AND (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST))) (EQ ALIST NIL)) (IMPLIES (AND (ALISTP ALIST) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (ALISTP ALIST) (NOT (ENDP ALIST)) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST)))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following three conjectures. Subgoal 3 (IMPLIES (AND (ALISTP ALIST) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 2 (IMPLIES (AND (ALISTP ALIST) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 1 (IMPLIES (AND (ALISTP ALIST) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definition ALISTP. Q.E.D. That completes the proof of the guard theorem for ASSOC-EQUAL. ASSOC-EQUAL is compliant with Common Lisp. Summary Form: ( DEFUN ASSOC-EQUAL ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT)) Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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. [GC for 2928 CONS pages..(T=10).GC finished] 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)). Name the formula above *3. Subgoal 2.1 (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). [GC for 2928 CONS pages..(T=10).GC finished] 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 2928 CONS pages..(T=10).GC finished] But simplification reduces this to T, using the :definitions ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning. Subgoal *5/3 (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). By the simple :definition ENDP we reduce the conjecture to Subgoal *5/3' (IMPLIES (AND (CONSP ALIST) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *5/2 (IMPLIES (AND (NOT (ENDP ALIST)) (EQUAL TREE (CAR (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). By the simple :definition ENDP we reduce the conjecture to Subgoal *5/2' (IMPLIES (AND (CONSP ALIST) (EQUAL TREE (CAR (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). But simplification reduces this to T, using the :definitions ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning. Subgoal *5/1 (IMPLIES (AND (ENDP ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). By the simple :definition ENDP we reduce the conjecture to Subgoal *5/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ASSOC-EQUAL TREE ALIST)) (CONSP (ASSOC-EQUAL TREE ALIST))). But simplification reduces this to T, using the :definitions ASSOC-EQUAL and EQLABLE-ALISTP, the :executable-counterpart of CONSP and primitive type reasoning. That completes the proof of *5. We therefore turn our attention to *4, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). Perhaps we can prove *4 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST). This suggestion was produced using the :induction rules ALISTP and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *4 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST))))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (ATOM ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit EQLABLE-ALISTP. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *4/5 (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *4/5' (IMPLIES (AND (CONSP ALIST) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal *4/4 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *4/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). [GC for 2938 CONS pages..(T=10).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *4/3 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *4/3' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions ALISTP, EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP. Subgoal *4/2 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *4/2' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *4/1 (IMPLIES (AND (ATOM ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *4/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (SYMBOLP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *4. We therefore turn our attention to *3, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). [GC for 2938 CONS pages..(T=10).GC finished] Perhaps we can prove *3 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST). This suggestion was produced using the :induction rules ALISTP and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *3 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST))))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (ATOM ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit EQLABLE-ALISTP. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *3/5 (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/5' (IMPLIES (AND (CONSP ALIST) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal *3/4 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *3/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *3/3 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/3' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions ALISTP, EQLABLE-ALISTP and EQLABLEP and the :type-prescription rule ALISTP. Subgoal *3/2 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/2' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. [GC for 2938 CONS pages..(T=9).GC finished] Subgoal *3/1 (IMPLIES (AND (ATOM ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *3/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (CHARACTERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *3. We therefore turn our attention to *2, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). Perhaps we can prove *2 by induction. Two induction schemes are suggested by this conjecture. Subsumption reduces that number to one. We will induct according to a scheme suggested by (EQLABLE-ALISTP ALIST). This suggestion was produced using the :induction rules ALISTP and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *2 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST))))) (:P ALIST TREE)) (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (ATOM ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit EQLABLE-ALISTP. When applied to the goal at hand the above induction scheme produces five nontautological subgoals. Subgoal *2/5 (IMPLIES (AND (NOT (ATOM ALIST)) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *2/5' (IMPLIES (AND (CONSP ALIST) (NOT (CONSP (CAR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP. Subgoal *2/4 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (NOT (EQLABLEP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definitions ATOM and EQLABLEP we reduce the conjecture to Subgoal *2/4' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (NOT (ACL2-NUMBERP (CAR (CAR ALIST)))) (NOT (SYMBOLP (CAR (CAR ALIST)))) (NOT (CHARACTERP (CAR (CAR ALIST)))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *2/3 (IMPLIES (AND (NOT (ATOM ALIST)) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *2/3' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (ALISTP (CDR ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). 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)). [GC for 2938 CONS pages..(T=10).GC finished] By the simple :definition ATOM we reduce the conjecture to Subgoal *2/2' (IMPLIES (AND (CONSP ALIST) (CONSP (CAR ALIST)) (EQLABLEP (CAR (CAR ALIST))) (NOT (EQLABLE-ALISTP (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definitions EQLABLE-ALISTP and EQLABLEP. Subgoal *2/1 (IMPLIES (AND (ATOM ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). By the simple :definition ATOM we reduce the conjecture to Subgoal *2/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE)) (ACL2-NUMBERP TREE)) (ALISTP ALIST)). But simplification reduces this to T, using the :definition EQLABLE-ALISTP, the :executable-counterparts of ALISTP and CONSP and primitive type reasoning. That completes the proof of *2. We therefore turn our attention to *1, which is (IMPLIES (AND (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (ASSOC-EQL-EXEC TREE ALIST). This suggestion was produced using the :induction rules ASSOC-EQL-EXEC, ASSOC-EQUAL and EQLABLE-ALISTP. If we let (:P ALIST TREE) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQL TREE (CAR (CAR ALIST)))) (:P (CDR ALIST) TREE)) (:P ALIST TREE)) (IMPLIES (AND (NOT (ENDP ALIST)) (EQL TREE (CAR (CAR ALIST)))) (:P ALIST TREE)) (IMPLIES (ENDP ALIST) (:P ALIST TREE))). This induction is justified by the same argument used to admit ASSOC-EQL-EXEC. When applied to the goal at hand the above induction scheme produces four nontautological subgoals. Subgoal *1/4 (IMPLIES (AND (NOT (ENDP ALIST)) (NOT (EQL TREE (CAR (CAR ALIST)))) (EQUAL (ASSOC-EQUAL TREE (CDR ALIST)) (ASSOC-EQL-EXEC TREE (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). By the simple :definitions ENDP and EQL we reduce the conjecture to Subgoal *1/4' (IMPLIES (AND (CONSP ALIST) (NOT (EQUAL TREE (CAR (CAR ALIST)))) (EQUAL (ASSOC-EQUAL TREE (CDR ALIST)) (ASSOC-EQL-EXEC TREE (CDR ALIST))) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). 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))). [GC for 2938 CONS pages..(T=10).GC finished] But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC, ASSOC-EQUAL, EQLABLE-ALISTP and EQLABLEP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ENDP ALIST) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). By the simple :definition ENDP we reduce the conjecture to Subgoal *1/1' (IMPLIES (AND (NOT (CONSP ALIST)) (EQLABLE-ALISTP ALIST) (NOT (CONSP TREE))) (EQUAL (ASSOC-EQUAL TREE ALIST) (ASSOC-EQL-EXEC TREE ALIST))). But simplification reduces this to T, using the :definitions ASSOC-EQL-EXEC, ASSOC-EQUAL and EQLABLE-ALISTP, the :executable-counterparts of CONSP and EQUAL and primitive type reasoning. That completes the proof of *1. Q.E.D. That completes the proof of the guard theorem for SUBLIS. SUBLIS is compliant with Common Lisp. Summary Form: ( DEFUN SUBLIS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ASSOC-EQL-EXEC) (:DEFINITION ASSOC-EQUAL) (:DEFINITION ATOM) (:DEFINITION ENDP) (:DEFINITION EQL) (:DEFINITION EQLABLE-ALISTP) (:DEFINITION EQLABLEP) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART ALISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION ALISTP) (:INDUCTION ASSOC-EQL-EXEC) (:INDUCTION ASSOC-EQUAL) (:INDUCTION EQLABLE-ALISTP) (:TYPE-PRESCRIPTION ALISTP) (:TYPE-PRESCRIPTION EQLABLE-ALISTP)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION EQLABLEP) (:DEFINITION NOT)) Time: 1.02 seconds (prove: 0.53, print: 0.20, other: 0.29) 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.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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))). [GC for 2938 CONS pages..(T=10).GC finished] This simplifies, using the :definitions ACL2-COUNT (if-intro), IFIX (if-intro), INTEGER-ABS (if-intro), NFIX (if-intro), O-FINP and O< (if-intro), primitive type reasoning and the :rewrite rule DISTRIBUTIVITY-OF-MINUS-OVER-+, to the following two conjectures. Subgoal 2 (IMPLIES (AND (INTEGERP J) (<= 0 J) (NOT (EQUAL J 0)) (INTEGERP I) (<= J I) (< (+ I (- J)) 0)) (< (+ (- I) (- (- J))) I)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (INTEGERP J) (<= 0 J) (NOT (EQUAL J 0)) (INTEGERP I) (<= J I) (<= 0 (+ I (- J)))) (< (+ I (- J)) I)). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Q.E.D. That completes the proof of the measure theorem for NONNEGATIVE-INTEGER-QUOTIENT. Thus, we admit this function under the principle of definition. We observe that the type of NONNEGATIVE-INTEGER-QUOTIENT is described by the theorem (AND (INTEGERP (NONNEGATIVE-INTEGER-QUOTIENT I J)) (<= 0 (NONNEGATIVE-INTEGER-QUOTIENT I J))). We used primitive type reasoning and the :type-prescription rule NFIX. Computing the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT.... The non-trivial part of the guard conjecture for NONNEGATIVE-INTEGER-QUOTIENT, given primitive type reasoning and the :type-prescription rules IFIX, NFIX and NONNEGATIVE-INTEGER-QUOTIENT, is Goal (IMPLIES (AND (< 0 J) (INTEGERP J) (<= 0 I) (INTEGERP I) (NOT (OR (= (NFIX J) 0) (< (IFIX I) J)))) (<= 0 (+ I (- J)))). By the simple :definition = we reduce the conjecture to Goal' (IMPLIES (AND (< 0 J) (INTEGERP J) (<= 0 I) (INTEGERP I) (NOT (OR (EQUAL (NFIX J) 0) (< (IFIX I) J)))) (<= 0 (+ I (- J)))). 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.30 seconds (prove: 0.10, print: 0.00, other: 0.20) Prover steps counted: 507 NONNEGATIVE-INTEGER-QUOTIENT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FLOOR) [GC for 2938 CONS pages..Since FLOOR is non-recursive, its admission is trivial.(T=10).GC finished] We observe that the type of FLOOR is described by the theorem (INTEGERP (FLOOR I J)). We used primitive type reasoning and the :type-prescription rule NONNEGATIVE-INTEGER-QUOTIENT. Computing the guard conjecture for FLOOR.... The guard conjecture for FLOOR is trivial to prove, given the :executable- counterpart of EQLABLEP, primitive type reasoning and the :type-prescription rule NONNEGATIVE-INTEGER-QUOTIENT. FLOOR is compliant with Common Lisp. Summary Form: ( DEFUN FLOOR ...) Rules: ((:EXECUTABLE-COUNTERPART EQLABLEP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:TYPE-PRESCRIPTION NONNEGATIVE-INTEGER-QUOTIENT)) Time: 0.31 seconds (prove: 0.00, print: 0.00, other: 0.31) 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND) The admission of BINARY-APPEND is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of BINARY-APPEND is described by the theorem (OR (CONSP (APPEND X Y)) (EQUAL (APPEND X Y) Y)). We used primitive type reasoning. Computing the guard conjecture for BINARY-APPEND.... The guard conjecture for BINARY-APPEND is trivial to prove, given primitive type reasoning. BINARY-APPEND is compliant with Common Lisp. Summary Form: ( DEFUN BINARY-APPEND ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) BINARY-APPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND) Since STRING-APPEND is non-recursive, its admission is trivial. We observe that the type of STRING-APPEND is described by the theorem (STRINGP (STRING-APPEND STR1 STR2)). We used primitive type reasoning. Computing the guard conjecture for STRING-APPEND.... The non-trivial part of the guard conjecture for STRING-APPEND is Goal (IMPLIES (AND (STRINGP STR2) (STRINGP STR1)) (EQUAL (COERCE (APPEND (COERCE STR1 'LIST) (COERCE STR2 'LIST)) 'STRING) (STRING-APPEND STR1 STR2))). But we reduce the conjecture to T, by the simple :definition STRING-APPEND. Q.E.D. That completes the proof of the guard theorem for STRING-APPEND. STRING-APPEND is compliant with Common Lisp. [GC for 2938 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN STRING-APPEND ...) Rules: ((:DEFINITION STRING-APPEND) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.26 seconds (prove: 0.00, print: 0.00, other: 0.26) Prover steps counted: 32 STRING-APPEND ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP) The admission of PLIST-WORLDP is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT ALIST). We observe that the type of PLIST-WORLDP is described by the theorem (OR (EQUAL (PLIST-WORLDP ALIST) T) (EQUAL (PLIST-WORLDP ALIST) NIL)). We used primitive type reasoning. Computing the guard conjecture for PLIST-WORLDP.... The guard conjecture for PLIST-WORLDP is trivial to prove. PLIST-WORLDP is compliant with Common Lisp. Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) 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)). [GC for 2938 CONS pages..(T=10).GC finished] But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 4 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (CONSP (CAR WORLD-ALIST)))) (EQUAL (CAR WORLD-ALIST) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 3 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (NOT (AND (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST)))))) (PLIST-WORLDP (CDR WORLD-ALIST))). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 2 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (EQUAL KEY (CADR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Subgoal 1 (IMPLIES (AND (PLIST-WORLDP WORLD-ALIST) (SYMBOLP KEY) (SYMBOLP SYMB) (CONSP WORLD-ALIST) (EQUAL SYMB (CAR (CAR WORLD-ALIST))) (NOT (CONSP (CDR (CAR WORLD-ALIST))))) (EQUAL (CDR (CAR WORLD-ALIST)) NIL)). But simplification reduces this to T, using the :definition PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for FGETPROP. FGETPROP is compliant with Common Lisp. Summary Form: ( DEFUN FGETPROP ...) Rules: ((:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION PLIST-WORLDP)) Time: 0.30 seconds (prove: 0.10, print: 0.01, other: 0.19) 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 2948 CONS pages..(T=10).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.31 seconds (prove: 0.10, print: 0.02, other: 0.19) Prover steps counted: 804 SGETPROP ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP) [GC for 2948 CONS pages..Since FUNCTION-SYMBOLP is non-recursive, its admission is trivial.(T=9).GC finished] We observe that the type of FUNCTION-SYMBOLP is described by the theorem (OR (EQUAL (FUNCTION-SYMBOLP SYM WRLD) T) (EQUAL (FUNCTION-SYMBOLP SYM WRLD) NIL)). Computing the guard conjecture for FUNCTION-SYMBOLP.... The guard conjecture for FUNCTION-SYMBOLP is trivial to prove. FUNCTION-SYMBOLP is compliant with Common Lisp. Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.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. [GC for 14592 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN STRIP-CARS ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) Prover steps counted: 174 STRIP-CARS ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK) Since ASSOC-EQ-EXEC$GUARD-CHECK is non-recursive, its admission is trivial. We observe that the type of ASSOC-EQ-EXEC$GUARD-CHECK is described by the theorem (EQUAL (ASSOC-EQ-EXEC$GUARD-CHECK X ALIST) T). Computing the guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK.... The guard conjecture for ASSOC-EQ-EXEC$GUARD-CHECK is trivial to prove. ASSOC-EQ-EXEC$GUARD-CHECK is compliant with Common Lisp. Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) ASSOC-EQ-EXEC$GUARD-CHECK ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC) The admission of ASSOC-EQ-EXEC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT ALIST). We could deduce no constraints on the type of ASSOC-EQ-EXEC. Computing the guard conjecture for ASSOC-EQ-EXEC.... The non-trivial part of the guard conjecture for ASSOC-EQ-EXEC is Goal (AND (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (NOT (CONSP ALIST))) (EQ ALIST NIL)) (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (NOT (ENDP ALIST)) (NOT (EQ X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))) (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (ENDP ALIST))) (SYMBOLP (CAR (CAR ALIST)))) (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (ENDP ALIST)) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)) (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (ENDP ALIST)) (NOT (EQ X (CAR (CAR ALIST))))) (SYMBOL-ALISTP (CDR ALIST))) (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (CONSP ALIST))) (EQ ALIST NIL))). By the simple :definitions ENDP and EQ we reduce the conjecture to the following seven conjectures. Subgoal 7 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 6 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (ALISTP (CDR ALIST))). [GC for 2948 CONS pages..(T=11).GC finished] But simplification reduces this to T, using the :definition ALISTP. Subgoal 5 (IMPLIES (AND (ALISTP ALIST) (SYMBOLP X) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition ALISTP. Subgoal 4 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST)) (SYMBOLP (CAR (CAR ALIST)))). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 3 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST) (NOT (CONSP (CAR ALIST)))) (EQUAL (CAR ALIST) NIL)). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 2 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (CONSP ALIST) (NOT (EQUAL X (CAR (CAR ALIST))))) (SYMBOL-ALISTP (CDR ALIST))). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Subgoal 1 (IMPLIES (AND (SYMBOL-ALISTP ALIST) (NOT (SYMBOLP X)) (NOT (CONSP ALIST))) (EQUAL ALIST NIL)). But simplification reduces this to T, using the :definition SYMBOL-ALISTP. Q.E.D. That completes the proof of the guard theorem for ASSOC-EQ-EXEC. ASSOC-EQ-EXEC is compliant with Common Lisp. [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION NOT) (:DEFINITION SYMBOL-ALISTP)) Time: 0.42 seconds (prove: 0.11, print: 0.00, other: 0.31) 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 2948 CONS pages..(T=10).GC finished] [GC for 2948 CONS pages..(T=10).GC finished] [GC for 2958 CONS pages..(T=11).GC finished] [GC for 2958 CONS pages..(T=10).GC finished] [GC for 2968 CONS pages..(T=10).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export TABLE-ALIST, ASSOC-EQ-EXEC, ASSOC-EQ-EXEC$GUARD-CHECK, STRIP-CARS, FUNCTION-SYMBOLP, SGETPROP, FGETPROP, PLIST-WORLDP, STRING-APPEND, BINARY-APPEND, FLOOR, NONNEGATIVE-INTEGER-QUOTIENT, IFIX, NFIX, SUBLIS, ASSOC-EQUAL, ASSOC-EQL-EXEC$GUARD-CHECK, ASSOC-EQL-EXEC, EQLABLE-ALISTP, CHAR, NTH, SYMBOL-ALISTP and ALISTP. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 8.92 seconds (prove: 1.04, print: 0.23, other: 7.65) Prover steps counted: 9199 T Summary Form: ( DEFUN MOD-EXPT ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) CLAUSES-RESULT Summary Form: ( TABLE EVISC-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) EVISC-TABLE Summary Form: ( DEFCONST *TOP-HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *TOP-HINT-KEYWORDS* Summary Form: ( DEFCONST *HINT-KEYWORDS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *HINT-KEYWORDS* Summary Form: ( TABLE CUSTOM-KEYWORDS-TABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CUSTOM-KEYWORDS-TABLE Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ADD-CUSTOM-KEYWORD-HINT Summary Form: ( DEFMACRO REMOVE-CUSTOM-KEYWORD-HINT ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) REMOVE-CUSTOM-KEYWORD-HINT [GC for 2978 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN SPLICE-KEYWORD-ALIST ...) Rules: NIL Time: 0.27 seconds (prove: 0.00, print: 0.00, other: 0.27) SPLICE-KEYWORD-ALIST Summary Form: ( DEFMACRO SHOW-CUSTOM-KEYWORD-HINT-EXPANSION ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SHOW-CUSTOM-KEYWORD-HINT-EXPANSION Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: NIL Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) SEARCH-FN-GUARD Summary Form: ( DEFUN SEARCH-FROM-START ...) Rules: NIL Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) SEARCH-FROM-START [GC for 2978 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN SEARCH-FROM-END ...) Rules: NIL Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30) SEARCH-FROM-END To verify that the 18 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1 (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STRINGP-SUBSEQ (IMPLIES (STRINGP STR) (STRINGP (SUBSEQ STR START END))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-NTHCDR (IMPLIES (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP (NTHCDR N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-REVAPPEND (IMPLIES (AND (STANDARD-CHAR-LISTP X) (STANDARD-CHAR-LISTP AC)) (STANDARD-CHAR-LISTP (REVAPPEND X AC))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM STANDARD-CHAR-LISTP-OF-TAKE (IMPLIES (AND (STANDARD-CHAR-LISTP X) (<= N (LEN X))) (STANDARD-CHAR-LISTP (TAKE N X))) :HINTS (("Goal" :IN-THEORY (ENABLE STANDARD-CHAR-LISTP))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-OF-TAKE (IMPLIES (AND (CHARACTER-LISTP X) (<= N (LEN X))) (CHARACTER-LISTP (TAKE N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM NTHCDR-NIL (EQUAL (NTHCDR N NIL) NIL))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-NTHCDR (EQUAL (LEN (NTHCDR N X)) (NFIX (- (LEN X) (NFIX N)))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LENGTH SEQ)) (STANDARD-CHAR-LISTP (COERCE SEQ 'LIST))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ START END) 'LIST))))) [GC for 2978 CONS pages..(T=11).GC finished] ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-OF-TAKE (EQUAL (LEN (TAKE N LST)) (NFIX N)))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ (IMPLIES (AND (TRUE-LISTP SEQ) (NATP START) (NATP END) (<= START END)) (EQUAL (LEN (SUBSEQ SEQ START END)) (- END START))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(LOCAL (DEFTHM LEN-SUBSEQ-STRING (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (- END START))) :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ))))) 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))))))) [GC for 2978 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN SEARCH-FN ...) Rules: NIL Time: 0.33 seconds (prove: 0.00, print: 0.00, other: 0.33) 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.63 seconds (prove: 0.00, print: 0.00, other: 0.63) T Summary Form: ( DEFMACRO SEARCH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SEARCH ACL2 Observation in TOP-LEVEL: DEFTHM events are skipped when the default-defun-mode is :PROGRAM. NIL Summary Form: ( DEFUN COUNT-STRINGP ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) COUNT-STRINGP Summary Form: ( DEFUN COUNT-LISTP ...) Rules: NIL Time: 0.18 seconds (prove: 0.00, print: 0.00, other: 0.18) COUNT-LISTP To verify that the two encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 p!>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) ACL2 Observation in TOP-LEVEL: LOCAL events are skipped when the default- defun-mode is :PROGRAM. NIL ACL2 p!>>(DEFUN COUNT-FN (ITEM SEQUENCE START END) (DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE) T (STRINGP SEQUENCE)) (NATP START) (OR (NULL END) (AND (NATP END) (<= END (LENGTH SEQUENCE))))))) (LET ((END (OR END (LENGTH SEQUENCE)))) (COND ((<= END START) 0) ((STRINGP SEQUENCE) (COUNT-STRINGP ITEM SEQUENCE START END)) (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE) (- END START)))))) [GC for 2988 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN COUNT-FN ...) Rules: NIL Time: 0.30 seconds (prove: 0.00, print: 0.00, other: 0.30) COUNT-FN End of Encapsulated Events. Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export COUNT-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 0.49 seconds (prove: 0.00, print: 0.00, other: 0.49) 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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) MAKE-SHARP-ATSIGN Summary Form: ( DEFUN SHARP-ATSIGN-ALIST ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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 [GC for 2988 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN GC$-FN ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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.07 seconds (prove: 0.00, print: 0.00, other: 0.07) GC-VERBOSE-FN Summary Form: ( DEFMACRO GC-VERBOSE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) GC-VERBOSE Summary Form: ( DEFUN GET-WORMHOLE-STATUS ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) GET-WORMHOLE-STATUS Summary Form: ( DEFUN FILE-WRITE-DATE$ ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) FILE-WRITE-DATE$ Summary Form: ( DEFUN DELETE-FILE$ ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) DELETE-FILE$ Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: NIL Time: 0.09 seconds (prove: 0.00, print: 0.00, other: 0.09) DEBUGGER-ENABLE Summary Form: ( DEFUN BREAK$ ...) Rules: NIL Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) BREAK$ [GC for 391 SFUN pages..(T=10).GC finished] Summary Form: ( DEFUN PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.19 seconds (prove: 0.00, print: 0.00, other: 0.19) 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.15 seconds (prove: 0.00, print: 0.00, other: 0.15) DEBUGGER-ENABLEDP Summary Form: ( DEFUN MAYBE-PRINT-CALL-HISTORY ...) Rules: NIL Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) MAYBE-PRINT-CALL-HISTORY Summary Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WITH-RECKLESS-READTABLE Summary Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SET-DEBUGGER-ENABLE Summary Form: ( DEFUN SET-DEBUGGER-ENABLE-FN ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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 14848 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] Summary Form: ( DEFUN ADD-@PAR-SUFFIX ...) Rules: NIL Time: 0.22 seconds (prove: 0.00, print: 0.00, other: 0.22) ADD-@PAR-SUFFIX Summary Form: ( DEFUN GENERATE-@PAR-MAPPINGS ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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)) [GC for 2988 CONS pages..(T=11).GC finished] Summary Form: ( DEFMACRO MV@PAR ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) MV@PAR ACL2 p!>>(DEFMACRO MV-LET@PAR (&REST RST) (CONS 'MV-LET RST)) Summary Form: ( DEFMACRO MV-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MV-LET@PAR ACL2 p!>>(DEFMACRO PARALLEL-ONLY@PAR (&REST RST) (CONS 'PARALLEL-ONLY RST)) Summary Form: ( DEFMACRO PARALLEL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PARALLEL-ONLY@PAR ACL2 p!>>(DEFMACRO PPROGN@PAR (&REST RST) (CONS 'PPROGN RST)) Summary Form: ( DEFMACRO PPROGN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PPROGN@PAR ACL2 p!>>(DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR (&REST RST) (CONS 'SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM RST)) Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM@PAR ACL2 p!>>(DEFMACRO SERIAL-ONLY@PAR (&REST RST) (CONS 'SERIAL-ONLY RST)) Summary Form: ( DEFMACRO SERIAL-ONLY@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-ONLY@PAR ACL2 p!>>(DEFMACRO SL-LET@PAR (&REST RST) (CONS 'SL-LET RST)) Summary Form: ( DEFMACRO SL-LET@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SL-LET@PAR ACL2 p!>>(DEFMACRO STATE-MAC@PAR (&REST RST) (CONS 'STATE-MAC RST)) Summary Form: ( DEFMACRO STATE-MAC@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) STATE-MAC@PAR ACL2 p!>>(DEFMACRO VALUE@PAR (&REST RST) (CONS 'VALUE RST)) Summary Form: ( DEFMACRO VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) VALUE@PAR ACL2 p!>>(DEFMACRO WARNING$@PAR (&REST RST) (CONS 'WARNING$ RST)) Summary Form: ( DEFMACRO WARNING$@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WARNING$@PAR ACL2 p!>>(DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'ADD-CUSTOM-KEYWORD-HINT RST)) Summary Form: ( DEFMACRO ADD-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ADD-CUSTOM-KEYWORD-HINT@PAR ACL2 p!>>(DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR (&REST RST) (CONS 'EVAL-CLAUSE-PROCESSOR RST)) Summary Form: ( DEFMACRO EVAL-CLAUSE-PROCESSOR@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) 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)) [GC for 2998 CONS pages..(T=10).GC finished] Summary Form: ( DEFMACRO CHK-EQUAL-ARITIES@PAR ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) CHK-EQUAL-ARITIES@PAR ACL2 p!>>(DEFMACRO CHK-EQUIV-CLASSICALP@PAR (&REST RST) (CONS 'CHK-EQUIV-CLASSICALP RST)) Summary Form: ( DEFMACRO CHK-EQUIV-CLASSICALP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-EQUIV-CLASSICALP@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE RST)) Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-EXPR-VALUE@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR (&REST RST) (CONS 'CHK-THEORY-EXPR-VALUE1 RST)) Summary Form: ( DEFMACRO CHK-THEORY-EXPR-VALUE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-EXPR-VALUE1@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT RST)) Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-INVARIANT@PAR ACL2 p!>>(DEFMACRO CHK-THEORY-INVARIANT1@PAR (&REST RST) (CONS 'CHK-THEORY-INVARIANT1 RST)) Summary Form: ( DEFMACRO CHK-THEORY-INVARIANT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CHK-THEORY-INVARIANT1@PAR ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER RST)) Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) CUSTOM-KEYWORD-HINT-INTERPRETER@PAR ACL2 p!>>(DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR (&REST RST) (CONS 'CUSTOM-KEYWORD-HINT-INTERPRETER1 RST)) Summary Form: ( DEFMACRO CUSTOM-KEYWORD-HINT-INTERPRETER1@PAR ...) Rules: NIL 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)) [GC for 3008 CONS pages..(T=10).GC finished] Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.10 seconds (prove: 0.00, print: 0.00, other: 0.10) TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-DO-NOT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-DO-NOT-INDUCT-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) 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 [GC for 3008 CONS pages..(T=11).GC finished] Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION@PAR ACL2 p!>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-SUBSTITUTION-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-TERM-LST@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT@PAR ACL2 p!>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-USE-HINT1@PAR ACL2 p!>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRANSLATE-X-HINT-VALUE@PAR ACL2 p!>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ACL2 p!>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST) (CONS 'WATERFALL-MSG RST)) Summary Form: ( DEFMACRO WATERFALL-MSG@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) WATERFALL-MSG@PAR ACL2 p!>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE RST)) 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.46 seconds (prove: 0.00, print: 0.00, other: 0.46) WATERFALL1@PAR Summary Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...) Rules: NIL Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) REPLACE-DEFUN@PAR-WITH-DEFUN Summary Form: ( DEFMACRO MUTUAL-RECURSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) MUTUAL-RECURSION@PAR Summary Form: ( DEFMACRO DEFUN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) DEFUN@PAR Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM Summary Form: ( DEFMACRO SERIAL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) SERIAL-ONLY Summary Form: ( DEFMACRO PARALLEL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PARALLEL-ONLY Summary Form: ( DEFMACRO STATE-MAC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) STATE-MAC Summary Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) ERROR-IN-PARALLELISM-MODE Summary Form: ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *WATERFALL-PRINTING-VALUES* Summary Form: ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) *WATERFALL-PARALLELISM-VALUES* [GC for 3018 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN SYMBOL-CONSTANT-FN ...) Rules: NIL Time: 0.24 seconds (prove: 0.00, print: 0.00, other: 0.24) SYMBOL-CONSTANT-FN Summary Form: ( DEFUN STOBJS-IN ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) STOBJS-IN Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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.19 seconds (prove: 0.00, print: 0.00, other: 0.19) STOBJS-OUT [GC for 3028 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: NIL Time: 0.39 seconds (prove: 0.00, print: 0.00, other: 0.39) 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 3028 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.17 seconds (prove: 0.00, print: 0.00, other: 0.17) 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 [GC for 3038 CONS pages..measure (ACL2-COUNT LST).(T=11).GC finished] 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.26 seconds (prove: 0.00, print: 0.00, other: 0.26) 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)))). 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))))). [GC for 3038 CONS pages..(T=10).GC finished] 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)). 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)). [GC for 3048 CONS pages..(T=11).GC finished] 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))))). 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))). [GC for 3048 CONS pages..(T=10).GC finished] 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))). 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))). [GC for 3048 CONS pages..(T=11).GC finished] 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'' (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)))). [GC for 3048 CONS pages..(T=11).GC finished] 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 3048 CONS pages..(T=10).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 3048 CONS pages..(T=11).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. 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))). [GC for 3048 CONS pages..(T=11).GC finished] 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 3048 CONS pages..(T=10).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 3048 CONS pages..(T=10).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 3048 CONS pages..(T=10).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 3048 CONS pages..(T=10).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 3048 CONS pages..(T=10).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))). [GC for 3048 CONS pages..(T=11).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC, MEMBER-EQUAL and TRUE-LISTP and primitive type reasoning. Subgoal *5/1 (IMPLIES (AND (ENDP Y) (TRUE-LISTP Y) (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))). 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))). [GC for 3048 CONS pages..(T=11).GC finished] 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))). 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)). [GC for 3048 CONS pages..(T=10).GC finished] 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)). 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 3048 CONS pages..(T=10).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))). [GC for 3048 CONS pages..(T=11).GC finished] But simplification reduces this to T, using the :definitions EQLABLE-LISTP, EQLABLEP, MEMBER-EQL-EXEC and MEMBER-EQUAL and primitive type reasoning. Subgoal *1/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))). 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: 2.21 seconds (prove: 1.84, print: 0.16, other: 0.21) 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.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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)) [GC for 3048 CONS pages..(T=11).GC finished] Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) SUBSETP-EQUAL ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND) The admission of REVAPPEND is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of REVAPPEND is described by the theorem (OR (CONSP (REVAPPEND X Y)) (EQUAL (REVAPPEND X Y) Y)). We used primitive type reasoning. Computing the guard conjecture for REVAPPEND.... The guard conjecture for REVAPPEND is trivial to prove, given primitive type reasoning. REVAPPEND is compliant with Common Lisp. Summary Form: ( DEFUN REVAPPEND ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) 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.17 seconds (prove: 0.00, print: 0.01, other: 0.16) Prover steps counted: 63 FIRST-N-AC ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE) The admission of TAKE is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT N). We observe that the type of TAKE is described by the theorem (TRUE-LISTP (TAKE N L)). We used primitive type reasoning. [GC for 3048 CONS pages..(T=11).GC finished] Summary Form: ( DEFUN TAKE ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.42 seconds (prove: 0.00, print: 0.00, other: 0.42) TAKE End of Encapsulated Events. [GC for 3058 CONS pages..(T=11).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.96 seconds (prove: 1.84, print: 0.17, other: 2.95) 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* [GC for 3058 CONS pages..(T=10).GC finished] Summary Form: ( DEFUN READ-FILE-INTO-STRING1 ...) Rules: NIL Time: 0.29 seconds (prove: 0.00, print: 0.00, other: 0.29) READ-FILE-INTO-STRING1 Summary Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) READ-FILE-INTO-STRING2-LOGICAL Summary Form: ( DEFUN READ-FILE-INTO-STRING2 ...) Rules: NIL Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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.07 seconds (prove: 0.00, print: 0.00, other: 0.07) PRINT-CL-CACHE-FN Summary Form: ( DEFMACRO PRINT-CL-CACHE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) PRINT-CL-CACHE Summary Form: ( DEFUN HONS-REMOVE-ASSOC ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) HONS-REMOVE-ASSOC Summary Form: ( DEFUN COUNT-KEYS ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) COUNT-KEYS [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] Summary Form: ( DEFUN HONS-ENABLEDP ...) Rules: NIL Time: 0.23 seconds (prove: 0.00, print: 0.00, other: 0.23) 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 HONS-ACONS FAST-ALIST-FREE-ON-EXIT-RAW FAST-ALIST-FREE FAST-ALIST-FREE-ON-EXIT [GC for 391 SFUN pages..(T=11).GC finished] HONS-COPY HONS-COPY-PERSISTENT HONS HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH [GC for 484 SYMBOL pages..(T=11).GC finished] HONS-WASH! HONS-SUMMARY HONS-RESIZE HONS-RESIZE-FN HONS SET-SLOW-ALIST-ACTION HONS-ACONS! MAKE-FAST-ALIST FAST-ALIST-FORK FAST-ALIST-FORK! HONS-SHRINK-ALIST HONS-SHRINK-ALIST! MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE [GC for 391 SFUN pages..(T=11).GC finished] FAST-ALIST-CLEAN FAST-ALIST-CLEAN! FAST-ALIST-LEN FAST-ALIST-SUMMARY WITH-FAST-ALIST-RAW WITH-FAST-ALIST WITH-STOLEN-ALIST-RAW WITH-STOLEN-ALIST CONS-SUBTREES [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=11).GC finished] NUMBER-SUBTREES FLUSH-HONS-GET-HASH-TABLE-LINK NIL REMOVE-KEYWORD Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO DEFN (F A &REST R) (CONS 'DEFUN (CONS F #))) (DEFMACRO DEFND (F A &REST R) (CONS 'DEFUND (CONS F #))) (DEFN HONS-EQUAL (X Y) (DECLARE (XARGS :MODE :LOGIC)) (EQUAL X Y)) (DEFN HONS-ASSOC-EQUAL (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (COND (# NIL) (# #) (T #))) (DEFN HONS-GET (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (HONS-ASSOC-EQUAL KEY ALIST)) (DEFN HONS-ACONS (KEY VAL ALIST) (DECLARE (XARGS :MODE :LOGIC)) (CONS (CONS KEY VAL) ALIST)) ...). ACL2 loading "basis-a.lisp". "ACL2" EQUAL-X-CONSTANT [GC for 3058 CONS pages..(T=10).GC finished] MATCH-TESTS-AND-BINDINGS MATCH-CLAUSE MATCH-CLAUSE-LIST CASE-MATCH [GC for 3068 CONS pages..(T=10).GC finished] WORMHOLE-STATUSP WORMHOLE-ENTRY-CODE WORMHOLE-DATA SET-WORMHOLE-ENTRY-CODE SET-WORMHOLE-DATA MAKE-WORMHOLE-STATUS [GC for 391 SFUN pages..(T=9).GC finished] TREE-OCCUR-EQ WORMHOLE-EVAL WITH-WORMHOLE-LOCK [GC for 3078 CONS pages..(T=10).GC finished] WORMHOLE-EVAL-EARLY-NULL-EXIT-P WORMHOLE LAMBDA-KEYWORDP [GC for 3088 CONS pages..(T=11).GC finished] LEGAL-VARIABLE-OR-CONSTANT-NAMEP LEGAL-VARIABLEP ARGLISTP1 ARGLISTP FIND-FIRST-BAD-ARG [GC for 3098 CONS pages..(T=10).GC finished] PROCESS-DEFABBREV-DECLARES DEFABBREV1 DEFABBREV *EVISCERATION-MARK* *EVISCERATION-HASH-MARK* *EVISCERATION-ELLIPSIS-MARK* *EVISCERATION-WORLD-MARK* *EVISCERATION-STATE-MARK* *EVISCERATION-ERROR-TRIPLE-MARKS* *EVISCERATION-HIDING-MARK* *ANTI-EVISCERATION-MARK* EVISCERATEDP *SHARP-ATSIGN-AR* GET-SHARP-ATSIGN [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] UPDATE-IPRINT-ALIST-FAL [GC for 2049 RELOCATABLE-BLOCKS pages..(T=11).GC finished] (EVISCERATE1 EVISCERATE1-LST) [GC for 3098 CONS pages..(T=11).GC finished] (EVISCERATE1P EVISCERATE1P-LST) EVISCERATE EVISCERATE-SIMPLE ASET1-LST IPRINT-HARD-BOUND IPRINT-SOFT-BOUND [GC for 391 SFUN pages..(T=10).GC finished] IPRINT-LAST-INDEX* IPRINT-LAST-INDEX IPRINT-AR-ILLEGAL-INDEX IPRINT-ENABLEDP IPRINT-AR-AREF1 [GC for 391 SFUN pages..(T=10).GC finished] COLLECT-POSP-INDICES-TO-HEADER IPRINT-FAL-NAME IPRINT-EAGER-P INIT-IPRINT-FAL ROLLOVER-IPRINT-AR [GC for 3108 CONS pages..(T=10).GC finished] UPDATE-IPRINT-FAL-REC UPDATE-IPRINT-FAL UPDATE-IPRINT-AR-FAL [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] EVISCERATE-TOP MV-LETC ER-HARD-VAL ER-HARD?-VAL? THE-FIXNUM! THE-HALF-FIXNUM! THE-UNSIGNED-BYTE! THE-STRING! XXXJOIN-FIXNUM +F -F |1-F| |1+F| CHARF *F PPR-FLAT-RIGHT-MARGIN SET-PPR-FLAT-RIGHT-MARGIN [GC for 3118 CONS pages..(T=10).GC finished] KEYWORD-PARAM-VALUEP CONS-PPR1 FLSZ-INTEGER [GC for 3128 CONS pages..(T=11).GC finished] [GC for 3138 CONS pages..(T=11).GC finished] FLSZ-ATOM *NEWLINE-STRING* [GC for 3148 CONS pages..(T=11).GC finished] FLSZ1 FLSZ MAX-WIDTH [GC for 3148 CONS pages..(T=12).GC finished] (PPR1 PPR1-LST) NEWLINE FMT-HARD-RIGHT-MARGIN [GC for 3148 CONS pages..(T=12).GC finished] FMT-SOFT-RIGHT-MARGIN SET-FMT-HARD-RIGHT-MARGIN SET-FMT-SOFT-RIGHT-MARGIN WRITE-FOR-READ [GC for 391 SFUN pages..(T=12).GC finished] SPACES1 MAKE-SPACES-ARRAY-REC MAKE-SPACES-ARRAY *ACL2-BUILT-IN-SPACES-ARRAY* SPACES [GC for 3148 CONS pages..(T=10).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] (FLPR1 FLPR11) FLPR PPR2-FLAT [GC for 3148 CONS pages..(T=10).GC finished] (PPR2-COLUMN PPR2) *FMT-PPR-INDENTATION* PPR *ILLEGAL-FMT-KEYS* [GC for 3158 CONS pages..(T=11).GC finished] ILLEGAL-FMT-STRING ILLEGAL-FMT-MSG SCAN-PAST-WHITESPACE ZERO-ONE-OR-MORE [GC for 3158 CONS pages..(T=11).GC finished] FIND-ALTERNATIVE-SKIP [GC for 3158 CONS pages..(T=11).GC finished] FIND-ALTERNATIVE-START1 [GC for 3158 CONS pages..(T=11).GC finished] FMT-CHAR [GC for 3158 CONS pages..(T=11).GC finished] FIND-ALTERNATIVE-START [GC for 3168 CONS pages..(T=11).GC finished] FIND-ALTERNATIVE-STOP PUNCTP [GC for 3178 CONS pages..(T=11).GC finished] FMT-TILDE-S1 FMT-TILDE-CAP-S1 [GC for 3178 CONS pages..(T=13).GC finished] FMT-VAR SPLAT-ATOM SPLAT-ATOM! SPLAT-STRING [GC for 3178 CONS pages..(T=11).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] (SPLAT SPLAT1) NUMBER-OF-DIGITS [GC for 391 SFUN pages..(T=11).GC finished] LEFT-PAD-WITH-BLANKS MAYBE-NEWLINE EVISC-TUPLE STANDARD-EVISC-TUPLEP WORLD-EVISCERATION-ALIST ABBREV-EVISC-TUPLE GAG-MODE [GC for 391 SFUN pages..(T=10).GC finished] TERM-EVISC-TUPLE GAG-MODE-EVISC-TUPLE LD-EVISC-TUPLE FMT-PPR [GC for 3178 CONS pages..(T=11).GC finished] SCAN-PAST-EMPTY-FMT-DIRECTIVES [GC for 3188 CONS pages..(T=11).GC finished] [GC for 3198 CONS pages..(T=11).GC finished] [GC for 3208 CONS pages..(T=11).GC finished] [GC for 3218 CONS pages..(T=11).GC finished] [GC for 3228 CONS pages..(T=11).GC finished] [GC for 3238 CONS pages..(T=10).GC finished] [GC for 3238 CONS pages..(T=11).GC finished] [GC for 3248 CONS pages..(T=11).GC finished] [GC for 3258 CONS pages..(T=11).GC finished] [GC for 3268 CONS pages..(T=11).GC finished] [GC for 3278 CONS pages..(T=11).GC finished] [GC for 3288 CONS pages..(T=11).GC finished] [GC for 3298 CONS pages..(T=11).GC finished] [GC for 3308 CONS pages..(T=11).GC finished] [GC for 3318 CONS pages..(T=11).GC finished] [GC for 3328 CONS pages..(T=12).GC finished] [GC for 3338 CONS pages..(T=12).GC finished] [GC for 14848 CONTIGUOUS-BLOCKS pages..(T=12).GC finished] [GC for 391 SFUN pages..(T=12).GC finished] (FMT0* FMT0&V SPELL-NUMBER FMT-TILDE-S FMT-TILDE-CAP-S FMT0) TILDE-*-&V-STRINGS [GC for 3348 CONS pages..(T=11).GC finished] FMT1 FMT FMS FMT1! FMT! FMS! FMX FMX-CW-MSG-1-BODY [GC for 401 SFUN pages..(T=12).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] FMX-CW-MSG-1 FMX-CW-MSG FMX-CW-FN-GUARD FMX-CW-FN FMX!-CW-FN FMX-CW [GC for 401 SFUN pages..(T=12).GC finished] FMX!-CW FMT-DOC-EXAMPLE1 FMT-DOC-EXAMPLE *SEE-DOC-SET-IPRINT* FMT-ABBREV1 FMT-ABBREV *FMT-CTX-SPACERS* FMT-CTX FMT-IN-CTX [GC for 401 SFUN pages..(T=12).GC finished] ER-SOFT-OFF-P1 ER-SOFT-OFF-P ERROR-FMS-CHANNEL ERROR-FMS [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] PUSH-WARNING-FRAME ABSORB-FRAME POP-WARNING-FRAME PUSH-WARNING RECORD-MAKER-FUNCTION-NAME RECORD-CHANGER-FUNCTION-NAME MAKE CHANGE MAKE-RECORD-CAR-CDRS1 [GC for 401 SFUN pages..(T=11).GC finished] MAKE-RECORD-CAR-CDRS MAKE-RECORD-ACCESSORS SYMBOL-NAME-TREE-OCCUR SOME-SYMBOL-NAME-TREE-OCCUR MAKE-RECORD-CHANGER-CONS MAKE-RECORD-CHANGER-LET-BINDINGS MAKE-RECORD-CHANGER-LET MAKE-RECORD-CHANGER [GC for 401 SFUN pages..(T=11).GC finished] MAKE-RECORD-MAKER-CONS MAKE-RECORD-MAKER-LET MAKE-RECORD-MAKER MAKE-RECORD-FIELD-LST RECORD-MAKER-RECOGNIZER-NAME MAKE-RECORD-RECOGNIZER-BODY MAKE-RECORD-RECOGNIZER [GC for 401 SFUN pages..(T=12).GC finished] RECORD-MACROS DEFREC RECORD-TYPE IO?-NIL-OUTPUT CHECK-EXACT-FREE-VARS FORMAL-BINDINGS WEAK-IO-RECORD-P PUSH-IO-RECORD SAVED-OUTPUT-TOKEN-P [GC for 401 SFUN pages..(T=12).GC finished] IO?-WORMHOLE-BINDINGS *TRACKED-WARNING-SUMMARIES* IO? IO?-PROVE OUTPUT-IGNORED-P ERROR1 ERROR1-SAFE *UNINHIBITED-WARNING-SUMMARIES* WARNING-OFF-P1 [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] WARNING-OFF-P WEAK-DO-EXPRESSIONP-P WEAK-STATE-VARS-P DEFAULT-STATE-VARS WARNING1-BODY WARNING1-FORM [GC for 401 SFUN pages..(T=12).GC finished] WARNING1 WARNING-DISABLED-P ER-SOFT ER-SOFT@PAR OBSERVATION1-BODY OBSERVATION1 OBSERVATION1-CW OBSERVATION OBSERVATION-CW WEAK-DEFSTOBJ-FIELD-TEMPLATE-P [GC for 494 SYMBOL pages..(T=12).GC finished] WEAK-DEFSTOBJ-TEMPLATE-P PACKN1 PACKN-POS FIND-FIRST-NON-CL-SYMBOL PACKN PACK2 [GC for 401 SFUN pages..(T=11).GC finished] DEFSTOBJ-FNNAME-KEY2 DOUBLET-LISTP DEFSTOBJ-FNNAME DEFINED-CONSTANT FIX-STOBJ-ARRAY-TYPE [GC for 401 SFUN pages..(T=11).GC finished] DEFSTOBJ-FIELD-TEMPLATES *DEFSTOBJ-KEYWORDS* PARTITION-REST-AND-KEYWORD-ARGS1 PARTITION-REST-AND-KEYWORD-ARGS2 PARTITION-REST-AND-KEYWORD-ARGS DEFSTOBJ-TEMPLATE [GC for 401 SFUN pages..(T=11).GC finished] SIMPLE-ARRAY-TYPE LIVE-STOBJP ABSSTOBJ-NAME WEAK-DEFSTOBJ-REDUNDANT-RAW-LISP-DISCRIMINATOR-VALUE-P WEAK-STOBJ-PROPERTY-P GET-STOBJ-CREATOR [GC for 401 SFUN pages..(T=12).GC finished] THE$ GET-STOBJ-SCALAR-FIELD MAKE-STOBJ-SCALAR-FIELD [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=13).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 3348 CONS pages..(T=12).GC finished] DEFSTOBJ-FIELD-FNS-RAW-DEFS DEFSTOBJ-RAW-INIT-FIELDS DEFSTOBJ-RAW-INIT-SETF-FORMS [GC for 3348 CONS pages..(T=11).GC finished] DEFSTOBJ-RAW-INIT DEFSTOBJ-COMPONENT-RECOGNIZER-CALLS STOBJP TRANSLATE-STOBJ-TYPE-TO-GUARD [GC for 3348 CONS pages..(T=12).GC finished] DEFSTOBJ-COMPONENT-RECOGNIZER-AXIOMATIC-DEFS CONGRUENT-STOBJ-REP ALL-BUT-LAST DEFSTOBJ-RAW-DEFS DEFCONST-NAME [GC for 401 SFUN pages..(T=12).GC finished] DEFSTOBJ-DEFCONSTS STRIP-ACCESSOR-NAMES THE-LIVE-VAR STANDARD-CO WEAK-LD-HISTORY-ENTRY-P [GC for 401 SFUN pages..(T=12).GC finished] PARSE-WITH-LOCAL-STOBJ PARSE-VERSION PCD2 POWER-REP [GC for 3348 CONS pages..(T=12).GC finished] DECODE-IDATE PRINT-IDATE GOOD-BYE-FN GOOD-BYE EXIT QUIT EXPAND-TILDE-TO-USER-HOME-DIR [GC for 401 SFUN pages..(T=13).GC finished] SAVE-EXEC-FN SAVE-EXEC *SLASH-DOT-DOT* *LENGTH-SLASH-DOT-DOT* FIND-DOT-DOT [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] (CANCEL-DOT-DOTS GET-PARENT-DIRECTORY MERGE-USING-DOT-DOT) COMMENT-STRING-P1 COMMENT-STRING-P [GC for 401 SFUN pages..(T=12).GC finished] WEAK-PRINT-CONTROL-P :REDUNDANT PRINT-CONTROL-ALISTP *RAW-PRINT-VARS-KEYS* ALIST-KEYS-SUBSETP [GC for 3348 CONS pages..(T=13).GC finished] PRINT-CONTROL-P 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" [GC for 401 SFUN pages..(T=12).GC finished] CLEAR-MEMOIZE-TABLE CLEAR-MEMOIZE-TABLES MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS MEMSUM *HONS-PRIMITIVE-FNS* *HONS-PRIMITIVES* *MHT-DEFAULT-SIZE* [GC for 401 SFUN pages..(T=13).GC finished] MEMOIZE-FORM MEMOIZE UNMEMOIZE PROFILE MEMOIZEDP-WORLD MEMOIZEDP NEVER-MEMOIZE-FN NEVER-MEMOIZE *BAD-LISP-CONSP-MEMOIZATION* *THREAD-UNSAFE-BUILTIN-MEMOIZATIONS* SET-BAD-LISP-CONSP-MEMOIZE *SPECIAL-CLTL-CMD-ATTACHMENT-MARK-NAME* *SPECIAL-CLTL-CMD-ATTACHMENT-MARK* Finished loading '((IN-PACKAGE "ACL2") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). "ACL2" SERIALIZE-WRITE [GC for 3358 CONS pages..(T=12).GC finished] [GC for 52 CFUN pages..(T=12).GC finished] SERIALIZE-WRITE-FN SERIALIZE-READ SERIALIZE-READ-FN WITH-SERIALIZE-CHARACTER Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). ACL2 loading "basis-b.lisp". "ACL2" ENFORCE-REDUNDANCY-ER-ARGS ENFORCE-REDUNDANCY GLOBAL-SET [GC for 401 SFUN pages..(T=12).GC finished] TILDE-@-ILLEGAL-VARIABLE-OR-CONSTANT-NAME-PHRASE LEGAL-CONSTANTP GENVAR1 GENVAR [GC for 401 SFUN pages..(T=12).GC finished] GEN-FORMALS-FROM-PRETTY-FLAGS1 GEN-FORMALS-FROM-PRETTY-FLAGS COLLECT-NON-X [GC for 15104 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] COLLECT-NON-* DEFSTUB-BODY-NEW DEFPROXY DEFSTUB-IGNORES [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] DEFSTUB-BODY-OLD-AUX DEFSTUB-BODY-OLD DEFSTUB-FN1 [GC for 3368 CONS pages..(T=13).GC finished] DEFSTUB-FN DEFSTUB *PRIMITIVE-FORMALS-AND-GUARDS* *PRIMITIVE-MONADIC-BOOLEANS* CONS-TERM1-CASES [GC for 3378 CONS pages..(T=11).GC finished] *CONS-TERM1-ALIST* CONS-TERM1-BODY QUOTE-LISTP CONS-TERM1 [GC for 3388 CONS pages..(T=12).GC finished] CONS-TERM CONS-TERM* MCONS-TERM MCONS-TERM* FCONS-TERM CDR-NEST STOBJ-PRINT-NAME EVISCERATION-STOBJ-MARK [GC for 401 SFUN pages..(T=11).GC finished] EVISCERATION-STOBJ-MARKS1 *ERROR-TRIPLE-SIG* *CMP-SIG* EVISCERATION-STOBJ-MARKS EVISCERATE-STOBJS1 EVISCERATE-STOBJS [GC for 401 SFUN pages..(T=11).GC finished] EVISCERATE-STOBJS-TOP FLAMBDA-APPLICATIONP LAMBDA-APPLICATIONP FLAMBDAP LAMBDA-FORMALS LAMBDA-BODY MAKE-LAMBDA MAKE-LET ER-LET* MATCH MATCH! DEF-BASIC-TYPE-SETS1 DEF-BASIC-TYPE-SETS LIST-OF-THE-TYPE-SET TS= TS-COMPLEMENT0 TS-COMPLEMENTP [GC for 401 SFUN pages..(T=11).GC finished] TS-UNION0-FN TS-UNION0 TS-INTERSECTION0 TS-DISJOINTP TS-INTERSECTP TS-BUILDER-CASE-LISTP TS-BUILDER-MACRO1 [GC for 401 SFUN pages..(T=11).GC finished] TS-BUILDER-MACRO TS-BUILDER FFN-SYMB-P STRIP-NOT EQUALITYP INEQUALITYP CONSITYP PRINT-CURRENT-IDATE SKIP-WHEN-LOGIC [GC for 3388 CONS pages..(T=12).GC finished] CHK-INHIBIT-OUTPUT-LST *LD-SPECIAL-ERROR* CHK-LD-SKIP-PROOFSP [GC for 3398 CONS pages..(T=12).GC finished] SET-LD-SKIP-PROOFSP SET-LD-SKIP-PROOFS SET-WRITE-ACL2X *CHECK-SUM-EXCLUSIVE-MAXIMUM* *CHECK-LENGTH-EXCLUSIVE-MAXIMUM* *-CHECK-SUM-EXCLUSIVE-MAXIMUM* *1-CHECK-LENGTH-EXCLUSIVE-MAXIMUM* ASCII-CODE! CHECK-SUM1 [GC for 3408 CONS pages..(T=11).GC finished] CHECK-SUM CHECK-SUM-INC CHECK-SUM-NATURAL [GC for 3418 CONS pages..(T=11).GC finished] CHECK-SUM-STRING1 CHECK-SUM-STRING2 CHECK-SUM-STRING [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] CHECK-SUM-OBJ1 OLD-CHECK-SUM-OBJ PLUS-MOD-M31 DOUBLE-MOD-M31 [GC for 3428 CONS pages..(T=12).GC finished] TIMES-EXPT-2-16-MOD-M31 TIMES-MOD-M31 FCHECKSUM-NATURAL-AUX FCHECKSUM-NATURAL [GC for 3428 CONS pages..(T=13).GC finished] FCHECKSUM-STRING1 [GC for 3428 CONS pages..(T=11).GC finished] FCHECKSUM-STRING2 FCHECKSUM-STRING FCHECKSUM-ATOM *FCHECKSUM-OBJ-STACK-BOUND-INIT* [GC for 3438 CONS pages..(T=12).GC finished] (FCHECKSUM-OBJ2 FCHECKSUM-OBJ) CHECK-SUM-OBJ [GC for 504 SYMBOL pages..(T=12).GC finished] READ-FILE-ITERATE READ-FILE FORMALS PLIST-WORLDP-WITH-FORMALS ARITY SYMBOL-CLASS FDEFUN-MODE [GC for 3438 CONS pages..(T=12).GC finished] DEFUN-MODE ARITIES-OKP USER-DEFINED-FUNCTIONS-TABLE WEAK-DEF-BODY-P LATEST-BODY DEF-BODY [GC for 3438 CONS pages..(T=13).GC finished] BODY GET-STOBJ-RECOGNIZER STOBJ-RECOGNIZER-TERMS MCONS-TERM-SMART (OPTIMIZE-STOBJ-RECOGNIZERS1 OPTIMIZE-STOBJ-RECOGNIZERS1-LST) [GC for 3448 CONS pages..(T=12).GC finished] OPTIMIZE-STOBJ-RECOGNIZERS GUARD GUARD-LST EQUIVALENCE-RELATIONP >=-LEN ALL->=-LEN STRIP-CADRS STRIP-CDDRS [GC for 3448 CONS pages..(T=12).GC finished] [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] GLOBAL-SET-LST CONS-TERM1-BODY-MV2 CONS-TERM1-MV2 [GC for 3458 CONS pages..(T=13).GC finished] (SUBLIS-VAR1 SUBLIS-VAR1-LST) SUBLIS-VAR SUBLIS-VAR-LST SUBCOR-VAR1 (SUBCOR-VAR SUBCOR-VAR-LST) [GC for 3458 CONS pages..(T=12).GC finished] MAKE-REVERSED-AD-LIST CAR-CDR-ABBREV-NAME PRETTY-PARSE-AD-LIST UNTRANSLATE-CAR-CDR-NEST COLLECT-NON-TRIVIAL-BINDINGS UNTRANSLATE-AND UNTRANSLATE-OR [GC for 3468 CONS pages..(T=12).GC finished] CASE-LENGTH COND-LENGTH *UNTRANSLATE-BOOLEAN-PRIMITIVES* RIGHT-ASSOCIATED-ARGS DUMB-NEGATE-LIT [GC for 3478 CONS pages..(T=11).GC finished] DUMB-NEGATE-LIT-LST (TERM-STOBJS-OUT-ALIST TERM-STOBJS-OUT) ACCESSOR-ROOT PROGN! LD-REDEFINITION-ACTION [GC for 3478 CONS pages..(T=12).GC finished] CHK-LD-REDEFINITION-ACTION SET-LD-REDEFINITION-ACTION REDEF REDEF! REDEF+ REDEF- CHK-CURRENT-PACKAGE SET-CURRENT-PACKAGE DEFUN-FOR-STATE-NAME ERROR-FREE-TRIPLE-TO-STATE DEFUN-FOR-STATE SET-CURRENT-PACKAGE-STATE [GC for 3478 CONS pages..(T=12).GC finished] STANDARD-OI READ-STANDARD-OI CHK-STANDARD-OI SET-STANDARD-OI CHK-STANDARD-CO SET-STANDARD-CO [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] PROOFS-CO CHK-PROOFS-CO SET-PROOFS-CO ILLEGAL-STATE-LD-PROMPT LD-PRE-EVAL-FILTER ILLEGAL-STATE-P LD-PROMPT [GC for 3478 CONS pages..(T=11).GC finished] CHK-LD-PROMPT 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 [GC for 3488 CONS pages..(T=13).GC finished] CHK-LD-MISSING-INPUT-OK SET-LD-MISSING-INPUT-OK NEW-NAMEP CHK-LD-PRE-EVAL-FILTER SET-LD-PRE-EVAL-FILTER [GC for 3488 CONS pages..(T=12).GC finished] LD-PRE-EVAL-PRINT CHK-LD-PRE-EVAL-PRINT SET-LD-PRE-EVAL-PRINT LD-POST-EVAL-PRINT CHK-LD-POST-EVAL-PRINT SET-LD-POST-EVAL-PRINT [GC for 411 SFUN pages..(T=12).GC finished] LD-ERROR-TRIPLES CHK-LD-ERROR-TRIPLES SET-LD-ERROR-TRIPLES LD-ERROR-ACTION CHK-LD-ERROR-ACTION SET-LD-ERROR-ACTION [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] LD-QUERY-CONTROL-ALIST LD-QUERY-CONTROL-ALISTP CDR-ASSOC-QUERY-ID CHK-LD-QUERY-CONTROL-ALIST SET-LD-QUERY-CONTROL-ALIST LD-VERBOSE [GC for 411 SFUN pages..(T=11).GC finished] CHK-LD-VERBOSE [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] SET-LD-VERBOSE CHK-LD-USER-STOBJS-MODIFIED-WARNING SET-LD-USER-STOBJS-MODIFIED-WARNING *NQTHM-TO-ACL2-PRIMITIVES* *NQTHM-TO-ACL2-COMMANDS* [GC for 3498 CONS pages..(T=12).GC finished] NQTHM-TO-ACL2-FN NQTHM-TO-ACL2 ALLOCATE-FIXNUM-RANGE ALLEGRO-ALLOCATE-SLOWLY-FN CLEAR-PSTK *PSTK-VARS* PSTK-BINDINGS-AND-ARGS [GC for 3508 CONS pages..(T=12).GC finished] PSTK PSTACK-FN PSTACK VERBOSE-PSTACK SET-PRINT-CLAUSE-IDS SET-SAVED-OUTPUT-TOKEN-LST SET-GAG-MODE-FN [GC for 3508 CONS pages..(T=13).GC finished] SET-GAG-MODE POP-INHIBIT-OUTPUT-LST-STACK PUSH-INHIBIT-OUTPUT-LST-STACK SET-GC-THRESHOLD$-FN SET-GC-THRESHOLD$ Finished loading "basis-b.lisp". ACL2 loading "parallel.lisp". "ACL2" SET-PARALLEL-EXECUTION-FN SET-PARALLEL-EXECUTION WATERFALL-PRINTING-VALUE-FOR-PARALLELISM-VALUE [GC for 3518 CONS pages..(T=13).GC finished] PRINT-SET-WATERFALL-PARALLELISM-NOTICE CHECK-FOR-NO-OVERRIDE-HINTS SET-WATERFALL-PARALLELISM-FN SET-WATERFALL-PARALLELISM1 SAVED-MEMOIZE-TABLE SAVE-MEMO-TABLE [GC for 3518 CONS pages..(T=12).GC finished] CLEAR-MEMO-TABLE-EVENTS CLEAR-MEMO-TABLE SAVE-AND-CLEAR-MEMOIZATION-SETTINGS SET-MEMO-TABLE-EVENTS RESTORE-MEMOIZATION-SETTINGS SET-WATERFALL-PARALLELISM SET-WATERFALL-PRINTING-FN SET-WATERFALL-PRINTING SET-WATERFALL-PARALLELISM-HACKS-ENABLED-GUARD WATERFALL-PARALLELISM-TABLE SET-WATERFALL-PARALLELISM-HACKS-ENABLED SET-WATERFALL-PARALLELISM-HACKS-ENABLED! CAAR-IS-DECLAREP [GC for 411 SFUN pages..(T=12).GC finished] DECLARE-GRANULARITY-P CHECK-AND-PARSE-FOR-GRANULARITY-FORM PARGS PLET BINARY-PAND PAND BINARY-POR POR OR-LIST AND-LIST [GC for 411 SFUN pages..(T=12).GC finished] CPU-CORE-COUNT SPEC-MV-LET SET-TOTAL-PARALLELISM-WORK-LIMIT-FN SET-TOTAL-PARALLELISM-WORK-LIMIT SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR-FN SET-TOTAL-PARALLELISM-WORK-LIMIT-ERROR Finished loading "parallel.lisp". ACL2 loading "translate.lisp". "ACL2" [GC for 3528 CONS pages..(T=13).GC finished] (TERMP TERM-LISTP) [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] TERM-LIST-LISTP COMPUTED-HINT-TUPLE-LISTP DEFAULT-HINTS-TABLE :REDUNDANT MACRO-ARGS *MACRO-EXPANSION-CTX* ERROR-TRACE-SUGGESTION IGNORED-ATTACHMENT-MSG [GC for 411 SFUN pages..(T=12).GC finished] EV-FNCALL-NULL-BODY-ER-MSG EV-FNCALL-NULL-BODY-ERP EV-FNCALL-NULL-BODY-ER EV-FNCALL-CREATOR-ER-MSG UNKNOWN-PKG-ERROR-MSG ILLEGAL-MSG PROGRAM-ONLY-ER-MSG *SAFE-MODE-GUARD-ER-ADDENDUM* [GC for 411 SFUN pages..(T=13).GC finished] FIND-FIRST-NON-NIL LATCH-STOBJS1 LATCH-STOBJS ACTUAL-STOBJS-OUT1 APPLY-SYMBOL-ALIST [GC for 3538 CONS pages..(T=13).GC finished] APPLY-INVERSE-SYMBOL-ALIST *FOR-LOOP$-KEYWORD-INFO* *LOOP$-SPECIAL-FUNCTION-SYMBOLS* FOR-LOOP$-OPERATOR-SCIONP LOOP$-SCION-STYLE1 LOOP$-SCION-STYLE LOOP$-SCION-RESTRICTION1 LOOP$-SCION-RESTRICTION [GC for 411 SFUN pages..(T=13).GC finished] MAKE-CARTON EXCART SYMBOL-NAME-EQUAL ASSOC-SYMBOL-NAME-EQUAL [GC for 3548 CONS pages..(T=12).GC finished] PARSE-LOOP$-ACCUM POSSIBLE-TYPOP MAYBE-MEANT-BUT-DIDNT-WRITE [GC for 3558 CONS pages..(T=12).GC finished] PARSE-LOOP$-WHEN PARSE-LOOP$-UNTIL [GC for 3568 CONS pages..(T=12).GC finished] PARSE-LOOP$-VSTS-DIAGNOSE-FAILURE [GC for 3578 CONS pages..(T=12).GC finished] PARSE-LOOP$-VSTS PARSE-LOOP$-FINALLY [GC for 3588 CONS pages..(T=12).GC finished] [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] PARSE-DO$-KEYWORDS-AND-BODY PARSE-DO$ FIRST-UNUSUAL-WITH-CLAUSE [GC for 3588 CONS pages..(T=13).GC finished] PARSE-LOOP$-WITH PARSE-LOOP$ UNKNOWN-STOBJ-NAMES DO$-STOBJS-OUT [GC for 411 SFUN pages..(T=11).GC finished] ACTUAL-STOBJS-OUT ; Hons-Note: grew SBITS to 7384397; 0.00 seconds, [unknown] bytes. [GC for 3588 CONS pages..(T=12).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP4 [GC for 3598 CONS pages..(T=12).GC finished] TRANSLATED-ACL2-UNWIND-PROTECTP ACL2-SYSTEM-NAMEP ACL2-SYSTEM-NAMEP-STATE [GC for 411 SFUN pages..(T=12).GC finished] (BIG-N DECREMENT-BIG-N ZP-BIG-N) W-OF-ANY-STATE UNTRANSLATE-PREPROCESS-FN UNTRANSLATE* [GC for 411 SFUN pages..(T=13).GC finished] SAVE-EV-FNCALL-GUARD-ER WEAK-ATTACHMENT-P WEAK-ATTACHMENT-COMPONENT-P ATTACHMENT-RECORD-PAIRS [GC for 514 SYMBOL pages..(T=12).GC finished] ALL-ATTACHMENTS GC-OFF1 GC-OFF RETURN-LAST-LOOKUP [GC for 411 SFUN pages..(T=12).GC finished] ADD-IGNORE-TO-REST ADD-TYPE-DCLS-TO-REST COLLECT-IGNORED-LET-VARS MAKE-LET-OR-LET* UNTRANSLATE*-LST [GC for 411 SFUN pages..(T=11).GC finished] LIVE-STATE-SYMBOLP APPLY-USER-STOBJ-ALIST-OR-KWOTE SIGNATURE-FNS [GC for 15360 CONTIGUOUS-BLOCKS pages..(T=13).GC finished] MAKE-EVENT-TUPLE ACCESS-EVENT-TUPLE-NUMBER ACCESS-EVENT-TUPLE-DEPTH ACCESS-EVENT-TUPLE-TYPE ACCESS-EVENT-TUPLE-SKIPPED-PROOFS-P [GC for 411 SFUN pages..(T=11).GC finished] ACCESS-EVENT-TUPLE-NAMEX ACCESS-EVENT-TUPLE-FORM ACCESS-EVENT-TUPLE-SYMBOL-CLASS WEAK-COMMAND-TUPLE-P [GC for 411 SFUN pages..(T=12).GC finished] MAKE-COMMAND-TUPLE ACCESS-COMMAND-TUPLE-NUMBER ACCESS-COMMAND-TUPLE-DEFUN-MODE ACCESS-COMMAND-TUPLE-FORM [GC for 411 SFUN pages..(T=13).GC finished] SAFE-ACCESS-COMMAND-TUPLE-FORM ACCESS-COMMAND-TUPLE-LAST-MAKE-EVENT-EXPANSION ACCESS-COMMAND-TUPLE-CBD MAX-ABSOLUTE-EVENT-NUMBER [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] NEXT-ABSOLUTE-EVENT-NUMBER MAX-ABSOLUTE-COMMAND-NUMBER NEXT-ABSOLUTE-COMMAND-NUMBER SCAN-TO-LANDMARK-NUMBER [GC for 411 SFUN 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* [GC for 411 SFUN pages..(T=13).GC finished] GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS1 GET-UNAMBIGUOUS-XARGS-FLG1/EDCLS GET-UNAMBIGUOUS-XARGS-FLG1 GET-UNAMBIGUOUS-XARGS-FLG [GC for 3598 CONS pages..(T=12).GC finished] GET-UNAMBIGUOUS-XARGS-FLG-LST REMOVE-STRINGS REV-UNION-EQUAL TRANSLATE-DECLARATION-TO-GUARD-GEN-VAR-LST [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] TRANSLATE-DECLARATION-TO-GUARD-VAR-LST GET-GUARDS2 GET-GUARDS1 [GC for 3608 CONS pages..(T=12).GC finished] GET-GUARDS DCLS-GUARD-RAW-FROM-DEF GET-EVENT GET-SKIPPED-PROOFS-P NEGATE-UNTRANSLATED-FORM EVENT-TUPLE-FN-NAMES [GC for 3618 CONS pages..(T=12).GC finished] CLTL-DEF-FROM-NAME2 CLTL-DEF-FROM-NAME1 CLTL-DEF-FROM-NAME UNMAKE-TRUE-LIST-CONS-NEST [GC for 3628 CONS pages..(T=12).GC finished] UNMAKE-FORMAL-PAIRLIS2 COLLECT-IGNORED-MV-VARS ALL-QUOTEPS (SUBST-VAR SUBST-VAR-LST) [GC for 3638 CONS pages..(T=12).GC finished] SUBST-EACH-FOR-VAR TYPE-EXPRESSIONS-FROM-TYPE-SPEC SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP1 FLATTEN-ANDS-IN-LIT [GC for 3638 CONS pages..(T=12).GC finished] FLATTEN-ANDS-IN-LIT-LST WEAK-SPLO-EXTRACTS-TUPLE-P [GC for 3638 CONS pages..(T=12).GC finished] (SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTP SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN SYNTACTICALLY-PLAUSIBLE-LAMBDA-OBJECTSP-WITHIN-LST) COLLECT-PROGRAMS ALL-FNNAMES1 ALL-FNNAMES ALL-FNNAMES-LST [GC for 3648 CONS pages..(T=13).GC finished] 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 GET-BADGE GET-BADGE-AND-WARRANTP WARRANT-NAME [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] STRING-PREFIXP-1 STRING-PREFIXP WARRANT-NAME-INVERSE WARRANT-FUNCTION-NAMEP [GC for 3648 CONS pages..(T=13).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 3658 CONS pages..(T=13).GC finished] (EXECUTABLE-TAMEP EXECUTABLE-TAMEP-FUNCTIONP EXECUTABLE-SUITABLY-TAMEP-LISTP) WELL-FORMED-LAMBDA-OBJECTP1 WELL-FORMED-LAMBDA-OBJECTP [GC for 3668 CONS pages..(T=12).GC finished] ALL-FNNAMES! REMOVE-GUARD-HOLDERS-BLOCKED-BY-HIDE-P :ATTACHMENTS-RECORDED [GC for 3668 CONS pages..(T=13).GC finished] (POSSIBLY-DIRTY-LAMBDA-OBJECTP1 POSSIBLY-DIRTY-LAMBDA-OBJECTP1-LST) POSSIBLY-DIRTY-LAMBDA-OBJECTP (MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP MAY-CONTAIN-DIRTY-LAMBDA-OBJECTSP-LST) (EXPAND-ALL-LAMBDAS EXPAND-ALL-LAMBDAS-LST) [GC for 421 SFUN pages..(T=12).GC finished] (DUMB-OCCUR-VAR DUMB-OCCUR-VAR-LST) TRIVIAL-LAMBDA-P [GC for 3668 CONS pages..(T=12).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 3678 CONS pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] (WARRANTS-FOR-TAMEP WARRANTS-FOR-TAMEP-FUNCTIONP WARRANTS-FOR-SUITABLY-TAMEP-LISTP) WARRANTS-FOR-TAMEP-LAMBDAP-LST (CLEAN-UP-DIRTY-LAMBDA-OBJECTS CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST) [GC for 3678 CONS pages..(T=12).GC finished] POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-LST POSSIBLY-CLEAN-UP-DIRTY-LAMBDA-OBJECTS-IN-PAIRS REMOVE-GUARD-HOLDERS-LAMP :ATTACHMENTS-RECORDED REMOVE-GUARD-HOLDERS REMOVE-GUARD-HOLDERS-LST REMOVE-GUARD-HOLDERS-LST-LST [GC for 3688 CONS pages..(T=13).GC finished] LAMBDA-OBJECT-GUARD TAG-TRANSLATED-LAMBDA$-BODY LAMBDA$-BODYP MEMBER-LAMBDA-OBJECTP ATTACHMENT-ALIST ATTACHMENT-PAIR APPLY$-LAMBDA-GUARD [GC for 421 SFUN pages..(T=12).GC finished] APPLY$-GUARD NON-TRIVIAL-ENCAPSULATE-EE-ENTRIES ALL-FUNCTION-SYMBOLPS *UNKNOWN-CONSTRAINTS* UNKNOWN-CONSTRAINTS-TABLE-GUARD UNKNOWN-CONSTRAINTS-TABLE SET-UNKNOWN-CONSTRAINTS-SUPPORTERS EV-FNCALL-REC-LOGICAL-UNKNOWN-CONSTRAINTS [GC for 3688 CONS pages..(T=12).GC finished] NON-EXECUTABLE-STOBJS-MSG SCAN-TO-EVENT GET-DEFUN-EVENT *ONE-WAY-UNIFY1-IMPLICIT-FNS* [GC for 3698 CONS pages..(T=12).GC finished] ONE-WAY-UNIFY1-QUOTEP-SUBPROBLEMS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=14).GC finished] (ONE-WAY-UNIFY1 ONE-WAY-UNIFY1-LST ONE-WAY-UNIFY1-EQUAL1 ONE-WAY-UNIFY1-EQUAL) ONE-WAY-UNIFY *INITIAL-RETURN-LAST-TABLE* MAYBE-CONVERT-TO-MV *TYPE-EXPR-TO-TYPE-SPEC-ALIST* [GC for 3708 CONS pages..(T=12).GC finished] TYPE-SPEC-FIX-UNIFY-SUBST TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION-1 [GC for 3708 CONS pages..(T=13).GC finished] TYPE-SPEC-AND-VAR-FROM-TYPE-EXPRESSION TYPE-SPEC-TO-VARLIST-ALIST [GC for 3718 CONS pages..(T=13).GC finished] RECOVER-TYPE-SPEC-EXPRS!1 RECOVER-TYPE-SPEC-EXPRS! SPLIT-TYPE-SPECS-FROM-TERM [GC for 3718 CONS pages..(T=12).GC finished] UNTRANSLATE-LAMBDA-OBJECT-P :ATTACHMENTS-RECORDED UNTRANSLATE-LAMBDA-OBJECT-CHEAT [GC for 3718 CONS pages..(T=12).GC finished] [GC for 3728 CONS pages..(T=12).GC finished] [GC for 3738 CONS pages..(T=12).GC finished] [GC for 3748 CONS pages..(T=12).GC finished] [GC for 3758 CONS pages..(T=12).GC finished] [GC for 3768 CONS pages..(T=12).GC finished] [GC for 3778 CONS pages..(T=12).GC finished] [GC for 3788 CONS pages..(T=13).GC finished] [GC for 3798 CONS pages..(T=13).GC finished] [GC for 3808 CONS pages..(T=12).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=12).GC finished] [GC for 3818 CONS pages..(T=12).GC finished] [GC for 3828 CONS pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] [GC for 524 SYMBOL pages..(T=12).GC finished] [GC for 421 SFUN pages..(T=13).GC finished] [GC for 3838 CONS pages..(T=14).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 421 SFUN pages..(T=13).GC finished] ERSATZ-PROG2 ERSATZ-SETQ ERSATZ-RETURN ERSATZ-LOOP-FINISH ERSATZ-MV-SETQ MAKE-ERSATZ-MV-SETQ [GC for 421 SFUN pages..(T=13).GC finished] ERSATZ-MV-SETQ-VARS ERSATZ-MV-SETQ-BODY *CLTL-TO-ERSATZ-FNS* ERSATZ-FUNCTIONP [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] (ERSATZ-SYMBOLS ERSATZ-SYMBOLS-LIST) UNTRANSLATE UNTRANSLATE-LST [GC for 421 SFUN pages..(T=13).GC finished] (REPLACE-ERSATZ-FUNCTIONS REPLACE-ERSATZ-FUNCTIONS-LIST) UNTRANSLATE-DO-BODY PROGN$-OF-CHECK-DCL-GUARDIANSP LAMBDA-DO-BODY-DECONSTRUCTOR (WELL-FORMED-DO-BODY WELL-FORMED-DO-BODY-LIST) [GC for 421 SFUN pages..(T=12).GC finished] (DUMB-OCCUR DUMB-OCCUR-LST) VAR-ON-IF-LEAF GUESS-DO-BODY-MEASURE-VARS GUESS-DO-BODY-MEASURE [GC for 421 SFUN pages..(T=13).GC finished] CMP-DO-BODY-ALIST MAKE-TRUE-LIST-CONS-NEST CMP-DO-BODY-EXIT CMP-DO-BODY-GUARDIAN PROG2$-CALL CMP-DO-BODY-MV-GUARDIAN-1 CMP-DO-BODY-MV-GUARDIAN [GC for 421 SFUN pages..(T=13).GC finished] TRANSLATED-MV-NTH-CALLS COLLECT-BY-POSITION MAKE-LAMBDA-APPLICATION MAKE-LAMBDA-TERM CMP-TO-ERROR-TRIPLE CMP-TO-ERROR-DOUBLE CMP-AND-VALUE-TO-ERROR-QUADRUPLE [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] 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 CHK-NO-ERSATZ-SYMBOLS-P [GC for 421 SFUN pages..(T=12).GC finished] COLLECT-NONTRIVIAL-FORMALS-IN-SET CMP-DO-BODY-1 CMP-DO-BODY [GC for 3838 CONS pages..(T=12).GC finished] COLLECT-TWVTS-TYPE-PREDS VAR-TO-CDR-ASSOC-VAR-SUBSTITUTION MAKE-DO-BODY-LAMBDA$ MAKE-DO-MEASURE-LAMBDA$ MAKE-INITIAL-DO-BODY-ALIST EV-W-LST [GC for 421 SFUN pages..(T=13).GC finished] SILENT-ERROR WARNING1-CW WARNING$-CW1 WARNING$-CW CHK-LENGTH-AND-KEYS DUPLICATE-KEYS-ACTION-TABLE SET-DUPLICATE-KEYS-ACTION! SET-DUPLICATE-KEYS-ACTION DUPLICATE-KEYS-ACTION [GC for 421 SFUN pages..(T=13).GC finished] LEGAL-INITP MACRO-ARGLIST-KEYSP MACRO-ARGLIST-AFTER-RESTP MACRO-ARGLIST-OPTIONALP [GC for 421 SFUN pages..(T=12).GC finished] MACRO-ARGLIST1P SUBSEQUENCEP COLLECT-LAMBDA-KEYWORDPS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] MACRO-ARGS-STRUCTUREP BIND-MACRO-ARGS-KEYS1 BIND-MACRO-ARGS-KEYS BIND-MACRO-ARGS-AFTER-REST [GC for 421 SFUN pages..(T=13).GC finished] BIND-MACRO-ARGS-OPTIONAL BIND-MACRO-ARGS1 BIND-MACRO-ARGS MACRO-GUARD-ER-MSG [GC for 421 SFUN pages..(T=13).GC finished] MACROEXPAND1-CMP MACROEXPAND1 CHK-DECLARE COLLECT-DCLS TAG-LOOP$ *ACCEPTABLE-DCLS-ALIST* *DOCUMENTATION-STRINGS-PERMITTED* *DCL-EXPLANATION-ALIST* [GC for 421 SFUN pages..(T=13).GC finished] TILDE-*-CONJUNCTION-PHRASE1 TILDE-*-CONJUNCTION-PHRASE COLLECT-NON-LEGAL-VARIABLEPS OPTIMIZE-ALISTP [GC for 3838 CONS pages..(T=13).GC finished] CHK-DCL-LST NUMBER-OF-STRINGS GET-STRING [GC for 421 SFUN pages..(T=13).GC finished] COLLECT-DECLARATIONS-CMP COLLECT-DECLARATIONS LISTIFY TRANSLATE-DCL-LST *ONEIFY-PRIMITIVES* *EC-CALL-BAD-OPS* RETURN-LAST-CALL [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] DCL-GUARDIAN IGNORE-VARS IGNORABLE-VARS MV-NTH-LIST TRANSLATE-BIND TRANSLATE-DEREF [GC for 421 SFUN pages..(T=14).GC finished] TRANSLATE-UNBOUND LISTLIS (FIND-FIRST-VAR FIND-FIRST-VAR-LST) (FIND-FIRST-FNSYMB FIND-FIRST-FNSYMB-LST) [GC for 421 SFUN pages..(T=13).GC finished] FIND-PKG-WITNESS TRANS-ER TRANS-ER+ TRANS-ER+? TRANS-VALUE TRANS-ER-LET* HIDE-IGNORED-ACTUALS AUGMENT-IGNORE-VARS COMPUTE-STOBJ-FLAGS [GC for 421 SFUN pages..(T=14).GC finished] PRETTYIFY-STOBJ-FLAGS PRETTYIFY-STOBJS-OUT DEFSTOBJ-SUPPORTERP STOBJ-CREATORP [GC for 421 SFUN pages..(T=13).GC finished] (FFNNAMEP FFNNAMEP-LST) UNKNOWN-BINDING-MSG *MACROS-FOR-NONEXPANSION-IN-RAW-LISP* [GC for 2049 RELOCATABLE-BLOCKS pages..(T=13).GC finished] CHK-NO-DUPLICATE-DEFUNS-CMP CHK-NO-DUPLICATE-DEFUNS [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] CHK-STATE-OK-MSG CHK-STATE-OK CHK-ARGLIST-MSG MSG-TO-CMP [GC for 421 SFUN pages..(T=14).GC finished] CHK-ARGLIST-CMP CHK-ARGLIST LOGICAL-NAME-TYPE CHK-ALL-BUT-NEW-NAME-CMP [GC for 421 SFUN pages..(T=13).GC finished] CHK-ALL-BUT-NEW-NAME CHK-DEFUNS-TUPLES-CMP CHK-DEFUNS-TUPLES NAME-DROPPER [GC for 421 SFUN pages..(T=12).GC finished] FIRST-ASSOC-EQ CONTEXT-FOR-ENCAPSULATE-PASS-2 *BRR-GLOBALS* UNKNOWN-BINDING-MSG-ER CONGRUENT-STOBJSP STOBJS-IN-OUT1 [GC for 421 SFUN pages..(T=12).GC finished] STOBJS-IN-MATCHP STOBJS-IN-OUT NON-TRIVIAL-STOBJ-BINDING FORMALIZED-VARLISTP [GC for 421 SFUN pages..(T=13).GC finished] THROW-NONEXEC-ERROR-P1 THROW-NONEXEC-ERROR-P [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] CHK-FLET-DECLARATIONS CHK-FLET-DECLARE-FORM CHK-FLET-DECLARE-FORM-LIST STOBJ-UPDATER-GUESS-FROM-ACCESSOR [GC for 421 SFUN pages..(T=14).GC finished] PARSE-STOBJ-LET-ACTUAL UNQUOTED-SYMBOL [GC for 3838 CONS pages..(T=14).GC finished] PARSE-STOBJ-LET1 ILLEGAL-STOBJ-LET-MSG [GC for 3848 CONS pages..(T=13).GC finished] PARSE-STOBJ-LET SPLIT-VALUES-BY-KEYS NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS/ALIST [GC for 421 SFUN pages..(T=14).GC finished] CONCRETE-ACCESSOR NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS-1 WEAK-ABSSTOBJ-INFO-P ABSSTOBJ-TUPLES-LST NO-DUPLICATE-INDICES-CHECKS-FOR-STOBJ-LET-ACTUALS [GC for 3858 CONS pages..(T=14).GC finished] STOBJ-LET-FN STOBJ-LET-FN-RAW-LET-BINDINGS STOBJ-FIELD-ACCESSOR-P *STOBJ-TABLE-STOBJ* [GC for 3868 CONS pages..(T=14).GC finished] CHK-STOBJ-LET/BINDINGS CHK-STOBJ-LET/UPDATERS-1 [GC for 3878 CONS pages..(T=14).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=16).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 3878 CONS pages..(T=13).GC finished] CHK-STOBJ-LET/ACCESSORS CHK-STOBJ-LET ALL-NILS-OR-X ABSSTOBJ-FIELD-FN-OF-STOBJ-TYPE-P STOBJ-FIELD-FN-OF-STOBJ-TYPE-P STOBJ-RECOGNIZER-P TRANS-OR INSIDE-DEFABSSTOBJ [GC for 3878 CONS pages..(T=13).GC finished] MISSING-KNOWN-STOBJS DEREF-MACRO-NAME CORRESPONDING-INLINE-FN UNTOUCHABLE-FN-P MACROEXPAND1*-CMP [GC for 3878 CONS pages..(T=13).GC finished] FIND-STOBJ-OUT-AND-CALL DEFINED-SYMBOLS MACROS-AND-FUNCTIONS-IN-OTHER-PACKAGES MATCH-STOBJS (ALL-UNBADGED-FNNAMES ALL-UNBADGED-FNNAMES-LIST) *GRATUITOUS-LAMBDA-OBJECT-RESTRICTION-MSG* [GC for 3888 CONS pages..(T=12).GC finished] [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).GC finished] EDCLS-FROM-LAMBDA-OBJECT-DCLS EDCLS-FROM-LAMBDA-OBJECT-DCLS-SHORT-CUT MAKE-PLAIN-LOOP$-LAMBDA-OBJECT [GC for 3888 CONS pages..(T=13).GC finished] TRANSLATE-VSTS MAKE-BINDINGS COLLECT-TVSTS-LIFTED-GUARDS MAKE-FANCY-LOOP$-TYPE-SPECS LIFT-FANCY-LOOP$-CARTON-GUARD [GC for 3898 CONS pages..(T=14).GC finished] MAKE-FANCY-LOOP$-LAMBDA-OBJECT MAKE-PLAIN-LOOP$ MAKE-FANCY-LOOP$-TARGET MAKE-FANCY-LOOP$ REMOVE-FOR-LOOP$-GUARDS [GC for 3898 CONS pages..(T=13).GC finished] REMOVE-DO-LOOP$-GUARDS REMOVE-LOOP$-GUARDS TRANSLATE11-VAR-OR-QUOTE-EXIT WEAK-BADGE-USERFN-STRUCTURE-ALISTP [GC for 3898 CONS pages..(T=13).GC finished] ILKS-PLIST-WORLDP ILKS-PER-ARGUMENT-SLOT [GC for 15616 CONTIGUOUS-BLOCKS pages..(T=15).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=13).GC finished] PARSE-WITH-GLOBAL-STOBJ *WITH-GLOBAL-STOBJ-PREFIX* *WITH-GLOBAL-STOBJ-PREFIX-CHARS* WITH-GLOBAL-STOBJ-VAR-LST WITH-GLOBAL-STOBJ-ADJUST-SIGNATURE-OR-VARS [GC for 3908 CONS pages..(T=13).GC finished] WITH-GLOBAL-STOBJ-FN1 *SEE-DOC-WITH-GLOBAL-STOBJ* [GC for 62 CFUN pages..(T=13).GC finished] WITH-GLOBAL-STOBJ-FN WITH-GLOBAL-STOBJ (COLLECT-GLOBAL-STOBJS COLLECT-GLOBAL-STOBJS-LST) [GC for 3918 CONS pages..(T=13).GC finished] PATH-TO-WITH-GLOBAL-STOBJ WITH-GLOBAL-STOBJ-ILLEGAL-PATH-MSG CHK-GLOBAL-STOBJ-BODY [GC for 3928 CONS pages..(T=13).GC finished] [GC for 3938 CONS pages..(T=13).GC finished] [GC for 3948 CONS pages..(T=13).GC finished] [GC for 3958 CONS pages..(T=13).GC finished] [GC for 3968 CONS pages..(T=13).GC finished] [GC for 3978 CONS pages..(T=13).GC finished] [GC for 3988 CONS pages..(T=13).GC finished] [GC for 3998 CONS pages..(T=13).GC finished] [GC for 4008 CONS pages..(T=13).GC finished] [GC for 4018 CONS pages..(T=14).GC finished] [GC for 4028 CONS pages..(T=15).GC finished] [GC for 4038 CONS pages..(T=15).GC finished] [GC for 4048 CONS pages..(T=15).GC finished] [GC for 4058 CONS pages..(T=15).GC finished] [GC for 4068 CONS pages..(T=15).GC finished] [GC for 4078 CONS pages..(T=14).GC finished] [GC for 4088 CONS pages..(T=14).GC finished] [GC for 4098 CONS pages..(T=15).GC finished] [GC for 4108 CONS pages..(T=14).GC finished] [GC for 4118 CONS pages..(T=14).GC finished] [GC for 4128 CONS pages..(T=14).GC finished] [GC for 4128 CONS pages..(T=14).GC finished] [GC for 4138 CONS pages..(T=15).GC finished] [GC for 4138 CONS pages..(T=14).GC finished] [GC for 4138 CONS pages..(T=14).GC finished] [GC for 4138 CONS pages..(T=15).GC finished] [GC for 4138 CONS pages..(T=15).GC finished] [GC for 4138 CONS pages..(T=14).GC finished] [GC for 4148 CONS pages..(T=15).GC finished] [GC for 4148 CONS pages..(T=15).GC finished] [GC for 4148 CONS pages..(T=15).GC finished] [GC for 4148 CONS pages..(T=15).GC finished] [GC for 4148 CONS pages..(T=15).GC finished] [GC for 4158 CONS pages..(T=16).GC finished] [GC for 4168 CONS pages..(T=15).GC finished] [GC for 4178 CONS pages..(T=15).GC finished] [GC for 4188 CONS pages..(T=14).GC finished] [GC for 4198 CONS pages..(T=15).GC finished] [GC for 4208 CONS pages..(T=15).GC finished] [GC for 4218 CONS pages..(T=15).GC finished] [GC for 4228 CONS pages..(T=16).GC finished] [GC for 57 STRUCTURE pages..(T=15).GC finished] [GC for 4238 CONS pages..(T=16).GC finished] [GC for 239 ARRAY pages..(T=15).GC finished] [GC for 4248 CONS pages..(T=15).GC finished] [GC for 249 ARRAY pages..(T=16).GC finished] [GC for 4258 CONS pages..(T=15).GC finished] [GC for 259 ARRAY pages..(T=16).GC finished] [GC for 4268 CONS pages..(T=16).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=15).GC finished] [GC for 269 ARRAY pages..(T=15).GC finished] [GC for 4278 CONS pages..(T=15).GC finished] [GC for 4288 CONS pages..(T=15).GC finished] [GC for 4298 CONS pages..(T=15).GC finished] [GC for 4308 CONS pages..(T=15).GC finished] [GC for 4318 CONS pages..(T=15).GC finished] [GC for 4328 CONS pages..(T=15).GC finished] [GC for 279 ARRAY pages..(T=15).GC finished] [GC for 4338 CONS pages..(T=13).GC finished] [GC for 431 SFUN pages..(T=15).GC finished] /tmp/gazonk_1577234_0.c: In function 'L1': /tmp/gazonk_1577234_0.c:1162:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 1162 | if((Cnil)==Cnil){ | ^~ /tmp/gazonk_1577234_0.c:1605:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 1605 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_1577234_0.c:2036:18: warning: self-comparison always evaluates to false [-Wtautological-compare] 2036 | if((Cnil)!=Cnil){ | ^~ /tmp/gazonk_1577234_0.c:2361:18: warning: self-comparison always evaluates to true [-Wtautological-compare] 2361 | if((Cnil)==Cnil){ | ^~ [GC for 431 SFUN pages..(T=14).GC finished] [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] [GC for 431 SFUN pages..(T=15).GC finished] [GC for 431 SFUN pages..(T=15).GC finished] (TRANSLATE11-FLET-ALIST TRANSLATE11-FLET-ALIST1 TRANSLATE11-FLET TRANSLATE-STOBJ-CALLS TRANSLATE11-LET TRANSLATE11-LET* TRANSLATE11-MV-LET ...) TRANSLATE1-CMP TRANSLATE1 [GC for 431 SFUN pages..(T=14).GC finished] (LOGIC-FNSP LOGIC-FNS-LISTP) LOGIC-TERMP LOGIC-TERM-LISTP [GC for 431 SFUN pages..(T=15).GC finished] LOGIC-FNS-LIST-LISTP LOGIC-TERM-LIST-LISTP TRANSLATE-CMP TRANSLATE TRANSLATABLE-P CHK-TRANSLATABLE [GC for 431 SFUN pages..(T=14).GC finished] LOOP$-STOBJS-OUT REPLACED-STOBJ REPLACE-STOBJS1 REPLACE-STOBJS USER-STOBJSP [GC for 431 SFUN pages..(T=14).GC finished] PUT-ASSOC-EQ-ALIST COLLECT-USER-STOBJS FILTER-KNOWN-STOBJS [GC for 431 SFUN pages..(T=14).GC finished] CHK-GLOBAL-STOBJS EV-FOR-TRANS-EVAL MACROEXPAND1* TRANS-EVAL1 [GC for 431 SFUN pages..(T=13).GC finished] TRANS-EVAL0 TRANS-EVAL TRANS-EVAL-NO-WARNING TRANS-EVAL-DEFAULT-WARNING [GC for 431 SFUN pages..(T=14).GC finished] LAMBDA-OBJECT-GUARD-LST LAMBDA-OBJECT-BODY-LST FILTER-LAMBDA$-OBJECTS (COLLECT-CERTAIN-LAMBDA-OBJECTS COLLECT-CERTAIN-LAMBDA-OBJECTS-LST) [GC for 431 SFUN pages..(T=14).GC finished] TAGGED-LOOP$P (COLLECT-CERTAIN-TAGGED-LOOP$S COLLECT-CERTAIN-TAGGED-LOOP$S-LST) [GC for 16128 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] (ANCESTRAL-LAMBDA$S-BY-CALLER1 ANCESTRAL-LAMBDA$S-BY-CALLER1-LST) COLLECT-NON-EMPTY-PAIRS ANCESTRAL-LAMBDA$S-BY-CALLER [GC for 431 SFUN pages..(T=15).GC finished] (ELIMINATE-LAMBDA$ ELIMINATE-LAMBDA$-LST) TILDE-@-LAMBDA$-REPLACEMENT-PHRASE1 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE2 TILDE-@-LAMBDA$-REPLACEMENT-PHRASE3 [GC for 431 SFUN pages..(T=12).GC finished] TILDE-@-LAMBDA$-REPLACEMENT-PHRASE4 TILDE-*-LAMBDA$-REPLACEMENT-PHRASE5 STRINGS-AND-OTHERS PROHIBITION-OF-LOOP$-AND-LAMBDA$-MSG [GC for 431 SFUN 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 SET-TEMP-TOUCHABLE-VARS [GC for 441 SFUN pages..(T=13).GC finished] CLEAR-TEMP-TOUCHABLE-FNS CLEAR-TEMP-TOUCHABLE-VARS MAPCAR$ MAPDO ALWAYS THEREIS GUARD-MSG-TABLE SET-GUARD-MSG GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE GUARD-MSG-TABLE SUBLIS-EQUAL *TYPE-SPEC-TEMPLATES* PAIR-TYPE-EXPRESSIONS-WITH-TYPE-SPECS Finished loading "translate.lisp". [GC for 441 SFUN pages..(T=14).GC finished] 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 441 SFUN pages..(T=14).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 4338 CONS pages..(T=14).GC finished] [GC for 4338 CONS pages..(T=14).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=15).GC finished] [GC for 441 SFUN pages..(T=14).GC finished] TYPE-SET-BINARY-+-ALIST-ENTRY TYPE-SET-BINARY-+-ALIST1 TYPE-SET-BINARY-+-ALIST [GC for 4338 CONS pages..(T=13).GC finished] [GC for 4338 CONS pages..(T=14).GC finished] [GC for 441 SFUN pages..(T=14).GC finished] TYPE-SET-BINARY-*-ALIST-ENTRY [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=16).GC finished] TYPE-SET-BINARY-*-ALIST1 TYPE-SET-BINARY-*-ALIST [GC for 4338 CONS pages..(T=14).GC finished] [GC for 4338 CONS pages..(T=14).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 [GC for 441 SFUN pages..(T=14).GC finished] PT-OCCUR PT-INTERSECTP TAG-TREE-OCCUR REMOVE-TAG-FROM-TAG-TREE [GC for 544 SYMBOL pages..(T=14).GC finished] REMOVE-TAG-FROM-TAG-TREE! EXTEND-TAG-TREE ADD-TO-TAG-TREE ADD-TO-TAG-TREE! *FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE* FAKE-RUNE-FOR-ANONYMOUS-ENABLED-RULE-P PUSH-LEMMA REMOVE1-ASSOC-EQ-ASSOC-EQ-1 REMOVE1-ASSOC-EQ-ASSOC-EQ CONS-TAG-TREES1 CONS-TAG-TREES TAGGED-OBJECTS TAGGED-OBJECTSP TAGGED-OBJECT WITH-TTREE-LOCK [GC for 441 SFUN pages..(T=14).GC finished] ACCUMULATE-TTREE-AND-STEP-LIMIT-INTO-STATE PTS-TO-TTREE-LST MARRY-PARENTS COLLECT-PARENTS1 COLLECT-PARENTS0 COLLECT-PARENTS IGNORE-POLYP TO-BE-IGNOREDP1 [GC for 441 SFUN pages..(T=14).GC finished] TO-BE-IGNOREDP WEAK-ASSUMNOTE-P WEAK-ASSUMPTION-P WEAK-FC-DERIVATION-P (CONTAINS-ASSUMPTIONP CONTAINS-ASSUMPTIONP-FC-DERIVATIONS) REMOVE-ASSUMPTION-ENTRIES-FROM-TYPE-ALIST [GC for 441 SFUN pages..(T=14).GC finished] FORCE-ASSUMPTION1 DUMB-OCCUR-IN-TYPE-ALIST ALL-DUMB-OCCUR-IN-TYPE-ALIST *FORCE-XRUNE* FORCE-ASSUMPTION TAG-TREE-OCCUR-ASSUMPTION-NIL-1 TAG-TREE-OCCUR-ASSUMPTION-NIL ASSUMPTION-FREE-TTREEP *IMPOSSIBLE-ASSUMPTION* FN-COUNT-EVG-MAX-VAL FN-COUNT-EVG-MAX-VAL-NEG FN-COUNT-EVG-MAX-CALLS [GC for 441 SFUN pages..(T=14).GC finished] MIN-FIXNUM FN-COUNT-EVG-REC FN-COUNT-EVG VAR-FN-COUNT-1 VAR-FN-COUNT VAR-OR-FN-COUNT-< TERM-ORDER1 ARITH-TERM-ORDER [GC for 441 SFUN pages..(T=14).GC finished] WEAK-POLY-P FIRST-VAR FIRST-COEFFICIENT GOOD-COEFFICIENT GOOD-POT-VARP GOOD-POLYP LOGICAL-< LOGICAL-<= EVALUATE-GROUND-POLY [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] IMPOSSIBLE-POLYP TRUE-POLYP SILLY-POLYP IMPOSSIBLE-POLY BASE-POLY0 BASE-POLY POLY-ALIST-EQUAL POLY-EQUAL [GC for 441 SFUN pages..(T=15).GC finished] POLY-WEAKERP POLY-MEMBER NEW-AND-UGLY-LINEAR-VARSP FILTER-POLYS ADD-LINEAR-VARIABLE1 ZERO-FACTOR-P GET-COEFFICIENT [GC for 441 SFUN pages..(T=15).GC finished] ADD-LINEAR-VARIABLE DUMB-EVAL-YIELDS-QUOTEP DUMB-EVAL ADD-LINEAR-TERM ADD-LINEAR-TERMS-FN ADD-LINEAR-TERMS NORMALIZE-POLY1 NORMALIZE-POLY [GC for 441 SFUN pages..(T=14).GC finished] NORMALIZE-POLY-LST WEAK-LINEAR-POT-P MODIFY-LINEAR-POT *MAX-LINEAR-POT-LOOP-STOPPER-VALUE* LOOP-STOPPER-VALUE-OF-VAR SET-LOOP-STOPPER-VALUES VAR-IN-POT-LST-P BOUNDS-POLY-WITH-VAR [GC for 441 SFUN pages..(T=15).GC finished] BOUNDS-POLYS-WITH-VAR POLYS-WITH-VAR1 POLYS-WITH-VAR POLYS-WITH-POTS NEW-VARS-IN-POT-LST CHANGED-POT-VARS INFECT-POLYS [GC for 441 SFUN pages..(T=15).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 CONS-TERM-BINARY-+-CONSTANT [GC for 441 SFUN pages..(T=15).GC finished] CONS-TERM-UNARY-- CONS-TERM-BINARY-*-CONSTANT FIND-EQUATIONAL-POLY-RHS1 FIND-EQUATIONAL-POLY-RHS FIND-EQUATIONAL-POLY3 FIND-EQUATIONAL-POLY2 FIND-EQUATIONAL-POLY1 [GC for 441 SFUN pages..(T=15).GC finished] FIND-EQUATIONAL-POLY [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] GET-COEFF-FOR-CANCEL1 CANCEL2 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=13).GC finished] CANCEL1 CANCEL CANCEL-POLY-AGAINST-ALL-POLYS ADD-POLY PRUNE-POLY-LST ADD-POLYS1 [GC for 441 SFUN pages..(T=14).GC finished] ADD-POLYS0 SHOW-POLY2 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 [GC for 441 SFUN pages..(T=13).GC finished] RUNEP BASE-SYMBOL STRIP-BASE-SYMBOLS FNUME FRUNIC-MAPPING-PAIR FN-RUNE-NUME DEFINITION-RUNES GET-NEXT-NUME DEREF-MACRO-NAME-LST *ABBREV-RUNE-ALIST* [GC for 441 SFUN pages..(T=14).GC finished] TRANSLATE-ABBREV-RUNE RULE-NAME-DESIGNATORP THEORYP1 THEORYP RUNIC-THEORYP1 RUNIC-THEORYP [GC for 441 SFUN pages..(T=14).GC finished] FIND-MAPPING-PAIRS-TAIL1 FIND-MAPPING-PAIRS-TAIL AUGMENT-RUNIC-THEORY1 AUGMENT-RUNIC-THEORY *BAD-RUNIC-DESIGNATOR-STRING* CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS1 CONVERT-THEORY-TO-UNORDERED-MAPPING-PAIRS DUPLICITOUS-CONS-CAR [GC for 441 SFUN pages..(T=13).GC finished] DUPLICITOUS-REVAPPEND-CAR DUPLICITOUS-MERGE-CAR DUPLICITOUS-SORT-CAR AUGMENT-THEORY ASSERT$-RUNIC-THEORYP RUNIC-THEORY WEAK-ENABLED-STRUCTURE-P [GC for 441 SFUN pages..(T=15).GC finished] ENABLED-STRUCTURE-P ENABLED-NUMEP ENABLED-ARITH-NUMEP ENABLED-RUNEP ACTIVE-RUNEP ACTIVE-OR-NON-RUNEP ENABLED-XFNP [GC for 441 SFUN pages..(T=13).GC finished] (SUBLIS-VAR! SUBLIS-VAR!-LST) THEORY-WARNING-FNS-AUX [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=18).GC finished] THEORY-WARNING-FNS MAYBE-WARN-ABOUT-THEORY WEAK-THEORY-INVARIANT-RECORD-P ENABLED-DISABLED-RUNEPS THEORY-INVARIANT-MSG-IMPLICATION [GC for 441 SFUN pages..(T=15).GC finished] COMBINE-ANDS THEORY-INVARIANT-MSG-ACTIVE-RUNEP-LST THEORY-INVARIANT-MSG WEAK-CERTIFY-BOOK-INFO-P WEAK-USELESS-RUNES-P [GC for 441 SFUN pages..(T=13).GC finished] ACTIVE-USELESS-RUNES USELESS-RUNES-FILENAME ACTIVE-USELESS-RUNES-FILENAME CHK-THEORY-INVARIANT1 [GC for 441 SFUN pages..(T=15).GC finished] CHK-THEORY-INVARIANT WEAK-CLAUSE-ID-P POS-LISTP ALL-DIGITS-P [GC for 441 SFUN pages..(T=13).GC finished] D-POS-LISTP CLAUSE-ID-P *INITIAL-CLAUSE-ID* CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE [GC for 441 SFUN pages..(T=14).GC finished] STRING-FOR-TILDE-@-CLAUSE-ID-PHRASE UPDATE-ENABLED-STRUCTURE-ARRAY INCREMENT-ARRAY-NAME UPDATE-ENABLED-STRUCTURE [GC for 554 SYMBOL pages..(T=15).GC finished] LOAD-THEORY-INTO-ENABLED-STRUCTURE-1 LOAD-THEORY-INTO-ENABLED-STRUCTURE INITIAL-GLOBAL-ENABLED-STRUCTURE RECOMPRESS-GLOBAL-ENABLED-STRUCTURE RECOMPRESS-STOBJ-ACCESSOR-ARRAYS *FAKE-RUNE-FOR-TYPE-SET* [GC for 441 SFUN pages..(T=13).GC finished] PUFFERT IMMEDIATE-FORCEP NUMERIC-TYPE-SET RATIONAL-TYPE-SET TYPE-SET-BINARY-+ [GC for 441 SFUN pages..(T=14).GC finished] TYPE-SET-BINARY-* TYPE-SET-NOT TYPE-SET-<-1 [GC for 4338 CONS pages..(T=13).GC finished] TYPE-SET-< [GC for 4338 CONS pages..(T=14).GC finished] TYPE-SET-UNARY-- [GC for 4338 CONS pages..(T=14).GC finished] TYPE-SET-UNARY-/ [GC for 441 SFUN pages..(T=15).GC finished] TYPE-SET-NUMERATOR TYPE-SET-DENOMINATOR TYPE-SET-REALPART TYPE-SET-IMAGPART [GC for 4338 CONS pages..(T=15).GC finished] TYPE-SET-COMPLEX WEAK-RECOGNIZER-TUPLE-P *INITIAL-RECOGNIZER-ALIST* [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] MOST-RECENT-ENABLED-RECOG-TUPLE1 MOST-RECENT-ENABLED-RECOG-TUPLE TYPE-SET-RECOGNIZER TYPE-SET-CAR [GC for 441 SFUN pages..(T=15).GC finished] TYPE-SET-CDR TYPE-SET-COERCE [GC for 441 SFUN pages..(T=14).GC finished] TYPE-SET-INTERN-IN-PACKAGE-OF-SYMBOL TYPE-SET-LENGTH TYPE-SET-CONS *SINGLETON-TYPE-SETS* [GC for 4338 CONS pages..(T=14).GC finished] TYPE-SET-EQUAL TYPE-SET-QUOTE TYPE-SET-CHAR-CODE [GC for 441 SFUN pages..(T=13).GC finished] FN-COUNT-1 FN-COUNT TERM-ORDER WEAK-TYPE-PRESCRIPTION-P FIND-RUNED-TYPE-PRESCRIPTION [GC for 441 SFUN pages..(T=15).GC finished] MV-ATF ASSUME-TRUE-FALSE-ERROR NON-CONS-CDR CANONICAL-REPRESENTATIVE SUBST-TYPE-ALIST1-CHECK [GC for 441 SFUN 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 [GC for 441 SFUN pages..(T=16).GC finished] INFECT-NEW-TYPE-ALIST-ENTRIES1 INFECT-NEW-TYPE-ALIST-ENTRIES [GC for 2049 RELOCATABLE-BLOCKS pages..(T=15).GC finished] EXTEND-TYPE-ALIST-SIMPLE EXTEND-TYPE-ALIST1 EXTEND-TYPE-ALIST [GC for 441 SFUN pages..(T=15).GC finished] ZIP-VARIABLE-TYPE-ALIST ASSOC-EQUIV ASSOC-EQUIV+ ASSOC-TYPE-ALIST [GC for 441 SFUN pages..(T=14).GC finished] LOOK-IN-TYPE-ALIST MEMBER-CHAR-STRINGP TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP [GC for 441 SFUN pages..(T=14).GC finished] EVG-OCCUR (OCCUR OCCUR-LST) [GC for 441 SFUN pages..(T=15).GC finished] (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST) DECREMENT-WORSE-THAN-CLK WITH-DECREMENT-WORSE-THAN-CLK WORSE-THAN-BUILTIN-CLOCKED-BODY [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=17).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 451 SFUN 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 EARLIER-ANCESTOR-BIGGERP [GC for 4338 CONS pages..(T=15).GC finished] EQUAL-MOD-COMMUTING ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN ANCESTORS-CHECK :ATTACHMENTS-RECORDED MAP-MULTIPLY-CAR NORMALIZE-ADDEND INSERT-CDR-TERM-ORDER NORMALIZE-LINEAR-SUM-2 [GC for 451 SFUN pages..(T=14).GC finished] NORMALIZE-LINEAR-SUM-1 NORMALIZE-LINEAR-SUM NORMALIZE-LINEAR-SUM-P1 NORMALIZE-LINEAR-SUM-P [GC for 4338 CONS pages..(T=15).GC finished] [GC for 4338 CONS pages..(T=15).GC finished] TYPE-SET-FINISH-1 [GC for 4338 CONS pages..(T=15).GC finished] TYPE-SET-FINISH SEARCH-TYPE-ALIST-REC (FREE-VARSP FREE-VARSP-LST) [GC for 4338 CONS pages..(T=14).GC finished] SEARCH-TYPE-ALIST-WITH-REST SEARCH-TYPE-ALIST TERM-AND-TYP-TO-LOOKUP LOOKUP-HYP BIND-FREE-VARS-TO-UNBOUND-FREE-VARS X-XRUNEP HYP-XRUNE HYP-XRUNE-RUNE CONC-XRUNE CONC-XRUNE-RUNE XRUNE-RUNE RUNE= XRUNE= PRETTYIFY-XRUNE WEAK-ACCP-INFO-P [GC for 4338 CONS pages..(T=15).GC finished] WEAK-ACCP-ENTRY-P MERGE-ACCUMULATED-PERSISTENCE-AUX MERGE-ACCUMULATED-PERSISTENCE-REC [GC for 16384 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] MERGE-ACCUMULATED-PERSISTENCE ADD-ACCUMULATED-PERSISTENCE-S ADD-ACCUMULATED-PERSISTENCE-F ACCUMULATED-PERSISTENCE-MAKE-FAILURES [GC for 4338 CONS pages..(T=15).GC finished] ADD-ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE ACCUMULATED-PERSISTENCE-OOPS SET-ACCUMULATED-PERSISTENCE MERGE-CAR-> MERGE-SORT-CAR-> *ACCP-MAJOR-SEPARATOR* *ACCP-MINOR-SEPARATOR* SHOW-ACCUMULATED-PERSISTENCE-PHRASE0 SHOW-ACCUMULATED-PERSISTENCE-PHRASE1 SHOW-ACCUMULATED-PERSISTENCE-REMOVE-USELESS [GC for 4338 CONS pages..(T=15).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE-KEY SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2-NOT-MERGE SHOW-ACCUMULATED-PERSISTENCE-PHRASE2 SPLIT-XRUNE-ALIST SORT-XRUNE-ALIST-BY-RUNE1 [GC for 4338 CONS pages..(T=16).GC finished] SORT-XRUNE-ALIST-BY-RUNE POP-ACCP-FN POP-ACCP-FN-ITERATE SHOW-ACCUMULATED-PERSISTENCE-LIST [GC for 4338 CONS pages..(T=16).GC finished] SHOW-ACCUMULATED-PERSISTENCE-PHRASE SHOW-ACCUMULATED-PERSISTENCE PUSH-ACCP-FN PUSH-ACCP [GC for 4338 CONS pages..(T=15).GC finished] POP-ACCP WITH-ACCUMULATED-PERSISTENCE [GC for 4338 CONS pages..(T=14).GC finished] [GC for 4348 CONS pages..(T=14).GC finished] [GC for 4358 CONS pages..(T=15).GC finished] [GC for 4368 CONS pages..(T=15).GC finished] ASSUME-TRUE-FALSE-< MV-ATF-2 [GC for 4378 CONS pages..(T=15).GC finished] BINDING-HYP-P ADJUST-IGNORE-FOR-ATF BACKCHAIN-LIMIT-REACHEDP1 BACKCHAIN-LIMIT-REACHEDP NEW-BACKCHAIN-LIMIT ONCEP-TP ONCEP-TP-BUILTIN :ATTACHMENTS-RECORDED STRENGTHEN-RECOG-CALL [GC for 451 SFUN pages..(T=16).GC finished] PUSH-LEMMA? STRONG-RECOGNIZER-EXPR-P [GC for 4378 CONS pages..(T=15).GC finished] RECOGNIZER-EXPR-P PUSH-LEMMA[S] [GC for 4378 CONS pages..(T=15).GC finished] [GC for 4388 CONS pages..(T=15).GC finished] [GC for 4398 CONS pages..(T=15).GC finished] [GC for 4408 CONS pages..(T=15).GC finished] [GC for 4418 CONS pages..(T=15).GC finished] [GC for 4428 CONS pages..(T=15).GC finished] [GC for 4438 CONS pages..(T=15).GC finished] [GC for 4448 CONS pages..(T=15).GC finished] [GC for 4458 CONS pages..(T=15).GC finished] [GC for 4468 CONS pages..(T=16).GC finished] [GC for 4478 CONS pages..(T=16).GC finished] [GC for 4488 CONS pages..(T=15).GC finished] [GC for 4498 CONS pages..(T=15).GC finished] [GC for 4498 CONS pages..(T=15).GC finished] [GC for 4498 CONS pages..(T=15).GC finished] [GC for 4508 CONS pages..(T=16).GC finished] [GC for 4508 CONS pages..(T=16).GC finished] [GC for 4518 CONS pages..(T=16).GC finished] [GC for 4528 CONS pages..(T=15).GC finished] [GC for 4538 CONS pages..(T=15).GC finished] [GC for 4548 CONS pages..(T=16).GC finished] [GC for 4558 CONS pages..(T=15).GC finished] [GC for 4568 CONS pages..(T=15).GC finished] [GC for 4578 CONS pages..(T=15).GC finished] [GC for 4588 CONS pages..(T=14).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=15).GC finished] [GC for 4598 CONS pages..(T=15).GC finished] [GC for 4608 CONS pages..(T=16).GC finished] [GC for 4618 CONS pages..(T=16).GC finished] [GC for 16640 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] [GC for 4628 CONS pages..(T=16).GC finished] [GC for 564 SYMBOL pages..(T=15).GC finished] (TYPE-SET-REC TYPE-SET-LST TYPE-SET-RELIEVE-HYPS-FREE TYPE-SET-RELIEVE-HYPS1 TYPE-SET-RELIEVE-HYPS EXTEND-TYPE-ALIST-WITH-BINDINGS TYPE-SET-WITH-RULE ...) TYPE-SET [GC for 451 SFUN pages..(T=15).GC finished] TYPE-SET-BC ASSUME-TRUE-FALSE-AGGRESSIVE-P :ATTACHMENTS-RECORDED TOP-LEVEL-IF-REDUCE-REC TOP-LEVEL-IF-REDUCE TOP-LEVEL-IF-P TYPE-ALIST-REDUCIBLE-ENTRIES [GC for 451 SFUN pages..(T=14).GC finished] ASSUME-TRUE-FALSE-AGGRESSIVE-1 ASSUME-TRUE-FALSE-AGGRESSIVE ASSUME-TRUE-FALSE ASSUME-TRUE-FALSE-BC OK-TO-FORCE-ENS ADD-LINEAR-ASSUMPTION RETURN-TYPE-ALIST [GC for 451 SFUN pages..(T=15).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 451 SFUN pages..(T=15).GC finished] PUT-ASSOC-EQUAL-TS RECONSIDER-TYPE-ALIST TYPE-ALIST-CLAUSE-FINISH1 TYPE-ALIST-CLAUSE-FINISH TYPE-ALIST-CLAUSE KNOWN-WHETHER-NIL [GC for 451 SFUN pages..(T=15).GC finished] TS-BOOLEANP WEAK-CONS-OCCUR EQUAL-X-CONS-X-YP NOT-IDENT FIRST-IF ALL-VARIABLEP [GC for 451 SFUN pages..(T=15).GC finished] NORMALIZE-WITH-TYPE-SET [GC for 451 SFUN pages..(T=15).GC finished] (NORMALIZE NORMALIZE-LST NORMALIZE-OR-DISTRIBUTE-FIRST-IF DISTRIBUTE-FIRST-IF) DECODE-TYPE-SET1 DECODE-TYPE-SET DTS [GC for 16640 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] ENS Finished loading "type-set-b.lisp". ACL2 loading "linear-b.lisp". "ACL2" [GC for 451 SFUN pages..(T=14).GC finished] POLYS-FROM-TYPE-SET ADD-TYPE-SET-POLYS ADD-POLYNOMIAL-INEQUALITIES ADD-POLYS (EVAL-GROUND-SUBEXPRESSIONS1 EVAL-GROUND-SUBEXPRESSIONS1-LST) EVAL-GROUND-SUBEXPRESSIONS [GC for 451 SFUN pages..(T=15).GC finished] EVAL-GROUND-SUBEXPRESSIONS-LST POLY-SET [GC for 4628 CONS pages..(T=15).GC finished] [GC for 451 SFUN pages..(T=15).GC finished] LINEARIZE1 LINEARIZE LINEARIZE-LST1 [GC for 451 SFUN pages..(T=16).GC finished] LINEARIZE-LST Finished loading "linear-b.lisp". ACL2 loading "non-linear.lisp". "ACL2" CLEANSE-TYPE-ALIST VAR-WITH-DIVISIONP VARIFY VARIFY! VARIFY!-LST1 [GC for 451 SFUN pages..(T=15).GC finished] VARIFY!-LST INVERT-VAR PART-OF1 PART-OF PRODUCT-ALREADY-TRIEDP TOO-MANY-POLYSP [GC for 451 SFUN pages..(T=16).GC finished] EXPANDED-NEW-VARS-IN-POT-LST2 EXPANDED-NEW-VARS-IN-POT-LST1 EXPANDED-NEW-VARS-IN-POT-LST EXTRACT-BOUNDS GOOD-BOUNDS-IN-POT [GC for 451 SFUN pages..(T=15).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 451 SFUN pages..(T=15).GC finished] BINARY-*-LEAVES BINARY-*-TREE MERGE-ARITH-TERM-ORDER INSERT-ARITH-TERM-ORDER SORT-ARITH-TERM-ORDER MULTIPLY-ALIST-AND-CONST [GC for 451 SFUN pages..(T=15).GC finished] COLLECT-RATIONAL-POLY-P-LST Finished loading "non-linear.lisp". ACL2 loading "tau.lisp". "ACL2" ALMOST-LEXORDER-SINGLETONS [GC for 2049 RELOCATABLE-BLOCKS pages..(T=14).GC finished] MEMBER-NIL-NEG-EVGS MEMBER-NEG-EVGS1 MEMBER-NEG-EVGS INSERT-NEG-EVGS1 INSERT-NEG-EVGS [GC for 16640 CONTIGUOUS-BLOCKS pages..(T=17).GC finished] MERGE-CAR-< MERGE-SORT-CAR-< MERGE-CADR-< MERGE-SORT-CADR-< STRIP-CADDRS [GC for 451 SFUN pages..(T=15).GC finished] UNPRETTYIFY/ADD-HYPS-TO-PAIRS UNPRETTYIFY REPRETTYIFY CONVERT-RETURNED-VARS-TO-TERM-LST IMPLICATE [GC for 451 SFUN pages..(T=14).GC finished] WEAK-TYPE-SET-INVERTER-RULE-P *INITIAL-TYPE-SET-INVERTER-RULES* CONVERT-TYPE-SET-TO-TERM-LST CONVERT-TYPE-SET-TO-TERM1 CONVERT-TYPE-SET-TO-TERM CONVERT-TYPE-PRESCRIPTION-TO-TERM [GC for 451 SFUN pages..(T=16).GC finished] ALL-RUNES-IN-VAR-TO-RUNES-ALIST ALL-RUNES-IN-VAR-TO-RUNES-ALIST-LST UNION-EQUAL-REMOVING-DUPLICATES WEAK-SUMMARY-DATA-P MAKE-SUMMARY-DATA [GC for 451 SFUN pages..(T=15).GC finished] [GC for 451 SFUN pages..(T=14).GC finished] (ALL-RUNES-IN-ELIM-SEQUENCE-LST ALL-RUNES-IN-ELIM-SEQUENCE ALL-RUNES-IN-TTREE-FC-DERIVATION-LST ALL-RUNES-IN-TTREE-FIND-EQUATIONAL-POLY-LST ALL-RUNES-SUMMARY-DATA-LST ALL-RUNES-IN-TTREE ALL-RUNES-IN-TTREE-LST) WEAK-TAU-INTERVAL-P *TAU-EMPTY-INTERVAL* TAU-EMPTY-INTERVALP = LOWER-BOUND-> UPPER-BOUND-< TAU-SUBINTERVALP [GC for 461 SFUN pages..(T=15).GC finished] TAU-IMPLIES EMPTY-TAU-INTERVALP SINGLETON-TAU-INTERVALP MAKE-IDENTITY-INTERVAL IDENTITY-INTERVALP DELETE-CONSECUTIVE-INTEGERS-UPWARD DELETE-CONSECUTIVE-INTEGERS-DOWNWARD COLLECT- APPLY-REORDER-HINT ERASE-RW-CACHE-ANY-TAG-FROM-PSPV RESTORE-RW-CACHE-STATE-IN-PSPV WATERFALL1-WRAPPER [GC for 6218 CONS pages..(T=21).GC finished] [GC for 6218 CONS pages..(T=21).GC finished] [GC for 6218 CONS pages..(T=21).GC finished] (WATERFALL1 WATERFALL0-WITH-HINT-SETTINGS WATERFALL0 WATERFALL0-OR-HIT WATERFALL1-LST) WATERFALL [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] SOME-POOL-MEMBER-SUBSUMES ADD-TO-POP-HISTORY POP-CLAUSE1 MAKE-DEFTHM-FORMS-FOR-BYES [GC for 6218 CONS pages..(T=21).GC finished] POP-CLAUSE-MSG1 POP-CLAUSE-MSG SUBSUMED-CLAUSE-IDS-FROM-POP-HISTORY INCREMENT-PROOF-TREE-POP-CLAUSE POP-CLAUSE TILDE-@-ASSUMNOTES-PHRASE-LST [GC for 6218 CONS pages..(T=20).GC finished] TILDE-*-ASSUMNOTES-COLUMN-PHRASE TILDE-@-ASSUMNOTES-PHRASE-LST-GAG-MODE TILDE-*-ASSUMNOTES-COLUMN-PHRASE-GAG-MODE PROCESS-ASSUMPTIONS-MSG1 PROCESS-ASSUMPTIONS-MSG COUNT-ASSUMPTIONS [GC for 541 SFUN pages..(T=22).GC finished] ADD-TYPE-ALIST-RUNES-TO-TTREE1 ADD-TYPE-ALIST-RUNES-TO-TTREE PROCESS-ASSUMPTIONS-TTREE PROCESS-ASSUMPTIONS [GC for 6218 CONS pages..(T=21).GC finished] DO-NOT-INDUCT-MSG PROVE-LOOP2 PROVE-LOOP1 PRINT-SUMMARY-ON-ERROR [GC for 6218 CONS pages..(T=21).GC finished] PROVE-LOOP0 PROVE-LOOP MAKE-PSPV CHK-ASSUMPTION-FREE-TTREE PUSH-CURRENT-ACL2-WORLD [GC for 674 SYMBOL pages..(T=21).GC finished] POP-CURRENT-ACL2-WORLD REVERT-WORLD PROVE Finished loading "prove.lisp". ACL2 loading "defuns.lisp". "ACL2" CERT-DATA-PAIR CERT-DATA-VAL CERT-DATA-ENTRY-PAIR CERT-DATA-ENTRY [GC for 541 SFUN pages..(T=21).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 541 SFUN pages..(T=20).GC finished] TRANSLATE-BODIES1 CHK-NON-EXECUTABLE-BODIES COLLECT-UNTOUCHABLE-FNS COLLECT-UNTOUCHABLE-VARS GET-TRANSLATE-CERT-DATA-RECORD [GC for 541 SFUN pages..(T=21).GC finished] GET-TRANSLATE-BODIES [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] TRANSLATE-BODIES CHK-MUTUAL-RECURSION-BAD-NAMES *CHK-MUTUAL-RECURSION-STRING* CHK-MUTUAL-RECURSION1 CHK-MUTUAL-RECURSION [GC for 541 SFUN pages..(T=20).GC finished] (FFNNAMEP-MOD-MBE FFNNAMEP-MOD-MBE-LST) PUTPROP-RECURSIVEP-LST PROPER-DUMB-OCCUR-AS-OUTPUT ALWAYS-TESTED-AND-CHANGEDP GUESS-MEASURE GUESS-MEASURE-ALIST [GC for 541 SFUN pages..(T=20).GC finished] TILDE-*-MEASURE-PHRASE1 TILDE-*-MEASURE-PHRASE FIND-?-MEASURE [GC for 6218 CONS pages..(T=21).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=20).GC finished] PROVE-TERMINATION PUTPROP-JUSTIFICATION-LST UNION-EQUAL-TO-END [GC for 6228 CONS pages..(T=20).GC finished] CROSS-TESTS-AND-CALLS3 CROSS-TESTS-AND-CALLS2 CROSS-TESTS-AND-CALLS1 SUBLIS-TESTS-REV ALL-CALLS-TEST-ALIST CROSS-TESTS-AND-CALLS [GC for 541 SFUN pages..(T=20).GC finished] MARK-LOOP$-RECURSION-NUGGET MARKED-LOOP$-RECURSION-NUGGETP (INDUCTION-MACHINE-FOR-FN1 INDUCTION-MACHINE-FOR-FN1-LST) SIMPLIFY-TESTS-AND-CALLS [GC for 541 SFUN pages..(T=21).GC finished] SIMPLIFY-TESTS-AND-CALLS-LST (LOOP$-RECURSION-FFNNAMEP LOOP$-RECURSION-FFNNAMEP-LST) INDUCTION-MACHINE-FOR-FN CLEAN-UP-NOTS CLEAN-UP-NOTS-LST [GC for 541 SFUN pages..(T=22).GC finished] CLEAN-UP-CONJUNCTION1 CLEAN-UP-CONJUNCTION CLEAN-UP-LOOP$-RECURSION-INDUCTION-MACHINE INDUCTION-MACHINES PUTPROP-INDUCTION-MACHINE-LST QUICK-BLOCK-INITIAL-SETTINGS [GC for 541 SFUN pages..(T=21).GC finished] QUICK-BLOCK-INFO1 QUICK-BLOCK-INFO2 [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] QUICK-BLOCK-SETTINGS QUICK-BLOCK-DOWN-T-MACHINE QUICK-BLOCK-INFO PUTPROP-QUICK-BLOCK-INFO-LST BIG-MUTREC GET-SIG-FNS1 GET-SIG-FNS [GC for 541 SFUN pages..(T=22).GC finished] SELECTED-ALL-FNNAMES-LST SUBVERSIVEP SUBVERSIVE-CLIQUEP PROVE-TERMINATION-NON-RECURSIVE [GC for 6228 CONS pages..(T=22).GC finished] PROVE-TERMINATION-RECURSIVE PUT-INDUCTION-INFO-RECURSIVE MAYBE-WARN-OR-ERROR-ON-NON-REC-MEASURE COLLECT-PROBLEMATIC-QUOTED-FNS [GC for 541 SFUN pages..(T=21).GC finished] MAYBE-WARN-ON-PROBLEMATIC-QUOTED-FNS PUT-INDUCTION-INFO DESTRUCTURE-DEFINITION MEMBER-REWRITE-RULE-RUNE [GC for 541 SFUN pages..(T=22).GC finished] REPLACE-REWRITE-RULE-RUNE PREPROCESS-HYP PREPROCESS-HYPS ADD-DEFINITION-RULE-WITH-TTREE ADD-DEFINITION-RULE PUTPROP-BODY-LST [GC for 541 SFUN pages..(T=21).GC finished] TYPE-SET-IMPLIED-BY-TERM1 TYPE-SET-IMPLIED-BY-TERM PUTPROP-INITIAL-TYPE-PRESCRIPTIONS MAP-RETURNED-FORMALS-VIA-FORMALS MAP-TYPE-SETS-VIA-FORMALS VECTOR-TS-UNION MAP-CONS-TAG-TREES [GC for 6238 CONS pages..(T=21).GC finished] TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE1 TYPE-SET-AND-RETURNED-FORMALS-WITH-RULE [GC for 6248 CONS pages..(T=22).GC finished] TYPE-SET-AND-RETURNED-FORMALS-WITH-RULES [GC for 6258 CONS pages..(T=22).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 6268 CONS pages..(T=20).GC finished] (GUARDED-TERMP GUARDED-TERM-LISTP) [GC for 6268 CONS pages..(T=21).GC finished] CONJOIN-TYPE-PRESCRIPTIONS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] CLEANSE-TYPE-PRESCRIPTIONS GUESS-AND-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE GET-NORMALIZED-BODIES CERT-DATA-PUTPROP-TYPE-PRESCRIPTION-LST-FOR-CLIQUE PUTPROP-TYPE-PRESCRIPTION-LST PUTPROP-LEVEL-NO-LST [GC for 6278 CONS pages..(T=22).GC finished] PRIMITIVE-RECURSIVE-ARGP PRIMITIVE-RECURSIVE-CALLP PRIMITIVE-RECURSIVE-CALLSP PRIMITIVE-RECURSIVE-MACHINEP PUTPROP-PRIMITIVE-RECURSIVE-DEFUNP-LST [GC for 102 CFUN pages..(T=23).GC finished] MAKE-CONTROLLER-POCKET MAKE-CONTROLLER-ALIST1 MAKE-CONTROLLER-ALIST MAX-NUME-EXCEEDED-ERROR PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS1 PUTPROP-DEFUN-RUNIC-MAPPING-PAIRS PRINT-VERIFY-GUARDS-MSG COLLECT-IDEALS COLLECT-NON-IDEALS [GC for 551 SFUN pages..(T=21).GC finished] COLLECT-NON-COMMON-LISP-COMPLIANTS ALL-FNNAMES1-EXEC ALL-FNNAMES-EXEC COLLECT-GUARDS-AND-BODIES CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS-CMP CHK-COMMON-LISP-COMPLIANT-SUBFUNCTIONS CHK-ACCEPTABLE-VERIFY-GUARDS-FORMULA-CMP GUARD-SIMPLIFY-MSG GUARD-SIMPLIFY-P [GC for 6288 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-VERIFY-GUARDS-CMP CHK-ACCEPTABLE-VERIFY-GUARDS GUARD-OBLIGATION-CLAUSES [GC for 6298 CONS pages..(T=21).GC finished] GUARD-OBLIGATION PROVE-GUARD-CLAUSES-MSG VERIFY-GUARDS-FORMULA-FN VERIFY-GUARDS-FORMULA [GC for 6308 CONS pages..(T=21).GC finished] PROVE-GUARD-CLAUSES MAYBE-REMOVE-INVARIANT-RISK VERIFY-GUARDS-FN1 CONVERT-RUNES-TO-UNORDERED-MAPPING-PAIRS AUGMENT-THEORY-WEAK [GC for 6318 CONS pages..(T=21).GC finished] WITH-USELESS-RUNES-AUX [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] 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 USELESS-RUNES-REPORT-P [GC for 551 SFUN pages..(T=21).GC finished] PRINT-USELESS-RUNES-TUPLES-REC PRINT-USELESS-RUNES-TUPLES [GC for 2049 RELOCATABLE-BLOCKS pages..(T=22).GC finished] PRINT-USELESS-RUNES AUGMENTED-RUNES-AFTER-1 AUGMENTED-RUNES-AFTER EXTEND-SET-DIFFERENCE-THEORIES USELESS-RUNES-ENS WITH-USELESS-RUNES [GC for 6318 CONS pages..(T=20).GC finished] VERIFY-GUARDS-FN *SUPER-DEFUN-WART-TABLE* PROJECT-OUT-COLUMNS-I-AND-J *SUPER-DEFUN-WART-BINDING-ALIST* *SUPER-DEFUN-WART-STOBJS-IN-ALIST* SUPER-DEFUN-WART-BINDINGS STORE-STOBJS-INS STORE-SUPER-DEFUN-WARTS-STOBJS-IN COLLECT-OLD-NAMEPS PUT-INVARIANT-RISK1 STOBJS-GUARD-ONLY-LST [GC for 6328 CONS pages..(T=21).GC finished] STOBJS-GUARD-ONLY REMOVE-GUARD-T *BOOT-STRAP-INVARIANT-RISK-ALIST* PUT-INVARIANT-RISK DEFUNS-FN-SHORT-CUT PRINT-DEFUN-MSG/COLLECT-TYPE-PRESCRIPTIONS PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS1 PRINT-DEFUN-MSG/TYPE-PRESCRIPTIONS SIMPLE-SIGNATUREP [GC for 551 SFUN pages..(T=21).GC finished] ALL-SIMPLE-SIGNATURESP PRINT-DEFUN-MSG/SIGNATURES1 PRINT-DEFUN-MSG/SIGNATURES PRINT-DEFUN-MSG GET-IGNORES GET-IGNORABLES [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=25).GC finished] IRRELEVANT-VARS GET-IRRELEVANTS CHK-ALL-STOBJ-NAMES GET-DECLARED-STOBJ-NAMES GET-STOBJS-IN-LST CHK-STOBJS-OUT-BOUND STORE-STOBJS-OUT [GC for 6328 CONS pages..(T=20).GC finished] UNPARSE-SIGNATURE CHK-DEFUN-MODE SCAN-TO-CLTL-COMMAND DCL-FIELDS1 DCL-FIELDS SET-EQUALP-EQ [GC for 551 SFUN pages..(T=23).GC finished] NON-IDENTICAL-DEFP-CHK-MEASURES NON-IDENTICAL-DEFP IDENTICAL-DEFP [GC for 6338 CONS pages..(T=22).GC finished] REDUNDANT-OR-RECLASSIFYING-DEFUNP0 REDUNDANT-OR-RECLASSIFYING-DEFUNP REDUNDANT-OR-RECLASSIFYING-DEFUNSP10 REDUNDANT-OR-RECLASSIFYING-DEFUNSP1 RECOVER-DEFS-LST [GC for 684 SYMBOL pages..(T=20).GC finished] GET-CLIQUE REDUNDANT-OR-RECLASSIFYING-DEFUNSP0 STRIP-LAST-ELEMENTS REDUNDANT-OR-RECLASSIFYING-DEFUNSP COLLECT-WHEN-CADR-EQ ALL-PROGRAMP FORMAL-POSITION [GC for 551 SFUN pages..(T=20).GC finished] MAKE-POSNS (RELEVANT-POSNS-TERM RELEVANT-POSNS-TERM-LST RELEVANT-POSNS-CALL) RELEVANT-POSNS-CLIQUE1 RELEVANT-POSNS-CLIQUE-RECUR RELEVANT-POSNS-CLIQUE-INIT [GC for 551 SFUN pages..(T=22).GC finished] (RELEVANT-POSNS-LAMBDAS RELEVANT-POSNS-LAMBDAS-LST) [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] RELEVANT-POSNS-MERGE RELEVANT-POSNS-LAMBDAS-TOP RELEVANT-POSNS-CLIQUE IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE2 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE1 IRRELEVANT-NON-LAMBDA-SLOTS-CLIQUE TILDE-*-IRRELEVANT-FORMALS-MSG1 [GC for 551 SFUN pages..(T=21).GC finished] TILDE-*-IRRELEVANT-FORMALS-MSG MISSING-IRRELEVANT-SLOTS1 MISSING-IRRELEVANT-SLOTS FIND-SLOT BOGUS-IRRELEVANTS-ALIST2 BOGUS-IRRELEVANTS-ALIST1 BOGUS-IRRELEVANTS-ALIST TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG1 [GC for 551 SFUN pages..(T=22).GC finished] TILDE-*-BOGUS-IRRELEVANTS-ALIST-MSG CHK-IRRELEVANT-FORMALS-MSG CHK-IRRELEVANT-FORMALS CHK-LOGIC-SUBFUNCTIONS COLLECT-UNBADGED CHK-BADGED-QUOTED-SUBFUNCTIONS UNION-COLLECT-NON-X [GC for 551 SFUN pages..(T=20).GC finished] TRANSLATE-MEASURES REDUNDANT-PREDEFINED-ERROR-MSG CHK-ACCEPTABLE-DEFUNS-REDUNDANCY CHK-ACCEPTABLE-DEFUNS-VERIFY-GUARDS-ER CHK-NON-EXECUTABLEP [GC for 6348 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-DEFUNS0 GET-BOOLEAN-UNAMBIGUOUS-XARGS-FLG-LST GET-IRRELEVANTS-ALIST RAW-LAMBDA$S-TO-LAMBDAS *DEFAULT-STATE-VARS* CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS1 CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS2 [GC for 6358 CONS pages..(T=20).GC finished] CHK-ACCEPTABLE-LAMBDA$-TRANSLATIONS WEAK-LOOP$-ALIST-ENTRY-P LOOP$-ALIST-TERM *PRIMITIVE-UNTRANSLATE-ALIST* [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).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 551 SFUN pages..(T=21).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 6368 CONS 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 [GC for 551 SFUN pages..(T=21).GC finished] (REMOVE-LAMBDAS1 REMOVE-LAMBDAS-LST) REMOVE-LAMBDAS TYPE-PRESCRIPTION-DISJUNCTP TYPE-PRESCRIPTION-CONCLP SUBST-NIL-INTO-TYPE-PRESCRIPTION-DISJUNCT SUBST-NIL-INTO-TYPE-PRESCRIPTION-CONCL UNPRETTYIFY-TP [GC for 6378 CONS pages..(T=21).GC finished] DESTRUCTURE-TYPE-PRESCRIPTION GET-XARGS-TYPE-PRESCRIPTION-LST [GC for 6388 CONS pages..(T=21).GC finished] CHK-TYPE-PRESCRIPTION-LST GLOBAL-STOBJS-PROP [GC for 6398 CONS pages..(T=20).GC finished] [GC for 6408 CONS pages..(T=21).GC finished] [GC for 6418 CONS pages..(T=21).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=21).GC finished] CHK-ACCEPTABLE-DEFUNS1 CONDITIONALLY-MEMOIZED-FNS [GC for 6428 CONS pages..(T=22).GC finished] [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] CHK-ACCEPTABLE-DEFUNS UNION-EQ1-REV COLLECT-HEREDITARILY-CONSTRAINED-FNNAMES PUTPROP-HEREDITARILY-CONSTRAINED-FNNAMES-LST [GC for 6428 CONS pages..(T=22).GC finished] DEFUNS-FN1 DEFUNS-FN0 STRIP-NON-HIDDEN-PACKAGE-NAMES IN-PACKAGE-FN [GC for 6438 CONS pages..(T=23).GC finished] DEFSTOBJ-FUNCTIONSP INDEX-OF-NON-NUMBER MAKE-UDF-INSIGS INTRO-UDF INTRO-UDF-LST1 [GC for 551 SFUN pages..(T=21).GC finished] INTRO-UDF-LST2 INTRO-UDF-LST DEFUN-CTX INSTALL-EVENT-DEFUNS [GC for 6438 CONS pages..(T=20).GC finished] DEFUNS-FN DEFUN-FN ARGS-FN ARGS MAKE-VERIFY-TERMINATION-DEF [GC for 551 SFUN pages..(T=20).GC finished] MAKE-VERIFY-TERMINATION-DEFS-LST CHK-ACCEPTABLE-VERIFY-TERMINATION1 UNIFORM-DEFUN-MODES CHK-ACCEPTABLE-VERIFY-TERMINATION [GC for 551 SFUN pages..(T=22).GC finished] VERIFY-TERMINATION1 VERIFY-TERMINATION-BOOT-STRAP-FN1 VERIFY-TERMINATION-BOOT-STRAP-FN WHEN-LOGIC3 VERIFY-TERMINATION-FN FNS-USED-IN-AXIOMS CHECK-OUT-INSTANTIABLEP1 [GC for 551 SFUN pages..(T=21).GC finished] 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 [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] 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 WEAK-GOAL-P *GOAL-FIELDS* CONC HYPS CURRENT-ADDR GOAL-NAME DEPENDS-ON MAKE-OFFICIAL-PC-COMMAND [GC for 551 SFUN pages..(T=21).GC finished] INTERN-IN-KEYWORD-PACKAGE MAKE-PRETTY-PC-COMMAND MAKE-PRETTY-PC-INSTR CHANGE-PC-STATE MAKE-OFFICIAL-PC-INSTR CHECK-FORMALS-LENGTH CHECK-&OPTIONAL-AND-&REST MAKE-LET-PAIRS-FROM-FORMALS [GC for 6448 CONS pages..(T=21).GC finished] (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 6458 CONS pages..(T=21).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 6468 CONS pages..(T=21).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 [GC for 6478 CONS pages..(T=22).GC finished] CURRENT-ALL-DEPS MAYBE-PRINT-PROVED-GOAL-MESSAGE [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] ACCUMULATE-TTREE-IN-PC-STATE PC-PROCESS-ASSUMPTIONS MAKE-IMPLICATION CL-SET-TO-IMPLICATIONS KNOWN-ASSUMPTIONS ADD-ASSUMPTIONS-TO-TOP-GOAL UNPROVED-GOALS MAKE-PC-ENS [GC for 694 SYMBOL pages..(T=23).GC finished] INITIAL-RCNST-FROM-ENS MAKE-NEW-GOALS-FIXED-HYPS [GC for 6488 CONS pages..(T=23).GC finished] [GC for 6498 CONS pages..(T=24).GC finished] PC-SINGLE-STEP-PRIMITIVE [GC for 6508 CONS pages..(T=23).GC finished] MAYBE-PRINT-MACROEXPANSION PC-SINGLE-STEP-1 UNION-LASTN-PC-TAG-TREES [GC for 6508 CONS pages..(T=22).GC finished] PC-SINGLE-STEP *PC-COMPLETE-SIGNAL* PRINT-RE-ENTERING-PROOF-BUILDER CHK-ABSSTOBJ-INVARIANTS [GC for 6508 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 PC-MAIN PC-TOP [GC for 6518 CONS pages..(T=21).GC finished] (ILLEGAL-FNP ILLEGAL-FNP-LIST) VERIFY-FN [GC for 6518 CONS pages..(T=20).GC finished] PRINT-UNPROVED-GOALS-MESSAGE STATE-STACK-FROM-INSTRUCTIONS STATE-FROM-INSTRUCTIONS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] PRINT-PC-DEFTHM PRINT-PC-GOAL PRINT-PC-STATE 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 561 SFUN pages..(T=21).GC finished] FORM-OF-REWRITE-QUOTED-CONSTANT-RULE INTERPRET-TERM-AS-REWRITE-RULE2 [GC for 6518 CONS pages..(T=21).GC finished] INTERPRET-TERM-AS-REWRITE-RULE1 INTERPRET-TERM-AS-REWRITE-RULE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=20).GC finished] (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 (SURROUNDING-FNS1 SURROUNDING-FNS-LST) [GC for 561 SFUN pages..(T=20).GC finished] SURROUNDING-FNS LOOP-STOPPER1 LOOP-STOPPER REMOVE-IRRELEVANT-LOOP-STOPPER-PAIRS PUT-MATCH-FREE-VALUE FREE-VARS-IN-HYPS FREE-VARS-IN-HYPS-SIMPLE [GC for 561 SFUN pages..(T=21).GC finished] FREE-VARS-IN-FC-HYPS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] FREE-VARS-IN-HYPS-CONSIDERING-BIND-FREE ALL-VARS-IN-HYPS MATCH-FREE-VALUE MATCH-FREE-FC-VALUE RULE-BACKCHAIN-LIMIT-LST CREATE-REWRITE-RULE HYPS-THAT-INSTANTIATE-FREE-VARS [GC for 561 SFUN pages..(T=21).GC finished] (MAYBE-ONE-WAY-UNIFY MAYBE-ONE-WAY-UNIFY-LST) MAYBE-ONE-WAY-UNIFY-WITH-SOME MAYBE-SUBSUMES SUBSUMES-REWRITE-RULE FIND-SUBSUMED-RULE-NAMES FIND-SUBSUMING-RULE-NAMES [GC for 6528 CONS pages..(T=21).GC finished] FORCED-HYPS STRIP-TOP-LEVEL-NOTS-AND-FORCES FREE-VARIABLE-ERROR? EXTEND-GENEQV-ALIST (COVERED-GENEQV-ALIST COVERED-GENEQV-ALIST-LST) UNCOVERED-EQUIVS [GC for 561 SFUN pages..(T=21).GC finished] (UNCOVERED-EQUIVS-ALIST UNCOVERED-EQUIVS-ALIST-LST) DOUBLE-REWRITE-OPPORTUNITIES SHOW-DOUBLE-REWRITE-OPPORTUNITIES1 SHOW-DOUBLE-REWRITE-OPPORTUNITIES [GC for 6538 CONS pages..(T=21).GC finished] IRRELEVANT-LOOP-STOPPER-PAIRS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] NON-REC-DEF-RULES-MSG-1 NON-REC-DEF-RULES-MSG [GC for 6548 CONS pages..(T=22).GC finished] CHK-REWRITE-RULE-WARNINGS CHK-ACCEPTABLE-REWRITE-RULE2 CHK-ACCEPTABLE-REWRITE-RULE1 CHK-ACCEPTABLE-REWRITE-RULE ADD-REWRITE-RULE2 ADD-REWRITE-RULE1 [GC for 561 SFUN 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 ALWAYS-BIGGERP [GC for 561 SFUN pages..(T=21).GC finished] NO-ELEMENT-ALWAYS-BIGGERP MAXIMAL-TERMS1 MAXIMAL-TERMS COLLECT-WHEN-FFNNAMESP MAKE-FREE-MAX-TERMS-MSG1 MAKE-FREE-MAX-TERMS-MSG [GC for 561 SFUN pages..(T=22).GC finished] EXTERNAL-LINEARIZE BAD-SYNP-HYP-MSG-FOR-LINEAR SHOW-DOUBLE-REWRITE-OPPORTUNITIES-LINEAR NO-LINEAR-MSG [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] ALL-NON-NUMERIC CHK-ACCEPTABLE-LINEAR-RULE2 CHK-ACCEPTABLE-LINEAR-RULE1 CHK-ACCEPTABLE-LINEAR-RULE [GC for 6558 CONS pages..(T=22).GC finished] ADD-LINEAR-RULE3 ADD-LINEAR-RULE2 ADD-LINEAR-RULE1 ADD-LINEAR-RULE [GC for 6568 CONS pages..(T=21).GC finished] DESTRUCTURE-WELL-FOUNDED-RELATION-RULE [GC for 6578 CONS pages..(T=22).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 561 SFUN pages..(T=21).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 MAKE-BUILT-IN-CLAUSE-RULES [GC for 561 SFUN pages..(T=21).GC finished] CLASSIFY-AND-STORE-BUILT-IN-CLAUSE-RULES ADD-BUILT-IN-CLAUSE-RULE [GC for 6578 CONS pages..(T=21).GC finished] DESTRUCTURE-COMPOUND-RECOGNIZER [GC for 6588 CONS pages..(T=20).GC finished] MAKE-RECOGNIZER-TUPLE [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] COMMENT-ON-NEW-RECOG-TUPLE1 COMMENT-ON-NEW-RECOG-TUPLE [GC for 6598 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-COMPOUND-RECOGNIZER-RULE ADD-COMPOUND-RECOGNIZER-RULE CHK-TRIGGERS DESTRUCTURE-FORWARD-CHAINING-TERM CHK-ACCEPTABLE-FORWARD-CHAINING-RULE [GC for 561 SFUN pages..(T=21).GC finished] PUTPROP-FORWARD-CHAINING-RULES-LST ADD-FORWARD-CHAINING-RULE EVALUATOR-CLAUSE/ARGLIST EVALUATOR-CLAUSE EVALUATOR-CLAUSES1 EVALUATOR-CLAUSES [GC for 561 SFUN pages..(T=23).GC finished] CDRP EXPAND-EQ-AND-ATOM-TERM-LST NORMALIZE-ALLEGED-EVALUATOR-CLAUSE NORMALIZE-ALLEGED-EVALUATOR-CLAUSE-SET SHALLOW-CLAUSIFY1 SHALLOW-CLAUSIFY [GC for 6608 CONS pages..(T=21).GC finished] FIND-EVFN-LST-IN-CLAUSE GUESS-EVFN-LST-FOR-EVFN FIND-FN-IN-CLAUSE GUESS-FN-ARGS-LST-FOR-EVFN [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=26).GC finished] NORMALIZED-EVALUATOR-CL-SET [GC for 2049 RELOCATABLE-BLOCKS pages..(T=22).GC finished] CHK-EVALUATOR NAMEDP-PREFIX DEFEVALUATOR-FORM/DEFTHM-NAME DEFEVALUATOR-FORM/DEFTHM-HINTS DEFEVALUATOR-FORM/DEFTHM [GC for 561 SFUN pages..(T=21).GC finished] DEFEVALUATOR-FORM/DEFTHMS CAR-CADR-CADDR-ETC DEFEVALUATOR-FORM/FNS-CLAUSES *DEFEVALUATOR-FORM-BASE-THEORY* DEFEVALUATOR-FORM PAIRS-TO-MACRO-ALIAS-MSGS [GC for 561 SFUN pages..(T=21).GC finished] DEFEVALUATOR-CHECK-MSG DEFEVALUATOR-CHECK DEFEVALUATOR-CHECK-FORM DEFEVALUATOR TERM-TABLE TERM-TABLE REMOVE-META-EXTRACT-CONTEXTUAL-HYPS REMOVE-META-EXTRACT-GLOBAL-HYPS [GC for 561 SFUN pages..(T=21).GC finished] META-RULE-HYPOTHESIS-FUNCTIONS META-FN-ARGS CHK-META-FUNCTION EV-LST-FROM-EV ATTACHED-FNS [GC for 561 SFUN pages..(T=23).GC finished] SIBLINGS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).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 6618 CONS pages..(T=21).GC finished] CHK-EVALUATOR-USE-IN-RULE CHK-RULE-FN-GUARD ADD-NEW-NEVER-UNTOUCHABLE-FNS COLLECT-NEVER-UNTOUCHABLE-FNS-ENTRIES [GC for 6628 CONS pages..(T=22).GC finished] INTERPRET-TERM-AS-META-RULE [GC for 6638 CONS pages..(T=20).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 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] (DESTRUCTORS DESTRUCTORS-LST) STRIP-FFN-SYMBS CHK-ACCEPTABLE-ELIM-RULE1 CHK-ACCEPTABLE-ELIM-RULE ADD-ELIM-RULE1 ADD-ELIM-RULE [GC for 704 SYMBOL pages..(T=22).GC finished] CHK-ACCEPTABLE-GENERALIZE-RULE 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 [GC for 6648 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-TYPE-PRESCRIPTION-RULE FIX-PKG FIX-INTERN$ FIX-INTERN-IN-PKG-OF-SYM PACK-TO-STRING GEN-SYM-SYM BOOLEAN-FN [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] REFLEXIVITY SYMMETRY TRANSITIVITY EQUIVALENCE-RELATION-CONDITION FIND-CANDIDATE-EQUIVALENCE-RELATION COLLECT-PROBLEMATIC-PRE-EQUIVALENCE-RULE-NAMES CHK-ACCEPTABLE-EQUIVALENCE-RULE [GC for 6658 CONS pages..(T=22).GC finished] ADD-EQUIVALENCE-RULE CHK-ACCEPTABLE-REFINEMENT-RULE COLLECT-COARSENINGS PUTPROP-COARSENINGS UNION-VALUES EXTEND-VALUE-SET EXTEND-EACH-VALUE-SET CLOSE-VALUE-SETS [GC for 571 SFUN pages..(T=23).GC finished] ADD-REFINEMENT-RULE CORRESPONDING-ARGS-EQ-EXCEPT (DUPLICATE-VARS-1 DUPLICATE-VARS-1-LST) DUPLICATE-VARS [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] (REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1 REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR-1-LST) REPLACE-DUPLICATE-VARS-WITH-ANONYMOUS-VAR SPLIT-AT-POSITION MAKE-PEQUIV-PATTERN MAKE-PEQUIV (VAR-ADDRESS VAR-ADDRESS-LST) [GC for 6668 CONS pages..(T=22).GC finished] INTERPRET-TERM-AS-CONGRUENCE-RULE SOME-CONGRUENCE-RULE-SAME SOME-CONGRUENCE-RULE-HAS-REFINEMENT [GC for 6678 CONS pages..(T=22).GC finished] CHK-ACCEPTABLE-CONGRUENCE-RULE ADD-CONGRUENCE-RULE-TO-CONGRUENCE CONS-ASSOC-EQ-REC CONS-ASSOC-EQ [GC for 6688 CONS pages..(T=22).GC finished] ADD-CONGRUENCE-RULE CHK-DESTRUCTURE-DEFINITION CHK-ACCEPTABLE-DEFINITION-INSTALL-BODY CHK-ACCEPTABLE-DEFINITION-RULE CHK-ACCEPTABLE-INDUCTION-RULE [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] ADD-INDUCTION-RULE CHK-ACCEPTABLE-TYPE-SET-INVERTER-RULE ADD-TYPE-SET-INVERTER-RULE TILDE-@-ILLEGAL-CLAUSE-PROCESSOR-SIG-MSG DESTRUCTURE-CLAUSE-PROCESSOR-RULE [GC for 6698 CONS pages..(T=21).GC finished] CHK-ACCEPTABLE-CLAUSE-PROCESSOR-RULE ADD-CLAUSE-PROCESSOR-RULE TRUSTED-CL-PROC-TABLE-GUARD TRUSTED-CL-PROC-TABLE DEFINE-TRUSTED-CLAUSE-PROCESSOR PRIMITIVE-INSTRUCTIONP NON-PRIMITIVE-INSTRUCTIONS CHK-PRIMITIVE-INSTRUCTION-LISTP [GC for 571 SFUN pages..(T=22).GC finished] TRANSLATE-INSTRUCTIONS CONTROLLER-ALISTP ALIST-TO-KEYWORD-ALIST ELIMINATE-MACRO-ALIASES FIX-LOOP-STOPPER-ALIST GUESS-CONTROLLER-ALIST-FOR-DEFINITION-RULE CHK-LEGAL-LINEAR-TRIGGER-TERMS1 [GC for 571 SFUN pages..(T=23).GC finished] [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] CHK-LEGAL-LINEAR-TRIGGER-TERMS BACKCHAIN-LIMIT-LISTP RECOVER-METAFUNCTION-OR-CLAUSE-PROCESSOR-SIGNATURES EQUAL-EXCEPT-ON-NON-STOBJS ARITY-ALISTP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=23).GC finished] COMPATIBLE-ARITY-ALISTSP COLLECT-DISAGREEING-ARITY-ASSUMPTIONS [GC for 6698 CONS pages..(T=23).GC finished] [GC for 6708 CONS pages..(T=23).GC finished] [GC for 6718 CONS pages..(T=24).GC finished] [GC for 6728 CONS pages..(T=23).GC finished] [GC for 18176 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] INTERPRET-TERM-AS-WELL-FORMEDNESS-GUARANTEE-THM TRANSLATE-WELL-FORMEDNESS-GUARANTEE [GC for 6738 CONS pages..(T=22).GC finished] [GC for 6738 CONS pages..(T=22).GC finished] [GC for 6748 CONS pages..(T=22).GC finished] [GC for 6758 CONS pages..(T=22).GC finished] TRANSLATE-RULE-CLASS-ALIST [GC for 6768 CONS pages..(T=22).GC finished] TRANSLATE-RULE-CLASS1 REASON-FOR-NON-KEYWORD-VALUE-LISTP TRANSLATE-RULE-CLASS TRANSLATE-RULE-CLASSES1 TRANSLATE-RULE-CLASSES CHK-ACCEPTABLE-X-RULE [GC for 571 SFUN pages..(T=23).GC finished] CHK-ACCEPTABLE-X-RULES COLLECT-KEYS-EQ CHK-ACCEPTABLE-RULES ADD-X-RULE ADD-RULES1 TRUNCATE-CLASS-ALIST [GC for 571 SFUN pages..(T=23).GC finished] TRUNCATE-CLASSES MAKE-RUNES1 MAKE-RUNES MAKE-RUNIC-MAPPING-PAIRS ADD-RULES REDUNDANT-THEOREMP NON-TAUTOLOGICAL-CLASSES [GC for 571 SFUN pages..(T=23).GC finished] PROVE-COROLLARIES1 PROVE-COROLLARIES ENABLED-RUNEP-STRING UNTRANSLATE-HYPS [GC for 6768 CONS pages..(T=24).GC finished] INFO-FOR-LEMMAS ASSOC-EQ-EQ INFO-FOR-WELL-FOUNDED-RELATION-RULES INFO-FOR-BUILT-IN-CLAUSE-RULES1 [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] INFO-FOR-BUILT-IN-CLAUSE-RULES INFO-FOR-COMPOUND-RECOGNIZER-RULES INFO-FOR-GENERALIZE-RULES INFO-FOR-LINEAR-LEMMAS INFO-FOR-ELIMINATE-DESTRUCTORS-RULE [GC for 571 SFUN pages..(T=23).GC finished] INFO-FOR-CONGRUENCES INFO-FOR-PEQUIVS INFO-FOR-COARSENINGS INFO-FOR-FORWARD-CHAINING-RULES DECODE-TYPE-SET-LST INFO-FOR-TYPE-PRESCRIPTIONS [GC for 571 SFUN pages..(T=23).GC finished] INFO-FOR-INDUCTION-RULES INFO-FOR-TYPE-SET-INVERTER-RULES INFO-FOR-X-RULES INFO-FOR-RULES PRINT-INFO-FOR-RULES-ENTRY PRINT-INFO-FOR-RULES [GC for 571 SFUN pages..(T=23).GC finished] REPLACE-PROP RESTRICT-PKG-IMPORTS PR-BODY PR-FN PRINT-CLAUSE-PROCESSOR-RULES1 PRINT-CLAUSE-PROCESSOR-RULES NEW-NUMES [GC for 571 SFUN pages..(T=24).GC finished] WORLD-TO-NEXT-COMMAND PR!-FN PR PR! DISABLEDP-FN-LST DISABLEDP-FN DISABLEDP COLLECT-ABBREVIATION-SUBCLASS [GC for 571 SFUN pages..(T=22).GC finished] RUNES-TO-MONITOR1 *MONITORABLE-RUNE-TYPES* [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] MONITORABLE-RUNES MONITORABLE-RUNES-FROM-MAPPING-PAIRS RUNES-TO-MONITOR REMOVE1-ASSOC-EQUAL? REMOVE1-ASSOC-EQUAL?-LST MONITOR1 [GC for 571 SFUN pages..(T=21).GC finished] REMOVE1-ASSOC-EQUAL-LST SET-DIFFERENCE-ASSOC-EQUAL UNMONITOR1 MONITOR-FN [GC for 571 SFUN pages..(T=23).GC finished] UNMONITOR-FN MONITORED-RUNES-FN BRR-FN BRR MONITOR! BRR@ MONITOR UNMONITOR MONITORED-RUNES PROCEED-FROM-BRKPT1 [GC for 571 SFUN pages..(T=21).GC finished] EXIT-BRR OK-IF-FN OK-IF PRINT-RULE-STORAGE-DEPENDENCIES DEFAXIOM-SUPPORTERS WHEN-LOGIC-OR-BOOT-STRAP [GC for 6768 CONS pages..(T=22).GC finished] DEFAXIOM-FN WARN-ON-INAPPROPRIATE-DEFUN-MODE WITH-WATERFALL-PARALLELISM-TIMINGS TRANSLATE-FOR-DEFTHM [GC for 6778 CONS pages..(T=23).GC finished] [GC for 6788 CONS pages..(T=24).GC finished] [GC for 6798 CONS pages..(T=25).GC finished] DEFTHM-FN1 DEFTHM-FN [GC for 6808 CONS pages..(T=21).GC finished] THM-FN THM CHK-EXTENSIBLE-RULE-CLASSES EXTEND-RULE-CLASSES *DEFEQUIV-PACKAGE-VALUES* DEFEQUIV-FORM [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] DEFEQUIV-FN DEFEQUIV *DEFREFINEMENT-PACKAGE-VALUES* DEFREFINEMENT-FORM [GC for 2049 RELOCATABLE-BLOCKS pages..(T=22).GC finished] DEFREFINEMENT-FN DEFREFINEMENT *DEFCONG-PACKAGE-VALUES* DEFCONG-FORM DEFCONG-FN DEFCONG Finished loading "defthm.lisp". ACL2 loading "other-events.lisp". "ACL2" [GC for 571 SFUN pages..(T=21).GC finished] MACRO-VARS-KEY MACRO-VARS-AFTER-REST MACRO-VARS-OPTIONAL MACRO-VARS [GC for 571 SFUN pages..(T=21).GC finished] CHK-LEGAL-DEFCONST-NAME DEFCONST-FN1 WEAK-HCOMP-BOOK-HT-ENTRY-P DEFCONST-VAL LARGE-CONSP DEFCONST-FN [GC for 6808 CONS pages..(T=22).GC finished] CHK-LEGAL-INIT-MSG CHK-LEGAL-INIT CHK-MACRO-ARGLIST-KEYS CHK-MACRO-ARGLIST-AFTER-REST [GC for 571 SFUN pages..(T=24).GC finished] CHK-MACRO-ARGLIST-OPTIONAL CHK-MACRO-ARGLIST1 CHK-MACRO-ARGLIST-MSG CHK-MACRO-ARGLIST DEFMACRO-FN1 CHK-DEFMACRO-WIDTH [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] REDUNDANT-DEFMACROP COLLECT-NON-APPLY$-PRIMPS2 [GC for 112 CFUN pages..(T=23).GC finished] (COLLECT-NON-APPLY$-PRIMPS1 COLLECT-NON-APPLY$-PRIMPS1-LST) COLLECT-NON-APPLY$-PRIMPS CHK-DEFMACRO-UNTOUCHABLE [GC for 6818 CONS pages..(T=24).GC finished] DEFMACRO-FN *INITIAL-EVENT-DEFMACROS* BOOT-TRANSLATE PRIMORDIAL-EVENT-MACRO-AND-FN1 PRIMORDIAL-EVENT-MACRO-AND-FN [GC for 6828 CONS pages..(T=24).GC finished] PRIMORDIAL-EVENT-MACROS-AND-FNS *INITIAL-TYPE-PRESCRIPTIONS* COLLECT-WORLD-GLOBALS PRIMORDIAL-WORLD-GLOBALS ARGLISTS-TO-NILS *UNATTACHABLE-PRIMITIVES* PUTPROP-RECOGNIZER-ALIST PRIMORDIAL-WORLD [GC for 714 SYMBOL pages..(T=22).GC finished] 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 6838 CONS pages..(T=24).GC finished] CHK-ACCEPTABLE-DEFPKG [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] DEFPKG-FN THEORY-FN-CALLP INTERSECTION-AUGMENTED-THEORIES-FN1 CHECK-THEORY-MSG1 CHECK-THEORY-MSG CHECK-THEORY-ACTION CHECK-THEORY MAYBE-CHECK-THEORY INTERSECTION-THEORIES-FN INTERSECTION-THEORIES UNION-AUGMENTED-THEORIES-FN1 UNION-THEORIES-FN1 [GC for 581 SFUN pages..(T=24).GC finished] UNION-THEORIES-FN UNION-AUGMENTED-THEORIES-FN1+ 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 [GC for 581 SFUN pages..(T=24).GC finished] CURRENT-THEORY-FN CURRENT-THEORY1-AUGMENTED UNION-CURRENT-THEORY-FN UNION-THEORIES SET-DIFFERENCE-CURRENT-THEORY-FN SET-DIFFERENCE-THEORIES [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] UNIVERSAL-THEORY-FN1 UNIVERSAL-THEORY-FN UNIVERSAL-THEORY FUNCTION-THEORY-FN1 FUNCTION-THEORY-FN FUNCTION-THEORY EXECUTABLE-COUNTERPART-THEORY-FN EXECUTABLE-COUNTERPART-THEORY STANDARD-THEORIES CURRENT-THEORY END-PREHISTORIC-WORLD THEORY-NAMEP [GC for 6848 CONS pages..(T=23).GC finished] THEORY-FN THEORY REDUNDANT-DEFTHEORY-P DEFTHEORY-FN :REDUNDANT SET-IN-THEORY-REDUNDANT-OKP [GC for 6858 CONS pages..(T=24).GC finished] IN-THEORY-FN IN-ARITHMETIC-THEORY-FN DISABLE ENABLE THEORY-INVARIANT-TABLE-GUARD THEORY-INVARIANT-TABLE [GC for 6868 CONS pages..(T=24).GC finished] [GC for 6878 CONS pages..(T=23).GC finished] THEORY-INVARIANT-FN THEORY-INVARIANT INCOMPATIBLE INCOMPATIBLE! *GENERIC-BAD-SIGNATURE-STRING* *SIGNATURE-KEYWORDS* DUPLICATE-KEY-IN-KEYWORD-VALUE-LISTP [GC for 6888 CONS pages..(T=23).GC finished] FORMALS-PRETTY-FLAGS-MISMATCH-MSG CHK-GLOBAL-STOBJS-VALUE [GC for 6888 CONS pages..(T=23).GC finished] CHK-SIGNATURE [GC for 6898 CONS pages..(T=22).GC finished] CHK-SIGNATURES CHK-ACCEPTABLE-ENCAPSULATE1 NAME-INTRODUCED CHK-EMBEDDED-EVENT-FORM-ORIG-FORM-MSG *ACL2-DEFAULTS-TABLE-MACROS* [GC for 6898 CONS pages..(T=24).GC finished] [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=30).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 [GC for 581 SFUN pages..(T=24).GC finished] ALIST-TO-BINDINGS ACL2-RAW-EVAL GET-AND-CHK-LAST-MAKE-EVENT-EXPANSION *LOCAL-VALUE-TRIPLE-ELIDED* ELIDE-LOCALS (ELIDE-LOCALS-REC ELIDE-LOCALS-LST) MAKE-RECORD-EXPANSION? ACL2-SYSTEM-TABLE MAYBE-ADD-EVENT-LANDMARK [GC for 6908 CONS pages..(T=22).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=22).GC finished] EVAL-EVENT-LST EQUAL-INSIG BAD-SIGNATURE-ALIST IF-NS TILDE-*-BAD-INSIGS-PHRASE1 TILDE-*-BAD-INSIGS-PHRASE [GC for 581 SFUN pages..(T=22).GC finished] UNION-EQ-CARS CHK-ACCEPTABLE-ENCAPSULATE2 [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] CONJOIN-INTO-ALIST CLASSES-THEOREMS CONSTRAINTS-INTRODUCED1 NEW-TRIPS-REC NEW-TRIPS CONSTRAINTS-INTRODUCED PUTPROP-CONSTRAINTS MAYBE-INSTALL-ACL2-DEFAULTS-TABLE [GC for 581 SFUN pages..(T=22).GC finished] UPDATE-FOR-REDO-FLAT REDO-FLAT CERT-OP EVAL-EVENT-LST-ENVIRONMENT [GC for 6918 CONS pages..(T=23).GC finished] PROCESS-EMBEDDED-EVENTS CONSTRAINED-FUNCTIONS COLLECT-LOGICALS EXPORTED-FUNCTION-NAMES GET-SUBVERSIVES [GC for 581 SFUN pages..(T=25).GC finished] ANCESTRAL-FFN-SYMBS-LST ENCAPSULATE-CONSTRAINT BOGUS-EXPORTED-COMPLIANTS REMOVE-TYPE-PRESCRIPTION-CERT-DATA ENCAPSULATE-RETURN-VALUE-P [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] ENCAPSULATE-PASS-2 TILDE-@-ABBREVIATE-OBJECT-PHRASE ENCAPSULATE-CTX PRINT-ENCAPSULATE-MSG1 [GC for 6928 CONS pages..(T=23).GC finished] PRINT-ENCAPSULATE-MSG2 PRINT-ENCAPSULATE-MSG3/EXPORTED-NAMES PRINT-ENCAPSULATE-MSG3/CONSTRAINTS PRINT-ENCAPSULATE-MSG3 [GC for 6938 CONS pages..(T=23).GC finished] (FIND-FIRST-NON-LOCAL-NAME FIND-FIRST-NON-LOCAL-NAME-LST) EQUAL-MOD-ELIDE-LOCALS1 (EQUAL-MOD-ELIDE-LOCALS EQUAL-MOD-ELIDE-LOCALS-LST) CORRESPONDING-ENCAP-EVENTS [GC for 581 SFUN pages..(T=22).GC finished] CORRESPONDING-ENCAPS REDUNDANT-ENCAPSULATE-TUPLEP REDUNDANT-ENCAPSULATEP [GC for 6948 CONS pages..(T=23).GC finished] MARK-MISSING-AS-HIDDEN-P KNOWN-PACKAGE-ALIST-INCLUDED-P [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] ENCAPSULATE-FIX-KNOWN-PACKAGE-ALIST SUBST-BY-POSITION1 SUBST-BY-POSITION INTRO-UDF-GUARDS INTRO-UDF-GLOBAL-STOBJS INTRO-UDF-NON-CLASSICALP [GC for 581 SFUN pages..(T=22).GC finished] ASSOC-PROOF-SUPPORTERS-ALIST 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 [GC for 581 SFUN pages..(T=23).GC finished] EMPTY-ENCAPSULATE CERT-DATA-TP-FROM-RUNIC-TYPE-PRESCRIPTION CERT-DATA-TPS-FROM-FNS CERT-DATA-FOR-CERTIFICATE NEWLY-DEFINED-TOP-LEVEL-FNS-REC [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] NEWLY-DEFINED-TOP-LEVEL-FNS CERT-DATA-TPS-1 CERT-DATA-TPS CERT-DATA-PASS1-SAVED FUNCTIONAL-SUBSTITUTION-P NEW-PROVED-FUNCTIONAL-INSTANCES-ALIST FAST-ALIST-FREE-CERT-DATA-ON-EXIT [GC for 6948 CONS pages..(T=23).GC finished] [GC for 6958 CONS pages..(T=24).GC finished] ENCAPSULATE-FN [GC for 6968 CONS pages..(T=23).GC finished] PROGN-FN1 PROGN-FN PROGN!-FN [GC for 581 SFUN pages..(T=24).GC finished] CHK-BOOK-NAME INCLUDE-BOOK-ALIST-SUBSETP CBD-FN CBD GET-PORTCULLIS-CMDS OUR-MERGE-PATHNAMES CANONICAL-PATHNAME CANONICAL-DIRNAME! [GC for 581 SFUN pages..(T=24).GC finished] DIRECTORY-OF-ABSOLUTE-PATHNAME [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] EXTEND-PATHNAME MAYBE-ADD-SEPARATOR SET-CBD-FN SET-CBD SET-CBD-STATE PARSE-BOOK-NAME SYSFILE-P [GC for 581 SFUN pages..(T=23).GC finished] SYSFILE-FILENAME FILENAME-TO-SYSFILE SYSFILE-TO-FILENAME [GC for 581 SFUN pages..(T=22).GC finished] (MAKE-INCLUDE-BOOKS-ABSOLUTE-1 MAKE-INCLUDE-BOOKS-ABSOLUTE-LST) MAKE-INCLUDE-BOOKS-ABSOLUTE FIRST-KNOWN-PACKAGE-ALIST DEFPKG-ITEMS-REC NEW-DEFPKG-P [GC for 581 SFUN pages..(T=23).GC finished] DEFPKG-ITEMS NEW-DEFPKG-LIST2 MAKE-HIDDEN-DEFPKG [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] NEW-DEFPKG-LIST1 NEW-DEFPKG-LIST (TERM-IGNORE-OKP TERM-LIST-IGNORE-OKP) HIDDEN-DEFPKG-EVENTS1 [GC for 581 SFUN pages..(T=24).GC finished] HIDDEN-DEFPKG-EVENTS FIX-PORTCULLIS-CMDS1 FIX-PORTCULLIS-CMDS COLLECT-UNCERTIFIED-BOOKS CHK-IN-PACKAGE ILL-FORMED-CERTIFICATE-ER [GC for 581 SFUN pages..(T=24).GC finished] INCLUDE-BOOK-ER-WARNING-SUMMARY INCLUDE-BOOK-ER1 INCLUDE-BOOK-ER POST-ALIST-FROM-CHANNEL [GC for 581 SFUN pages..(T=24).GC finished] CERTIFICATE-FILE-AND-INPUT-CHANNEL1 PCERT-OP-P [GC for 2049 RELOCATABLE-BLOCKS pages..(T=24).GC finished] CERTIFICATE-FILE-AND-INPUT-CHANNEL [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] CERT-ANNOTATIONS-AND-CHECKSUM-FROM-CERT-FILE TILDE-@-CERT-POST-ALIST-PHRASE ASSOC-FAMILIAR-NAME TILDE-*-BOOK-HASH-PHRASE1 TILDE-*-BOOK-HASH-PHRASE [GC for 724 SYMBOL pages..(T=24).GC finished] GET-CMDS-FROM-PORTCULLIS1 HIDDEN-DEFPKG-EVENTS-SIMPLE GET-CMDS-FROM-PORTCULLIS CONVERT-BOOK-NAME-TO-PORT-NAME CHK-RAISE-PORTCULLIS2 [GC for 6978 CONS 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 [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] SYSFILE-OR-STRING-LISTP TTAG-ALISTP CERT-ANNOTATIONSP WEAK-CERT-OBJ-P *TRIVIAL-BOOK-HASH* CERT-HASH INCLUDE-BOOK-ALIST-ENTRY-P SYSFILE-TO-FILENAME-TTAG-ALIST-VAL [GC for 6988 CONS pages..(T=25).GC finished] 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 FILENAME-TO-SYSFILE-CERT-ANNOTATIONS [GC for 6998 CONS pages..(T=23).GC finished] [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] 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 7008 CONS pages..(T=24).GC finished] CHK-RAISE-PORTCULLIS CHK-CERTIFICATE-FILE1 CERTIFICATE-FILE [GC for 7018 CONS pages..(T=24).GC finished] CHK-CERTIFICATE-FILE EQUAL-MODULO-HIDDEN-DEFPKGS CERT-OBJ-FOR-CONVERT CHK-ACCEPTABLE-CERTIFY-BOOK1 TRANSLATE-BOOK-NAMES [GC for 7028 CONS pages..(T=23).GC finished] [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] FIX-TTAGS CHK-WELL-FORMED-TTAGS CHECK-CERTIFICATE-FILE-EXISTS ILLEGAL-TO-CERTIFY-CHECK CHK-ACCEPTABLE-CERTIFY-BOOK PRINT-OBJECTS REPLACE-INITIAL-SUBSTRING REPLACE-STRING-PREFIX-IN-TREE WITH-OUTPUT-OBJECT-CHANNEL-SHARING [GC for 591 SFUN pages..(T=22).GC finished] ELIDE-LOCALS-AND-SPLIT-EXPANSION-ALIST [GC for 7038 CONS pages..(T=22).GC finished] MAKE-CERTIFICATE-FILE1 MAKE-CERTIFICATE-FILE MAKE-CERTIFICATE-FILES OPEN-INPUT-OBJECT-FILE READ-OBJECT-FILE1 [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=27).GC finished] READ-OBJECT-FILE CHK-CERT-ANNOTATIONS CHK-CERT-ANNOTATIONS-POST-ALIST CHK-INPUT-OBJECT-FILE [GC for 7048 CONS pages..(T=22).GC finished] INCLUDE-BOOK-DIR INCLUDE-BOOK-DIR-WITH-CHK ACCUMULATE-POST-ALIST SKIPPED-PROOFSP-IN-POST-ALIST BOOK-HASH-ALIST BOOK-HASH WITH-HCOMP-BINDINGS WITH-HCOMP-HT-BINDINGS GET-DECLAIM-LIST TILDE-@-BOOK-STACK-MSG [GC for 591 SFUN pages..(T=24).GC finished] CONVERT-BOOK-NAME-TO-ACL2X-NAME ACL2X-ALISTP [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] READ-ACL2X-FILE EVAL-PORT-FILE GETENV! [GC for 7058 CONS pages..(T=24).GC finished] UPDATE-PCERT-BOOKS CONVERT-NON-NIL-SYMBOLS-TO-KEYWORDS [GC for 7068 CONS pages..(T=24).GC finished] [GC for 7078 CONS pages..(T=24).GC finished] INCLUDE-BOOK-FN1 [GC for 7088 CONS pages..(T=23).GC finished] CHK-INCLUDE-BOOK-INPUTS INCLUDE-BOOK-FN SPONTANEOUS-DECERTIFICATIONP1 SPONTANEOUS-DECERTIFICATIONP REMOVE-DUPLICATES-EQUAL-FROM-END INCLUDE-BOOK-ALIST-SUBSETP-FAILURE-WITNESSES [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] EXPANSION-FILENAME TOP-LEVEL-LOOP$-ALIST-REC TOP-LEVEL-LOOP$-ALIST WRITE-EXPANSION-FILE COLLECT-IDEAL-USER-DEFUNS1 [GC for 7088 CONS pages..(T=23).GC finished] COLLECT-IDEAL-USER-DEFUNS SET-DIFFERENCE-EQ-SORTED PKG-NAMES0 HONS-UNION-ORDERED-STRING-LISTS PKG-NAMES DELETE-NAMES-FROM-KPA-REC DELETE-NAMES-FROM-KPA [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PRINT-CERTIFY-BOOK-STEP-2 PRINT-CERTIFY-BOOK-STEP-3 PRINT-CERTIFY-BOOK-GUARDS-WARNING CHK-CERTIFY-BOOK-STEP-3 PRINT-CERTIFY-BOOK-STEP-4 [GC for 7088 CONS pages..(T=23).GC finished] PRINT-CERTIFY-BOOK-STEP-5 HCOMP-BUILD-FROM-STATE ACL2X-EXPANSION-ALIST HONS-COPY-WITH-STATE IDENTITY-WITH-STATE :ATTACHMENTS-RECORDED [GC for 7088 CONS pages..(T=23).GC finished] WRITE-ACL2X-FILE MERGE-INTO-EXPANSION-ALIST1 [GC for 18432 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] ACL2X-ALISTP-DOMAINS-SUBSETP MERGE-INTO-EXPANSION-ALIST RESTRICT-EXPANSION-ALIST ELIDE-LOCALS-FROM-EXPANSION-ALIST [GC for 2049 RELOCATABLE-BLOCKS pages..(T=23).GC finished] WRITE-PORT-FILE SAVE-PARALLELISM-SETTINGS INCLUDE-BOOK-ALIST-EQUAL-MODULO-LOCAL COPY-OBJECT-CHANNEL-UNTIL-MARKER [GC for 7098 CONS pages..(T=23).GC finished] COPY-PCERT0-TO-PCERT1 TOUCH? CONVERT-BOOK-NAME-TO-COMPILED-NAME CERTIFY-BOOK-FINISH-CONVERT INCLUDE-BOOK-ALIST-UNCERTIFIED-BOOKS [GC for 591 SFUN pages..(T=23).GC finished] COUNT-FORMS-IN-CHANNEL SKIP-FORMS-IN-CHANNEL POST-ALIST-FROM-PCERT1-1 POST-ALIST-FROM-PCERT1 CERTIFICATE-POST-ALIST CERTIFY-BOOK-FINISH-COMPLETE [GC for 591 SFUN pages..(T=23).GC finished] EXPANSION-ALIST-CONFLICT SYMBOL-PACKAGE-NAME-SET NAMES-OF-SYMBOLS-IN-PACKAGE [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] SYMBOL-LIST-TO-PACKAGE-ALIST1 SYMBOL-LIST-TO-PACKAGE-ALIST BOOKDATA-ALIST1 BOOKDATA-ALIST MAYBE-WRITE-BOOKDATA [GC for 591 SFUN pages..(T=23).GC finished] FROMTO REMOVE-SMALLER-KEYS-FROM-SORTED-ALIST CERT-INCLUDE-EXPANSION-ALIST EVAL-HIDDEN-PACKAGES WITH-PACKAGES-UNHIDDEN READ-USELESS-RUNES2 READ-USELESS-RUNES1 READ-FILE-ITERATE-SAFE [GC for 591 SFUN pages..(T=23).GC finished] USELESS-RUNES-ENV-INFO USELESS-RUNES-SOURCE-MSG READ-USELESS-RUNES FREE-USELESS-RUNES [GC for 7108 CONS pages..(T=24).GC finished] USELESS-RUNES-VALUE INITIAL-USELESS-RUNES MAYBE-REFRESH-USELESS-RUNES UPDATE-USELESS-RUNES [GC for 7118 CONS pages..(T=24).GC finished] EVAL-SOME-PORTCULLIS-CMDS [GC for 7128 CONS pages..(T=24).GC finished] [GC for 7138 CONS pages..(T=24).GC finished] [GC for 7148 CONS pages..(T=25).GC finished] [GC for 7158 CONS pages..(T=24).GC finished] [GC for 7168 CONS pages..(T=25).GC finished] [GC for 7178 CONS pages..(T=25).GC finished] [GC for 7188 CONS pages..(T=25).GC finished] [GC for 7198 CONS pages..(T=25).GC finished] [GC for 7198 CONS pages..(T=25).GC finished] CERTIFY-BOOK-FN CERTIFY-BOOK CERTIFY-BOOK! REDUNDANT-DEFCHOOSEP [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] CHK-ARGLIST-FOR-DEFCHOOSE WITHOUT-WARNINGS-FN WITHOUT-WARNINGS TRANSLATE-IGNORE-OK TRANSLATE-WITHOUT-WARNINGS-IGNORE-OK DEFCHOOSE-CONSTRAINT-BASIC [GC for 591 SFUN pages..(T=23).GC finished] GENERATE-VARIABLE-LST-SIMPLE DEFCHOOSE-CONSTRAINT-EXTRA DEFCHOOSE-CONSTRAINT DEFCHOOSE-FN *DEFUN-SK-KEYWORDS* [GC for 7198 CONS pages..(T=23).GC finished] NON-ACCEPTABLE-DEFUN-SK-P DEFINITION-RULE-NAME VERIFY-GUARDS? PARSE-DEFUN-SK-DCLS MAP-WITH-OUTPUT [GC for 591 SFUN pages..(T=23).GC finished] DEFUN-SK-FN TAMENESS-CONDITIONS SUCCESSIVE-CADRS [GC for 591 SFUN pages..(T=23).GC finished] 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 CHK-STOBJ-FIELD-ETYPE [GC for 7198 CONS pages..(T=24).GC finished] CHK-STOBJ-FIELD-DESCRIPTOR [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] CHK-ACCEPTABLE-DEFSTOBJ-RENAMING CHK-ACCEPTABLE-DEFSTOBJ1 OLD-FIELD-DESCRIPTORS [GC for 7198 CONS pages..(T=26).GC finished] REDUNDANT-DEFSTOBJP CONGRUENT-STOBJ-FIELDS CHK-ACCEPTABLE-DEFSTOBJ [GC for 7198 CONS pages..(T=24).GC finished] DEFSTOBJ-FIELD-FNS-AXIOMATIC-DEFS DEFSTOBJ-AXIOMATIC-INIT-FIELDS DEFSTOBJ-CREATOR-DEF DEFSTOBJ-AXIOMATIC-DEFS [GC for 7208 CONS pages..(T=25).GC finished] PUT-STOBJS-IN-AND-OUTS1 PUT-STOBJS-IN-AND-OUTS DEFCONST-NAME-ALIST ACCESSOR-ARRAY [GC for 734 SYMBOL pages..(T=25).GC finished] PUT-DEFSTOBJ-INVARIANT-RISK DEFSTOBJ-FN DEFABSSTOBJ CONCRETE-STOBJ DEFABSSTOBJ-MISSING-EVENTS REDUNDANT-DEFABSSTOBJP ABSSTOBJ-CORRESPONDENCE-CONCL-LST [GC for 7208 CONS pages..(T=27).GC finished] FLATTEN-ANDS-IN-LIT! ABSSTOBJ-CORRESPONDENCE-FORMULA [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] ABSSTOBJ-PRESERVED-FORMULA WEAK-ABSSTOBJ-METHOD-P (FN-STOBJ-UPDATES-P STOBJ-UPDATES-P STOBJ-UPDATES-LISTP) UNPROTECTED-EXPORT-P [GC for 7208 CONS pages..(T=26).GC finished] [GC for 7218 CONS pages..(T=26).GC finished] TRANSLATE-ABSSTOBJ-FIELD SIMPLE-TRANSLATE-ABSSTOBJ-FIELDS ONE-WAY-UNIFY-P OBVIOUSLY-EQUAL-LAMBDA-ARGS (OBVIOUSLY-EQUIV-TERMS OBVIOUSLY-EQUIV-TERMS-LST) OBVIOUSLY-IFF-EQUIV-TERMS [GC for 7228 CONS pages..(T=24).GC finished] CHK-DEFABSSTOBJ-METHOD-LEMMAS CHK-DEFABSSTOBJ-METHOD INTERSPERSE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=25).GC finished] SORT-ABSSTOBJ-NAMES CHK-ACCEPTABLE-DEFABSSTOBJ1 FIRST-KEYWORD [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] COLLECT-DEFABSSTOBJ-UPDATERS CHK-DEFABSSTOBJ-UPDATERS-1 CHK-DEFABSSTOBJ-UPDATERS CHK-ACCEPTABLE-DEFABSSTOBJ DEFABSSTOBJ-AXIOMATIC-DEFS [GC for 7228 CONS pages..(T=24).GC finished] WITH-INSIDE-ABSSTOBJ-UPDATE DEFABSSTOBJ-RAW-DEF DEFABSSTOBJ-RAW-DEFS-REC DEFABSSTOBJ-RAW-DEFS EXPAND-RECOGNIZER PUT-ABSSTOBJS-IN-AND-OUTS METHOD-EXEC DEFABSSTOBJ-RAW-INIT [GC for 601 SFUN pages..(T=25).GC finished] DEFABSSTOBJ-MISSING-MSG UPDATE-GUARD-POST DEFABSSTOBJ-LOGIC-SUBST CHK-DEFABSSTOBJ-GUARD CHK-DEFABSSTOBJ-GUARDS1 CHK-DEFABSSTOBJ-GUARDS [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] MAKE-ABSSTOBJ-TUPLES PUT-DEFABSSTOBJ-INVARIANT-RISK KEY-POSITION-FROM-END-EQ CONGRUENT-ABSSTOBJ-TUPLES-REC CONGRUENT-ABSSTOBJ-TUPLES [GC for 7238 CONS pages..(T=24).GC finished] DEFABSSTOBJ-FN1 DEFABSSTOBJ-FN CREATE-STATE WITH-LOCAL-STATE STOBJ-LET [GC for 7248 CONS pages..(T=25).GC finished] COLLECT-BADGED-FNS COLLECT-MACROS PUSH-UNTOUCHABLE-FN REMOVE-UNTOUCHABLE-FN DEF-BODY-LEMMAS SHOW-BODIES SET-BODY-FN1 [GC for 7258 CONS pages..(T=25).GC finished] SET-BODY-FN TRACE-MULTIPLICITY *1*DEFP TRACE$-ER-MSG [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] DECLS-AND-DOC TRACE$-WHEN-GCOND STOBJ-EVISCERATION-ALIST TRACE-EVISCERATION-ALIST SET-TRACE-EVISC-TUPLE CHK-TRACE-OPTIONS-AUX TRACE$-VALUE-MSGP [GC for 601 SFUN pages..(T=24).GC finished] CHK-TRACE-OPTIONS MEMOIZE-OFF-TRACE-ERROR UNTRACE$-FN1 UNTRACE$-REC UNTRACE$-FN MAYBE-UNTRACE$-FN MAYBE-UNTRACE$ [GC for 7258 CONS pages..(T=26).GC finished] TRACE$-FN-GENERAL TRACE$-FN-SIMPLE *TRACE-KEYWORDS* *TRACE-KEYWORDS-NEEDING-TTAG* FIRST-ASSOC-KEYWORD *ILLEGAL-TRACE-SPEC-FMT-STRING* TRACE$-FN [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] TRACE$-LST TRACE$ WITH-UBT! TRACE! UNTRACE$ 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 7268 CONS pages..(T=25).GC finished] PARSE-DEFEXEC-DCLS DEFEXEC WEAK-SAR-P APPLICABLE-REWRITE-RULES1 APPLICABLE-LINEAR-RULES1 [GC for 7278 CONS pages..(T=25).GC finished] PC-RELIEVE-HYP (PC-RELIEVE-HYPS1-ITER PC-RELIEVE-HYPS1) PC-RELIEVE-HYPS REMOVE-TRIVIAL-LITS UNRELIEVED-HYPS [GC for 601 SFUN pages..(T=26).GC finished] UNTRANSLATE-SUBST-ABB [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] SHOW-REWRITE-LINEAR SHOW-REWRITES-LINEARS [GC for 7288 CONS pages..(T=24).GC finished] EXPAND-ASSUMPTIONS-1 EXPAND-ASSUMPTIONS HYPS-TYPE-ALIST SHOW-REWRITES-LINEARS-FN SHOW-META-LEMMAS1 [GC for 7298 CONS pages..(T=24).GC finished] SHOW-META-LEMMAS DECODED-TYPE-SET-FROM-TP-RULE SHOW-TYPE-PRESCRIPTION-RULE SHOW-TYPE-PRESCRIPTION-RULES1 SHOW-TYPE-PRESCRIPTION-RULES [GC for 601 SFUN pages..(T=24).GC finished] PL2-FN PL-FN PL PL2 ACL2-DEFAULTS-TABLE-LOCAL-CTX-P CHANGE-INCLUDE-BOOK-DIR [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] ADD-CUSTOM-KEYWORD-HINT-FN RESET-PREHISTORY DISABLE-UBT RESET-KILL-RING RESET-PREHISTORY-FN [GC for 7308 CONS 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 601 SFUN pages..(T=24).GC finished] (FSUBCOR-VAR FSUBCOR-VAR-LST) (PRINT-GV-SUBSTITUTE-P1 PRINT-GV-SUBSTITUTE-P1-LST) PRINT-GV-SUBSTITUTE-P PRINT-GV-FORM [GC for 601 SFUN pages..(T=24).GC finished] PRINT-GV-CONJUNCT [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=30).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 601 SFUN pages..(T=24).GC finished] DISABLE-IPRINT-AR ENABLE-IPRINT-AR *IPRINT-ACTIONS* SET-IPRINT-FN1 INIT-IPRINT-FAL+ [GC for 601 SFUN pages..(T=24).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 [GC for 601 SFUN pages..(T=23).GC finished] IPRINT-VIRGINP [GC for 2049 RELOCATABLE-BLOCKS pages..(T=23).GC finished] SET-EVISC-TUPLE-FN SET-EVISC-TUPLE TOP-LEVEL [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=28).GC finished] NECC-NAME-ARGS-INSTANCE DEFWARRANT-EVENTS [GC for 7318 CONS pages..(T=24).GC finished] TRANSLATE-DEFATTACH-HELPERS *DEFATTACH-KEYS* DEFATTACH-UNKNOWN-CONSTRAINTS-ERROR INTERSECTION-DOMAINS [GC for 7328 CONS pages..(T=25).GC finished] PROCESS-DEFATTACH-ARGS1 [GC for 7338 CONS pages..(T=23).GC finished] DUPLICATE-KEYSP-EQ SPLIT-AT-FIRST-KEYWORD MAYBE-REMOVE1-EQ FILTER-FOR-ATTACHMENT *DEFATTACH-KEYS-EXTENDED* [GC for 601 SFUN pages..(T=24).GC finished] PROCESS-DEFATTACH-ARGS [GC for 7348 CONS pages..(T=25).GC finished] PROVE-DEFATTACH-GUARDS1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PROVE-DEFATTACH-GUARDS TRUE-APPLY$-WARRANT DEFATTACH-CONSTRAINT-REC DEFATTACH-CONSTRAINT [GC for 744 SYMBOL pages..(T=26).GC finished] PROVE-DEFATTACH-CONSTRAINT ATTACHMENT-COMPONENT-OWNER DEFATTACH-COMPONENT-HAS-OWNER [GC for 7358 CONS pages..(T=24).GC finished] DEFATTACH-MERGE-INTO-COMPONENT DEFATTACH-MERGE-COMPONENTS DEFATTACH-MERGE DEFATTACH-MERGE-LST DEFATTACH-MERGE-LST-LST DEFATTACH-LOOP-ERROR-MSG [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] DEFATTACH-LOOP-ERROR DEFATTACH-CLOSE DEFATTACH-ERASE-COMPONENTS DEFATTACH-ERASE-P DEFATTACH-ERASE1 DEFATTACH-ERASE COLLECT-EXT-ANC [GC for 7368 CONS pages..(T=25).GC finished] EXTEND-ATTACHMENT-COMPONENTS COMPONENT-PATH-EXTENSION EXTEND-ATTACHMENT-RECORD UPDATE-ATTACHMENT-RECORDS1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] UPDATE-ATTACHMENT-RECORDS ATTACHMENT-RECORDS CHK-DEFATTACH-LOOP DEFAXIOM-SUPPORTER-MSG-LIST DEFATTACH-GLOBAL-STOBJS-MSG [GC for 7378 CONS pages..(T=26).GC finished] CHK-ACCEPTABLE-DEFATTACH ATTACHMENT-CLTL-CMD [GC for 7388 CONS pages..(T=26).GC finished] DEFATTACH-FN DEFATTACH-SYSTEM [GC for 7398 CONS pages..(T=27).GC finished] CHK-RETURN-LAST-ENTRY RETURN-LAST-TABLE DEFMACRO-LAST *FMT-CONTROL-DEFAULTS* *FIXED-FMT-CONTROLS* FMT-CONTROL-BINDINGS1 [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] FMT-CONTROL-BINDINGS SET-IPRINT-AR OVERRIDE-GLOBAL-EVISC-TABLE CHANNEL-TO-STRING *FMT-CONTROL-DEFAULTS-KEYS* [GC for 7408 CONS pages..(T=26).GC finished] [GC for 7418 CONS pages..(T=24).GC finished] [GC for 7428 CONS pages..(T=27).GC finished] [GC for 18688 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] FMS-TO-STRING-FN FMS-TO-STRING [GC for 7438 CONS pages..(T=25).GC finished] [GC for 7448 CONS pages..(T=25).GC finished] [GC for 7458 CONS pages..(T=24).GC finished] FMS!-TO-STRING-FN FMS!-TO-STRING [GC for 7458 CONS pages..(T=25).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=25).GC finished] [GC for 7458 CONS pages..(T=26).GC finished] FMT-TO-STRING-FN FMT-TO-STRING [GC for 7468 CONS pages..(T=25).GC finished] [GC for 7468 CONS pages..(T=24).GC finished] [GC for 7478 CONS pages..(T=24).GC finished] FMT!-TO-STRING-FN FMT!-TO-STRING [GC for 7488 CONS pages..(T=24).GC finished] [GC for 7488 CONS pages..(T=24).GC finished] [GC for 611 SFUN pages..(T=24).GC finished] FMT1-TO-STRING-FN FMT1-TO-STRING [GC for 7498 CONS pages..(T=24).GC finished] [GC for 7498 CONS pages..(T=25).GC finished] FMT1!-TO-STRING-FN FMT1!-TO-STRING [GC for 611 SFUN pages..(T=25).GC finished] ATTACHMENT-PAIRS SIBLING-ATTACHMENTS EXT-ANCESTORS-ATTACHMENTS4 EXT-ANCESTORS-ATTACHMENTS3 EXT-ANCESTORS-ATTACHMENTS2 CANONICAL-CDRS EXT-ANCESTORS-ATTACHMENTS1 [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] ATTACHMENT-RECORDS-FAL EXT-ANCESTORS-ATTACHMENTS EXT-ANC-ATTACHMENT-MISSING EXT-ANC-ATTACHMENTS-VALID-P-1 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 [GC for 611 SFUN pages..(T=25).GC finished] REGENERATE-TAU-DATABASE-FN1 REGENERATE-TAU-DATABASE-FN RATIONAL-TO-DECIMAL-STRING DEFUND MAGIC-EV-FNCALL MAKE-EVENT-CTX [GC for 7508 CONS pages..(T=25).GC finished] [GC for 7508 CONS pages..(T=24).GC finished] [GC for 7508 CONS pages..(T=25).GC finished] [GC for 7508 CONS pages..(T=25).GC finished] [GC for 7518 CONS pages..(T=25).GC finished] [GC for 7528 CONS pages..(T=25).GC finished] [GC for 7538 CONS pages..(T=25).GC finished] [GC for 7548 CONS pages..(T=26).GC finished] [GC for 18944 CONTIGUOUS-BLOCKS pages..(T=30).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 2049 RELOCATABLE-BLOCKS pages..(T=24).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 7558 CONS pages..(T=24).GC finished] DOPPELGANGER-APPLY$-USERFN APPLY$-LAMBDA-LOGICAL OUR-QUOTE-MACRO [GC for 7558 CONS pages..(T=24).GC finished] [GC for 7558 CONS pages..(T=25).GC finished] [GC for 7558 CONS pages..(T=25).GC finished] [GC for 7568 CONS pages..(T=26).GC finished] [GC for 7578 CONS pages..(T=26).GC finished] [GC for 7588 CONS pages..(T=27).GC finished] VALUE-TRIPLE-FN1 CHK-VALUE-TRIPLE VALUE-TRIPLE-FN COLLECT-NON-REDUNDANT [GC for 7598 CONS pages..(T=25).GC finished] REMOVE-VAR-FROM-TYPE-DCLS MEMOIZE-PARTIAL-DEF MEMOIZE-PARTIAL-DECLARE MEMOIZE-PARTIAL-SUPPORTING-EVENTS-1 MEMOIZE-PARTIAL-SUPPORTING-EVENTS-REC [GC for 611 SFUN pages..(T=25).GC finished] FLET-BINDINGS MEMOIZE-PARTIAL-SUPPORTING-EVENTS MEMOIZE-PARTIAL-TUPLE-SHAPE-P 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 [GC for 611 SFUN pages..(T=25).GC finished] MEMOIZE-PARTIAL-TRANSLATIONS-MSG PARTIAL-FUNCTIONS-TABLE-GUARD-MSG PARTIAL-FUNCTIONS-TABLE-GUARD PARTIAL-FUNCTIONS-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=30).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 611 SFUN pages..(T=25).GC finished] [GC for 122 CFUN pages..(T=24).GC finished] MEMOIZE-TABLE-CHK-INVOKE-MSG MEMOIZE-TABLE-CHK MEMOIZE-TABLE [GC for 611 SFUN pages..(T=25).GC finished] MEMOIZE-PARTIAL-CALLS MEMOIZE-PARTIAL-TUPLE-1 MEMOIZE-PARTIAL-TUPLE MEMOIZE-PARTIAL-TUPLES MEMOIZE-PARTIAL-BASIC-CHECKS MEMOIZE-PARTIAL Finished loading "other-events.lisp". ACL2 loading "ld.lisp". "ACL2" [GC for 611 SFUN pages..(T=25).GC finished] WEAK-LD-PROMPT-MEMO-P DEFAULT-PRINT-PROMPT PRINT-PROMPT INITIALIZE-TIMERS MAYBE-ADD-COMMAND-LANDMARK [GC for 611 SFUN pages..(T=25).GC finished] REPLACE-LAST-CDR LD-STANDARD-OI-MISSING CHK-ACCEPTABLE-LD-FN1-PAIR CLOSE-CHANNELS [GC for 611 SFUN pages..(T=26).GC finished] CHK-ACCEPTABLE-LD-FN1 CHK-ACCEPTABLE-LD-FN F-PUT-LD-SPECIALS F-GET-LD-SPECIALS [GC for 611 SFUN pages..(T=25).GC finished] LD-READ-KEYWORD-COMMAND1 EXIT-LD LD-READ-KEYWORD-COMMAND [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] LD-FIX-COMMAND LD-READ-COMMAND LD-PRINT-COMMAND CONTINUE-FROM-ILLEGAL-STATE LD-FILTER-COMMAND [GC for 754 SYMBOL pages..(T=25).GC finished] LD-PRINT-RESULTS LD-PRINT-PROMPT LD-RETURN-ERROR INITIALIZE-ACCUMULATED-WARNINGS *EMPTY-LD-HISTORY-ENTRY* LD-HISTORY [GC for 611 SFUN pages..(T=24).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 621 SFUN pages..(T=26).GC finished] EXTEND-LD-HISTORY LD-READ-EVAL-PRINT LD-LOOP GET-DIRECTORY-OF-FILE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=27).GC finished] UPDATE-CBD LD-FN-BODY LD-FN1 LD-FN-ALIST LD-FN0 LD-FN LD QUICK-TEST [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] WORMHOLE-PROMPT RESET-LD-SPECIALS-FN RESET-LD-SPECIALS MAYBE-RESET-DEFAULTS-TABLE1 MAYBE-RESET-DEFAULTS-TABLE2 MAYBE-RESET-DEFAULTS-TABLE DELETE-SOMETHING STORE-IN-KILL-RING ROTATE-KILL-RING1 ROTATE-KILL-RING [GC for 621 SFUN pages..(T=26).GC finished] UBT-UBU-FN1 UBT?-UBU?-FN UBT-UBU-FN UBT!-UBU!-FN UBT-PREHISTORY UBT-PREHISTORY-FN OOPS-WARNING OOPS-FN OOPS I-AM-HERE [GC for 7598 CONS pages..(T=25).GC finished] 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 SWEEP-ACL2-ORACLE SWEEP-GLOBAL-STATE-FOR-LISP-OBJECTS WET DISASSEMBLE$ NEAR-MISSES [GC for 621 SFUN pages..(T=25).GC finished] COMPILE-FUNCTION KEEP-TMP-FILES [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] COMP-FN COMP COMP-GCL SCAN-PAST-DEEPER-EVENT-LANDMARKS PUFFABLE-ENCAPSULATE-P PUFFABLE-COMMAND-BLOCKP PUFFABLE-COMMAND-NUMBERP PUFF-INCLUDE-BOOK PUFF-COMMAND-BLOCK1 PUFF-COMMAND-BLOCK [GC for 621 SFUN pages..(T=25).GC finished] COMMANDS-BACK-TO-1 COMMANDS-BACK-TO PUFFED-COMMAND-SEQUENCE LD-READ-EVAL-PRINT-SIMPLE LD-LOOP-SIMPLE LD-SIMPLE [GC for 7598 CONS pages..(T=24).GC finished] PUFF-FN1 PUFF-REPORT PUFF-FN PUFF*-FN11 PUFF*-FN1 [GC for 7598 CONS pages..(T=25).GC finished] 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* *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 [GC for 7598 CONS pages..(T=24).GC finished] FIND-RUNED-LINEAR-LEMMA [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] MFC-FORCE-FLG UPDATE-RNCST-FOR-FORCEP PRINT-SAVED-OUTPUT-LST [GC for 7608 CONS pages..(T=25).GC finished] PRINT-SAVED-OUTPUT CONVERT-IO-MARKERS-LST 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 [GC for 621 SFUN pages..(T=23).GC finished] SET-LD-EVISC-TUPLE SET-LD-EVISC-TUPLE-STATE SET-ABBREV-EVISC-TUPLE SET-ABBREV-EVISC-TUPLE-STATE SET-GAG-MODE-EVISC-TUPLE SET-GAG-MODE-EVISC-TUPLE-STATE SET-TERM-EVISC-TUPLE SET-TERM-EVISC-TUPLE-STATE [GC for 621 SFUN pages..(T=25).GC finished] 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 NON-BOUNDED-NUMS DELETE-BY-POSITION [GC for 7618 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHK-ASSUMPTION-FREE-TTREE-1 PUT-CDR-ASSOC-QUERY-ID SET-QUERY-VAL QUERY-ON-EXIT REPLAY-QUERY [GC for 7628 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 7638 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 7638 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PRINT-COMMANDS MAKE-PRETTY-START-INSTR RAW-INDEXED-INSTRS PC-COMMAND-TABLE [GC for 7648 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE DEFINE-PC-HELP EVISC-INDEXED-INSTRS-1 EVISC-INDEXED-INSTRS-REC MARK-UNFINISHED-INSTRS EVISC-INDEXED-INSTRS PC-COMMAND-TABLE PC-COMMAND-TABLE PROMOTE-GUTS [GC for 7648 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] REMOVE-BY-INDICES PC-COMMAND-TABLE BOUNDED-INTEGER-LISTP FETCH-TERM-AND-CL FETCH-TERM [GC for 2049 RELOCATABLE-BLOCKS pages..(T=25).GC finished] GOVERNORS TERM-ID-IFF ? ?-FN ABBREVIATIONS-ALIST (CHK-?S CHK-?S-LST) REMOVE-?S [GC for 621 SFUN pages..(T=24).GC finished] TRANSLATE-ABB TRANS0 P-BODY PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7658 CONS pages..(T=24).GC finished] TAKE-BY-INDICES PRINT-HYPS SOME-> PRINT-HYPS-TOP PRINT-GOVERNORS-TOP [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] PAIR-INDICES [GC for 7668 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE [GC for 7678 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PAIR-KEYWORDS NULL-POOL INITIAL-PSPV PC-PROVE ABBREVIATIONS-ALIST-? [GC for 621 SFUN pages..(T=24).GC finished] FIND-?-FN UNPROVED-PC-PROVE-CLAUSES PROVER-CALL MAKE-NEW-GOALS SAME-GOAL REMOVE-BYES-FROM-TAG-TREE [GC for 7688 CONS pages..(T=25).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 621 SFUN pages..(T=26).GC finished] PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE NOT-IN-DOMAIN-EQ PC-COMMAND-TABLE [GC for 7688 CONS pages..(T=25).GC finished] PRINT-ABBREVIATIONS [GC for 7698 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE DROP-FROM-END PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 764 SYMBOL pages..(T=25).GC finished] EXPAND-ADDRESS-RECURSE DIVE-ONCE-MORE-ERROR ABBREVIATION-RAW-TERM-P ADDR-RECUR OR-ADDR AND-ADDR DIVE-INTO-MACROS-TABLE ADD-DIVE-INTO-MACRO REMOVE-DIVE-INTO-MACRO DIVE-INTO-MACROS-TABLE RASSOC-EQ-AS-CAR *CAR-ALIST* CAR/CDR^N EXPAND-ADDRESS-MSG [GC for 621 SFUN pages..(T=24).GC finished] [GC for 7698 CONS pages..(T=25).GC finished] EXPAND-ADDRESS DV-ERROR PC-COMMAND-TABLE [GC for 7708 CONS pages..(T=25).GC finished] (DEPOSIT-TERM DEPOSIT-TERM-LST) [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).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 7708 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7718 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 621 SFUN pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PRINT-ON-SEPARATE-LINES PC-COMMAND-TABLE [GC for 7728 CONS pages..(T=24).GC finished] MODIFIED-ERROR-TRIPLE-FOR-SEQUENCE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 621 SFUN pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE EXTRACT-GOAL [GC for 7728 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-BY-POSITION PC-COMMAND-TABLE [GC for 621 SFUN pages..(T=26).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=26).GC finished] PC-COMMAND-TABLE DEFINE-PC-BIND* PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7738 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE FIND-EQUIVALENCE-HYP-TERM-NO-TARGET PC-COMMAND-TABLE [GC for 621 SFUN pages..(T=26).GC finished] PC-COMMAND-TABLE [GC for 7748 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE APPLICABLE-REWRITE-RULES PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7758 CONS pages..(T=26).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE TRANSLATE-SUBST-ABB1 SINGLE-VALUED-SYMBOLP-ALISTP CHECK-CARS-ARE-VARIABLES [GC for 7768 CONS pages..(T=25).GC finished] TRANSLATE-SUBST-ABB MAKE-REWRITE-INSTR [GC for 7768 CONS pages..(T=26).GC finished] [GC for 7778 CONS pages..(T=26).GC finished] PC-COMMAND-TABLE APPLICABLE-LINEAR-RULES [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] MAKE-LINEAR-INSTR [GC for 7788 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7798 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-REWRITE*-1 PC-REWRITE* MAKE-GOALS-FROM-ASSUMPTIONS MAKE-NEW-GOALS-FROM-ASSUMPTIONS *DEFAULT-S-REPEAT-LIMIT* HYPS-TYPE-ALIST-AND-POT-LST [GC for 7798 CONS pages..(T=24).GC finished] [GC for 7798 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE BUILD-PC-ENABLED-STRUCTURE-FROM-ENS PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE CHANGE-LAST [GC for 7808 CONS pages..(T=26).GC finished] ASSIGN-EVENT-NAME-AND-RULE-CLASSES SAVE-FN PC-COMMAND-TABLE RETRIEVE PC-COMMAND-TABLE UNSAVE-FN UNSAVE [GC for 7808 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] SHOW-RETRIEVED-GOAL RETRIEVE-FN [GC for 7818 CONS pages..(T=26).GC finished] PRINT-ALL-GOALS PC-COMMAND-TABLE PRINT-CONC PRINT-ALL-CONCS PC-COMMAND-TABLE GEN-VAR-MARKER TRANSLATE-GENERALIZE-ALIST-1 NON-GEN-VAR-MARKERS [GC for 631 SFUN pages..(T=26).GC finished] FIND-DUPLICATE-GENERALIZE-ENTRIES TRANSLATE-GENERALIZE-ALIST-2 [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] TRANSLATE-GENERALIZE-ALIST ALL-VARS-GOALS PC-STATE-VARS PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 631 SFUN pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] RUN-INSTR-ON-GOALS-GUTS PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE INSTR-NAME [GC for 631 SFUN pages..(T=25).GC finished] PC-FREE-INSTR-P FIND-POSSIBLE-PUT PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 2049 RELOCATABLE-BLOCKS pages..(T=25).GC finished] PC-COMMAND-TABLE SAVE-FC-REPORT-SETTINGS RESTORE-FC-REPORT-SETTINGS [GC for 7818 CONS pages..(T=24).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=30).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE ACL2-WRAP PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7828 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] GOAL-TERMS WRAP1-AUX1 WRAP1-AUX2 PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 7838 CONS pages..(T=25).GC finished] PC-COMMAND-TABLE PC-COMMAND-TABLE PC-COMMAND-TABLE [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=29).GC finished] SHOW-GENEQV PC-COMMAND-TABLE GOALS-TO-CLAUSE-LIST PROOF-BUILDER-CLAUSE-LIST TTREE-TO-SUMMARY-DATA [GC for 774 SYMBOL pages..(T=24).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).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 7848 CONS pages..(T=26).GC finished] [GC for 7858 CONS pages..(T=26).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 CDR-LOOP$-AS-TUPLE LOOP$-AS-AC [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] LOOP$-AS FROM-TO-BY-MEASURE FROM-TO-BY-AC FROM-TO-BY 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 [GC for 631 SFUN pages..(T=26).GC finished] APPLY$-BADGEP [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] 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 19200 CONTIGUOUS-BLOCKS pages..(T=31).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 631 SFUN pages..(T=25).GC finished] [GC for 19200 CONTIGUOUS-BLOCKS pages..(T=31).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=27).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 631 SFUN pages..(T=26).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 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=31).GC finished] SUBSETP-EQ-EXEC :REDUNDANT :REDUNDANT :REDUNDANT SUBSETP-EQ-EXEC-IS-SUBSETP-EQUAL SUBSETP-EQL-EXEC-IS-SUBSETP-EQUAL :REDUNDANT :REDUNDANT SYMBOL-ALISTP-FORWARD-TO-EQLABLE-ALISTP CHARACTER-ALISTP CHARACTER-ALISTP-FORWARD-TO-EQLABLE-ALISTP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT ASSOC-EQ-EXEC-IS-ASSOC-EQUAL ASSOC-EQL-EXEC-IS-ASSOC-EQUAL :REDUNDANT ASSOC-EQ-EQUAL-ALISTP ASSOC-EQ-SAFE ASSOC-EQ-EQUAL [GC for 7868 CONS pages..(T=26).GC finished] 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 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] IMPROPER-CONSP :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 [GC for 7878 CONS pages..(T=26).GC finished] (:NUMBER-OF-ENABLED-RUNES 991) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :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 [GC for 7888 CONS pages..(T=26).GC finished] :REDUNDANT :REDUNDANT NO-DUPLICATESP-EQ-EXEC-IS-NO-DUPLICATESP-EQUAL NO-DUPLICATESP-EQL-EXEC-IS-NO-DUPLICATESP-EQUAL :REDUNDANT R-EQLABLE-ALISTP R-SYMBOL-ALISTP RASSOC-EQ-EXEC [GC for 7898 CONS pages..(T=26).GC finished] RASSOC-EQL-EXEC RASSOC-EQUAL :REDUNDANT RASSOC-EQ-EXEC-IS-RASSOC-EQUAL RASSOC-EQL-EXEC-IS-RASSOC-EQUAL :REDUNDANT :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] RFIX :REDUNDANT :REDUNDANT :REDUNDANT :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>= [GC for 8188 CONS pages..(T=27).GC finished] STRING<-L [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] STRING< STRING> STRING<= STRING>= SYMBOL< STRING<-L-IRREFLEXIVE STRING<-IRREFLEXIVE [GC for 8198 CONS pages..(T=26).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] SUBSTITUTE-AC 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 [GC for 8208 CONS pages..(T=28).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT PLIST-WORLDP-FORWARD-TO-ASSOC-EQ-EQUAL-ALISTP PUTPROP :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] GETPROP-DEFAULT :REDUNDANT :REDUNDANT ORDERED-SYMBOL-ALISTP (:NUMBER-OF-ENABLED-RUNES 1672) ORDERED-SYMBOL-ALISTP-FORWARD-TO-SYMBOL-ALISTP ADD-PAIR [GC for 8218 CONS pages..(T=27).GC finished] REMOVE1-ASSOC-EQ-EXEC [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=32).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 21248 CONTIGUOUS-BLOCKS pages..(T=33).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 8228 CONS pages..(T=26).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] GETPROPS (:NUMBER-OF-ENABLED-RUNES 1724) EQUAL-CHAR-CODE HAS-PROPSP1 [GC for 8238 CONS pages..(T=28).GC finished] HAS-PROPSP EXTEND-WORLD [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] RETRACT-WORLD GLOBAL-VAL :REDUNDANT :REDUNDANT CONJOIN2 CONJOIN [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] CONJOIN-UNTRANSLATED-TERMS DISJOIN2 DISJOIN DISJOIN-LST [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] KWOTE? CONJOIN? <=? [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] >? DISJOIN? :REDUNDANT :REDUNDANT WEAK-SATISFIES-TYPE-SPEC-P :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT THE-CHECK :REDUNDANT :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] THE-CHECK-FOR-*1* :REDUNDANT :REDUNDANT :REDUNDANT BOUNDED-INTEGER-ALISTP BOUNDED-INTEGER-ALISTP-FORWARD-TO-EQLABLE-ALISTP KEYWORD-VALUE-LISTP-ASSOC-KEYWORD CONSP-ASSOC-EQUAL :REDUNDANT ARRAY1P [GC for 8248 CONS pages..(T=27).GC finished] ARRAY1P-FORWARD ARRAY1P-LINEAR [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BOUNDED-INTEGER-ALISTP2 ASSOC2 ARRAY2P [GC for 8258 CONS pages..(T=27).GC finished] ARRAY2P-FORWARD ARRAY2P-LINEAR HEADER [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] DIMENSIONS MAXIMUM-LENGTH DEFAULT [GC for 8268 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] AREF1 COMPRESS11 ARRAY-ORDER [GC for 8278 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] COMPRESS1 ARRAY1P-CONS ASET1 ASET1-TRUSTED [GC for 132 CFUN pages..(T=27).GC finished] AREF2 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=32).GC finished] COMPRESS211 COMPRESS21 COMPRESS2 [GC for 8288 CONS pages..(T=27).GC finished] ARRAY2P-CONS [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] ASET2 FLUSH-COMPRESS [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] MAYBE-FLUSH-AND-COMPRESS1 CDRN :REDUNDANT :REDUNDANT UPDATE-NTH [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] UPDATE-NTH-ARRAY :REDUNDANT :REDUNDANT 32-BIT-INTEGERP 32-BIT-INTEGERP-FORWARD-TO-INTEGERP ACL2-NUMBER-LISTP ACL2-NUMBER-LISTP-FORWARD-TO-TRUE-LISTP [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).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 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] 32-BIT-INTEGER-LISTP 32-BIT-INTEGER-LISTP-FORWARD-TO-INTEGER-LISTP OPEN-INPUT-CHANNELS [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-OPEN-INPUT-CHANNELS OPEN-OUTPUT-CHANNELS UPDATE-OPEN-OUTPUT-CHANNELS [GC for 8298 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] GLOBAL-TABLE UPDATE-GLOBAL-TABLE T-STACK [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-T-STACK 32-BIT-INTEGER-STACK [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-32-BIT-INTEGER-STACK BIG-CLOCK-ENTRY UPDATE-BIG-CLOCK-ENTRY [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] IDATES UPDATE-IDATES [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] ACL2-ORACLE UPDATE-ACL2-ORACLE FILE-CLOCK [GC for 8308 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] UPDATE-FILE-CLOCK READABLE-FILES [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] WRITTEN-FILES UPDATE-WRITTEN-FILES [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] READ-FILES UPDATE-READ-FILES [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] WRITEABLE-FILES LIST-ALL-PACKAGE-NAMES-LST [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-LIST-ALL-PACKAGE-NAMES-LST USER-STOBJ-ALIST1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-USER-STOBJ-ALIST1 :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT UNTOUCHABLE-MARKER :REDUNDANT :REDUNDANT [GC for 8318 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] INIT-IPRINT-AR :REDUNDANT :REDUNDANT [GC for 2049 RELOCATABLE-BLOCKS pages..(T=28).GC finished] DEFAULT-TOTAL-PARALLELISM-WORK-LIMIT :REDUNDANT :REDUNDANT :REDUNDANT T :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] ALL-BOUNDP KNOWN-PACKAGE-ALISTP KNOWN-PACKAGE-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP [GC for 8328 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] TIMER-ALISTP TIMER-ALISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-SYMBOL-ALISTP TYPED-IO-LISTP TYPED-IO-LISTP-FORWARD-TO-TRUE-LISTP :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] OPEN-CHANNEL1 OPEN-CHANNEL1-FORWARD-TO-TRUE-LISTP-AND-CONSP OPEN-CHANNEL-LISTP [GC for 8338 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] OPEN-CHANNELS-P OPEN-CHANNELS-P-FORWARD FILE-CLOCK-P FILE-CLOCK-P-FORWARD-TO-INTEGERP [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] READABLE-FILE READABLE-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP READABLE-FILES-LISTP READABLE-FILES-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP [GC for 8348 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] READABLE-FILES-P READABLE-FILES-P-FORWARD-TO-READABLE-FILES-LISTP WRITTEN-FILE WRITTEN-FILE-FORWARD-TO-TRUE-LISTP-AND-CONSP [GC for 8358 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] WRITTEN-FILE-LISTP WRITTEN-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP-AND-ALISTP WRITTEN-FILES-P WRITTEN-FILES-P-FORWARD-TO-WRITTEN-FILE-LISTP [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] READ-FILE-LISTP1 READ-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP READ-FILE-LISTP READ-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP [GC for 8368 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] READ-FILES-P READ-FILES-P-FORWARD-TO-READ-FILE-LISTP WRITABLE-FILE-LISTP1 WRITABLE-FILE-LISTP1-FORWARD-TO-TRUE-LISTP-AND-CONSP [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] WRITABLE-FILE-LISTP WRITABLE-FILE-LISTP-FORWARD-TO-TRUE-LIST-LISTP WRITEABLE-FILES-P WRITEABLE-FILES-P-FORWARD-TO-WRITABLE-FILE-LISTP [GC for 8378 CONS pages..(T=29).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] STATE-P1 STATE-P1-FORWARD STATE-P [GC for 8388 CONS pages..(T=28).GC finished] (:NUMBER-OF-ENABLED-RUNES 2094) STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 :REDUNDANT :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BUILD-STATE1 COERCE-STATE-TO-OBJECT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] COERCE-OBJECT-TO-STATE CREATE-STATE [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] GLOBAL-TABLE-CARS1 GLOBAL-TABLE-CARS [GC for 8398 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BOUNDP-GLOBAL1 BOUNDP-GLOBAL :REDUNDANT [GC for 8408 CONS pages..(T=28).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] MAKUNBOUND-GLOBAL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] GET-GLOBAL PUT-GLOBAL :REDUNDANT :REDUNDANT [GC for 8418 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] ALWAYS-BOUNDP-GLOBAL STATE-GLOBAL-LET*-BINDINGS-P [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] STATE-GLOBAL-LET*-GET-GLOBALS [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] STATE-GLOBAL-LET*-PUT-GLOBALS STATE-GLOBAL-LET*-CLEANUP :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8428 CONS pages..(T=29).GC finished] :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] T STANDARD-CHAR-P-NTH [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] STRING-EQUAL ASSOC-STRING-EQUAL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] MEMBER-STRING-EQUAL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] XXXJOIN NIL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] EXPLODE-NONNEGATIVE-INTEGER TRUE-LISTP-EXPLODE-NONNEGATIVE-INTEGER NIL NIL EXPLODE-NONNEGATIVE-INTEGER [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] T MAKE-VAR-LST TRUE-LISTP-TAKE T [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BUTLAST [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] DEFUN-NX-FORM [GC for 8438 CONS pages..(T=27).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] DEFUN-NX-FN [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX-1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] UPDATE-MUTUAL-RECURSION-FOR-DEFUN-NX [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] PROGRAM-DECLARED-P [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] SOME-PROGRAM-DECLARED-P [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] PARSE-ARGS-AND-TEST [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] INTEGER-RANGE-P NIL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] SIGNED-BYTE-P [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] UNSIGNED-BYTE-P INTEGER-RANGE-P-FORWARD SIGNED-BYTE-P-FORWARD-TO-INTEGERP UNSIGNED-BYTE-P-FORWARD-TO-NONNEGATIVE-INTEGERP :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] ZPF NIL SUBSTITUTE NIL [GC for 8448 CONS pages..(T=28).GC finished] ALL-VARS1 ALL-VARS NIL CHECK-VARS-NOT-FREE-TEST :REDUNDANT DEFAULT-SYMBOL-NAME :REDUNDANT DEFAULT-SYMBOL-PACKAGE-NAME SYMBOL-EQUALITY [GC for 8458 CONS pages..(T=27).GC finished] [GC for 8468 CONS pages..(T=27).GC finished] T :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] INTEGER-LENGTH [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BINARY-LOGAND [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] LOGNAND [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] BINARY-LOGIOR [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] LOGORC1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] LOGORC2 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] LOGANDC1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] LOGANDC2 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] BINARY-LOGEQV [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] BINARY-LOGXOR [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] LOGNOR [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] LOGTEST :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8478 CONS pages..(T=29).GC finished] :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] BOOLE$ [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] SET-FORMS-FROM-BINDINGS :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] ALIST-DIFFERENCE-EQ :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8488 CONS pages..(T=29).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] EXPLODE-ATOM :REDUNDANT [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] EXPLODE-ATOM+ TRUE-LIST-LISTP-FORWARD-TO-TRUE-LISTP-ASSOC-EQUAL TRUE-LISTP-CADR-ASSOC-EQ-FOR-OPEN-CHANNELS-P NIL [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] OPEN-INPUT-CHANNEL-P1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] OPEN-OUTPUT-CHANNEL-P1 [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] [GC for 21248 CONTIGUOUS-BLOCKS pages..(T=33).GC finished] OPEN-INPUT-CHANNEL-P [GC for 8498 CONS pages..(T=28).GC finished] OPEN-OUTPUT-CHANNEL-P OPEN-OUTPUT-CHANNEL-ANY-P1 [GC for 8508 CONS pages..(T=29).GC finished] OPEN-OUTPUT-CHANNEL-ANY-P OPEN-INPUT-CHANNEL-ANY-P1 OPEN-INPUT-CHANNEL-ANY-P [GC for 8518 CONS pages..(T=29).GC finished] NON-FREE-VAR-RUNES FREE-VAR-RUNES NATP-POSITION-AC :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8528 CONS pages..(T=28).GC finished] OS ABSOLUTE-PATHNAME-STRING-P [GC for 8538 CONS pages..(T=28).GC finished] ILLEGAL-RULER-EXTENDERS-VALUES :REDUNDANT RULER-EXTENDERS-MSG-AUX [GC for 8548 CONS pages..(T=29).GC finished] RULER-EXTENDERS-MSG STRICT-SYMBOL<-SORTEDP :REDUNDANT :REDUNDANT :REDUNDANT [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] INCLUDE-BOOK-DIR-ALIST-ENTRY-P INCLUDE-BOOK-DIR-ALISTP :REDUNDANT TTAG GET-REGISTER-INVARIANT-RISK-WORLD [GC for 8558 CONS pages..(T=29).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SET-PRINT-CASE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SET-PRINT-BASE SET-PRINT-CIRCLE [GC for 8568 CONS pages..(T=29).GC finished] SET-PRINT-ESCAPE SET-PRINT-PRETTY SET-PRINT-RADIX SET-PRINT-READABLY :REDUNDANT SET-PRINT-LENGTH SET-PRINT-LEVEL [GC for 631 SFUN pages..(T=28).GC finished] SET-PRINT-LINES [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] SET-PRINT-RIGHT-MARGIN RAW-PRINT-VARS-ALIST :REDUNDANT [GC for 8578 CONS pages..(T=29).GC finished] PRINC$ WRITE-BYTE$ W [GC for 8588 CONS pages..(T=28).GC finished] GET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-FN SET-SERIALIZE-CHARACTER SET-SERIALIZE-CHARACTER-SYSTEM [GC for 8598 CONS pages..(T=27).GC finished] ALL-BOUNDP-PRESERVES-ASSOC-EQUAL NIL PRINT-OBJECT$+-ALIST MAKE-INPUT-CHANNEL MAKE-OUTPUT-CHANNEL [GC for 8608 CONS pages..(T=28).GC finished] OPEN-INPUT-CHANNEL NTH-UPDATE-NTH TRUE-LISTP-UPDATE-NTH NIL NTH-UPDATE-NTH-ARRAY CLOSE-INPUT-CHANNEL [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] OPEN-OUTPUT-CHANNEL OPEN-OUTPUT-CHANNEL! :REDUNDANT :REDUNDANT COMMENT-WINDOW-CO FMT-TO-COMMENT-WINDOW [GC for 8618 CONS pages..(T=27).GC finished] FMT-TO-COMMENT-WINDOW! FMT-TO-COMMENT-WINDOW+ FMT-TO-COMMENT-WINDOW!+ PAIRLIS2 :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT LOCK-SYMBOL-NAME-P ASSIGN-LOCK :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8628 CONS pages..(T=28).GC finished] GET-OUTPUT-STREAM-STRING$-FN :REDUNDANT CLOSE-OUTPUT-CHANNEL MAYBE-FINISH-OUTPUT$ [GC for 8638 CONS pages..(T=28).GC finished] [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] READ-CHAR$ PEEK-CHAR$ READ-BYTE$ RAW-MODE-P [GC for 8648 CONS pages..(T=26).GC finished] READ-OBJECT READ-OBJECT-WITH-CASE READ-OBJECT-SUPPRESS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT SOME-SLASHABLE PRIN1-WITH-SLASHES1 [GC for 8658 CONS pages..(T=29).GC finished] PRIN1-WITH-SLASHES :REDUNDANT :REDUNDANT [GC for 2049 RELOCATABLE-BLOCKS pages..(T=29).GC finished] MAY-NEED-SLASHES1 NIL ALL-DOTS [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] MAY-NEED-SLASHES-FN :REDUNDANT NEEDS-SLASHES T-STACK-LENGTH1 T-STACK-LENGTH [GC for 631 SFUN pages..(T=29).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 8668 CONS pages..(T=28).GC finished] SHRINK-T-STACK AREF-T-STACK ASET-T-STACK [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] 32-BIT-INTEGER-STACK-LENGTH1 32-BIT-INTEGER-STACK-LENGTH EXTEND-32-BIT-INTEGER-STACK SHRINK-32-BIT-INTEGER-STACK AREF-32-BIT-INTEGER-STACK [GC for 784 SYMBOL pages..(T=29).GC finished] ASET-32-BIT-INTEGER-STACK :REDUNDANT :REDUNDANT BIG-CLOCK-NEGATIVE-P DECREMENT-BIG-CLOCK LIST-ALL-PACKAGE-NAMES USER-STOBJ-ALIST [GC for 631 SFUN pages..(T=28).GC finished] UPDATE-USER-STOBJ-ALIST [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=34).GC finished] POWER-EVAL READ-IDATE READ-RUN-TIME READ-ACL2-ORACLE READ-ACL2-ORACLE@PAR [GC for 8678 CONS pages..(T=28).GC finished] GETENV$ SETENV$ RANDOM$ NATP-RANDOM$ RANDOM$-LINEAR (:NUMBER-OF-ENABLED-RUNES 2608) SYS-CALL (:NUMBER-OF-ENABLED-RUNES 2610) [GC for 8688 CONS pages..(T=28).GC finished] SYS-CALL-STATUS T UPDATE-ACL2-ORACLE-PRESERVES-STATE-P1 (:NUMBER-OF-ENABLED-RUNES 2614) SYS-CALL+ [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] 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 (:NUMBER-OF-ENABLED-RUNES 2621) NIL MAIN-TIMER [GC for 8698 CONS pages..(T=28).GC finished] PUT-ASSOC-EQ-EXEC PUT-ASSOC-EQL-EXEC PUT-ASSOC-EQUAL :REDUNDANT :REDUNDANT PUT-ASSOC-EQ-EXEC-IS-PUT-ASSOC-EQUAL PUT-ASSOC-EQL-EXEC-IS-PUT-ASSOC-EQUAL [GC for 8708 CONS pages..(T=28).GC finished] :REDUNDANT NIL NIL NIL SET-TIMER GET-TIMER NIL PUSH-TIMER RATIONALP-+ RATIONALP-* RATIONALP-UNARY-- RATIONALP-UNARY-/ [GC for 8718 CONS pages..(T=27).GC finished] RATIONALP-IMPLIES-ACL2-NUMBERP [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] POP-TIMER 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 8728 CONS pages..(T=28).GC finished] PRINT-RATIONAL-AS-DECIMAL PRINT-TIMER STATE-P1-UPDATE-PRINT-BASE SET-PRINT-BASE-RADIX [GC for 8738 CONS pages..(T=28).GC finished] KNOWN-PACKAGE-ALIST SYMBOL-IN-CURRENT-PACKAGE-P [GC for 8748 CONS pages..(T=28).GC finished] PRIN1$ NIL CURRENT-PACKAGE STATE-P1-UPDATE-NTH-2-WORLD :REDUNDANT :REDUNDANT LD-SKIP-PROOFSP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] INTERSECTION-EQ-EXEC INTERSECTION-EQL-EXEC [GC for 8758 CONS pages..(T=28).GC finished] INTERSECTION-EQUAL :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 [GC for 8768 CONS pages..(T=30).GC finished] :REDUNDANT SET-COMPILER-ENABLED [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] SET-PORT-FILE-ENABLED DEFAULT-MEASURE-FUNCTION :REDUNDANT DEFAULT-WELL-FOUNDED-RELATION :REDUNDANT :REDUNDANT DEFAULT-DEFUN-MODE DEFAULT-DEFUN-MODE-FROM-STATE [GC for 8778 CONS pages..(T=28).GC finished] :REDUNDANT :REDUNDANT INVISIBLE-FNS-TABLE :REDUNDANT UNARY-FUNCTION-SYMBOL-LISTP INVISIBLE-FNS-ENTRYP :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT REMOVE1-ASSOC-STRING-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8788 CONS pages..(T=28).GC finished] :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT BACKCHAIN-LIMIT :REDUNDANT [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] DEFAULT-BACKCHAIN-LIMIT STEP-LIMIT-FROM-TABLE :REDUNDANT :REDUNDANT :REDUNDANT REWRITE-STACK-LIMIT CASE-SPLIT-LIMITATIONS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8798 CONS pages..(T=28).GC finished] UNTRANS-TABLE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT MATCH-FREE-DEFAULT :REDUNDANT :REDUNDANT MATCH-FREE-OVERRIDE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT RAW-INCLUDE-BOOK-DIR-P :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8808 CONS pages..(T=26).GC finished] NON-LINEARP :REDUNDANT :REDUNDANT [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] TAU-AUTO-MODEP :REDUNDANT GET-IN-THEORY-REDUNDANT-OKP :REDUNDANT :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE 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 8818 CONS pages..(T=27).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 :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT MACRO-ALIASES-TABLE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NTH-ALIASES :REDUNDANT :REDUNDANT DEFAULT-HINTS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT T [GC for 8828 CONS pages..(T=28).GC finished] (:NUMBER-OF-ENABLED-RUNES 2803) :REDUNDANT MACRO-ALIASES-TABLE PAIRLIS$-TRUE-LIST-FIX BOOLEAN-LISTP BOOLEAN-LISTP-CONS [GC for 21504 CONTIGUOUS-BLOCKS pages..(T=35).GC finished] 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 MAKE-CHARACTER-LIST-MAKE-CHARACTER-LIST DEFAULT-COERCE-2 DEFAULT-COERCE-3 :REDUNDANT DEFAULT-DENOMINATOR [GC for 8838 CONS pages..(T=29).GC finished] :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 631 SFUN pages..(T=29).GC finished] P! (:NUMBER-OF-ENABLED-RUNES 2854) :REDUNDANT :REDUNDANT WORMHOLE1 WORMHOLE-P [GC for 8848 CONS pages..(T=28).GC finished] DUPLICATES SET-EQUALP-EQUAL :REDUNDANT :REDUNDANT :REDUNDANT RECORD-ACCESSOR-FUNCTION-NAME :REDUNDANT [GC for 8858 CONS pages..(T=28).GC finished] MFC-CLAUSE MFC-RDEPTH TYPE-ALIST-ENTRYP TYPE-ALISTP MFC-TYPE-ALIST MFC-ANCESTORS MFC-UNIFY-SUBST [GC for 8868 CONS pages..(T=29).GC finished] MFC-WORLD PSEUDO-TERM-LISTP-MFC-CLAUSE TYPE-ALISTP-MFC-TYPE-ALIST :REDUNDANT BAD-ATOM-COMPOUND-RECOGNIZER (:NUMBER-OF-ENABLED-RUNES 2897) :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 8878 CONS pages..(T=29).GC finished] ALPHORDER [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=36).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 NIL NIL [GC for 8888 CONS pages..(T=28).GC finished] TRUE-LISTP-MERGE-SORT-LEXORDER MERGE-SORT-LEXORDER :REDUNDANT RESIZE-LIST-EXEC RESIZE-LIST RESIZE-LIST-EXEC-IS-RESIZE-LIST [GC for 8898 CONS pages..(T=29).GC finished] 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.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SYMBOL-ALISTP) The event ( DEFUN SYMBOL-ALISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-ALISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TRUE-LISTP) The event ( DEFUN TRUE-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TRUE-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LEN) The event ( DEFUN LEN ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LEN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP LENGTH) The event ( DEFUN LENGTH ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN LENGTH ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP NTH) The event ( DEFUN NTH ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN NTH ...) Rules: NIL Time: 0.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 8908 CONS pages..(T=28).GC finished] The event ( DEFUN SYMBOL-LISTP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SYMBOL-LISTP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BINARY-APPEND) The event ( DEFUN BINARY-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN BINARY-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRING-APPEND) The event ( DEFUN STRING-APPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRING-APPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP PLIST-WORLDP) The event ( DEFUN PLIST-WORLDP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN PLIST-WORLDP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FGETPROP) The event ( DEFUN FGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SGETPROP) The event ( DEFUN SGETPROP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SGETPROP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FUNCTION-SYMBOLP) The event ( DEFUN FUNCTION-SYMBOLP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FUNCTION-SYMBOLP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP STRIP-CARS) The event ( DEFUN STRIP-CARS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN STRIP-CARS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC$GUARD-CHECK) The event ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN ASSOC-EQ-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ASSOC-EQ-EXEC) The event ( DEFUN ASSOC-EQ-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ASSOC-EQ-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TABLE-ALIST) The event ( DEFUN TABLE-ALIST ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN TABLE-ALIST ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT End of Encapsulated Events. 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.29 seconds (prove: 0.00, print: 0.00, other: 0.29) :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 8918 CONS pages..(T=29).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.42 seconds (prove: 0.00, print: 0.00, other: 0.42) 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.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) 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 8928 CONS pages..(T=28).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 8938 CONS pages..(T=27).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))). [GC for 8948 CONS pages..(T=27).GC finished] But simplification reduces this to T, using the :definitions KEYWORD-VALUE-LISTP and KEYWORDP. Q.E.D. That completes the proof of the guard theorem for SPLICE-KEYWORD-ALIST. SPLICE-KEYWORD-ALIST is compliant with Common Lisp. Summary Form: ( DEFUN SPLICE-KEYWORD-ALIST ...) Rules: ((:DEFINITION ACL2-COUNT) (:DEFINITION ENDP) (:DEFINITION EQ) (:DEFINITION KEYWORD-VALUE-LISTP) (:DEFINITION KEYWORDP) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O<) (: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: 1.01 seconds (prove: 0.84, print: 0.00, other: 0.17) 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 8958 CONS pages..(T=28).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 8968 CONS pages..(T=28).GC finished] [GC for 8978 CONS pages..(T=27).GC finished] [GC for 8988 CONS pages..(T=27).GC finished] [GC for 8998 CONS pages..(T=27).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.09 secs; see :DOC time-tracker-tau. 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 9008 CONS pages..(T=26).GC finished] [GC for 9018 CONS pages..(T=28).GC finished] [GC for 9028 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition MEMBER-EQUAL, the :executable- counterparts of CAR, CDR, CONSP and EQUAL, primitive type reasoning and the :type-prescription rules LENGTH and STANDARD-CHAR-LISTP. Q.E.D. That completes the proof of the guard theorem for SEARCH-FN-GUARD. SEARCH-FN-GUARD is compliant with Common Lisp. Summary Form: ( DEFUN SEARCH-FN-GUARD ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION EQ) (:DEFINITION HARD-ERROR) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART HARD-ERROR) (:EXECUTABLE-COUNTERPART IF) (:EXECUTABLE-COUNTERPART SYMBOL-LISTP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART TRUE-LISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION HARD-ERROR) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION STANDARD-CHAR-LISTP)) Time: 2.30 seconds (prove: 1.94, print: 0.00, other: 0.36) Prover steps counted: 1480 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.93 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)))))). [GC for 9038 CONS pages..(T=28).GC finished] 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)))) (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 9048 CONS pages..(T=28).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 9048 CONS pages..(T=29).GC finished] [GC for 9058 CONS pages..(T=29).GC finished] [GC for 9068 CONS pages..(T=28).GC finished] [GC for 9078 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.16 secs; see :DOC time-tracker-tau. [GC for 9088 CONS pages..(T=27).GC finished] [GC for 9088 CONS pages..(T=27).GC finished] [GC for 9088 CONS pages..(T=27).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 9088 CONS pages..(T=27).GC finished] [GC for 9088 CONS pages..(T=27).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 9088 CONS pages..(T=29).GC finished] [GC for 9088 CONS pages..(T=29).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 9088 CONS pages..(T=29).GC finished] [GC for 9088 CONS pages..(T=28).GC finished] [GC for 9088 CONS pages..(T=29).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 9088 CONS pages..(T=28).GC finished] [GC for 9088 CONS pages..(T=29).GC finished] [GC for 9088 CONS pages..(T=29).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: 5.68 seconds (prove: 5.18, print: 0.03, other: 0.47) Prover steps counted: 12127 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 3.71 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))))). 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.... [GC for 9088 CONS pages..(T=28).GC finished] 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 9088 CONS pages..(T=29).GC finished] [GC for 9088 CONS pages..(T=28).GC finished] [GC for 9088 CONS pages..(T=28).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 9088 CONS pages..(T=27).GC finished] [GC for 9088 CONS pages..(T=28).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 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 9088 CONS pages..(T=28).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.16 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 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 9088 CONS pages..(T=28).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 9088 CONS pages..(T=28).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))))). [GC for 9088 CONS pages..(T=28).GC finished] 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: 3.12 seconds (prove: 2.59, print: 0.02, other: 0.51) Prover steps counted: 5163 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 1.72 seconds. See :DOC time-tracker-tau. SEARCH-FROM-END To verify that the 18 encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM LEN-STRING-DOWNCASE1 (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X)))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (LEN X). This suggestion was produced using the :induction rules LEN and STRING-DOWNCASE1. If we let (:P X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P X)) (IMPLIES (AND (CONSP X) (:P (CDR X))) (:P X))). This induction is justified by the same argument used to admit LEN. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X))). But simplification reduces this to T, using the :definitions LEN and STRING-DOWNCASE1 and the :executable-counterparts of EQUAL and LEN. Subgoal *1/1 (IMPLIES (AND (CONSP X) (EQUAL (LEN (STRING-DOWNCASE1 (CDR X))) (LEN (CDR X)))) (EQUAL (LEN (STRING-DOWNCASE1 X)) (LEN X))). But simplification reduces this to T, using the :definitions LEN and STRING-DOWNCASE1, primitive type reasoning, the :rewrite rule CDR-CONS and the :type-prescription rule STRING-DOWNCASE1. That completes the proof of *1. Q.E.D. Summary Form: ( DEFTHM LEN-STRING-DOWNCASE1 ...) Rules: ((:DEFINITION LEN) (:DEFINITION STRING-DOWNCASE1) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART LEN) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION LEN) (:INDUCTION STRING-DOWNCASE1) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION STRING-DOWNCASE1)) Time: 0.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!] 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))). [GC for 9088 CONS pages..(T=29).GC finished] 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.31 seconds (prove: 0.31, 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. 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))). [GC for 9088 CONS pages..(T=30).GC finished] 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.31 seconds (prove: 0.31, 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!] Name the formula above *1. [GC for 9088 CONS pages..(T=29).GC finished] 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.31 seconds (prove: 0.31, 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))))) 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))). [GC for 9088 CONS pages..(T=29).GC finished] 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.31 seconds (prove: 0.30, print: 0.01, other: 0.00) Prover steps counted: 532 CHARACTER-LISTP-OF-TAKE ACL2 !>>(LOCAL (DEFTHM CHARACTER-LISTP-NTHCDR (IMPLIES (CHARACTER-LISTP X) (CHARACTER-LISTP (NTHCDR N X))))) Name the formula above *1. Perhaps we can prove *1 by induction. Two induction schemes are suggested by this conjecture. These merge into one derived induction scheme. We will induct according to a scheme suggested by (NTHCDR N X). This suggestion was produced using the :induction rules CHARACTER-LISTP and NTHCDR. If we let (:P N X) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (ZP N)) (:P (+ N -1) (CDR X))) (:P N X)) (IMPLIES (ZP N) (:P N X))). This induction is justified by the same argument used to admit NTHCDR. Note, however, that the unmeasured variable X is being instantiated. When applied to the goal at hand the above induction scheme produces three nontautological subgoals. Subgoal *1/3 (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). This simplifies, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CDR and CONSP, primitive type reasoning, the :rewrite rule COMMUTATIVITY-OF-+ and the :type-prescription rule CHARACTER-LISTP, to Subgoal *1/3' (IMPLIES (AND (NOT (ZP N)) (CHARACTER-LISTP (NTHCDR (+ N -1) NIL)) (NOT X)) (CHARACTER-LISTP (NTHCDR (+ -1 N) NIL))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2 (IMPLIES (AND (NOT (ZP N)) (NOT (CHARACTER-LISTP (CDR X))) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :definition CHARACTER-LISTP, the :executable-counterparts of CDR, CHARACTER-LISTP and CONSP and primitive type reasoning. Subgoal *1/1 (IMPLIES (AND (ZP N) (CHARACTER-LISTP X)) (CHARACTER-LISTP (NTHCDR N X))). But simplification reduces this to T, using the :compound-recognizer rule ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP and NTHCDR, the :executable-counterparts of CHARACTER-LISTP and CONSP, primitive type reasoning and the :type-prescription rule CHARACTER-LISTP. That completes the proof of *1. Q.E.D. The storage of CHARACTER-LISTP-NTHCDR depends upon the :type-prescription rule CHARACTER-LISTP. Summary Form: ( DEFTHM CHARACTER-LISTP-NTHCDR ...) Rules: ((:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION NOT) (:DEFINITION NTHCDR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION CHARACTER-LISTP) (:INDUCTION NTHCDR) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION CHARACTER-LISTP)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) Prover steps counted: 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))). 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.00 seconds (prove: 0.00, 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)))). [GC for 9088 CONS pages..(T=30).GC finished] 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)))))). 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)). [GC for 9088 CONS pages..(T=30).GC finished] 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))))). 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)))). [GC for 9088 CONS pages..(T=30).GC finished] 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.93 seconds (prove: 0.93, print: 0.00, 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))). 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.00 seconds (prove: 0.00, print: 0.00, other: 0.00) Prover steps counted: 582 SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-REVAPPEND (EQUAL (TRUE-LISTP (REVAPPEND X Y)) (TRUE-LISTP Y)))) [GC for 9088 CONS pages..(T=30).GC finished] 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.01, print: 0.00, other: 0.00) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-NTHCDR ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-NTHCDR ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-SUBSEQ (IMPLIES (TRUE-LISTP SEQ) (TRUE-LISTP (SUBSEQ SEQ START END))) :RULE-CLASSES (:REWRITE :TYPE-PRESCRIPTION))) ACL2 Observation in ( DEFTHM TRUE-LISTP-SUBSEQ ...): Our heuristics choose (SUBSEQ SEQ START END) as the :TYPED-TERM. ACL2 Warning [Non-rec] in ( DEFTHM TRUE-LISTP-SUBSEQ ...): A :REWRITE rule generated from TRUE-LISTP-SUBSEQ will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-SUBSEQ depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-SUBSEQ ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-SUBSEQ-TYPE-PRESCRIPTION)) Warnings: Non-rec Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-SUBSEQ ACL2 !>>(LOCAL (DEFTHM LEN-REVAPPEND (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y))))) Name the formula above *1. Perhaps we can prove *1 by induction. Three induction schemes are suggested by this conjecture. These merge into two derived induction schemes. However, one of these is flawed and so we are left with one viable candidate. We will induct according to a scheme suggested by (LEN X), but modified to accommodate (REVAPPEND X Y). These suggestions were produced using the :induction rules LEN and REVAPPEND. If we let (:P X Y) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (NOT (CONSP X)) (:P X Y)) (IMPLIES (AND (CONSP X) (:P (CDR X) (CONS (CAR X) Y))) (:P X Y))). This induction is justified by the same argument used to admit LEN. Note, however, that the unmeasured variable Y is being instantiated. When applied to the goal at hand the above induction scheme produces two nontautological subgoals. Subgoal *1/2 (IMPLIES (NOT (CONSP X)) (EQUAL (LEN (REVAPPEND X Y)) (+ (LEN X) (LEN Y)))). 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)))). 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.01 seconds (prove: 0.00, print: 0.01, 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)). [GC for 9088 CONS pages..(T=30).GC finished] 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.31 seconds (prove: 0.31, 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.01 seconds (prove: 0.01, print: 0.00, other: 0.00) Prover steps counted: 286 LEN-SUBSEQ ACL2 !>>(LOCAL (DEFTHM LEN-SUBSEQ-STRING (IMPLIES (AND (STRINGP SEQ) (NATP START) (NATP END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (- END START))) :HINTS (("Goal" :IN-THEORY (ENABLE SUBSEQ))))) ACL2 Warning [Non-rec] in ( DEFTHM LEN-SUBSEQ-STRING ...): A :REWRITE rule generated from LEN-SUBSEQ-STRING will be triggered only by terms containing the function symbol SUBSEQ, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. [Note: A hint was supplied for our processing of the goal above. Thanks!] By the simple :definition NATP we reduce the conjecture to Goal' (IMPLIES (AND (STRINGP SEQ) (INTEGERP START) (<= 0 START) (INTEGERP END) (<= 0 END) (<= START END) (<= END (LEN (COERCE SEQ 'LIST)))) (EQUAL (LEN (COERCE (SUBSEQ SEQ START END) 'LIST)) (+ END (- START)))). [GC for 9088 CONS pages..(T=30).GC finished] 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.30 seconds (prove: 0.30, print: 0.00, other: 0.00) Prover steps counted: 384 LEN-SUBSEQ-STRING ACL2 !>>(DEFUN SEARCH-FN (SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) (DECLARE (XARGS :GUARD (SEARCH-FN-GUARD SEQ1 SEQ2 FROM-END TEST START1 START2 END1 END2 END1P END2P) :GUARD-HINTS (("Goal" :IN-THEORY (DISABLE SUBSEQ))))) (LET* ((END1 (IF END1P END1 (LENGTH SEQ1))) (END2 (IF END2P END2 (LENGTH SEQ2))) (SEQ1 (SUBSEQ SEQ1 START1 END1))) (MV-LET (SEQ1 SEQ2) (COND ((EQ TEST 'CHAR-EQUAL) (MV (STRING-DOWNCASE SEQ1) (STRING-DOWNCASE SEQ2))) (T (MV SEQ1 SEQ2))) (AND (<= (- END1 START1) (- END2 START2)) (COND (FROM-END (SEARCH-FROM-END SEQ1 SEQ2 START2 END2 NIL)) (T (SEARCH-FROM-START SEQ1 SEQ2 START2 END2))))))) 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 9088 CONS pages..(T=31).GC finished] [GC for 9098 CONS pages..(T=30).GC finished] [GC for 9098 CONS pages..(T=30).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 9108 CONS pages..(T=30).GC finished] [GC for 9118 CONS pages..(T=29).GC finished] [GC for 9118 CONS pages..(T=30).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.52 secs; see :DOC time-tracker-tau. [GC for 9118 CONS pages..(T=28).GC finished] [GC for 9118 CONS pages..(T=29).GC finished] [GC for 9118 CONS pages..(T=30).GC finished] [GC for 9118 CONS pages..(T=30).GC finished] [GC for 9118 CONS pages..(T=30).GC finished] [GC for 9118 CONS pages..(T=30).GC finished] [GC for 9128 CONS pages..(T=29).GC finished] [GC for 9128 CONS pages..(T=29).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 [GC for 9128 CONS pages..(T=30).GC finished] (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)))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 174 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). By the simple :definition NATP we reduce the conjecture to Subgoal 174' (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) END2)). [GC for 9128 CONS pages..(T=29).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-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)))). 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)))). [GC for 9128 CONS pages..(T=29).GC finished] But simplification reduces this to T, using the :definition LENGTH. Subgoal 163 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 162 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 161 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 160 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 159 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 158 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 157 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 156 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 155 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN (COERCE SEQ1 'LIST)) (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 154 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 153 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 152 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= (+ (- 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)))). [GC for 9128 CONS pages..(T=27).GC finished] But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 150 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 149 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 148 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN (COERCE SEQ1 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN (COERCE SEQ1 'LIST))) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 147 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 146 (IMPLIES (AND (EQUAL TEST 'EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN (COERCE SEQ2 'LIST)))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END1 (- START1)))). 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)))). [GC for 9128 CONS pages..(T=29).GC finished] 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)))). 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)))). [GC for 9128 CONS pages..(T=28).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 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. 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)))). [GC for 9128 CONS pages..(T=28).GC finished] 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))). By the simple :definition NATP we reduce the conjecture to Subgoal 114' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 113 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) END2)). [GC for 9128 CONS pages..(T=28).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 113' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (ACL2-NUMBERP START2) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) END2)). This simplifies, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH and the :rewrite 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))). [GC for 9128 CONS pages..(T=27).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 103' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) END1) (<= END1 (LEN SEQ1))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 102 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 NIL))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 101 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 100 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 99 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 98 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 97 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 96 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 95 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (INTEGERP START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 94 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= (LEN SEQ1) (LEN SEQ1))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 93 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 92 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END2 (- START2)))). 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))). [GC for 9128 CONS pages..(T=27).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 90' (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP (LEN SEQ1)) (<= 0 (LEN SEQ1)) (INTEGERP END2) (<= 0 END2) (<= START1 (LEN SEQ1)) (<= START2 END2) (<= (LEN SEQ1) (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2)) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= END2 (LEN SEQ2))). But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 89 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 88 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 87 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) (NOT END1P) END2P (LET ((END1 (LEN SEQ1))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ (- START1) (LEN SEQ1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 86 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (<= 0 START1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 85 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) (RATIONALP (+ END1 (- START1)))). 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))). [GC for 9128 CONS pages..(T=28).GC finished] But simplification reduces this to T, using the :definition LENGTH and the :type-prescription rule LEN. Subgoal 79 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 78 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END1 NIL) (END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2))))) END1). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 77 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= 0 START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 76 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 75 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (LEN SEQ2) (LEN SEQ2))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 74 (IMPLIES (AND (EQUAL TEST 'EQUAL) (NOT (STRINGP SEQ1)) (TRUE-LISTP SEQ1) (TRUE-LISTP SEQ2) END1P (NOT END2P) (LET ((END2 (LEN SEQ2))) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (<= (+ END1 (- START1)) (+ (- START2) (LEN SEQ2)))) (<= (+ START2 (LEN (SUBSEQ SEQ1 START1 END1))) (LEN SEQ2))). 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))). [GC for 9128 CONS pages..(T=27).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 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)). 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)))). [GC for 9128 CONS pages..(T=28).GC finished] 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)))). But simplification reduces this to T, using the :definition LENGTH. Subgoal 57 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 56 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 55 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (<= START1 (LEN (COERCE SEQ1 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 54 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 53 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (RATIONALP (+ NIL (- START1)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 52 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1)) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 51 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) END1) (INTEGERP END1)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 50 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= (+ START2 (LEN (COERCE (SUBSEQ SEQ1 START1 NIL) 'LIST))) END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 49 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 48 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (INTEGERP START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 47 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= 0 START2)). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 46 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET ((END1 NIL)) (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (NOT END1) (<= (+ NIL (- START1)) (+ END2 (- START2)))) (<= END2 (LEN (COERCE SEQ2 'LIST)))). But we reduce the conjecture to T, by the :executable-counterpart of NATP. Subgoal 45 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP START2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 44 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (INTEGERP END1)) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). [GC for 9128 CONS pages..(T=29).GC finished] By the simple :definition NATP we reduce the conjecture to Subgoal 44' (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (INTEGERP START1) (<= 0 START1) (INTEGERP START2) (<= 0 START2) (INTEGERP END1) (<= 0 END1) (INTEGERP END2) (<= 0 END2) (<= START1 END1) (<= START2 END2) (<= END1 (LENGTH SEQ1)) (<= END2 (LENGTH SEQ2))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))). But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definition LENGTH, the :rewrite rule SUBSEQ-PRESERVES-STANDARD-CHAR-LISTP and the :type-prescription rule STANDARD-CHAR-LISTP. Subgoal 43 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (RATIONALP (+ END1 (- START1)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 42 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP END1)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 41 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (RATIONALP (+ END2 (- START2)))). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 40 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST))) (ACL2-NUMBERP END2)). But we reduce the conjecture to T, by the simple :definition NATP and the :executable-counterpart of TAU-SYSTEM. Subgoal 39 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (INTEGERP END2)). But we reduce the conjecture to T, by the simple :definition NATP. Subgoal 38 (IMPLIES (AND (EQUAL TEST 'CHAR-EQUAL) (STRINGP SEQ1) (STRINGP SEQ2) (STANDARD-CHAR-LISTP (COERCE SEQ1 'LIST)) (STANDARD-CHAR-LISTP (COERCE SEQ2 'LIST)) END1P END2P (LET NIL (AND (NATP START1) (NATP START2) (NATP END1) (NATP END2) (NOT (< END1 START1)) (NOT (< END2 START2)) (NOT (< (LENGTH SEQ1) END1)) (NOT (< (LENGTH SEQ2) END2)))) (STANDARD-CHAR-LISTP (COERCE (SUBSEQ SEQ1 START1 END1) 'LIST)) (<= (+ END1 (- START1)) (+ END2 (- START2)))) (<= 0 START2)). 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 9128 CONS pages..(T=29).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 9128 CONS pages..(T=30).GC finished] 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 9128 CONS pages..(T=30).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 9128 CONS pages..(T=29).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 9128 CONS pages..(T=29).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 9128 CONS pages..(T=28).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 9128 CONS pages..(T=29).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)))). 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: 10.73 seconds (prove: 10.13, print: 0.39, other: 0.21) Prover steps counted: 63983 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 2.93 seconds. See :DOC time-tracker-tau. SEARCH-FN End of Encapsulated Events. [GC for 9128 CONS pages..(T=29).GC finished] Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export SEARCH-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Warnings: Non-rec Time: 14.38 seconds (prove: 12.93, print: 0.41, other: 1.04) 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))). 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.01 seconds (prove: 0.01, 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))))). [GC for 9128 CONS pages..(T=28).GC finished] 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)))). 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.49 seconds (prove: 0.29, print: 0.01, other: 0.19) 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))). [GC for 9128 CONS pages..(T=29).GC finished] 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.49 seconds (prove: 0.29, print: 0.00, other: 0.20) Prover steps counted: 754 COUNT-LISTP To verify that the two encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOCAL (DEFTHM TRUE-LISTP-NTHCDR (IMPLIES (TRUE-LISTP X) (TRUE-LISTP (NTHCDR N X))))) But we reduce the conjecture to T, by the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION. Q.E.D. The storage of TRUE-LISTP-NTHCDR depends upon the :type-prescription rule TRUE-LISTP. Summary Form: ( DEFTHM TRUE-LISTP-NTHCDR ...) Rules: ((:TYPE-PRESCRIPTION TRUE-LISTP) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) TRUE-LISTP-NTHCDR ACL2 !>>(DEFUN COUNT-FN (ITEM SEQUENCE START END) (DECLARE (XARGS :GUARD (AND (IF (TRUE-LISTP SEQUENCE) T (STRINGP SEQUENCE)) (NATP START) (OR (NULL END) (AND (NATP END) (<= END (LENGTH SEQUENCE))))))) (LET ((END (OR END (LENGTH SEQUENCE)))) (COND ((<= END START) 0) ((STRINGP SEQUENCE) (COUNT-STRINGP ITEM SEQUENCE START END)) (T (COUNT-LISTP ITEM (NTHCDR START SEQUENCE) (- END START)))))) Since COUNT-FN is non-recursive, its admission is trivial. We observe that the type of COUNT-FN is described by the theorem (AND (INTEGERP (COUNT-FN ITEM SEQUENCE START END)) (<= 0 (COUNT-FN ITEM SEQUENCE START END))). We used the :type-prescription rules COUNT-LISTP and COUNT-STRINGP. Computing the guard conjecture for COUNT-FN.... The non-trivial part of the guard conjecture for COUNT-FN, given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER and the :type-prescription rule LENGTH, is Goal (AND (IMPLIES (AND (EQUAL END NIL) (NATP START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (EQUAL END NIL) (NATP START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (NATP END) (NATP START) (TRUE-LISTP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))) (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (NATP END) (NATP START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START)))))))). [GC for 9128 CONS pages..(T=29).GC finished] [GC for 9128 CONS pages..(T=29).GC finished] [GC for 9128 CONS pages..(T=30).GC finished] [GC for 9128 CONS pages..(T=30).GC finished] TIME-TRACKER-NOTE [:TAU]: Elapsed runtime in tau is 1.19 secs; see :DOC time-tracker-tau. 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 9128 CONS pages..(T=29).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 9128 CONS pages..(T=30).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))))))). [GC for 9128 CONS pages..(T=29).GC finished] This simplifies, using the :definitions LENGTH, NATP and NOT, the :executable- counterpart of NOT, primitive type reasoning and the :type-prescription rule TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION, to Subgoal 2' (IMPLIES (AND (<= END (LEN SEQUENCE)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (TRUE-LISTP SEQUENCE) (< START END)) (<= 0 (+ END (- START)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal 1 (IMPLIES (AND (<= END (LENGTH SEQUENCE)) (INTEGERP END) (<= 0 END) (INTEGERP START) (<= 0 START) (STRINGP SEQUENCE)) (LET ((END (OR END (LENGTH SEQUENCE)))) (AND (RATIONALP START) (RATIONALP END) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP END)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (NATP START)) (OR (<= END START) (NOT (STRINGP SEQUENCE)) (<= END (LENGTH SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (INTEGERP START)) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP SEQUENCE)) (OR (<= END START) (STRINGP SEQUENCE) (<= 0 START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP START)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP END)) (OR (<= END START) (STRINGP SEQUENCE) (ACL2-NUMBERP (- START))) (OR (<= END START) (STRINGP SEQUENCE) (TRUE-LISTP (NTHCDR START SEQUENCE))) (OR (<= END START) (STRINGP SEQUENCE) (NATP (+ END (- START))))))). [GC for 9128 CONS pages..(T=29).GC finished] But simplification reduces this to T, using the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :definitions LENGTH and NOT and the :executable-counterpart of NOT. Q.E.D. That completes the proof of the guard theorem for COUNT-FN. COUNT-FN is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-FN ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:DEFINITION LENGTH) (:DEFINITION NATP) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE COMMUTATIVITY-OF-+) (:TYPE-PRESCRIPTION COUNT-LISTP) (:TYPE-PRESCRIPTION COUNT-STRINGP) (:TYPE-PRESCRIPTION LEN) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION TRUE-LISTP-NTHCDR-TYPE-PRESCRIPTION)) Time: 2.60 seconds (prove: 2.39, print: 0.01, other: 0.20) Prover steps counted: 2976 TIME-TRACKER-NOTE [:TAU]: For the proof above, the total runtime spent in the tau system was 2.07 seconds. See :DOC time-tracker-tau. COUNT-FN End of Encapsulated Events. Having verified that the encapsulated events validate the signatures of the ENCAPSULATE event, we discard the ephemeral theory and extend the original theory as directed by the signatures and the non-LOCAL events. We export COUNT-FN. Summary Form: ( ENCAPSULATE NIL (LOCAL ...) ...) Rules: NIL Time: 2.80 seconds (prove: 2.39, print: 0.01, other: 0.40) 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.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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.33 seconds (prove: 0.00, print: 0.01, other: 0.32) 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. [GC for 631 SFUN pages..(T=30).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] 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.81 seconds (prove: 0.00, print: 0.00, other: 0.81) 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 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.01, print: 0.00, other: 0.00) Prover steps counted: 311 TRUE-LISTP-REVAPPEND ACL2 !>>(VERIFY-GUARDS THROW-NONEXEC-ERROR) Computing the guard conjecture for THROW-NONEXEC-ERROR.... The guard conjecture for THROW-NONEXEC-ERROR is trivial to prove. THROW-NONEXEC-ERROR is compliant with Common Lisp. Summary Form: ( VERIFY-GUARDS THROW-NONEXEC-ERROR) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) THROW-NONEXEC-ERROR ACL2 !>>(VERIFY-GUARDS DEFUN-NX-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.01 seconds (prove: 0.01, print: 0.00, other: 0.00) 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.06 seconds (prove: 0.00, print: 0.00, other: 0.06) 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.09 seconds (prove: 0.00, print: 0.00, other: 0.09) 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.10 seconds (prove: 0.00, print: 0.00, other: 0.10) 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. [GC for 2049 RELOCATABLE-BLOCKS pages..(T=29).GC finished] 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.42 seconds (prove: 0.00, print: 0.00, other: 0.42) 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.12 seconds (prove: 0.00, print: 0.00, other: 0.12) DELETE-FILE$ Since DEBUGGER-ENABLE is non-recursive, its admission is trivial. We could deduce no constraints on the type of DEBUGGER-ENABLE. (DEBUGGER-ENABLE STATE) => *. Computing the guard conjecture for DEBUGGER-ENABLE.... The non-trivial part of the guard conjecture for DEBUGGER-ENABLE, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)). But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GLOBAL-TABLE and STATE-P. Q.E.D. That completes the proof of the guard theorem for DEBUGGER-ENABLE. DEBUGGER-ENABLE is compliant with Common Lisp. Summary Form: ( DEFUN DEBUGGER-ENABLE ...) Rules: ((:DEFINITION BOUNDP-GLOBAL) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION GLOBAL-TABLE) (:DEFINITION NOT) (:DEFINITION STATE-P) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.12 seconds (prove: 0.00, 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.04 seconds (prove: 0.00, print: 0.00, other: 0.04) 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.08 seconds (prove: 0.00, print: 0.00, other: 0.08) PRINT-CALL-HISTORY The event ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO DEBUGGER-ENABLEDP-VAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since DEBUGGER-ENABLEDP is non-recursive, its admission is trivial. We observe that the type of DEBUGGER-ENABLEDP is described by the theorem (OR (EQUAL (DEBUGGER-ENABLEDP STATE) T) (EQUAL (DEBUGGER-ENABLEDP STATE) NIL)). (DEBUGGER-ENABLEDP STATE) => *. Computing the guard conjecture for DEBUGGER-ENABLEDP.... [GC for 9128 CONS pages..(T=29).GC finished] The non-trivial part of the guard conjecture for DEBUGGER-ENABLEDP, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (AND (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (BOUNDP-GLOBAL1 'DEBUGGER-ENABLE STATE)) (IMPLIES (AND (BOUNDP-GLOBAL 'DEBUGGER-ENABLE STATE) (STATE-P STATE)) (LET ((X (GET-GLOBAL 'DEBUGGER-ENABLE STATE)) (L '(T :BREAK :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L)))))). But we reduce the conjecture to T, by the simple :definitions BOUNDP-GLOBAL, BOUNDP-GLOBAL1, GET-GLOBAL, GLOBAL-TABLE and STATE-P, the :executable- counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for DEBUGGER-ENABLEDP. DEBUGGER-ENABLEDP is compliant with Common Lisp. Summary Form: ( DEFUN DEBUGGER-ENABLEDP ...) Rules: ((:DEFINITION BOUNDP-GLOBAL) (:DEFINITION BOUNDP-GLOBAL1) (:DEFINITION GET-GLOBAL) (:DEFINITION GLOBAL-TABLE) (:DEFINITION NOT) (:DEFINITION STATE-P) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.47 seconds (prove: 0.00, print: 0.00, other: 0.47) 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.18 seconds (prove: 0.00, print: 0.01, other: 0.17) Prover steps counted: 129 MAYBE-PRINT-CALL-HISTORY The event ( DEFMACRO WITH-RECKLESS-READTABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WITH-RECKLESS-READTABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SET-DEBUGGER-ENABLE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SET-DEBUGGER-ENABLE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SET-DEBUGGER-ENABLE-FN is non-recursive, its admission is trivial. We observe that the type of SET-DEBUGGER-ENABLE-FN is described by the theorem (CONSP (SET-DEBUGGER-ENABLE-FN VAL STATE)). We used the :type-prescription rule PUT-GLOBAL. (SET-DEBUGGER-ENABLE-FN * STATE) => STATE. [GC for 9128 CONS pages..(T=30).GC finished] Computing the guard conjecture for SET-DEBUGGER-ENABLE-FN.... The non-trivial part of the guard conjecture for SET-DEBUGGER-ENABLE-FN, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rules MEMBER-EQ-EXEC$GUARD-CHECK and STATE-P, is Goal (AND (IMPLIES (STATE-P STATE) (LET ((X VAL) (L '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (IMPLIES (AND (LET ((X VAL) (L '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK))) (MEMBER-EQUAL X L)) (STATE-P STATE)) (LET ((STATE (PUT-GLOBAL 'DEBUGGER-ENABLE VAL STATE))) (AND (BOUNDP-GLOBAL1 'DMRP STATE) (STATE-P1 STATE) (OR (NOT (CONSP (GET-GLOBAL 'DMRP STATE))) (STATE-P1 STATE)))))). [Note: A hint was supplied for our processing of the goal above. Thanks!] [GC for 9128 CONS pages..(T=29).GC finished] By the simple :definitions 32-BIT-INTEGER-STACK, ACL2-ORACLE, BIG-CLOCK-ENTRY, FILE-CLOCK, FILE-CLOCK-P, GET-GLOBAL, GLOBAL-TABLE, IDATES, LIST-ALL-PACKAGE-NAMES-LST, NATP, OPEN-CHANNELS-P, OPEN-INPUT-CHANNELS, OPEN-OUTPUT-CHANNELS, READ-FILES, READ-FILES-P, READABLE-FILES, READABLE-FILES-P, STATE-P, STATE-P1, T-STACK, USER-STOBJ-ALIST1, WRITEABLE-FILES, WRITEABLE-FILES-P, WRITTEN-FILES and WRITTEN-FILES-P, the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to Goal' (IMPLIES (AND (MEMBER-EQUAL VAL '(T NIL :NEVER :BREAK :BT :BREAK-BT :BT-BREAK)) (TRUE-LISTP STATE) (EQUAL (LENGTH STATE) 15) (ORDERED-SYMBOL-ALISTP (NTH 0 STATE)) (OPEN-CHANNEL-LISTP (NTH 0 STATE)) (ORDERED-SYMBOL-ALISTP (NTH 1 STATE)) (OPEN-CHANNEL-LISTP (NTH 1 STATE)) (ORDERED-SYMBOL-ALISTP (NTH 2 STATE)) (ALL-BOUNDP '((ABBREV-EVISC-TUPLE . :DEFAULT) (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 9128 CONS pages..(T=29).GC finished] [GC for 9128 CONS pages..(T=29).GC finished] [GC for 9138 CONS pages..(T=29).GC finished] [GC for 9148 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9158 CONS pages..(T=28).GC finished] [GC for 9158 CONS pages..(T=30).GC finished] [GC for 9158 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=31).GC finished] [GC for 9168 CONS pages..(T=31).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=27).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=30).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=29).GC finished] [GC for 9168 CONS pages..(T=27).GC finished] [GC for 9168 CONS pages..(T=28).GC finished] [GC for 9168 CONS pages..(T=27).GC finished] [GC for 9168 CONS pages..(T=27).GC finished] [GC for 9168 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=26).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=26).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=27).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=28).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).GC finished] [GC for 9178 CONS pages..(T=29).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: 61.23 seconds (prove: 60.78, print: 0.02, other: 0.43) Prover steps counted: 281055 SET-DEBUGGER-ENABLE-FN Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) (:NUMBER-OF-ENABLED-RUNES 3016) Summary Form: ( IN-THEORY (DISABLE ...)) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) (: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.11 seconds (prove: 0.00, print: 0.00, other: 0.11) 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))). [GC for 9178 CONS pages..(T=30).GC finished] 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.44 seconds (prove: 0.30, 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.14 seconds (prove: 0.00, print: 0.00, other: 0.14) 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.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :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 Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUSH-CLAUSE@PAR (&REST RST) (CONS 'PUSH-CLAUSE RST)) The event ( DEFMACRO PUSH-CLAUSE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PUSH-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR (&REST RST) (CONS 'PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM RST)) The event ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO PUT-CL-ID-OF-CUSTOM-KEYWORD-HINT-IN-COMPUTED-HINT-FORM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO RECORD-GAG-STATE@PAR (&REST RST) (CONS 'RECORD-GAG-STATE RST)) The event ( DEFMACRO RECORD-GAG-STATE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO RECORD-GAG-STATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO THANKS-FOR-THE-HINT@PAR (&REST RST) (CONS 'THANKS-FOR-THE-HINT RST)) The event ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO THANKS-FOR-THE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE@PAR (&REST RST) (CONS 'TRANSLATE RST)) The event ( DEFMACRO TRANSLATE@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE1@PAR (&REST RST) (CONS 'TRANSLATE1 RST)) The event ( DEFMACRO TRANSLATE1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TRANSLATE1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKCHAIN-LIMIT-RW-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKCHAIN-LIMIT-RW-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BACKTRACK-HINT RST)) The event ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BACKTRACK-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BDD-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-BDD-HINT1 RST)) The event ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BDD-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-BY-HINT@PAR (&REST RST) (CONS 'TRANSLATE-BY-HINT RST)) The event ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-BY-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT RST)) The event ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASE-SPLIT-LIMITATIONS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CASES-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CASES-HINT RST)) The event ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CASES-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CLAUSE-PROCESSOR-HINT RST)) The event ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CLAUSE-PROCESSOR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR (&REST RST) (CONS 'TRANSLATE-CUSTOM-KEYWORD-HINT RST)) The event ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-CUSTOM-KEYWORD-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-DO-NOT-INDUCT-HINT RST)) The event ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-DO-NOT-INDUCT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-ERROR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-ERROR-HINT RST)) The event ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-ERROR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-HINT1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-EXPAND-TERM1@PAR (&REST RST) (CONS 'TRANSLATE-EXPAND-TERM1 RST)) The event ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-EXPAND-TERM1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-FUNCTIONAL-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-FUNCTIONAL-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-HANDS-OFF-HINT1 RST)) The event ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HANDS-OFF-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-HINT RST)) The event ( DEFMACRO TRANSLATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS@PAR (&REST RST) (CONS 'TRANSLATE-HINTS RST)) The event ( DEFMACRO TRANSLATE-HINTS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS1 RST)) The event ( DEFMACRO TRANSLATE-HINTS1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS2@PAR (&REST RST) (CONS 'TRANSLATE-HINTS2 RST)) The event ( DEFMACRO TRANSLATE-HINTS2@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS2@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-HINTS+1@PAR (&REST RST) (CONS 'TRANSLATE-HINTS+1 RST)) The event ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-HINTS+1@PAR ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :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 [GC for 9178 CONS pages..ACL2 !>>(T=29).GC finished] (DEFMACRO TRANSLATE-LMI/INSTANCE@PAR (&REST RST) (CONS 'TRANSLATE-LMI/INSTANCE RST)) The event ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-LMI/INSTANCE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-OP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-OP-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-OP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NO-THANKS-HINT RST)) The event ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NO-THANKS-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR (&REST RST) (CONS 'TRANSLATE-NONLINEARP-HINT RST)) The event ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-NONLINEARP-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-OR-HINT@PAR (&REST RST) (CONS 'TRANSLATE-OR-HINT RST)) The event ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-OR-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-REORDER-HINT@PAR (&REST RST) (CONS 'TRANSLATE-REORDER-HINT RST)) The event ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-REORDER-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RESTRICT-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RESTRICT-HINT RST)) The event ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RESTRICT-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-RW-CACHE-STATE-HINT RST)) The event ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-RW-CACHE-STATE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR (&REST RST) (CONS 'TRANSLATE-SIMPLE-OR-ERROR-TRIPLE RST)) The event ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SIMPLE-OR-ERROR-TRIPLE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR (&REST RST) (CONS 'TRANSLATE-SUBSTITUTION-LST RST)) The event ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-SUBSTITUTION-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-TERM-LST@PAR (&REST RST) (CONS 'TRANSLATE-TERM-LST RST)) The event ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-TERM-LST@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT RST)) The event ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-USE-HINT1@PAR (&REST RST) (CONS 'TRANSLATE-USE-HINT1 RST)) The event ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-USE-HINT1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO TRANSLATE-X-HINT-VALUE@PAR (&REST RST) (CONS 'TRANSLATE-X-HINT-VALUE RST)) The event ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO TRANSLATE-X-HINT-VALUE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR (&REST RST) (CONS 'WARN-ON-DUPLICATE-HINT-GOAL-SPECS RST)) The event ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WARN-ON-DUPLICATE-HINT-GOAL-SPECS@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-MSG@PAR (&REST RST) (CONS 'WATERFALL-MSG RST)) The event ( DEFMACRO WATERFALL-MSG@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-MSG@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-PRINT-CLAUSE@PAR (&REST RST) (CONS 'WATERFALL-PRINT-CLAUSE RST)) The event ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-PRINT-CLAUSE@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP@PAR (&REST RST) (CONS 'WATERFALL-STEP RST)) The event ( DEFMACRO WATERFALL-STEP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP1@PAR (&REST RST) (CONS 'WATERFALL-STEP1 RST)) The event ( DEFMACRO WATERFALL-STEP1@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL-STEP-CLEANUP@PAR (&REST RST) (CONS 'WATERFALL-STEP-CLEANUP RST)) The event ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL-STEP-CLEANUP@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0@PAR (&REST RST) (CONS 'WATERFALL0 RST)) The event ( DEFMACRO WATERFALL0@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WATERFALL0@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0-OR-HIT@PAR (&REST RST) (CONS 'WATERFALL0-OR-HIT RST)) The event ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL0-OR-HIT@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR (&REST RST) (CONS 'WATERFALL0-WITH-HINT-SETTINGS RST)) The event ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO WATERFALL0-WITH-HINT-SETTINGS@PAR ...) Rules: NIL Time: 0.01 seconds (prove: 0.00, print: 0.00, other: 0.01) :REDUNDANT ACL2 !>>(DEFMACRO WATERFALL1@PAR (&REST RST) (CONS 'WATERFALL1 RST)) The event ( DEFMACRO WATERFALL1@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WATERFALL1@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Summary Form: ( PROGN (DEFMACRO CATCH-TIME-LIMIT5@PAR ...) ...) Rules: NIL Time: 0.34 seconds (prove: 0.00, print: 0.00, other: 0.34) :REDUNDANT The admission of REPLACE-DEFUN@PAR-WITH-DEFUN is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT FORMS). We observe that the type of REPLACE-DEFUN@PAR-WITH-DEFUN is described by the theorem (TRUE-LISTP (REPLACE-DEFUN@PAR-WITH-DEFUN FORMS)). We used primitive type reasoning. Computing the guard conjecture for REPLACE-DEFUN@PAR-WITH-DEFUN.... The non-trivial part of the guard conjecture for REPLACE-DEFUN@PAR-WITH-DEFUN, given the :forward-chaining rule ALISTP-FORWARD-TO-TRUE-LISTP and the :type-prescription rule ALISTP, is Goal (AND (IMPLIES (AND (ALISTP FORMS) (NOT (ENDP FORMS))) (ALISTP (CDR FORMS))) (IMPLIES (AND (ALISTP FORMS) (NOT (ENDP FORMS)) (NOT (CONSP (CAR FORMS)))) (EQUAL (CAR FORMS) NIL))). By the simple :definition ENDP we reduce the conjecture to the following two conjectures. Subgoal 2 (IMPLIES (AND (ALISTP FORMS) (CONSP FORMS)) (ALISTP (CDR FORMS))). But simplification reduces this to T, using the :definition ALISTP. Subgoal 1 (IMPLIES (AND (ALISTP FORMS) (CONSP FORMS) (NOT (CONSP (CAR FORMS)))) (EQUAL (CAR FORMS) NIL)). But simplification reduces this to T, using the :definition ALISTP. Q.E.D. That completes the proof of the guard theorem for REPLACE-DEFUN@PAR-WITH-DEFUN. REPLACE-DEFUN@PAR-WITH-DEFUN is compliant with Common Lisp. Summary Form: ( DEFUN REPLACE-DEFUN@PAR-WITH-DEFUN ...) Rules: ((:DEFINITION ALISTP) (:DEFINITION ENDP) (:DEFINITION NOT) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ALISTP-FORWARD-TO-TRUE-LISTP) (:TYPE-PRESCRIPTION ALISTP)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) Prover steps counted: 127 REPLACE-DEFUN@PAR-WITH-DEFUN The event ( DEFMACRO MUTUAL-RECURSION@PAR ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO MUTUAL-RECURSION@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO DEFUN@PAR ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO DEFUN@PAR ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SERIAL-FIRST-FORM-PARALLEL-SECOND-FORM ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SERIAL-ONLY ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO SERIAL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO PARALLEL-ONLY ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PARALLEL-ONLY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO STATE-MAC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO STATE-MAC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO ERROR-IN-PARALLELISM-MODE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *WATERFALL-PRINTING-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *WATERFALL-PARALLELISM-VALUES* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since SYMBOL-CONSTANT-FN is non-recursive, its admission is trivial. We observe that the type of SYMBOL-CONSTANT-FN is described by the theorem (SYMBOLP (SYMBOL-CONSTANT-FN PREFIX SYM)). We used the :type- prescription rule SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL. Computing the guard conjecture for SYMBOL-CONSTANT-FN.... The non-trivial part of the guard conjecture for SYMBOL-CONSTANT-FN, given the :type-prescription rule STRING-APPEND-LST, is Goal (IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX)) (STRING-LISTP (LIST (SYMBOL-NAME PREFIX) "-" (SYMBOL-NAME SYM)))). By case analysis we reduce the conjecture to Goal' (IMPLIES (AND (SYMBOLP SYM) (SYMBOLP PREFIX)) (STRING-LISTP (LIST (SYMBOL-NAME PREFIX) "-" (SYMBOL-NAME SYM)))). But simplification reduces this to T, using the :definition STRING-LISTP, the :executable-counterparts of STRING-LISTP and STRINGP, primitive type reasoning and the :rewrite rules CAR-CONS and CDR-CONS. Q.E.D. That completes the proof of the guard theorem for SYMBOL-CONSTANT-FN. SYMBOL-CONSTANT-FN is compliant with Common Lisp. Summary Form: ( DEFUN SYMBOL-CONSTANT-FN ...) Rules: ((:DEFINITION NOT) (:DEFINITION STRING-LISTP) (:EXECUTABLE-COUNTERPART STRING-LISTP) (:EXECUTABLE-COUNTERPART STRINGP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:TYPE-PRESCRIPTION STRING-APPEND-LST) (:TYPE-PRESCRIPTION SYMBOLP-INTERN-IN-PACKAGE-OF-SYMBOL)) Time: 0.14 seconds (prove: 0.00, print: 0.00, other: 0.14) Prover steps counted: 122 SYMBOL-CONSTANT-FN Since STOBJS-IN is non-recursive, its admission is trivial. We could deduce no constraints on the type of STOBJS-IN. Computing the guard conjecture for STOBJS-IN.... The guard conjecture for STOBJS-IN is trivial to prove. STOBJS-IN is compliant with Common Lisp. Summary Form: ( DEFUN STOBJS-IN ...) Rules: NIL Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) STOBJS-IN The event ( DEFUN ALL-NILS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *TTAG-FNS* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *TTAG-FNS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since LOGICP is non-recursive, its admission is trivial. We observe that the type of LOGICP is described by the theorem (OR (EQUAL (LOGICP FN WRLD) T) (EQUAL (LOGICP FN WRLD) NIL)). We used primitive type reasoning. Computing the guard conjecture for LOGICP.... The guard conjecture for LOGICP is trivial to prove. LOGICP is compliant with Common Lisp. Summary Form: ( DEFUN LOGICP ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.16 seconds (prove: 0.00, print: 0.00, other: 0.16) LOGICP The event ( DEFMACRO LOGICALP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO LOGICALP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO PROGRAMP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PROGRAMP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *STOBJS-OUT-INVALID* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *STOBJS-OUT-INVALID* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since STOBJS-OUT is non-recursive, its admission is trivial. We could deduce no constraints on the type of STOBJS-OUT. However, in normalizing the definition we used the :type-prescription rule ILLEGAL. Computing the guard conjecture for STOBJS-OUT.... The non-trivial part of the guard conjecture for STOBJS-OUT, given the :type-prescription rule MEMBER-EQ-EXEC$GUARD-CHECK, is Goal (AND (IMPLIES (AND (SYMBOLP FN) (PLIST-WORLDP W)) (LET ((X FN) (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (IMPLIES (AND (NOT (LET ((X FN) (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST))) (MEMBER-EQUAL X L))) (PLIST-WORLDP W) (SYMBOLP FN) (NOT (EQ FN 'CONS))) (NOT (MEMBER-EQUAL FN '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST))))). But we reduce the conjecture to T, by the simple :definition EQ, the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for STOBJS-OUT. STOBJS-OUT is compliant with Common Lisp. [GC for 631 SFUN pages..(T=28).GC finished] Summary Form: ( DEFUN STOBJS-OUT ...) Rules: ((:DEFINITION EQ) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION ILLEGAL) (:TYPE-PRESCRIPTION MEMBER-EQ-EXEC$GUARD-CHECK)) Time: 0.49 seconds (prove: 0.00, print: 0.00, other: 0.49) Prover steps counted: 98 STOBJS-OUT Since EV-FNCALL-W-GUARD1 is non-recursive, its admission is trivial. We observe that the type of EV-FNCALL-W-GUARD1 is described by the theorem (OR (CONSP (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS)) (EQUAL (EV-FNCALL-W-GUARD1 FN WRLD TEMP-TOUCHABLE-FNS) NIL)). We used primitive type reasoning. Computing the guard conjecture for EV-FNCALL-W-GUARD1.... The non-trivial part of the guard conjecture for EV-FNCALL-W-GUARD1 is Goal (AND (IMPLIES (AND (PLIST-WORLDP WRLD) (SYMBOLP FN) (NOT (EQ FN 'IF)) (NOT (EQ FN 'DO$)) (NOT (EQ FN 'READ-USER-STOBJ-ALIST))) (LET ((X FN) (ALIST '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+)))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST))))) (IMPLIES (AND (PLIST-WORLDP WRLD) (SYMBOLP FN) (NOT (EQ FN 'IF)) (NOT (EQ FN 'DO$)) (NOT (EQ FN 'READ-USER-STOBJ-ALIST)) (NOT (ASSOC-EQUAL FN '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+))))) (LET ((FORMALS (FGETPROP FN 'FORMALS T WRLD))) (AND (SYMBOLP FN) (PLIST-WORLDP WRLD) (LET ((STOBJS-IN (STOBJS-IN FN WRLD))) (AND (PLIST-WORLDP WRLD) (LET ((UNTOUCHABLE-FNS (GLOBAL-VAL 'UNTOUCHABLE-FNS WRLD))) (AND (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (MEMBER-EQUAL FN UNTOUCHABLE-FNS) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS)) (LET ((X FN) (L TEMP-TOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (NULL FORMALS)) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (NULL FORMALS)) (PLIST-WORLDP WRLD)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (PLIST-WORLDP WRLD)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (SYMBOLP FN)) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (NOT (LET ((X FN) (L '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST))) (MBE :LOGIC (PROG2$ (MEMBER-EQ-EXEC$GUARD-CHECK X L) (MEMBER-EQUAL X L)) :EXEC (MEMBER-EQ-EXEC X L))))) (OR (EQ FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQ T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (NULL FORMALS) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQ FN 'RETURN-LAST) (PLIST-WORLDP WRLD)))))))))). [GC for 9178 CONS pages..(T=29).GC finished] By the simple :definitions EQ, GLOBAL-VAL, MEMBER-EQ-EXEC$GUARD-CHECK, NULL and RETURN-LAST, the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rules ASSOC-EQ-EXEC-IS-ASSOC-EQUAL and MEMBER-EQ-EXEC-IS-MEMBER-EQUAL we reduce the conjecture to Goal' (IMPLIES (AND (PLIST-WORLDP WRLD) (SYMBOLP FN) (NOT (EQUAL FN 'IF)) (NOT (EQUAL FN 'DO$)) (NOT (EQUAL FN 'READ-USER-STOBJ-ALIST)) (NOT (ASSOC-EQUAL FN '((HONS-WASH!) (HONS-CLEAR!) (OPEN-OUTPUT-CHANNEL!) (REMOVE-UNTOUCHABLE-FN " Note that the same restriction applies to the macro ~x0, whose ~ expansions generate calls of ~x1." (#\0 . REMOVE-UNTOUCHABLE) (#\1 . REMOVE-UNTOUCHABLE-FN)) (SET-RAW-MODE-ON " If you do not plan to certify books in this session, then ~ instead you may want to call ~x0; see :DOC ~x0." (#\0 . SET-RAW-MODE-ON!)) (SET-TEMP-TOUCHABLE-FNS) (SET-TEMP-TOUCHABLE-VARS) (SYS-CALL) (SYS-CALL*) (SYS-CALL+))))) (LET ((FORMALS (FGETPROP FN 'FORMALS T WRLD))) (AND (SYMBOLP FN) (PLIST-WORLDP WRLD) (LET ((STOBJS-IN (STOBJS-IN FN WRLD))) (AND (PLIST-WORLDP WRLD) (LET ((UNTOUCHABLE-FNS (FGETPROP 'UNTOUCHABLE-FNS 'GLOBAL-VALUE '(:ERROR "GLOBAL-VAL didn't find a value. Initialize this ~ symbol in PRIMORDIAL-WORLD-GLOBALS.") WRLD))) (AND (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (MEMBER-EQUAL FN UNTOUCHABLE-FNS) (LET ((X FN) (L UNTOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (NOT (TRUE-LISTP TEMP-TOUCHABLE-FNS)) (LET ((X FN) (L TEMP-TOUCHABLE-FNS)) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L))))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (EQUAL FORMALS NIL)) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (NOT (EQUAL FORMALS NIL)) (PLIST-WORLDP WRLD)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (PLIST-WORLDP WRLD)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (SYMBOLP FN)) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (NOT (MEMBER-EQUAL FN '(IF RETURN-LAST DO$ READ-USER-STOBJ-ALIST)))) (OR (EQUAL FORMALS T) (NOT (TRUE-LISTP UNTOUCHABLE-FNS)) (NOT (OR (NOT (MEMBER-EQUAL FN UNTOUCHABLE-FNS)) (EQUAL T TEMP-TOUCHABLE-FNS) (AND (TRUE-LISTP TEMP-TOUCHABLE-FNS) (MEMBER-EQUAL FN TEMP-TOUCHABLE-FNS)))) (AND (EQUAL FORMALS NIL) (FGETPROP FN 'STOBJ-FUNCTION NIL WRLD)) (NOT (TRUE-LISTP STOBJS-IN)) (NOT (ALL-NILS STOBJS-IN)) (EQUAL FN 'RETURN-LAST) (PLIST-WORLDP WRLD))))))))). [GC for 9178 CONS pages..(T=30).GC finished] [GC for 9178 CONS pages..(T=30).GC finished] But simplification reduces this to T, using the :definitions ASSOC-EQUAL, MEMBER-EQUAL, NOT and STOBJS-IN, the :executable-counterparts of CAR, CDR, CONSP and NOT, primitive type reasoning and the :type-prescription rule PLIST-WORLDP. Q.E.D. That completes the proof of the guard theorem for EV-FNCALL-W-GUARD1. EV-FNCALL-W-GUARD1 is compliant with Common Lisp. [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] Summary Form: ( DEFUN EV-FNCALL-W-GUARD1 ...) Rules: ((:DEFINITION ASSOC-EQUAL) (:DEFINITION EQ) (:DEFINITION GLOBAL-VAL) (:DEFINITION MEMBER-EQ-EXEC$GUARD-CHECK) (:DEFINITION MEMBER-EQUAL) (:DEFINITION NOT) (:DEFINITION NULL) (:DEFINITION RETURN-LAST) (:DEFINITION STOBJS-IN) (:EXECUTABLE-COUNTERPART CAR) (:EXECUTABLE-COUNTERPART CDR) (:EXECUTABLE-COUNTERPART CONSP) (:EXECUTABLE-COUNTERPART NOT) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION PLIST-WORLDP)) Time: 1.37 seconds (prove: 0.91, print: 0.02, other: 0.44) Prover steps counted: 3651 EV-FNCALL-W-GUARD1 Since EV-FNCALL-W-GUARD is non-recursive, its admission is trivial. We could deduce no constraints on the type of EV-FNCALL-W-GUARD. Computing the guard conjecture for EV-FNCALL-W-GUARD.... The guard conjecture for EV-FNCALL-W-GUARD is trivial to prove, given the :compound-recognizer rule EQLABLEP-RECOG and the :type-prescription rules EV-FNCALL-W-GUARD1 and LENGTH. EV-FNCALL-W-GUARD is compliant with Common Lisp. Summary Form: ( DEFUN EV-FNCALL-W-GUARD ...) Rules: ((:COMPOUND-RECOGNIZER EQLABLEP-RECOG) (:TYPE-PRESCRIPTION EV-FNCALL-W-GUARD1) (:TYPE-PRESCRIPTION LENGTH)) Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) EV-FNCALL-W-GUARD Since TIME-TRACKER-FN is non-recursive, its admission is trivial. We observe that the type of TIME-TRACKER-FN is described by the theorem (EQUAL (TIME-TRACKER-FN TAG KWD KWDP TIMES INTERVAL MIN-TIME MSG) NIL). We used the :compound-recognizer rule BOOLEANP-COMPOUND-RECOGNIZER, the :executable-counterpart of EQUAL, primitive type reasoning and the :type-prescription rule HARD-ERROR. Computing the guard conjecture for TIME-TRACKER-FN.... The non-trivial part of the guard conjecture for TIME-TRACKER-FN is Goal (IMPLIES (AND (NOT (AND (BOOLEANP TAG) KWDP)) (NOT (BOOLEANP TAG)) (SYMBOLP TAG)) (LET ((X KWD) (L '(:INIT :END :PRINT? :STOP :START :START!))) (AND (OR (NOT (SYMBOLP X)) (TRUE-LISTP L)) (OR (SYMBOLP X) (SYMBOL-LISTP L)) (EQUAL (MEMBER-EQUAL X L) (MEMBER-EQ-EXEC X L))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM and the simple :rewrite rule MEMBER-EQ-EXEC-IS-MEMBER-EQUAL. Q.E.D. That completes the proof of the guard theorem for TIME-TRACKER-FN. TIME-TRACKER-FN is compliant with Common Lisp. Summary Form: ( DEFUN TIME-TRACKER-FN ...) Rules: ((:COMPOUND-RECOGNIZER BOOLEANP-COMPOUND-RECOGNIZER) (:DEFINITION NOT) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:REWRITE MEMBER-EQ-EXEC-IS-MEMBER-EQUAL) (:TYPE-PRESCRIPTION HARD-ERROR)) Time: 0.08 seconds (prove: 0.00, print: 0.01, other: 0.07) Prover steps counted: 51 TIME-TRACKER-FN The event ( DEFMACRO TIME-TRACKER ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO TIME-TRACKER ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN SET-ABSSTOBJ-DEBUG-FN ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO SET-ABSSTOBJ-DEBUG ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since (MV * * STATE). Computing the guard conjecture for GC-STRATEGY.... The guard conjecture for GC-STRATEGY is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. GC-STRATEGY is compliant with Common Lisp. Summary Form: ( DEFUN GC-STRATEGY ...) Rules: ((:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION READ-ACL2-ORACLE) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.11 seconds (prove: 0.00, print: 0.00, other: 0.11) GC-STRATEGY The event ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *EXPANDABLE-BOOT-STRAP-NON-REC-FNS* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *DEFINITION-MINIMAL-THEORY* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFCONST *BBODY-ALIST* ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFCONST *BBODY-ALIST* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since BBODY-FN is non-recursive, its admission is trivial. We could deduce no constraints on the type of BBODY-FN. However, in normalizing the definition we used the :type-prescription rule ILLEGAL. Computing the guard conjecture for BBODY-FN.... The non-trivial part of the guard conjecture for BBODY-FN, given the :type-prescription rule ASSOC-EQ-EXEC$GUARD-CHECK, is Goal (AND (LET ((X FN) (ALIST '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0)))) (AND (OR (NOT (SYMBOLP X)) (ALISTP ALIST)) (OR (SYMBOLP X) (SYMBOL-ALISTP ALIST)) (EQUAL (ASSOC-EQUAL X ALIST) (ASSOC-EQ-EXEC X ALIST)))) (IMPLIES (LET ((X FN) (ALIST '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0)))) (ASSOC-EQUAL X ALIST)) (LET ((PAIR (ASSOC-EQUAL FN '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0))))) (AND (OR (NOT PAIR) (CONSP PAIR) (EQUAL PAIR NIL)) PAIR)))). By the :executable-counterparts of ALISTP, IF and SYMBOL-ALISTP and the simple :rewrite rule ASSOC-EQ-EXEC-IS-ASSOC-EQUAL we reduce the conjecture to Goal' (IMPLIES (ASSOC-EQUAL FN '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0))) (LET ((PAIR (ASSOC-EQUAL FN '((/= IF (EQUAL X Y) 'NIL 'T) (= EQUAL X Y) (ATOM IF (CONSP X) 'NIL 'T) (CASE-SPLIT . X) (CONS-WITH-HINT CONS X Y) (DOUBLE-REWRITE . X) (ENDP IF (CONSP X) 'NIL 'T) (EQ EQUAL X Y) (EQL EQUAL X Y) (FORCE . X) (IFF IF P (IF Q 'T 'NIL) (IF Q 'NIL 'T)) (IMPLIES IF P (IF Q 'T 'NIL) 'T) (LISTP IF (CONSP X) 'T (EQUAL X 'NIL)) (MINUSP < X '0) (MV-LIST . X) (NOT IF P 'NIL 'T) (NULL EQUAL X 'NIL) (PLUSP < '0 X) (RETURN-LAST . LAST-ARG) (SYNP QUOTE T) (THE-CHECK . Y) (WORMHOLE-EVAL QUOTE NIL) (ZEROP EQUAL X '0))))) (AND (OR (NOT PAIR) (CONSP PAIR) (EQUAL PAIR NIL)) PAIR))). But we reduce the conjecture to T, by the :executable-counterpart of ALISTP, primitive type reasoning and the :forward-chaining rule CONSP-ASSOC-EQUAL. Q.E.D. That completes the proof of the guard theorem for BBODY-FN. BBODY-FN is compliant with Common Lisp. [GC for 631 SFUN pages..(T=29).GC finished] Summary Form: ( DEFUN BBODY-FN ...) Rules: ((:DEFINITION NOT) (:EXECUTABLE-COUNTERPART ALISTP) (:EXECUTABLE-COUNTERPART IF) (:EXECUTABLE-COUNTERPART SYMBOL-ALISTP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING CONSP-ASSOC-EQUAL) (:REWRITE ASSOC-EQ-EXEC-IS-ASSOC-EQUAL) (:TYPE-PRESCRIPTION ASSOC-EQ-EXEC$GUARD-CHECK) (:TYPE-PRESCRIPTION ILLEGAL)) Time: 0.48 seconds (prove: 0.00, print: 0.01, other: 0.47) Prover steps counted: 80 BBODY-FN The event ( DEFMACRO BBODY ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO BBODY ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since FILE-LENGTH$ is non-recursive, its admission is trivial. We observe that the type of FILE-LENGTH$ is described by the theorem (AND (CONSP (FILE-LENGTH$ FILE STATE)) (TRUE-LISTP (FILE-LENGTH$ FILE STATE))). We used primitive type reasoning. (FILE-LENGTH$ * STATE) => (MV * STATE). Computing the guard conjecture for FILE-LENGTH$.... The guard conjecture for FILE-LENGTH$ is trivial to prove, given the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P. FILE-LENGTH$ is compliant with Common Lisp. Summary Form: ( DEFUN FILE-LENGTH$ ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:TYPE-PRESCRIPTION STATE-P)) Time: 0.12 seconds (prove: 0.00, print: 0.00, other: 0.12) FILE-LENGTH$ The event ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN CONSTANT-T-FUNCTION-ARITY-0 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN CONSTANT-NIL-FUNCTION-ARITY-0 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT To verify that the twelve encapsulated events correctly extend the current theory we will evaluate them. The theory thus constructed is only ephemeral. Encapsulated Events: ACL2 !>>(LOGIC) The event ( TABLE ACL2-DEFAULTS-TABLE ...) is redundant. See :DOC redundant-events. :INVISIBLE ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP BOOLEANP) The event ( DEFUN BOOLEANP ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN BOOLEANP ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP ALL-NILS) The event ( DEFUN ALL-NILS ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN ALL-NILS ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC) The event ( DEFUN MEMBER-EQL-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN MEMBER-EQL-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQL-EXEC$GUARD-CHECK) The event ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN MEMBER-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP MEMBER-EQUAL) The event ( DEFUN MEMBER-EQUAL ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN MEMBER-EQUAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC) The event ( DEFUN SUBSETP-EQL-EXEC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SUBSETP-EQL-EXEC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQL-EXEC$GUARD-CHECK) The event ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN SUBSETP-EQL-EXEC$GUARD-CHECK ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP SUBSETP-EQUAL) The event ( DEFUN SUBSETP-EQUAL ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN SUBSETP-EQUAL ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP REVAPPEND) The event ( DEFUN REVAPPEND ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN REVAPPEND ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP FIRST-N-AC) The event ( DEFUN FIRST-N-AC ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFUN FIRST-N-AC ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT ACL2 !>>(VERIFY-TERMINATION-BOOT-STRAP TAKE) The event ( DEFUN TAKE ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFUN TAKE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT End of Encapsulated Events. ACL2 Observation in ( ENCAPSULATE NIL (LOGIC) ...): The submitted encapsulate event has created no new ACL2 events, and thus is leaving the ACL2 logical world unchanged. See :DOC encapsulate. Summary Form: ( ENCAPSULATE NIL (LOGIC) ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :EMPTY-ENCAPSULATE The event ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFCONST *READ-FILE-INTO-STRING-BOUND* ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The admission of READ-FILE-INTO-STRING1 is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT BOUND). We observe that the type of READ-FILE-INTO-STRING1 is described by the theorem (AND (CONSP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND)) (TRUE-LISTP (READ-FILE-INTO-STRING1 CHANNEL STATE ANS BOUND))). We used primitive type reasoning. (READ-FILE-INTO-STRING1 * STATE * *) => (MV * STATE). Computing the guard conjecture for READ-FILE-INTO-STRING1.... The non-trivial part of the guard conjecture for READ-FILE-INTO-STRING1, given the :compound-recognizer rule NATP-COMPOUND-RECOGNIZER, the :executable- counterparts of MEMBER-EQ-EXEC, MEMBER-EQ-EXEC$GUARD-CHECK, MEMBER-EQUAL and RETURN-LAST, primitive type reasoning, the :forward-chaining rule STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1 and the :type-prescription rule STATE-P, is Goal (AND (IMPLIES (AND (NATP BOUND) (CHARACTER-LISTP ANS) (OPEN-INPUT-CHANNEL-P CHANNEL :CHARACTER STATE) (SYMBOLP CHANNEL) (STATE-P STATE) (NOT (ZP BOUND))) (MV-LET (VAL STATE) (READ-CHAR$ CHANNEL STATE) (AND (OR (CHARACTERP VAL) (TRUE-LISTP ANS) (STRINGP ANS)) (OR (CHARACTERP VAL) (CHARACTER-LISTP (REVERSE ANS))) (OR (NOT (CHARACTERP VAL)) (ACL2-NUMBERP BOUND)) (OR (NOT (CHARACTERP VAL)) (SYMBOLP CHANNEL)) (OR (NOT (CHARACTERP VAL)) (CHARACTER-LISTP (CONS VAL ANS))) (OR (NOT (CHARACTERP VAL)) (OPEN-INPUT-CHANNEL-P CHANNEL :CHARACTER STATE)) (OR (NOT (CHARACTERP VAL)) (NATP (+ -1 BOUND)))))) (IMPLIES (AND (NATP BOUND) (CHARACTER-LISTP ANS) (OPEN-INPUT-CHANNEL-P CHANNEL :CHARACTER STATE) (SYMBOLP CHANNEL) (STATE-P STATE) (NOT (ZP BOUND))) (OPEN-INPUT-CHANNEL-P1 CHANNEL :CHARACTER STATE))). [GC for 9178 CONS pages..(T=31).GC finished] By the simple :definitions NATP, OPEN-INPUT-CHANNEL-P, OPEN-INPUT-CHANNEL-P1, OPEN-INPUT-CHANNELS and STATE-P and the :executable-counterpart of TAU-SYSTEM we reduce the conjecture to Goal' (IMPLIES (AND (INTEGERP BOUND) (<= 0 BOUND) (CHARACTER-LISTP ANS) (ASSOC-EQUAL CHANNEL (NTH 0 STATE)) (EQUAL (CADR (CADR (ASSOC-EQUAL CHANNEL (NTH 0 STATE)))) :CHARACTER) (SYMBOLP CHANNEL) (STATE-P1 STATE) (NOT (ZP BOUND))) (MV-LET (VAL STATE) (READ-CHAR$ CHANNEL STATE) (AND (OR (CHARACTERP VAL) (TRUE-LISTP ANS) (STRINGP ANS)) (OR (CHARACTERP VAL) (CHARACTER-LISTP (REVERSE ANS))) (OR (NOT (CHARACTERP VAL)) (ACL2-NUMBERP BOUND)) (OR (NOT (CHARACTERP VAL)) (SYMBOLP CHANNEL)) (OR (NOT (CHARACTERP VAL)) (CHARACTER-LISTP (CONS VAL ANS))) (OR (NOT (CHARACTERP VAL)) (LET ((PAIR (ASSOC-EQUAL CHANNEL (NTH 0 STATE))) (TYP :CHARACTER)) (AND PAIR (EQUAL (CADR (CADR PAIR)) TYP)))) (OR (NOT (CHARACTERP VAL)) (NATP (+ -1 BOUND)))))). [GC for 9178 CONS pages..(T=31).GC finished] But simplification reduces this to T, using the :compound-recognizer rules NATP-COMPOUND-RECOGNIZER and ZP-COMPOUND-RECOGNIZER, the :definitions CHARACTER-LISTP, MV-NTH, NOT, NTH, OPEN-INPUT-CHANNELS, READ-CHAR$, REVERSE, UPDATE-NTH and UPDATE-OPEN-INPUT-CHANNELS, the :executable- counterparts of CHARACTER-LISTP, EQUAL and ZP, primitive type reasoning, the :forward-chaining rules ATOM-LISTP-FORWARD-TO-TRUE-LISTP, CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP, EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP and STATE-P1-FORWARD, the :rewrite rules ASSOC-ADD-PAIR, CAR-CONS, CDR-CONS, CHARACTER-LISTP-REVAPPEND and NTH-0-CONS and the :type-prescription rules ATOM-LISTP, CHARACTER-LISTP, EQLABLE-LISTP, LENGTH and STATE-P1. Q.E.D. That completes the proof of the guard theorem for READ-FILE-INTO-STRING1. READ-FILE-INTO-STRING1 is compliant with Common Lisp. Summary Form: ( DEFUN READ-FILE-INTO-STRING1 ...) Rules: ((:COMPOUND-RECOGNIZER NATP-COMPOUND-RECOGNIZER) (:COMPOUND-RECOGNIZER ZP-COMPOUND-RECOGNIZER) (:DEFINITION CHARACTER-LISTP) (:DEFINITION MV-NTH) (:DEFINITION NATP) (:DEFINITION NOT) (:DEFINITION NTH) (:DEFINITION OPEN-INPUT-CHANNEL-P) (:DEFINITION OPEN-INPUT-CHANNEL-P1) (:DEFINITION OPEN-INPUT-CHANNELS) (:DEFINITION READ-CHAR$) (:DEFINITION REVERSE) (:DEFINITION STATE-P) (:DEFINITION UPDATE-NTH) (:DEFINITION UPDATE-OPEN-INPUT-CHANNELS) (:EXECUTABLE-COUNTERPART CHARACTER-LISTP) (:EXECUTABLE-COUNTERPART EQUAL) (:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC) (:EXECUTABLE-COUNTERPART MEMBER-EQ-EXEC$GUARD-CHECK) (:EXECUTABLE-COUNTERPART MEMBER-EQUAL) (:EXECUTABLE-COUNTERPART RETURN-LAST) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:EXECUTABLE-COUNTERPART ZP) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:FORWARD-CHAINING ATOM-LISTP-FORWARD-TO-TRUE-LISTP) (:FORWARD-CHAINING CHARACTER-LISTP-FORWARD-TO-EQLABLE-LISTP) (:FORWARD-CHAINING EQLABLE-LISTP-FORWARD-TO-ATOM-LISTP) (:FORWARD-CHAINING STATE-P-IMPLIES-AND-FORWARD-TO-STATE-P1) (:FORWARD-CHAINING STATE-P1-FORWARD) (:REWRITE ASSOC-ADD-PAIR) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:REWRITE CHARACTER-LISTP-REVAPPEND) (:REWRITE NTH-0-CONS) (:TYPE-PRESCRIPTION ATOM-LISTP) (:TYPE-PRESCRIPTION CHARACTER-LISTP) (:TYPE-PRESCRIPTION EQLABLE-LISTP) (:TYPE-PRESCRIPTION LENGTH) (:TYPE-PRESCRIPTION STATE-P) (:TYPE-PRESCRIPTION STATE-P1)) Time: 0.85 seconds (prove: 0.64, print: 0.00, other: 0.21) Prover steps counted: 988 READ-FILE-INTO-STRING1 Since READ-FILE-INTO-STRING2-LOGICAL is non-recursive, its admission is trivial. We observe that the type of READ-FILE-INTO-STRING2-LOGICAL is described by the theorem (OR (EQUAL (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE) NIL) (STRINGP (READ-FILE-INTO-STRING2-LOGICAL FILENAME START BYTES STATE))). We used the :type-prescription rule STRINGP-SUBSEQ-TYPE-PRESCRIPTION. (READ-FILE-INTO-STRING2-LOGICAL * * * STATE) => *. Computing the guard conjecture for READ-FILE-INTO-STRING2-LOGICAL.... The guard conjecture for READ-FILE-INTO-STRING2-LOGICAL is trivial to prove. READ-FILE-INTO-STRING2-LOGICAL is compliant with Common Lisp. [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] Summary Form: ( DEFUN READ-FILE-INTO-STRING2-LOGICAL ...) Rules: ((:TYPE-PRESCRIPTION STRINGP-SUBSEQ-TYPE-PRESCRIPTION)) Time: 0.61 seconds (prove: 0.00, print: 0.00, other: 0.61) READ-FILE-INTO-STRING2-LOGICAL Since READ-FILE-INTO-STRING2 is non-recursive, its admission is trivial. We observe that the type of READ-FILE-INTO-STRING2 is described by the theorem (OR (EQUAL (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE) NIL) (STRINGP (READ-FILE-INTO-STRING2 FILENAME START BYTES STATE))). We used the :type-prescription rule READ-FILE-INTO-STRING2-LOGICAL. (READ-FILE-INTO-STRING2 * * * STATE) => *. Computing the guard conjecture for READ-FILE-INTO-STRING2.... The guard conjecture for READ-FILE-INTO-STRING2 is trivial to prove. READ-FILE-INTO-STRING2 is compliant with Common Lisp. Summary Form: ( DEFUN READ-FILE-INTO-STRING2 ...) Rules: ((:TYPE-PRESCRIPTION READ-FILE-INTO-STRING2-LOGICAL)) Time: 0.15 seconds (prove: 0.00, print: 0.00, other: 0.15) READ-FILE-INTO-STRING2 The event ( DEFMACRO READ-FILE-INTO-STRING ...) is redundant. See :DOC redundant-events. Summary Form: ( DEFMACRO READ-FILE-INTO-STRING ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The event ( DEFMACRO WHEN-PASS-2 ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO WHEN-PASS-2 ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT Since PRINT-CL-CACHE-FN is non-recursive, its admission is trivial. We observe that the type of PRINT-CL-CACHE-FN is described by the theorem (EQUAL (PRINT-CL-CACHE-FN I J) NIL). Computing the guard conjecture for PRINT-CL-CACHE-FN.... The guard conjecture for PRINT-CL-CACHE-FN is trivial to prove. PRINT-CL-CACHE-FN is compliant with Common Lisp. Summary Form: ( DEFUN PRINT-CL-CACHE-FN ...) Rules: NIL Time: 0.06 seconds (prove: 0.00, print: 0.00, other: 0.06) PRINT-CL-CACHE-FN The event ( DEFMACRO PRINT-CL-CACHE ...) is redundant. See :DOC redundant- events. Summary Form: ( DEFMACRO PRINT-CL-CACHE ...) Rules: NIL Time: 0.00 seconds (prove: 0.00, print: 0.00, other: 0.00) :REDUNDANT The admission of HONS-REMOVE-ASSOC is trivial, using the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT X). We observe that the type of HONS-REMOVE-ASSOC is described by the theorem (TRUE-LISTP (HONS-REMOVE-ASSOC K X)). We used primitive type reasoning. Computing the guard conjecture for HONS-REMOVE-ASSOC.... The guard conjecture for HONS-REMOVE-ASSOC is trivial to prove. HONS-REMOVE-ASSOC is compliant with Common Lisp. Summary Form: ( DEFUN HONS-REMOVE-ASSOC ...) Rules: ((:FAKE-RUNE-FOR-TYPE-SET NIL)) Time: 0.07 seconds (prove: 0.00, print: 0.00, other: 0.07) HONS-REMOVE-ASSOC For the admission of COUNT-KEYS we will use the relation O< (which is known to be well-founded on the domain recognized by O-P) and the measure (ACL2-COUNT AL). The non-trivial part of the measure conjecture is Goal (IMPLIES (AND (NOT (ATOM AL)) (CONSP (CAR AL))) (O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL)) (CDR AL))) (ACL2-COUNT AL))). By the simple :definition ATOM we reduce the conjecture to Goal' (IMPLIES (AND (CONSP AL) (CONSP (CAR AL))) (O< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL)) (CDR AL))) (ACL2-COUNT AL))). This simplifies, using the :definitions ACL2-COUNT, O-FINP and O<, primitive type reasoning and the :type-prescription rule ACL2-COUNT, to Goal'' (IMPLIES (AND (CONSP AL) (CONSP (CAR AL))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC (CAR (CAR AL)) (CDR AL))) (+ 1 (ACL2-COUNT (CAR AL)) (ACL2-COUNT (CDR AL))))). The destructor terms (CAR AL) and (CDR AL) can be eliminated. Furthermore, those terms are at the root of a chain of two rounds of destructor elimination. (1) Use CAR-CDR-ELIM to replace AL by (CONS AL1 AL2), (CAR AL) by AL1 and (CDR AL) by AL2. (2) Use CAR-CDR-ELIM, again, to replace AL1 by (CONS AL3 AL4), (CAR AL1) by AL3 and (CDR AL1) by AL4. These steps produce the following goal. Goal''' (IMPLIES (AND (CONSP (CONS AL3 AL4)) (CONSP (CONS (CONS AL3 AL4) AL2))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 1 (ACL2-COUNT (CONS AL3 AL4)) (ACL2-COUNT AL2)))). This simplifies, using the :definitions ACL2-COUNT and SYNP, the :executable- counterpart of BINARY-+, primitive type reasoning and the :rewrite rules CAR-CONS, CDR-CONS, COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+, to Goal'4' (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4))). Name the formula above *1. Perhaps we can prove *1 by induction. Four induction schemes are suggested by this conjecture. These merge into three derived induction schemes. However, one of these is flawed and so we are left with two viable candidates. One of these has a score higher than the other. We will induct according to a scheme suggested by (ACL2-COUNT AL2), but modified to accommodate (HONS-REMOVE-ASSOC AL3 AL2). These suggestions were produced using the :induction rules ACL2-COUNT and HONS-REMOVE-ASSOC. If we let (:P AL2 AL3 AL4) denote *1 above then the induction scheme we'll use is (AND (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (NOT (STRINGP AL2))) (:P AL2 AL3 AL4)) (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (STRINGP AL2)) (:P AL2 AL3 AL4)) (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (COMPLEX-RATIONALP AL2) (:P (REALPART AL2) AL3 AL4) (:P (IMAGPART AL2) AL3 AL4)) (:P AL2 AL3 AL4)) (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2))) (:P AL2 AL3 AL4)) (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (INTEGERP AL2)) (:P AL2 AL3 AL4)) (IMPLIES (AND (CONSP AL2) (:P (CAR AL2) AL3 AL4) (:P (CDR AL2) AL3 AL4)) (:P AL2 AL3 AL4))). This induction is justified by the same argument used to admit ACL2-COUNT. When applied to the goal at hand the above induction scheme produces six nontautological subgoals. Subgoal *1/6 (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (NOT (STRINGP AL2))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). [GC for 9188 CONS pages..(T=31).GC finished] This simplifies, using the :definitions ACL2-COUNT, FIX and HONS-REMOVE-ASSOC, the :executable-counterpart of ACL2-COUNT, primitive type reasoning, the :rewrite rule UNICITY-OF-0 and the :type-prescription rule ACL2-COUNT, to Subgoal *1/6' (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (NOT (STRINGP AL2))) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/5 (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (STRINGP AL2)) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC and LENGTH, the :executable-counterpart of ACL2-COUNT and the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to Subgoal *1/5' (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (NOT (COMPLEX-RATIONALP AL2)) (STRINGP AL2)) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (LEN (COERCE AL2 'LIST))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/4 (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (COMPLEX-RATIONALP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2))) (+ 2 (ACL2-COUNT (REALPART AL2)) (ACL2-COUNT AL3) (ACL2-COUNT AL4))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2))) (+ 2 (ACL2-COUNT (IMAGPART AL2)) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC and SYNP, the :executable-counterparts of ACL2-COUNT and BINARY-+ and the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+, to Subgoal *1/4' (IMPLIES (AND (NOT (CONSP AL2)) (NOT (RATIONALP AL2)) (COMPLEX-RATIONALP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (REALPART AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (REALPART AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (IMAGPART AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (IMAGPART AL2))))) (< 0 (+ 3 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (IMAGPART AL2)) (ACL2-COUNT (REALPART AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/3 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). [GC for 9188 CONS pages..This simplifies, using (T=30).GC finished] the :definitions ACL2-COUNT (if-intro), HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart of ACL2-COUNT, primitive type reasoning and the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to the following two conjectures. Subgoal *1/3.2 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2)) (< (NUMERATOR AL2) 0)) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (DENOMINATOR AL2) (- (NUMERATOR AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/3.1 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (NOT (INTEGERP AL2)) (<= 0 (NUMERATOR AL2))) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (DENOMINATOR AL2) (NUMERATOR AL2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2 (IMPLIES (AND (NOT (CONSP AL2)) (RATIONALP AL2) (INTEGERP AL2)) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). This simplifies, using the :definitions ACL2-COUNT (if-intro), HONS-REMOVE-ASSOC and INTEGER-ABS (if-intro), the :executable-counterpart of ACL2-COUNT and the :rewrite rules COMMUTATIVITY-2-OF-+ and COMMUTATIVITY-OF-+, to the following two conjectures. Subgoal *1/2.2 (IMPLIES (AND (NOT (CONSP AL2)) (INTEGERP AL2) (< AL2 0)) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (- AL2)))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/2.1 (IMPLIES (AND (NOT (CONSP AL2)) (INTEGERP AL2) (<= 0 AL2)) (< 0 (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) AL2))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1 (IMPLIES (AND (CONSP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2))) (+ 2 (ACL2-COUNT (CAR AL2)) (ACL2-COUNT AL3) (ACL2-COUNT AL4))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 2 (ACL2-COUNT (CDR AL2)) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 AL2)) (+ 2 (ACL2-COUNT AL2) (ACL2-COUNT AL3) (ACL2-COUNT AL4)))). This simplifies, using the :definitions ACL2-COUNT, HONS-REMOVE-ASSOC (if-intro) and SYNP, the :executable-counterpart of BINARY-+ and the :rewrite rules COMMUTATIVITY-2-OF-+, COMMUTATIVITY-OF-+ and FOLD-CONSTS-IN-+, to the following three conjectures. Subgoal *1/1.3 (IMPLIES (AND (CONSP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CDR AL2)))) (NOT (CONSP (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 3 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)) (ACL2-COUNT (CDR AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.2 (IMPLIES (AND (CONSP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CDR AL2)))) (CONSP (CAR AL2)) (NOT (EQUAL AL3 (CAR (CAR AL2))))) (< (ACL2-COUNT (CONS (CAR AL2) (HONS-REMOVE-ASSOC AL3 (CDR AL2)))) (+ 3 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)) (ACL2-COUNT (CDR AL2))))). [GC for 9188 CONS pages..(T=30).GC finished] This simplifies, using the :definition ACL2-COUNT, primitive type reasoning, the :rewrite rules CAR-CONS and CDR-CONS and the :type-prescription rule HONS-REMOVE-ASSOC, to Subgoal *1/1.2' (IMPLIES (AND (CONSP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CDR AL2)))) (CONSP (CAR AL2)) (NOT (EQUAL AL3 (CAR (CAR AL2))))) (< (+ 1 (ACL2-COUNT (CAR AL2)) (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2)))) (+ 3 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)) (ACL2-COUNT (CDR AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. Subgoal *1/1.1 (IMPLIES (AND (CONSP AL2) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CAR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 2 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CDR AL2)))) (EQUAL AL3 (CAR (CAR AL2)))) (< (ACL2-COUNT (HONS-REMOVE-ASSOC AL3 (CDR AL2))) (+ 3 (ACL2-COUNT AL3) (ACL2-COUNT AL4) (ACL2-COUNT (CAR AL2)) (ACL2-COUNT (CDR AL2))))). But we reduce the conjecture to T, by the :executable-counterpart of TAU-SYSTEM. That completes the proof of *1. Q.E.D. That completes the proof of the measure theorem for COUNT-KEYS. Thus, we admit this function under the principle of definition. We observe that the type of COUNT-KEYS is described by the theorem (AND (INTEGERP (COUNT-KEYS AL)) (<= 0 (COUNT-KEYS AL))). We used primitive type reasoning. Computing the guard conjecture for COUNT-KEYS.... The guard conjecture for COUNT-KEYS is trivial to prove, given the :type-prescription rule COUNT-KEYS. COUNT-KEYS is compliant with Common Lisp. Summary Form: ( DEFUN COUNT-KEYS ...) Rules: ((:DEFINITION ACL2-COUNT) (:DEFINITION ATOM) (:DEFINITION FIX) (:DEFINITION HONS-REMOVE-ASSOC) (:DEFINITION INTEGER-ABS) (:DEFINITION LENGTH) (:DEFINITION NOT) (:DEFINITION O-FINP) (:DEFINITION O<) (:DEFINITION SYNP) (:ELIM CAR-CDR-ELIM) (:EXECUTABLE-COUNTERPART ACL2-COUNT) (:EXECUTABLE-COUNTERPART BINARY-+) (:EXECUTABLE-COUNTERPART TAU-SYSTEM) (:FAKE-RUNE-FOR-TYPE-SET NIL) (:INDUCTION ACL2-COUNT) (:INDUCTION HONS-REMOVE-ASSOC) (:REWRITE CAR-CONS) (:REWRITE CDR-CONS) (:REWRITE COMMUTATIVITY-2-OF-+) (:REWRITE COMMUTATIVITY-OF-+) (:REWRITE FOLD-CONSTS-IN-+) (:REWRITE UNICITY-OF-0) (:TYPE-PRESCRIPTION ACL2-COUNT) (:TYPE-PRESCRIPTION COUNT-KEYS) (:TYPE-PRESCRIPTION HONS-REMOVE-ASSOC)) Splitter rules (see :DOC splitter): if-intro: ((:DEFINITION ACL2-COUNT) (:DEFINITION HONS-REMOVE-ASSOC) (:DEFINITION INTEGER-ABS)) Time: 1.03 seconds (prove: 0.66, print: 0.31, other: 0.06) Prover steps counted: 5904 COUNT-KEYS Since HONS-ENABLEDP is non-recursive, its admission is trivial. We observe that the type of HONS-ENABLEDP is described by the theorem (EQUAL (HONS-ENABLEDP STATE) T). (HONS-ENABLEDP STATE) => *. Computing the guard conjecture for HONS-ENABLEDP.... The guard conjecture for HONS-ENABLEDP is trivial to prove, given the :executable-counterpart of TRUE-LISTP. HONS-ENABLEDP is compliant with Common Lisp. Summary Form: ( DEFUN HONS-ENABLEDP ...) Rules: ((:EXECUTABLE-COUNTERPART TRUE-LISTP)) Time: 0.13 seconds (prove: 0.00, print: 0.00, other: 0.13) 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") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). "ACL2" CLEAR-MEMOIZE-TABLE CLEAR-MEMOIZE-TABLES MEMOIZE-SUMMARY CLEAR-MEMOIZE-STATISTICS :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 631 SFUN pages..(T=29).GC finished] MEMOIZE-FORM :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT NEVER-MEMOIZE-FN :REDUNDANT :REDUNDANT :REDUNDANT SET-BAD-LISP-CONSP-MEMOIZE :REDUNDANT :REDUNDANT Finished loading '((IN-PACKAGE "ACL2") (DEFN CLEAR-MEMOIZE-TABLE (FN) FN) (DEFN CLEAR-MEMOIZE-TABLES NIL NIL) (DEFN MEMOIZE-SUMMARY NIL NIL) (DEFN CLEAR-MEMOIZE-STATISTICS NIL NIL) (DEFMACRO MEMSUM NIL '(MEMOIZE-SUMMARY)) (DEFCONST *HONS-PRIMITIVE-FNS* '(HONS-COPY HONS HONS-EQUAL HONS-EQUAL-LITE HONS-CLEAR HONS-CLEAR! HONS-WASH ...)) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFMACRO DEFN (F A &REST R) (CONS 'DEFUN (CONS F #))) (DEFMACRO DEFND (F A &REST R) (CONS 'DEFUND (CONS F #))) (DEFN HONS-EQUAL (X Y) (DECLARE (XARGS :MODE :LOGIC)) (EQUAL X Y)) (DEFN HONS-ASSOC-EQUAL (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (COND (# NIL) (# #) (T #))) (DEFN HONS-GET (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (HONS-ASSOC-EQUAL KEY ALIST)) (DEFN HONS-ACONS (KEY VAL ALIST) (DECLARE (XARGS :MODE :LOGIC)) (CONS (CONS KEY VAL) ALIST)) ...). "ACL2" :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT HONS-COPY-PERSISTENT HONS HONS-EQUAL-LITE HONS-CLEAR [GC for 631 SFUN pages..(T=28).GC finished] HONS-CLEAR! HONS-WASH HONS-WASH! [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] HONS-SUMMARY :REDUNDANT HONS-RESIZE-FN :REDUNDANT :REDUNDANT HONS-ACONS! MAKE-FAST-ALIST FAST-ALIST-FORK FAST-ALIST-FORK! :REDUNDANT :REDUNDANT MACRO-ALIASES-TABLE MACRO-ALIASES-TABLE FAST-ALIST-CLEAN [GC for 631 SFUN pages..(T=29).GC finished] FAST-ALIST-CLEAN! FAST-ALIST-LEN FAST-ALIST-SUMMARY :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT CONS-SUBTREES NUMBER-SUBTREES FLUSH-HONS-GET-HASH-TABLE-LINK (:NUMBER-OF-ENABLED-RUNES 3186) [GC for 631 SFUN pages..(T=29).GC finished] REMOVE-KEYWORD Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO DEFN (F A &REST R) (CONS 'DEFUN (CONS F #))) (DEFMACRO DEFND (F A &REST R) (CONS 'DEFUND (CONS F #))) (DEFN HONS-EQUAL (X Y) (DECLARE (XARGS :MODE :LOGIC)) (EQUAL X Y)) (DEFN HONS-ASSOC-EQUAL (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (COND (# NIL) (# #) (T #))) (DEFN HONS-GET (KEY ALIST) (DECLARE (XARGS :MODE :LOGIC)) (HONS-ASSOC-EQUAL KEY ALIST)) (DEFN HONS-ACONS (KEY VAL ALIST) (DECLARE (XARGS :MODE :LOGIC)) (CONS (CONS KEY VAL) ALIST)) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). "ACL2" :REDUNDANT SERIALIZE-WRITE-FN :REDUNDANT SERIALIZE-READ-FN :REDUNDANT Finished loading '((IN-PACKAGE "ACL2") (DEFMACRO SERIALIZE-WRITE (FILENAME OBJ &KEY VERBOSEP) (CONS 'SERIALIZE-WRITE-FN (CONS FILENAME #))) (DEFUN SERIALIZE-WRITE-FN (FILENAME OBJ VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME OBJ VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) STATE)) (DEFMACRO SERIALIZE-READ (FILENAME &KEY (HONS-MODE #) VERBOSEP) (CONS 'SERIALIZE-READ-FN (CONS FILENAME #))) (DEFUN SERIALIZE-READ-FN (FILENAME HONS-MODE VERBOSEP STATE) (DECLARE (XARGS :GUARD # :STOBJS STATE) (IGNORABLE FILENAME HONS-MODE VERBOSEP)) (MV-LET (ERP VAL STATE) (READ-ACL2-ORACLE STATE) (DECLARE #) (MV VAL STATE))) (DEFMACRO WITH-SERIALIZE-CHARACTER (VAL FORM) (DECLARE (XARGS :GUARD #)) (CONS 'STATE-GLOBAL-LET* (CONS # #)))). ACL2 loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM) (VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS) (VERIFY-TERMINATION-BOOT-STRAP PACKN1) (ENCAPSULATE NIL (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER # :RULE-CLASSES #)) (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM # :RULE-CLASSES #)) (VERIFY-TERMINATION-BOOT-STRAP PACKN-POS) (VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL) (VERIFY-TERMINATION-BOOT-STRAP PACKN) ...) ...). "ACL2" QUOTE-LISTP [GC for 9188 CONS pages..(T=30).GC finished] [GC for 9198 CONS pages..(T=29).GC finished] [GC for 9208 CONS pages..(T=30).GC finished] [GC for 9218 CONS pages..(T=29).GC finished] CONS-TERM1 CONS-TERM [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] SYMBOL-CLASS PACKN1 [GC for 631 SFUN pages..(T=30).GC finished] T :REDUNDANT GUARD-THEOREM-SIMPLIFY-MSG GUARD-OR-TERMINATION-THEOREM-MSG ALIST-KEYS-SUBSETP KEYWORD-LISTP :REDUNDANT :REDUNDANT [GC for 631 SFUN pages..(T=29).GC finished] FIRST-KEYWORD SYMBOL-NAME-LST SYMBOL-NAME-EQUAL FIX-PKG UNMAKE-TRUE-LIST-CONS-NEST [GC for 631 SFUN pages..(T=29).GC finished] DUMB-NEGATE-LIT FLATTEN-ANDS-IN-LIT UNION-EQUAL-TO-END FLATTEN-ANDS-IN-LIT! WARRANTED-FNS-OF-WORLD [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] INITIALIZE-EVENT-USER FINALIZE-EVENT-USER ACL2X-EXPANSION-ALIST [GC for 631 SFUN pages..(T=30).GC finished] SET-LD-HISTORY-ENTRY-USER-DATA CANONICAL-PATHNAME MAGIC-EV-FNCALL (MFC-AP-FN MFC-RELIEVE-HYP-FN MFC-RELIEVE-HYP-TTREE MFC-RW+-FN MFC-RW+-TTREE MFC-RW-FN MFC-RW-TTREE ...) PRINT-OBJECT$-FN [GC for 631 SFUN pages..(T=29).GC finished] PRINT-OBJECT$ PRINT-OBJECT$-PRESERVING-CASE TOO-MANY-IFS-POST-REWRITE [GC for 631 SFUN pages..(T=30).GC finished] [GC for 9228 CONS pages..(T=29).GC finished] [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] [GC for 9238 CONS pages..(T=30).GC finished] T :ATTACHMENTS-RECORDED TOO-MANY-IFS-PRE-REWRITE :ATTACHMENTS-RECORDED (PSEUDO-VARIANTP PSEUDO-VARIANTP-LIST) [GC for 9248 CONS pages..(T=28).GC finished] MEMBER-CHAR-STRINGP TERMINAL-SUBSTRINGP1 TERMINAL-SUBSTRINGP EVG-OCCUR MIN-FIXNUM [GC for 9258 CONS pages..(T=28).GC finished] [GC for 9268 CONS pages..(T=28).GC finished] FN-COUNT-EVG-REC FN-COUNT-EVG-REC-TYPE-PRESCRIPTION FN-COUNT-EVG-REC-BOUND FN-COUNT-EVG-REC [GC for 9278 CONS pages..(T=29).GC finished] (OCCUR OCCUR-LST) [GC for 21760 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] [GC for 631 SFUN pages..(T=30).GC finished] (WORSE-THAN-BUILTIN-CLOCKED WORSE-THAN-OR-EQUAL-BUILTIN-CLOCKED BASIC-WORSE-THAN-LST1 BASIC-WORSE-THAN-LST2 BASIC-WORSE-THAN SOME-SUBTERM-WORSE-THAN-OR-EQUAL SOME-SUBTERM-WORSE-THAN-OR-EQUAL-LST ...) WORSE-THAN-BUILTIN WORSE-THAN-OR-EQUAL-BUILTIN ANCESTOR-LISTP [GC for 9288 CONS pages..(T=30).GC finished] EARLIER-ANCESTOR-BIGGERP FN-COUNT-1 FN-COUNT-1-TYPE FN-COUNT-1 [GC for 2049 RELOCATABLE-BLOCKS pages..(T=30).GC finished] VAR-FN-COUNT-1 SYMBOL-LISTP-CDR-ASSOC-EQUAL INTEGERP-NTH-0-VAR-FN-COUNT-1 INTEGERP-NTH-1-VAR-FN-COUNT-1 INTEGERP-NTH-2-VAR-FN-COUNT-1 VAR-FN-COUNT-1 EQUAL-MOD-COMMUTING [GC for 9298 CONS pages..(T=30).GC finished] ANCESTORS-CHECK1 ANCESTORS-CHECK-BUILTIN [GC for 9308 CONS pages..(T=29).GC finished] MEMBER-EQUAL-MOD-COMMUTING STRIP-ANCESTOR-LITERALS T ANCESTORS-CHECK :ATTACHMENTS-RECORDED [GC for 9318 CONS pages..(T=30).GC finished] :ATTACHMENTS-RECORDED :ATTACHMENTS-RECORDED HONS-COPY-WITH-STATE IDENTITY-WITH-STATE [GC for 9328 CONS pages..(T=29).GC finished] :ATTACHMENTS-RECORDED RW-CACHE-DEBUG-BUILTIN :ATTACHMENTS-RECORDED RW-CACHE-DEBUG-ACTION-BUILTIN :ATTACHMENTS-RECORDED RW-CACHEABLE-FAILURE-REASON-BUILTIN :ATTACHMENTS-RECORDED ALL-DIGITS-P D-POS-LISTP [GC for 631 SFUN pages..(T=30).GC finished] POS-LISTP :REDUNDANT D-POS-LISTP-FORWARD-TO-TRUE-LISTP [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] CLAUSE-ID-P PRINT-CLAUSE-ID-OKP PRINT-CLAUSE-ID-OKP-BUILTIN :ATTACHMENTS-RECORDED ONCEP-TP :ATTACHMENTS-RECORDED [GC for 631 SFUN pages..(T=29).GC finished] CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PRIMES POS-LISTP-FORWARD-TO-INTEGER-LISTP CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE TRUE-LISTP-CHARS-FOR-TILDE-@-CLAUSE-ID-PHRASE/PERIODS TRUE-LISTP-EXPLODE-ATOM T [GC for 9338 CONS pages..(T=29).GC finished] STRICT-MERGE-SYMBOL< T LD-HISTORY [GC for 631 SFUN pages..(T=31).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 [GC for 631 SFUN pages..(T=29).GC finished] LD-HISTORY-ENTRY-USER-DATA SET-LD-HISTORY-ENTRY-USER-DATA-DEFAULT :ATTACHMENTS-RECORDED 24 32 57 *ACL2-PRIMITIVES* 32 [GC for 9348 CONS pages..(T=29).GC finished] (:NUMBER-OF-ENABLED-RUNES 3528) (:NUMBER-OF-ENABLED-RUNES 3527) (:NUMBER-OF-ENABLED-RUNES 3526) [GC for 9358 CONS pages..(T=29).GC finished] FORMALS CONSTRAINT-INFO UNKNOWN-CONSTRAINTS-P (:DEFUND META-EXTRACT-FORMULA) [GC for 9368 CONS pages..(T=30).GC finished] TYPE-SET-QUOTE TYPE-SET-QUOTE TYPESPEC-CHECK [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] META-EXTRACT-RW+-TERM [GC for 9378 CONS pages..(T=29).GC finished] META-EXTRACT-CONTEXTUAL-FACT REWRITE-RULE-TERM-EXEC [GC for 9388 CONS pages..(T=29).GC finished] REWRITE-RULE-TERM LINEAR-LEMMA-TERM-EXEC LINEAR-LEMMA-TERM META-EXTRACT-GLOBAL-FACT [GC for 631 SFUN pages..(T=29).GC finished] FNCALL-TERM LOGICALLY-EQUIVALENT-STATES META-EXTRACT-GLOBAL-FACT+ MACRO-ALIASES-TABLE [GC for 9398 CONS pages..(T=29).GC finished] :SKIPPED :SKIPPED Finished loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP QUOTE-LISTP) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM1) (VERIFY-TERMINATION-BOOT-STRAP CONS-TERM) (VERIFY-TERMINATION-BOOT-STRAP SYMBOL-CLASS) (VERIFY-TERMINATION-BOOT-STRAP PACKN1) (ENCAPSULATE NIL (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-NONNEGATIVE-INTEGER # :RULE-CLASSES #)) (LOCAL (DEFTHM CHARACTER-LISTP-EXPLODE-ATOM # :RULE-CLASSES #)) (VERIFY-TERMINATION-BOOT-STRAP PACKN-POS) (VERIFY-TERMINATION-BOOT-STRAP FIND-FIRST-NON-CL-SYMBOL) (VERIFY-TERMINATION-BOOT-STRAP PACKN) ...) ...). ACL2 loading '((IN-PACKAGE "ACL2") (DEFUN 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" :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT FROM-TO-BY-MEASURE :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT :REDUNDANT [GC for 9408 CONS pages..(T=28).GC finished] SPLIT-SYSTEM-VERIFY-GUARDS-ALIST :REDUNDANT [GC for 9418 CONS pages..(T=30).GC finished] NIL :REDUNDANT [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] NIL APPLY$-BADGEP N-CAR-CADR-CADDR-ETC :REDUNDANT [GC for 9428 CONS pages..(T=31).GC finished] (:NUMBER-OF-ENABLED-RUNES 3583) [GC for 9438 CONS pages..(T=30).GC finished] [GC for 9448 CONS pages..(T=29).GC finished] [GC for 9458 CONS pages..(T=30).GC finished] [GC for 9468 CONS pages..(T=29).GC finished] [GC for 9478 CONS pages..(T=29).GC finished] [GC for 9488 CONS pages..(T=29).GC finished] [GC for 9498 CONS pages..(T=29).GC finished] [GC for 9508 CONS pages..(T=28).GC finished] [GC for 9518 CONS pages..(T=28).GC finished] [GC for 9528 CONS pages..(T=29).GC finished] [GC for 9538 CONS pages..(T=28).GC finished] [GC for 9548 CONS pages..(T=29).GC finished] [GC for 9558 CONS pages..(T=29).GC finished] [GC for 9568 CONS pages..(T=29).GC finished] [GC for 9578 CONS pages..(T=31).GC finished] [GC for 9588 CONS pages..(T=28).GC finished] 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" [GC for 9598 CONS pages..(T=28).GC finished] ACL2 Observation in ( DEFTHM BADGE-USERFN-TYPE ...): The :TRIGGER- TERMS for the :FORWARD-CHAINING rule BADGE-USERFN-TYPE will consist of the list containing (BADGE-USERFN FN). ACL2 Warning [Non-rec] in ( DEFTHM BADGE-USERFN-TYPE ...): The term (BADGE-USERFN FN) contains the function symbol BADGE-USERFN, which has a non-recursive definition. Unless this definition is disabled, (BADGE-USERFN FN) is unlikely ever to occur as a trigger for BADGE-USERFN-TYPE. [GC for 631 SFUN pages..(T=30).GC finished] ACL2 Warning [Non-rec] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...): A :REWRITE rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS will be triggered only by terms containing the function symbol UNTAME-APPLY$, which has a non-recursive definition. Unless this definition is disabled, this rule is unlikely ever to be used. ACL2 Warning [Subsume] in ( DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS ...): The previously added rule UNTAME-APPLY$ subsumes a newly proposed :REWRITE rule generated from UNTAME-APPLY$-TAKES-ARITY-ARGS, in the sense that the old rule rewrites a more general target. Because the new rule will be tried first, it may nonetheless find application. [GC for 631 SFUN pages..(T=30).GC finished] NIL Finished loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (ENCAPSULATE (#) (LOCAL #) (DEFTHM BADGE-USERFN-TYPE # :RULE-CLASSES #)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM APPLY$-USERFN-TAKES-ARITY-ARGS # :RULE-CLASSES NIL)) (ENCAPSULATE (#) (LOCAL #) (DEFTHM UNTAME-APPLY$-TAKES-ARITY-ARGS # :RULE-CLASSES #)) (DEFSTUB UNTAME-EV$ (X A) T) (DEFCONST *APPLY$-BOOT-FNS-BADGE-ALIST* (CONS # #)))). ACL2 loading '((IN-PACKAGE "ACL2") (WHEN-PASS-2 (DEFUN BADGE (FN) (DECLARE #) (COND # # # # # # ...)) (IN-THEORY (DISABLE APPLY$-PRIMP BADGE-PRIM)) (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" [GC for 631 SFUN pages..(T=31).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 631 SFUN pages..(T=30).GC finished] [GC for 631 SFUN pages..(T=30).GC finished] [GC for 794 SYMBOL pages..(T=31).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 641 SFUN pages..(T=29).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=30).GC finished] [GC for 641 SFUN pages..(T=31).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] [GC for 641 SFUN pages..(T=30).GC finished] [GC for 641 SFUN pages..(T=30).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 142 CFUN pages..(T=31).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=37).GC finished] [GC for 641 SFUN pages..(T=30).GC finished] [GC for 641 SFUN pages..(T=30).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] 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 # # #)) ...)). ACL2 loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM) (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP) (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W) (DECLARE #) (COND # # # # #)) (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W) (DECLARE #) (COND # #))) (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS (FNS WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS1 (WRLD INSTALLED-WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS (STATE) (DECLARE (XARGS :STOBJS STATE)) (LET (#) (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL))) ...). "ACL2" SAFE-ACCESS-COMMAND-TUPLE-FORM ACL2-SYSTEM-NAMEP [GC for 641 SFUN pages..(T=31).GC finished] (SYSTEM-PSEUDO-TERMP SYSTEM-PSEUDO-TERM-LISTP) PAIR-FNS-WITH-MEASURED-SUBSETS NEW-VERIFY-GUARDS-FNS1 NEW-VERIFY-GUARDS-FNS :REDUNDANT *DEVEL-CHECK-BOOK* CHK-NEW-VERIFIED-GUARDS [GC for 641 SFUN pages..(T=30).GC finished] SYSTEM-VERIFY-GUARDS-AUX CONS-ABSOLUTE-EVENT-NUMBERS [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] SORT->-ABSOLUTE-EVENT-NUMBER SYSTEM-VERIFY-GUARDS ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EQUAL-X-CONSTANT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS EQUAL-X-CONSTANT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-TESTS-AND-BINDINGS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9598 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-TESTS-AND-BINDINGS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MATCH-CLAUSE-LIST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MATCH-CLAUSE-LIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-KEYWORDP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-KEYWORDP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLE-OR-CONSTANT-NAMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLE-OR-CONSTANT-NAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-VARIABLEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-VARIABLEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9608 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARGLISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARGLISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-FIRST-BAD-ARG (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-FIRST-BAD-ARG)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEWLINE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS NEWLINE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WRITE-FOR-READ))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9618 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WRITE-FOR-READ)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILLEGAL-FMT-STRING))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ILLEGAL-FMT-STRING)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SCAN-PAST-WHITESPACE (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SCAN-PAST-WHITESPACE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ZERO-ONE-OR-MORE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9628 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ZERO-ONE-OR-MORE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-SKIP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-SKIP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9638 CONS pages..(T=29).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-CHAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9648 CONS pages..(T=29).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMT-CHAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-START))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-START)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-ALTERNATIVE-STOP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9658 CONS pages..(T=29).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-ALTERNATIVE-STOP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMT-VAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMT-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STANDARD-EVISC-TUPLEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STANDARD-EVISC-TUPLEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WORLD-EVISCERATION-ALIST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WORLD-EVISCERATION-ALIST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ABBREV-EVISC-TUPLE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ABBREV-EVISC-TUPLE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-MSG-1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9668 CONS pages..(T=30).GC finished] [GC for 9678 CONS pages..(T=29).GC finished] [GC for 9688 CONS pages..(T=29).GC finished] [GC for 9698 CONS pages..(T=29).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG-1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-MSG))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-MSG)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN-GUARD))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9708 CONS pages..(T=31).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN-GUARD)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX-CW-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMX-CW-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FMX!-CW-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FMX!-CW-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PUSH-IO-RECORD))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS PUSH-IO-RECORD)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SAVED-OUTPUT-TOKEN-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SAVED-OUTPUT-TOKEN-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING-OFF-P1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9718 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WARNING-OFF-P1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OBSERVATION1-CW))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS OBSERVATION1-CW)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFSTOBJ-FNNAME-KEY2))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEFSTOBJ-FNNAME-KEY2)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DOUBLET-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DOUBLET-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFSTOBJ-FNNAME))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9728 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEFSTOBJ-FNNAME)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STOBJP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STOBJP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THE-LIVE-VAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THE-LIVE-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FIND-DOT-DOT (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9738 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FIND-DOT-DOT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COMMENT-STRING-P1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COMMENT-STRING-P1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COMMENT-STRING-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COMMENT-STRING-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PRINT-CONTROL-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS PRINT-CONTROL-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-CONSTANTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-CONSTANTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-NON-X (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT-NON-X)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (PLIST-WORLDP-WITH-FORMALS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS PLIST-WORLDP-WITH-FORMALS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEFUN-MODE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9748 CONS pages..(T=29).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEFUN-MODE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITIES-OKP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITIES-OKP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LATEST-BODY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LATEST-BODY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEF-BODY))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEF-BODY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (>=-LEN (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS >=-LEN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALL->=-LEN (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9758 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALL->=-LEN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-CADRS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-CADRS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CONS-TERM1-MV2))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9768 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CONS-TERM1-MV2)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR1 (DECLARE (XARGS :MEASURE #))) (SUBLIS-VAR1-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBLIS-VAR-LST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9778 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBLIS-VAR-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))) (SUBCOR-VAR (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBCOR-VAR-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (NEW-NAMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS NEW-NAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-LISTP (DECLARE (XARGS :MEASURE #))) (TERMP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERM-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-LIST-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERM-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9788 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ACCESS-COMMAND-TUPLE-NUMBER))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ACCESS-COMMAND-TUPLE-NUMBER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-VAR-LST (DECLARE (XARGS :MEASURE #))) (SUBST-VAR (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-VAR-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALL-FNNAMES1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALL-FNNAMES1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP-1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9798 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP-1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRING-PREFIXP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRING-PREFIXP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS1-LST (DECLARE (XARGS :MEASURE #))) (REMOVE-GUARD-HOLDERS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9808 CONS pages..(T=32).GC finished] [GC for 9818 CONS pages..(T=32).GC finished] [GC for 9828 CONS pages..(T=32).GC finished] [GC for 9838 CONS pages..(T=32).GC finished] [GC for 9848 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS1-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-GUARD-HOLDERS-WEAK))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-GUARD-HOLDERS-WEAK)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-BY-POSITION (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT-BY-POSITION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MAKE-LAMBDA-APPLICATION))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9858 CONS pages..(T=33).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MAKE-LAMBDA-APPLICATION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ER-CMP-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ER-CMP-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SILENT-ERROR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SILENT-ERROR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WARNING1-CW))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9868 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WARNING1-CW)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CHK-LENGTH-AND-KEYS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=40).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CHK-LENGTH-AND-KEYS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DUPLICATE-KEYS-ACTION))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DUPLICATE-KEYS-ACTION)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LEGAL-INITP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LEGAL-INITP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-KEYSP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9878 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-KEYSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-AFTER-RESTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-AFTER-RESTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST-OPTIONALP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST-OPTIONALP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGLIST1P (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9888 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGLIST1P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBSEQUENCEP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBSEQUENCEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT-LAMBDA-KEYWORDPS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT-LAMBDA-KEYWORDPS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-ARGS-STRUCTUREP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9898 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-ARGS-STRUCTUREP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-KEYS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-KEYS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-KEYS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9908 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-KEYS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-AFTER-REST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-AFTER-REST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS-OPTIONAL (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS-OPTIONAL)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9918 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BIND-MACRO-ARGS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BIND-MACRO-ARGS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FFNNAMEP-LST (DECLARE (XARGS :MEASURE #))) (FFNNAMEP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FFNNAMEP-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAME-TYPE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9928 CONS pages..(T=30).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=38).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAME-TYPE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CHK-ALL-BUT-NEW-NAME-CMP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CHK-ALL-BUT-NEW-NAME-CMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FORMALIZED-VARLISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FORMALIZED-VARLISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THROW-NONEXEC-ERROR-P))), in the context of a book or an encapsulate event. Therefore, no logical [GC for 9938 CONS pages..claims may be soundly made in this context. See :DOC SKIP-PROOFS.(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THROW-NONEXEC-ERROR-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALIST-TO-DOUBLETS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALIST-TO-DOUBLETS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DEREF-MACRO-NAME))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DEREF-MACRO-NAME)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WEAK-BADGE-USERFN-STRUCTURE-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WEAK-BADGE-USERFN-STRUCTURE-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PLIST-WORLDP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ILKS-PLIST-WORLDP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ILKS-PER-ARGUMENT-SLOT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9948 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ILKS-PER-ARGUMENT-SLOT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-FNS-LISTP (DECLARE (XARGS :MEASURE #))) (LOGIC-FNSP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERMP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-FNS-LIST-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9958 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-FNS-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGIC-TERM-LIST-LISTP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGIC-TERM-LIST-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER1))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RUNEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS RUNEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FNUME))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FNUME)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TRANSLATE-ABBREV-RUNE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TRANSLATE-ABBREV-RUNE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-STRUCTURE-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-STRUCTURE-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-NUMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-NUMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9968 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENABLED-RUNEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENABLED-RUNEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERM-ORDER))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ENS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ENS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-CADDRS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-CADDRS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (IMPLICATE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS IMPLICATE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR1-LST (DECLARE (XARGS :MEASURE #))) (SUBST-EXPR1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 9978 CONS pages..(T=33).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR1-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR-ERROR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR-ERROR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUBST-EXPR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUBST-EXPR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK1)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CLEAN-BRR-STACK))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CLEAN-BRR-STACK)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9988 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-TERM-ORDER (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SORT-TERM-ORDER (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-TERM-ORDER)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LAMBDA-SUBTERMP (DECLARE (XARGS :MEASURE #))) (LAMBDA-SUBTERMP-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LAMBDA-SUBTERMP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TERMIFY-CLAUSE-SET (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TERMIFY-CLAUSE-SET)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOGICAL-NAMEP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOGICAL-NAMEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (RELATIVIZE-BOOK-PATH))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 9998 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS RELATIVIZE-BOOK-PATH)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SYMBOL< (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SYMBOL<)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MERGE-SORT-SYMBOL< (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MERGE-SORT-SYMBOL<)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (OVERRIDE-HINTS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS OVERRIDE-HINTS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SCAN-TO-CLTL-COMMAND (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SCAN-TO-CLTL-COMMAND)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS-LST (DECLARE (XARGS :MEASURE #))) (REMOVE-LAMBDAS1 (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 10008 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REMOVE-LAMBDAS))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REMOVE-LAMBDAS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (STRIP-NON-HIDDEN-PACKAGE-NAMES (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS STRIP-NON-HIDDEN-PACKAGE-NAMES)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BACKCHAIN-LIMIT-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BACKCHAIN-LIMIT-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ARITY-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ARITY-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 10018 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN-LST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (DISABLEDP-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS DISABLEDP-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-KEY (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-KEY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-AFTER-REST))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-AFTER-REST)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS-OPTIONAL (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 10028 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS-OPTIONAL)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (MACRO-VARS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS MACRO-VARS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THEORY-INVARIANT-TABLE-GUARD))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THEORY-INVARIANT-TABLE-GUARD)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-P))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-P)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SYSFILE-OR-STRING-LISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 10038 CONS pages..(T=30).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SYSFILE-OR-STRING-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TTAG-ALISTP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TTAG-ALISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CERT-ANNOTATIONSP))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CERT-ANNOTATIONSP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (INCLUDE-BOOK-DIR))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 2049 RELOCATABLE-BLOCKS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS INCLUDE-BOOK-DIR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ADD-SUFFIX-TO-FN))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ADD-SUFFIX-TO-FN)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FSUBCOR-VAR (DECLARE (XARGS :MEASURE #))) (FSUBCOR-VAR-LST (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FSUBCOR-VAR)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TAILS-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TAILS-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (TAILS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS TAILS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EMPTY-LOOP$-AS-TUPLEP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS EMPTY-LOOP$-AS-TUPLEP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CAR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CAR-LOOP$-AS-TUPLE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (CDR-LOOP$-AS-TUPLE (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS CDR-LOOP$-AS-TUPLE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 10048 CONS pages..(T=31).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (LOOP$-AS (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS LOOP$-AS)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FROM-TO-BY-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (FROM-TO-BY (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS FROM-TO-BY)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (REVAPPEND-TRUE-LIST-FIX (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS REVAPPEND-TRUE-LIST-FIX)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 10058 CONS pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-RW+-TERM))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-RW+-TERM)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-CONTEXTUAL-FACT))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-CONTEXTUAL-FACT)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (META-EXTRACT-GLOBAL-FACT+))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. [GC for 10068 CONS pages..(T=33).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS META-EXTRACT-GLOBAL-FACT+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. T [GC for 10078 CONS pages..(T=31).GC finished] [GC for 10088 CONS pages..(T=31).GC finished] [GC for 10098 CONS pages..(T=30).GC finished] [GC for 10108 CONS pages..(T=31).GC finished] [GC for 10118 CONS pages..(T=32).GC finished] [GC for 10128 CONS pages..(T=32).GC finished] [GC for 10138 CONS pages..(T=31).GC finished] [GC for 10148 CONS pages..(T=32).GC finished] [GC for 10158 CONS pages..(T=33).GC finished] [GC for 10168 CONS pages..(T=33).GC finished] [GC for 10178 CONS pages..(T=32).GC finished] [GC for 10188 CONS pages..(T=32).GC finished] [GC for 10198 CONS pages..(T=33).GC finished] [GC for 10208 CONS pages..(T=33).GC finished] [GC for 10218 CONS pages..(T=32).GC finished] [GC for 10228 CONS pages..(T=32).GC finished] [GC for 10238 CONS pages..(T=32).GC finished] [GC for 10248 CONS pages..(T=33).GC finished] [GC for 10258 CONS pages..(T=33).GC finished] [GC for 10268 CONS pages..(T=32).GC finished] [GC for 10278 CONS pages..(T=32).GC finished] [GC for 10288 CONS pages..(T=33).GC finished] [GC for 10298 CONS pages..(T=32).GC finished] [GC for 10298 CONS pages..(T=33).GC finished] [GC for 10298 CONS pages..(T=33).GC finished] [GC for 10298 CONS pages..(T=34).GC finished] [GC for 10308 CONS pages..(T=33).GC finished] [GC for 10308 CONS pages..(T=33).GC finished] [GC for 10308 CONS pages..(T=33).GC finished] [GC for 10308 CONS pages..(T=32).GC finished] [GC for 10308 CONS pages..(T=33).GC finished] [GC for 10308 CONS pages..(T=32).GC finished] [GC for 10308 CONS pages..(T=32).GC finished] [GC for 10318 CONS pages..(T=32).GC finished] [GC for 10318 CONS pages..(T=31).GC finished] [GC for 10318 CONS pages..(T=32).GC finished] [GC for 10318 CONS pages..(T=33).GC finished] [GC for 10318 CONS pages..(T=32).GC finished] [GC for 10318 CONS pages..(T=33).GC finished] [GC for 10318 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=33).GC finished] [GC for 10328 CONS pages..(T=33).GC finished] [GC for 10328 CONS pages..(T=33).GC finished] [GC for 10328 CONS pages..(T=33).GC finished] [GC for 10328 CONS pages..(T=31).GC finished] [GC for 10328 CONS pages..(T=32).GC finished] [GC for 10328 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=33).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=32).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10338 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=30).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=34).GC finished] [GC for 10348 CONS pages..(T=34).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=31).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10348 CONS pages..(T=32).GC finished] [GC for 10348 CONS pages..(T=33).GC finished] [GC for 10358 CONS pages..(T=34).GC finished] [GC for 10358 CONS pages..(T=33).GC finished] [GC for 10358 CONS pages..(T=34).GC finished] [GC for 10358 CONS pages..(T=34).GC finished] APPLY$-PRIM BADGE (:NUMBER-OF-ENABLED-RUNES 4264) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUITABLY-TAMEP-LISTP (DECLARE (XARGS :MEASURE #))) (TAMEP-FUNCTIONP (DECLARE (XARGS :MEASURE #))) (TAMEP (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUITABLY-TAMEP-LISTP)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (EV$ (DECLARE (XARGS :MEASURE #))) (APPLY$ (DECLARE (XARGS :MEASURE #))) (EV$-LIST (DECLARE (XARGS :MEASURE #))) (APPLY$-LAMBDA (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS EV$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (UNTIL$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 641 SFUN pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS UNTIL$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WHEN$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WHEN$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WHEN$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WHEN$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WHEN$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WHEN$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (WHEN$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS WHEN$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUM$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUM$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUM$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUM$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUM$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUM$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (SUM$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS SUM$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALWAYS$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (ALWAYS$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS ALWAYS$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THEREIS$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THEREIS$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (THEREIS$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS THEREIS$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 641 SFUN pages..(T=32).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (COLLECT$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS COLLECT$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+-AC (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$+-AC)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPEND$+ (DECLARE (XARGS :MEASURE #))))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. (See :DOC set-iprint to be able to see elided values in this message.) [GC for 10358 CONS pages..(T=33).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPEND$+)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (APPLY$-PRIM))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS APPLY$-PRIM)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-TERMINATION-BOOT-STRAP (BADGE))), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. ACL2 Warning [Skip-proofs] in ( ENCAPSULATE NIL (SET-INHIBIT-WARNINGS "Skip-proofs" ...) ...): ACL2 has encountered a SKIP-PROOFS form, (SKIP-PROOFS (VERIFY-GUARDS BADGE)), in the context of a book or an encapsulate event. Therefore, no logical claims may be soundly made in this context. See :DOC SKIP-PROOFS. T SYSTEM-EVENT SYSTEM-EVENTS-FN SYSTEM-EVENTS CHECK-SYSTEM-EVENTS (:NUMBER-OF-ENABLED-RUNES 4394) (:NUMBER-OF-ENABLED-RUNES 4384) [GC for 10368 CONS pages..(T=32).GC finished] APPLY$-EQUIVALENCE FN-EQUAL FN-EQUAL-IS-AN-EQUIVALENCE NATP-FROM-TO-BY-MEASURE MEMPOS T [GC for 10378 CONS pages..(T=33).GC finished] [GC for 10388 CONS pages..(T=33).GC finished] [GC for 10398 CONS pages..(T=31).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=39).GC finished] [GC for 641 SFUN pages..(T=31).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=45).GC finished] [GC for 10408 CONS pages..(T=33).GC finished] [GC for 10418 CONS pages..(T=33).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 10428 CONS pages..(T=33).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 10438 CONS pages..(T=32).GC finished] [GC for 22016 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 10448 CONS pages..(T=31).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10458 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10468 CONS pages..(T=33).GC finished] [GC for 10468 CONS pages..(T=31).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10478 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 10488 CONS pages..(T=33).GC finished] [GC for 804 SYMBOL pages..(T=32).GC finished] [GC for 10488 CONS pages..(T=32).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=46).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 10488 CONS pages..(T=34).GC finished] [GC for 10488 CONS pages..(T=32).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10498 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 10508 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10508 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10518 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 10528 CONS pages..(T=32).GC finished] [GC for 10528 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10538 CONS pages..(T=34).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10538 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10548 CONS pages..(T=32).GC finished] [GC for 10548 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 10558 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 10568 CONS pages..(T=34).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 10568 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10568 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10578 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=43).GC finished] [GC for 10588 CONS pages..(T=33).GC finished] [GC for 641 SFUN pages..(T=32).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 10588 CONS pages..(T=32).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 641 SFUN pages..(T=35).GC finished] [GC for 10598 CONS pages..(T=34).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 641 SFUN pages..(T=34).GC finished] [GC for 10598 CONS pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=44).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 10608 CONS pages..(T=34).GC finished] [GC for 641 SFUN pages..(T=33).GC finished] [GC for 22272 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 10608 CONS pages..(T=33).GC finished] NIL :SKIPPED DEFDEPRECATE 4489 END-OF-PASS-2 Finished loading '((IN-PACKAGE "ACL2") (VERIFY-TERMINATION-BOOT-STRAP SAFE-ACCESS-COMMAND-TUPLE-FORM) (VERIFY-TERMINATION-BOOT-STRAP ACL2-SYSTEM-NAMEP) (MUTUAL-RECURSION (DEFUN SYSTEM-PSEUDO-TERMP (X W) (DECLARE #) (COND # # # # #)) (DEFUN SYSTEM-PSEUDO-TERM-LISTP (LST W) (DECLARE #) (COND # #))) (DEFUN PAIR-FNS-WITH-MEASURED-SUBSETS (FNS WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS1 (WRLD INSTALLED-WRLD ACC) (DECLARE (XARGS :GUARD #)) (COND (# #) (# #) (T #))) (DEFUN NEW-VERIFY-GUARDS-FNS (STATE) (DECLARE (XARGS :STOBJS STATE)) (LET (#) (NEW-VERIFY-GUARDS-FNS1 WRLD WRLD NIL))) ...). ACL2 loading '((COMP-FN :EXEC NIL "1" STATE)). [GC for 2049 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 10608 CONS pages..(T=33).GC finished] [GC for 10618 CONS pages..(T=33).GC finished] [GC for 10628 CONS pages..(T=32).GC finished] [GC for 10628 CONS pages..(T=33).GC finished] [GC for 10628 CONS pages..(T=33).GC finished] [GC for 10628 CONS pages..(T=32).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 814 SYMBOL pages..(T=33).GC finished] [GC for 10628 CONS pages..(T=32).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=32).GC finished] [GC for 10628 CONS pages..(T=32).GC finished] [GC for 289 ARRAY pages..(T=32).GC finished] [GC for 289 ARRAY pages..(T=32).GC finished] [GC for 299 ARRAY pages..(T=32).GC finished] [GC for 309 ARRAY pages..(T=32).GC finished] [GC for 319 ARRAY pages..(T=33).GC finished] [GC for 10638 CONS pages..(T=32).GC finished] [GC for 329 ARRAY pages..(T=33).GC finished] [GC for 339 ARRAY pages..(T=31).GC finished] [GC for 10648 CONS pages..(T=31).GC finished] [GC for 349 ARRAY pages..(T=33).GC finished] [GC for 85 STRUCTURE pages..(T=32).GC finished] [GC for 10658 CONS pages..(T=31).GC finished] [GC for 359 ARRAY pages..(T=33).GC finished] [GC for 369 ARRAY pages..(T=32).GC finished] [GC for 10668 CONS pages..(T=32).GC finished] [GC for 379 ARRAY pages..(T=31).GC finished] [GC for 10678 CONS pages..(T=32).GC finished] [GC for 389 ARRAY pages..(T=33).GC finished] [GC for 399 ARRAY pages..(T=32).GC finished] [GC for 10688 CONS pages..(T=33).GC finished] [GC for 409 ARRAY pages..(T=33).GC finished] [GC for 10698 CONS pages..(T=33).GC finished] [GC for 419 ARRAY pages..(T=33).GC finished] [GC for 429 ARRAY pages..(T=34).GC finished] [GC for 10708 CONS pages..(T=34).GC finished] [GC for 439 ARRAY pages..(T=34).GC finished] [GC for 10718 CONS pages..(T=34).GC finished] [GC for 449 ARRAY pages..(T=34).GC finished] [GC for 459 ARRAY pages..(T=36).GC finished] [GC for 10728 CONS pages..(T=35).GC finished] [GC for 469 ARRAY pages..(T=38).GC finished] [GC for 10738 CONS pages..(T=35).GC finished] [GC for 479 ARRAY pages..(T=36).GC finished] [GC for 489 ARRAY pages..(T=35).GC finished] [GC for 10748 CONS pages..(T=34).GC finished] [GC for 499 ARRAY pages..(T=35).GC finished] [GC for 10758 CONS pages..(T=35).GC finished] [GC for 10768 CONS pages..(T=35).GC finished] [GC for 10778 CONS pages..(T=35).GC finished] [GC for 509 ARRAY pages..(T=34).GC finished] [GC for 10788 CONS pages..(T=35).GC finished] [GC for 519 ARRAY pages..(T=35).GC finished] [GC for 529 ARRAY pages..(T=35).GC finished] [GC for 539 ARRAY pages..(T=35).GC finished] [GC for 127 STRUCTURE pages..(T=33).GC finished] [GC for 549 ARRAY pages..(T=33).GC finished] [GC for 559 ARRAY pages..(T=33).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=33).GC finished] [GC for 569 ARRAY pages..(T=32).GC finished] [GC for 579 ARRAY pages..(T=34).GC finished] [GC for 589 ARRAY pages..(T=35).GC finished] [GC for 599 ARRAY pages..(T=34).GC finished] [GC for 609 ARRAY pages..(T=35).GC finished] [GC for 10798 CONS pages..(T=35).GC finished] [GC for 619 ARRAY pages..(T=35).GC finished] [GC for 10808 CONS pages..(T=35).GC finished] [GC for 629 ARRAY pages..(T=34).GC finished] [GC for 639 ARRAY pages..(T=34).GC finished] [GC for 10818 CONS pages..(T=34).GC finished] [GC for 649 ARRAY pages..(T=33).GC finished] [GC for 10828 CONS pages..(T=34).GC finished] [GC for 659 ARRAY pages..(T=34).GC finished] [GC for 10838 CONS pages..(T=34).GC finished] [GC for 669 ARRAY pages..(T=34).GC finished] [GC for 10848 CONS pages..(T=34).GC finished] [GC for 679 ARRAY pages..(T=35).GC finished] [GC for 10858 CONS pages..(T=33).GC finished] [GC for 689 ARRAY pages..(T=33).GC finished] [GC for 10868 CONS pages..(T=34).GC finished] [GC for 699 ARRAY pages..(T=34).GC finished] [GC for 10878 CONS pages..(T=34).GC finished] [GC for 709 ARRAY pages..(T=34).GC finished] [GC for 719 ARRAY pages..(T=33).GC finished] [GC for 10888 CONS pages..(T=34).GC finished] [GC for 729 ARRAY pages..(T=34).GC finished] [GC for 10898 CONS pages..(T=33).GC finished] [GC for 739 ARRAY pages..(T=34).GC finished] [GC for 10908 CONS pages..(T=33).GC finished] [GC for 749 ARRAY pages..(T=33).GC finished] [GC for 10918 CONS pages..(T=34).GC finished] [GC for 759 ARRAY pages..(T=33).GC finished] [GC for 769 ARRAY pages..(T=34).GC finished] [GC for 10928 CONS pages..(T=33).GC finished] [GC for 779 ARRAY pages..(T=34).GC finished] [GC for 10938 CONS pages..(T=34).GC finished] [GC for 789 ARRAY pages..(T=35).GC finished] [GC for 10948 CONS pages..(T=33).GC finished] [GC for 799 ARRAY pages..(T=34).GC finished] [GC for 190 STRUCTURE pages..(T=33).GC finished] [GC for 10958 CONS pages..(T=37).GC finished] [GC for 809 ARRAY pages..(T=34).GC finished] [GC for 10968 CONS pages..(T=34).GC finished] [GC for 819 ARRAY pages..(T=35).GC finished] [GC for 10978 CONS pages..(T=36).GC finished] [GC for 10988 CONS pages..(T=36).GC finished] [GC for 829 ARRAY pages..(T=35).GC finished] [GC for 839 ARRAY pages..(T=36).GC finished] [GC for 10998 CONS pages..(T=36).GC finished] [GC for 849 ARRAY pages..(T=35).GC finished] [GC for 11008 CONS pages..(T=35).GC finished] [GC for 859 ARRAY pages..(T=35).GC finished] [GC for 11018 CONS pages..(T=35).GC finished] [GC for 869 ARRAY pages..(T=35).GC finished] [GC for 879 ARRAY pages..(T=36).GC finished] [GC for 11028 CONS pages..(T=36).GC finished] [GC for 889 ARRAY pages..(T=37).GC finished] [GC for 11038 CONS pages..(T=36).GC finished] [GC for 899 ARRAY pages..(T=33).GC finished] [GC for 11048 CONS pages..(T=33).GC finished] [GC for 909 ARRAY pages..(T=34).GC finished] [GC for 919 ARRAY pages..(T=35).GC finished] [GC for 11058 CONS pages..(T=35).GC finished] [GC for 929 ARRAY pages..(T=35).GC finished] [GC for 11068 CONS pages..(T=35).GC finished] [GC for 939 ARRAY pages..(T=35).GC finished] [GC for 11078 CONS pages..(T=34).GC finished] [GC for 949 ARRAY pages..(T=36).GC finished] [GC for 959 ARRAY pages..(T=35).GC finished] [GC for 11088 CONS pages..(T=37).GC finished] [GC for 969 ARRAY pages..(T=36).GC finished] [GC for 11098 CONS pages..(T=36).GC finished] [GC for 979 ARRAY pages..(T=36).GC finished] [GC for 11108 CONS pages..(T=37).GC finished] [GC for 989 ARRAY pages..(T=35).GC finished] [GC for 11118 CONS pages..(T=36).GC finished] [GC for 999 ARRAY pages..(T=35).GC finished] [GC for 11128 CONS pages..(T=36).GC finished] [GC for 1009 ARRAY pages..(T=36).GC finished] [GC for 11138 CONS pages..(T=36).GC finished] [GC for 1019 ARRAY pages..(T=35).GC finished] [GC for 1029 ARRAY pages..(T=36).GC finished] [GC for 11148 CONS pages..(T=36).GC finished] [GC for 1039 ARRAY pages..(T=36).GC finished] [GC for 11158 CONS pages..(T=36).GC finished] [GC for 1049 ARRAY pages..(T=37).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=37).GC finished] [GC for 11168 CONS pages..(T=37).GC finished] [GC for 1059 ARRAY pages..(T=37).GC finished] [GC for 11178 CONS pages..(T=37).GC finished] [GC for 1069 ARRAY pages..(T=34).GC finished] [GC for 11188 CONS pages..(T=35).GC finished] [GC for 1079 ARRAY pages..(T=35).GC finished] [GC for 11198 CONS pages..(T=34).GC finished] [GC for 1089 ARRAY pages..(T=36).GC finished] [GC for 11208 CONS pages..(T=36).GC finished] [GC for 1099 ARRAY pages..(T=36).GC finished] [GC for 1109 ARRAY pages..(T=36).GC finished] [GC for 11218 CONS pages..(T=36).GC finished] [GC for 1119 ARRAY pages..(T=36).GC finished] [GC for 11228 CONS pages..(T=37).GC finished] [GC for 1129 ARRAY pages..(T=37).GC finished] [GC for 11238 CONS pages..(T=38).GC finished] [GC for 1139 ARRAY pages..(T=38).GC finished] [GC for 11248 CONS pages..(T=37).GC finished] [GC for 1149 ARRAY pages..(T=38).GC finished] [GC for 1159 ARRAY pages..(T=38).GC finished] [GC for 11258 CONS pages..(T=38).GC finished] [GC for 1169 ARRAY pages..(T=38).GC finished] [GC for 11268 CONS pages..(T=37).GC finished] [GC for 1179 ARRAY pages..(T=38).GC finished] [GC for 11278 CONS pages..(T=39).GC finished] [GC for 1189 ARRAY pages..(T=38).GC finished] [GC for 11288 CONS pages..(T=40).GC finished] [GC for 285 STRUCTURE pages..(T=38).GC finished] [GC for 1199 ARRAY pages..(T=38).GC finished] [GC for 11298 CONS pages..(T=39).GC finished] [GC for 1209 ARRAY pages..(T=38).GC finished] [GC for 11308 CONS pages..(T=38).GC finished] [GC for 1219 ARRAY pages..(T=37).GC finished] [GC for 1229 ARRAY pages..(T=37).GC finished] [GC for 11318 CONS pages..(T=36).GC finished] [GC for 1239 ARRAY pages..(T=36).GC finished] [GC for 11328 CONS pages..(T=36).GC finished] [GC for 1249 ARRAY pages..(T=37).GC finished] [GC for 11338 CONS pages..(T=36).GC finished] [GC for 1259 ARRAY pages..(T=37).GC finished] [GC for 11348 CONS pages..(T=38).GC finished] [GC for 1269 ARRAY pages..(T=39).GC finished] [GC for 11358 CONS pages..(T=38).GC finished] [GC for 1279 ARRAY pages..(T=36).GC finished] [GC for 11368 CONS pages..(T=37).GC finished] [GC for 1289 ARRAY pages..(T=36).GC finished] [GC for 11378 CONS pages..(T=37).GC finished] [GC for 1299 ARRAY pages..(T=36).GC finished] [GC for 11388 CONS pages..(T=36).GC finished] [GC for 1309 ARRAY pages..(T=36).GC finished] [GC for 1319 ARRAY pages..(T=37).GC finished] [GC for 11398 CONS pages..(T=36).GC finished] [GC for 1329 ARRAY pages..(T=36).GC finished] [GC for 11408 CONS pages..(T=37).GC finished] [GC for 1339 ARRAY pages..(T=37).GC finished] [GC for 11418 CONS pages..(T=37).GC finished] [GC for 1349 ARRAY pages..(T=38).GC finished] [GC for 11428 CONS pages..(T=37).GC finished] [GC for 1359 ARRAY pages..(T=38).GC finished] [GC for 11438 CONS pages..(T=37).GC finished] [GC for 1369 ARRAY pages..(T=37).GC finished] [GC for 1379 ARRAY pages..(T=37).GC finished] [GC for 11448 CONS pages..(T=37).GC finished] [GC for 1389 ARRAY pages..(T=37).GC finished] [GC for 11458 CONS pages..(T=38).GC finished] [GC for 1399 ARRAY pages..(T=37).GC finished] [GC for 11468 CONS pages..(T=38).GC finished] [GC for 1409 ARRAY pages..(T=37).GC finished] [GC for 11478 CONS pages..(T=37).GC finished] [GC for 1419 ARRAY pages..(T=36).GC finished] [GC for 11488 CONS pages..(T=39).GC finished] [GC for 1429 ARRAY pages..(T=38).GC finished] [GC for 11498 CONS pages..(T=38).GC finished] [GC for 1439 ARRAY pages..(T=38).GC finished] [GC for 11508 CONS pages..(T=39).GC finished] [GC for 1449 ARRAY pages..(T=38).GC finished] [GC for 1459 ARRAY pages..(T=38).GC finished] [GC for 11518 CONS pages..(T=41).GC finished] [GC for 1469 ARRAY pages..(T=41).GC finished] [GC for 11528 CONS pages..(T=39).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=39).GC finished] [GC for 1479 ARRAY pages..(T=39).GC finished] [GC for 11538 CONS pages..(T=38).GC finished] [GC for 1489 ARRAY pages..(T=39).GC finished] [GC for 11548 CONS pages..(T=39).GC finished] [GC for 1499 ARRAY pages..(T=38).GC finished] [GC for 11558 CONS pages..(T=39).GC finished] [GC for 1509 ARRAY pages..(T=38).GC finished] [GC for 11568 CONS pages..(T=39).GC finished] [GC for 1519 ARRAY pages..(T=38).GC finished] [GC for 1529 ARRAY pages..(T=38).GC finished] [GC for 11578 CONS pages..(T=39).GC finished] [GC for 1539 ARRAY pages..(T=39).GC finished] [GC for 11588 CONS pages..(T=39).GC finished] [GC for 1549 ARRAY pages..(T=40).GC finished] [GC for 11598 CONS pages..(T=40).GC finished] [GC for 1559 ARRAY pages..(T=38).GC finished] [GC for 11608 CONS pages..(T=39).GC finished] [GC for 1569 ARRAY pages..(T=38).GC finished] [GC for 11618 CONS pages..(T=38).GC finished] [GC for 1579 ARRAY pages..(T=38).GC finished] [GC for 11628 CONS pages..(T=39).GC finished] [GC for 1589 ARRAY pages..(T=39).GC finished] [GC for 1599 ARRAY pages..(T=38).GC finished] [GC for 11638 CONS pages..(T=38).GC finished] [GC for 1609 ARRAY pages..(T=39).GC finished] [GC for 11648 CONS pages..(T=36).GC finished] [GC for 1619 ARRAY pages..(T=36).GC finished] [GC for 11658 CONS pages..(T=36).GC finished] [GC for 1629 ARRAY pages..(T=38).GC finished] [GC for 11668 CONS pages..(T=38).GC finished] [GC for 1639 ARRAY pages..(T=37).GC finished] [GC for 11678 CONS pages..(T=37).GC finished] [GC for 1649 ARRAY pages..(T=37).GC finished] [GC for 11688 CONS pages..(T=38).GC finished] [GC for 1659 ARRAY pages..(T=36).GC finished] [GC for 1669 ARRAY pages..(T=36).GC finished] [GC for 11698 CONS pages..(T=37).GC finished] [GC for 1679 ARRAY pages..(T=37).GC finished] [GC for 11708 CONS pages..(T=38).GC finished] [GC for 1689 ARRAY pages..(T=38).GC finished] [GC for 11718 CONS pages..(T=37).GC finished] [GC for 1699 ARRAY pages..(T=38).GC finished] [GC for 11728 CONS pages..(T=39).GC finished] [GC for 1709 ARRAY pages..(T=39).GC finished] [GC for 11738 CONS pages..(T=39).GC finished] [GC for 1719 ARRAY pages..(T=39).GC finished] [GC for 11748 CONS pages..(T=38).GC finished] [GC for 1729 ARRAY pages..(T=38).GC finished] [GC for 11758 CONS pages..(T=39).GC finished] [GC for 1739 ARRAY pages..(T=38).GC finished] [GC for 1749 ARRAY pages..(T=40).GC finished] [GC for 11768 CONS pages..(T=39).GC finished] [GC for 1759 ARRAY pages..(T=39).GC finished] [GC for 11778 CONS pages..(T=38).GC finished] [GC for 1769 ARRAY pages..(T=39).GC finished] [GC for 427 STRUCTURE pages..(T=40).GC finished] [GC for 11788 CONS pages..(T=39).GC finished] [GC for 1779 ARRAY pages..(T=39).GC finished] [GC for 11798 CONS pages..(T=40).GC finished] [GC for 1789 ARRAY pages..(T=40).GC finished] [GC for 11808 CONS pages..(T=40).GC finished] [GC for 1799 ARRAY pages..(T=39).GC finished] [GC for 11818 CONS pages..(T=41).GC finished] [GC for 1809 ARRAY pages..(T=40).GC finished] [GC for 1819 ARRAY pages..(T=40).GC finished] [GC for 11828 CONS pages..(T=39).GC finished] [GC for 1829 ARRAY pages..(T=40).GC finished] [GC for 11838 CONS pages..(T=39).GC finished] [GC for 1839 ARRAY pages..(T=41).GC finished] [GC for 11848 CONS pages..(T=39).GC finished] [GC for 1849 ARRAY pages..(T=39).GC finished] [GC for 11858 CONS pages..(T=39).GC finished] [GC for 1859 ARRAY pages..(T=40).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=40).GC finished] [GC for 11868 CONS pages..(T=41).GC finished] [GC for 1869 ARRAY pages..(T=39).GC finished] [GC for 11878 CONS pages..(T=41).GC finished] [GC for 1879 ARRAY pages..(T=40).GC finished] [GC for 1889 ARRAY pages..(T=40).GC finished] [GC for 11888 CONS pages..(T=40).GC finished] [GC for 1899 ARRAY pages..(T=41).GC finished] [GC for 11898 CONS pages..(T=40).GC finished] [GC for 1909 ARRAY pages..(T=40).GC finished] [GC for 11908 CONS pages..(T=39).GC finished] [GC for 1919 ARRAY pages..(T=39).GC finished] [GC for 11918 CONS pages..(T=40).GC finished] [GC for 1929 ARRAY pages..(T=41).GC finished] [GC for 11928 CONS pages..(T=40).GC finished] [GC for 1939 ARRAY pages..(T=40).GC finished] [GC for 11938 CONS pages..(T=40).GC finished] [GC for 1949 ARRAY pages..(T=40).GC finished] [GC for 1959 ARRAY pages..(T=40).GC finished] [GC for 11948 CONS pages..(T=41).GC finished] [GC for 1969 ARRAY pages..(T=39).GC finished] [GC for 11958 CONS pages..(T=40).GC finished] [GC for 1979 ARRAY pages..(T=40).GC finished] [GC for 11968 CONS pages..(T=40).GC finished] [GC for 1989 ARRAY pages..(T=41).GC finished] [GC for 11978 CONS pages..(T=40).GC finished] [GC for 1999 ARRAY pages..(T=40).GC finished] [GC for 11988 CONS pages..(T=40).GC finished] [GC for 2009 ARRAY pages..(T=39).GC finished] [GC for 2019 ARRAY pages..(T=40).GC finished] [GC for 11998 CONS pages..(T=40).GC finished] [GC for 2029 ARRAY pages..(T=40).GC finished] [GC for 12008 CONS pages..(T=40).GC finished] [GC for 2039 ARRAY pages..(T=41).GC finished] [GC for 12018 CONS pages..(T=40).GC finished] [GC for 2049 ARRAY pages..(T=42).GC finished] [GC for 12028 CONS pages..(T=41).GC finished] [GC for 2059 ARRAY pages..(T=42).GC finished] [GC for 12038 CONS pages..(T=40).GC finished] [GC for 2069 ARRAY pages..(T=40).GC finished] [GC for 12048 CONS pages..(T=40).GC finished] [GC for 2079 ARRAY pages..(T=41).GC finished] [GC for 12058 CONS pages..(T=40).GC finished] [GC for 2089 ARRAY pages..(T=40).GC finished] [GC for 12068 CONS pages..(T=42).GC finished] [GC for 2099 ARRAY pages..(T=41).GC finished] [GC for 12078 CONS pages..(T=39).GC finished] [GC for 2109 ARRAY pages..(T=40).GC finished] [GC for 12088 CONS pages..(T=41).GC finished] [GC for 2119 ARRAY pages..(T=40).GC finished] [GC for 12098 CONS pages..(T=40).GC finished] [GC for 2129 ARRAY pages..(T=40).GC finished] [GC for 2139 ARRAY pages..(T=40).GC finished] [GC for 12108 CONS pages..(T=42).GC finished] [GC for 2149 ARRAY pages..(T=42).GC finished] [GC for 12118 CONS pages..(T=41).GC finished] [GC for 2159 ARRAY pages..(T=41).GC finished] [GC for 12128 CONS pages..(T=40).GC finished] [GC for 2169 ARRAY pages..(T=41).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=41).GC finished] [GC for 12138 CONS pages..(T=41).GC finished] [GC for 2179 ARRAY pages..(T=40).GC finished] [GC for 12148 CONS pages..(T=41).GC finished] [GC for 2189 ARRAY pages..(T=42).GC finished] [GC for 12158 CONS pages..(T=41).GC finished] [GC for 2199 ARRAY pages..(T=41).GC finished] [GC for 12168 CONS pages..(T=41).GC finished] [GC for 2209 ARRAY pages..(T=40).GC finished] [GC for 12178 CONS pages..(T=40).GC finished] [GC for 12188 CONS pages..(T=40).GC finished] [GC for 12198 CONS pages..(T=40).GC finished] [GC for 12208 CONS pages..(T=40).GC finished] [GC for 12218 CONS pages..(T=40).GC finished] [GC for 12228 CONS pages..(T=40).GC finished] [GC for 12238 CONS pages..(T=41).GC finished] [GC for 12248 CONS pages..(T=41).GC finished] [GC for 12258 CONS pages..(T=41).GC finished] [GC for 12268 CONS pages..(T=41).GC finished] [GC for 12278 CONS pages..(T=41).GC finished] [GC for 12288 CONS pages..(T=41).GC finished] [GC for 12298 CONS pages..(T=40).GC finished] [GC for 12308 CONS pages..(T=40).GC finished] [GC for 12318 CONS pages..(T=40).GC finished] [GC for 12328 CONS pages..(T=40).GC finished] [GC for 12338 CONS pages..(T=41).GC finished] [GC for 12348 CONS pages..(T=42).GC finished] [GC for 12358 CONS pages..(T=42).GC finished] [GC for 12368 CONS pages..(T=43).GC finished] [GC for 12378 CONS pages..(T=42).GC finished] [GC for 2219 ARRAY pages..(T=41).GC finished] [GC for 641 SFUN pages..(T=42).GC finished] [GC for 12388 CONS pages..(T=42).GC finished] [GC for 12398 CONS pages..(T=42).GC finished] [GC for 12408 CONS pages..(T=41).GC finished] [GC for 12418 CONS pages..(T=42).GC finished] [GC for 12428 CONS pages..(T=42).GC finished] [GC for 12438 CONS pages..(T=41).GC finished] [GC for 12448 CONS pages..(T=42).GC finished] [GC for 12458 CONS pages..(T=41).GC finished] [GC for 12468 CONS pages..(T=42).GC finished] [GC for 12478 CONS pages..(T=42).GC finished] [GC for 12488 CONS pages..(T=42).GC finished] [GC for 12498 CONS pages..(T=41).GC finished] [GC for 651 SFUN pages..(T=42).GC finished] [GC for 12508 CONS pages..(T=43).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=43).GC finished] [GC for 12518 CONS pages..(T=42).GC finished] [GC for 12528 CONS pages..(T=43).GC finished] [GC for 12538 CONS pages..(T=42).GC finished] [GC for 12548 CONS pages..(T=43).GC finished] [GC for 12558 CONS pages..(T=42).GC finished] [GC for 12568 CONS pages..(T=42).GC finished] [GC for 12578 CONS pages..(T=42).GC finished] [GC for 12588 CONS pages..(T=43).GC finished] [GC for 661 SFUN pages..(T=42).GC finished] [GC for 12598 CONS pages..(T=42).GC finished] [GC for 12608 CONS pages..(T=42).GC finished] [GC for 661 SFUN pages..(T=42).GC finished] [GC for 12618 CONS pages..(T=41).GC finished] [GC for 12628 CONS pages..(T=41).GC finished] [GC for 12638 CONS pages..(T=41).GC finished] [GC for 12648 CONS pages..(T=40).GC finished] [GC for 12658 CONS pages..(T=41).GC finished] [GC for 12668 CONS pages..(T=41).GC finished] [GC for 12678 CONS pages..(T=41).GC finished] [GC for 12688 CONS pages..(T=41).GC finished] [GC for 12698 CONS pages..(T=41).GC finished] [GC for 671 SFUN pages..(T=41).GC finished] [GC for 12708 CONS pages..(T=40).GC finished] [GC for 12718 CONS pages..(T=41).GC finished] [GC for 12728 CONS pages..(T=40).GC finished] [GC for 12738 CONS pages..(T=41).GC finished] [GC for 12748 CONS pages..(T=41).GC finished] [GC for 12758 CONS pages..(T=41).GC finished] [GC for 12768 CONS pages..(T=41).GC finished] [GC for 27136 CONTIGUOUS-BLOCKS pages..(T=42).GC finished] [GC for 152 CFUN pages..(T=32).GC finished] T Finished loading '((COMP-FN :EXEC NIL "1" STATE)). [GC for 2049 RELOCATABLE-BLOCKS pages..(T=37).GC finished] [GC for 681 SFUN pages..(T=36).GC finished] [GC for 681 SFUN pages..(T=38).GC finished] [GC for 12778 CONS pages..(T=39).GC finished] [GC for 12788 CONS pages..(T=38).GC finished] [GC for 12798 CONS pages..(T=38).GC finished] [GC for 12808 CONS pages..(T=37).GC finished] [GC for 12818 CONS pages..(T=38).GC finished] [GC for 12828 CONS pages..(T=38).GC finished] [GC for 12838 CONS pages..(T=38).GC finished] [GC for 12848 CONS pages..(T=39).GC finished] [GC for 12858 CONS pages..(T=40).GC finished] [GC for 12868 CONS pages..(T=39).GC finished] [GC for 12878 CONS pages..(T=39).GC finished] [GC for 12888 CONS pages..(T=38).GC finished] [GC for 12898 CONS pages..(T=37).GC finished] [GC for 12908 CONS pages..(T=38).GC finished] [GC for 12918 CONS pages..(T=41).GC finished] [GC for 12928 CONS pages..(T=41).GC finished] [GC for 12938 CONS pages..(T=42).GC finished] [GC for 12948 CONS pages..(T=41).GC finished] [GC for 12958 CONS pages..(T=39).GC finished] [GC for 12968 CONS pages..(T=40).GC finished] [GC for 12978 CONS pages..(T=41).GC finished] [GC for 12988 CONS pages..(T=41).GC finished] [GC for 12998 CONS pages..(T=40).GC finished] [GC for 13008 CONS pages..(T=39).GC finished] [GC for 13018 CONS pages..(T=41).GC finished] [GC for 13028 CONS pages..(T=40).GC finished] [GC for 13038 CONS pages..(T=39).GC finished] [GC for 13048 CONS pages..(T=41).GC finished] [GC for 13058 CONS pages..(T=42).GC finished] [GC for 13068 CONS pages..(T=42).GC finished] [GC for 13078 CONS pages..(T=42).GC finished] [GC for 13088 CONS pages..(T=42).GC finished] [GC for 13098 CONS pages..(T=41).GC finished] [GC for 13108 CONS pages..(T=40).GC finished] [GC for 13118 CONS pages..(T=40).GC finished] [GC for 13128 CONS pages..(T=39).GC finished] [GC for 691 SFUN pages..(T=39).GC finished] [GC for 13138 CONS pages..(T=39).GC finished] [GC for 13148 CONS pages..(T=39).GC finished] [GC for 13158 CONS pages..(T=39).GC finished] [GC for 13168 CONS pages..(T=39).GC finished] [GC for 13178 CONS pages..(T=41).GC finished] [GC for 13188 CONS pages..(T=41).GC finished] [GC for 13198 CONS pages..(T=42).GC finished] [GC for 13208 CONS pages..(T=42).GC finished] [GC for 13218 CONS pages..(T=43).GC finished] [GC for 13228 CONS pages..(T=43).GC finished] [GC for 13238 CONS pages..(T=43).GC finished] [GC for 13248 CONS pages..(T=42).GC finished] [GC for 13258 CONS pages..(T=42).GC finished] [GC for 13268 CONS pages..(T=43).GC finished] [GC for 13278 CONS pages..(T=41).GC finished] [GC for 13288 CONS pages..(T=42).GC finished] [GC for 13298 CONS pages..(T=41).GC finished] [GC for 13308 CONS pages..(T=41).GC finished] [GC for 13318 CONS pages..(T=42).GC finished] [GC for 13328 CONS pages..(T=42).GC finished] [GC for 13338 CONS pages..(T=42).GC finished] [GC for 13348 CONS pages..(T=40).GC finished] [GC for 13358 CONS pages..(T=39).GC finished] [GC for 13368 CONS pages..(T=39).GC finished] [GC for 13378 CONS pages..(T=41).GC finished] [GC for 13388 CONS pages..(T=41).GC finished] [GC for 13398 CONS pages..(T=42).GC finished] [GC for 13408 CONS pages..(T=42).GC finished] [GC for 13418 CONS pages..(T=42).GC finished] [GC for 13428 CONS pages..(T=41).GC finished] [GC for 13438 CONS pages..(T=41).GC finished] [GC for 13448 CONS pages..(T=41).GC finished] [GC for 13458 CONS pages..(T=41).GC finished] [GC for 13468 CONS pages..(T=42).GC finished] [GC for 13478 CONS pages..(T=41).GC finished] [GC for 13488 CONS pages..(T=41).GC finished] [GC for 13498 CONS pages..(T=42).GC finished] [GC for 13508 CONS pages..(T=41).GC finished] [GC for 13518 CONS pages..(T=42).GC finished] [GC for 13528 CONS pages..(T=41).GC finished] [GC for 13538 CONS pages..(T=41).GC finished] [GC for 13548 CONS pages..(T=40).GC finished] [GC for 13558 CONS pages..(T=40).GC finished] [GC for 13568 CONS pages..(T=41).GC finished] [GC for 13578 CONS pages..(T=40).GC finished] [GC for 13588 CONS pages..(T=38).GC finished] [GC for 13598 CONS pages..(T=39).GC finished] [GC for 13608 CONS pages..(T=39).GC finished] [GC for 13618 CONS pages..(T=40).GC finished] [GC for 13628 CONS pages..(T=39).GC finished] [GC for 13638 CONS pages..(T=39).GC finished] [GC for 13648 CONS pages..(T=39).GC finished] [GC for 13658 CONS pages..(T=39).GC finished] [GC for 13668 CONS pages..(T=39).GC finished] [GC for 13678 CONS pages..(T=39).GC finished] [GC for 13688 CONS pages..(T=39).GC finished] [GC for 13698 CONS pages..(T=40).GC finished] [GC for 13708 CONS pages..(T=40).GC finished] [GC for 13718 CONS pages..(T=40).GC finished] [GC for 13728 CONS pages..(T=39).GC finished] [GC for 13738 CONS pages..(T=40).GC finished] [GC for 13748 CONS pages..(T=39).GC finished] [GC for 13758 CONS pages..(T=39).GC finished] [GC for 701 SFUN pages..(T=39).GC finished] [GC for 13768 CONS pages..(T=38).GC finished] [GC for 13778 CONS pages..(T=40).GC finished] [GC for 13788 CONS pages..(T=38).GC finished] [GC for 13798 CONS pages..(T=38).GC finished] [GC for 13808 CONS pages..(T=39).GC finished] [GC for 13818 CONS pages..(T=42).GC finished] [GC for 13828 CONS pages..(T=43).GC finished] [GC for 13838 CONS pages..(T=42).GC finished] [GC for 13848 CONS pages..(T=42).GC finished] [GC for 13858 CONS pages..(T=44).GC finished] [GC for 13868 CONS pages..(T=43).GC finished] [GC for 13878 CONS pages..(T=44).GC finished] [GC for 13888 CONS pages..(T=43).GC finished] [GC for 13898 CONS pages..(T=44).GC finished] [GC for 13908 CONS pages..(T=43).GC finished] [GC for 13918 CONS pages..(T=43).GC finished] [GC for 13928 CONS pages..(T=43).GC finished] [GC for 13938 CONS pages..(T=43).GC finished] [GC for 13948 CONS pages..(T=43).GC finished] [GC for 13958 CONS pages..(T=43).GC finished] [GC for 13968 CONS pages..(T=43).GC finished] [GC for 13978 CONS pages..(T=44).GC finished] [GC for 13988 CONS pages..(T=43).GC finished] [GC for 13998 CONS pages..(T=44).GC finished] [GC for 14008 CONS pages..(T=43).GC finished] [GC for 14018 CONS pages..(T=44).GC finished] [GC for 711 SFUN pages..(T=43).GC finished] [GC for 14028 CONS pages..(T=45).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=44).GC finished] [GC for 14038 CONS pages..(T=43).GC finished] [GC for 721 SFUN pages..(T=43).GC finished] [GC for 14048 CONS pages..(T=44).GC finished] [GC for 14058 CONS pages..(T=43).GC finished] [GC for 14068 CONS pages..(T=43).GC finished] [GC for 14078 CONS pages..(T=44).GC finished] [GC for 14088 CONS pages..(T=43).GC finished] [GC for 14098 CONS pages..(T=42).GC finished] [GC for 14108 CONS pages..(T=42).GC finished] [GC for 14118 CONS pages..(T=41).GC finished] [GC for 14128 CONS pages..(T=42).GC finished] [GC for 14138 CONS pages..(T=42).GC finished] [GC for 14148 CONS pages..(T=41).GC finished] [GC for 14158 CONS pages..(T=41).GC finished] [GC for 14168 CONS pages..(T=40).GC finished] [GC for 14178 CONS pages..(T=41).GC finished] [GC for 14188 CONS pages..(T=41).GC finished] [GC for 14198 CONS pages..(T=40).GC finished] [GC for 14208 CONS pages..(T=39).GC finished] [GC for 14218 CONS pages..(T=39).GC finished] [GC for 14228 CONS pages..(T=40).GC finished] [GC for 14238 CONS pages..(T=39).GC finished] [GC for 14248 CONS pages..(T=38).GC finished] [GC for 14258 CONS pages..(T=39).GC finished] [GC for 14268 CONS pages..(T=39).GC finished] [GC for 14278 CONS pages..(T=39).GC finished] [GC for 14288 CONS pages..(T=39).GC finished] [GC for 14298 CONS pages..(T=41).GC finished] [GC for 14308 CONS pages..(T=40).GC finished] [GC for 14318 CONS pages..(T=39).GC finished] [GC for 14328 CONS pages..(T=39).GC finished] [GC for 14338 CONS pages..(T=39).GC finished] [GC for 14348 CONS pages..(T=38).GC finished] [GC for 14358 CONS pages..(T=39).GC finished] [GC for 14368 CONS pages..(T=40).GC finished] [GC for 14378 CONS pages..(T=43).GC finished] [GC for 14388 CONS pages..(T=43).GC finished] [GC for 14398 CONS pages..(T=42).GC finished] [GC for 14408 CONS pages..(T=43).GC finished] [GC for 14418 CONS pages..(T=42).GC finished] [GC for 14428 CONS pages..(T=43).GC finished] [GC for 14438 CONS pages..(T=42).GC finished] [GC for 14448 CONS pages..(T=42).GC finished] [GC for 14458 CONS pages..(T=43).GC finished] [GC for 14468 CONS pages..(T=43).GC finished] [GC for 14478 CONS pages..(T=44).GC finished] [GC for 14488 CONS pages..(T=44).GC finished] [GC for 14498 CONS pages..(T=42).GC finished] [GC for 14508 CONS pages..(T=42).GC finished] [GC for 14518 CONS pages..(T=41).GC finished] [GC for 14528 CONS pages..(T=41).GC finished] [GC for 14538 CONS pages..(T=40).GC finished] [GC for 14548 CONS pages..(T=42).GC finished] [GC for 14558 CONS pages..(T=39).GC finished] [GC for 14568 CONS pages..(T=38).GC finished] [GC for 14578 CONS pages..(T=38).GC finished] [GC for 14588 CONS pages..(T=43).GC finished] [GC for 14598 CONS pages..(T=45).GC finished] [GC for 14608 CONS pages..(T=44).GC finished] [GC for 14618 CONS pages..(T=44).GC finished] [GC for 14628 CONS pages..(T=43).GC finished] [GC for 14638 CONS pages..(T=41).GC finished] [GC for 14648 CONS pages..(T=41).GC finished] [GC for 14658 CONS pages..(T=41).GC finished] [GC for 14668 CONS pages..(T=39).GC finished] [GC for 14678 CONS pages..(T=39).GC finished] [GC for 14688 CONS pages..(T=39).GC finished] [GC for 14698 CONS pages..(T=40).GC finished] [GC for 14708 CONS pages..(T=40).GC finished] [GC for 14718 CONS pages..(T=39).GC finished] [GC for 14728 CONS pages..(T=40).GC finished] [GC for 14738 CONS pages..(T=38).GC finished] [GC for 14748 CONS pages..(T=39).GC finished] [GC for 14758 CONS pages..(T=44).GC finished] [GC for 14768 CONS pages..(T=44).GC finished] [GC for 14778 CONS pages..(T=44).GC finished] [GC for 14788 CONS pages..(T=43).GC finished] [GC for 14798 CONS pages..(T=43).GC finished] [GC for 14808 CONS pages..(T=42).GC finished] [GC for 14818 CONS pages..(T=41).GC finished] [GC for 14828 CONS pages..(T=39).GC finished] [GC for 14838 CONS pages..(T=39).GC finished] [GC for 14848 CONS pages..(T=39).GC finished] [GC for 14858 CONS pages..(T=39).GC finished] [GC for 14868 CONS pages..(T=39).GC finished] [GC for 14878 CONS pages..(T=39).GC finished] [GC for 14888 CONS pages..(T=41).GC finished] [GC for 14898 CONS pages..(T=39).GC finished] [GC for 14908 CONS pages..(T=39).GC finished] [GC for 14918 CONS pages..(T=39).GC finished] [GC for 731 SFUN pages..(T=39).GC finished] [GC for 14928 CONS pages..(T=38).GC finished] [GC for 14938 CONS pages..(T=39).GC finished] [GC for 14948 CONS pages..(T=40).GC finished] [GC for 14958 CONS pages..(T=39).GC finished] [GC for 14968 CONS pages..(T=39).GC finished] [GC for 14978 CONS pages..(T=39).GC finished] [GC for 14988 CONS pages..(T=39).GC finished] [GC for 14998 CONS pages..(T=40).GC finished] [GC for 15008 CONS pages..(T=39).GC finished] [GC for 15018 CONS pages..(T=38).GC finished] [GC for 15028 CONS pages..(T=39).GC finished] [GC for 824 SYMBOL pages..(T=39).GC finished] [GC for 15038 CONS pages..(T=40).GC finished] Warning: SIMPLE-WARNING: TRACE is being redefined. Warning: SIMPLE-WARNING: UNTRACE is being redefined. [GC for 27136 CONTIGUOUS-BLOCKS pages.. ****************************************************************************** Initialization complete, beginning the check and save. ****************************************************************************** (T=36).GC finished] [GC for 39680 CONTIGUOUS-BLOCKS pages..(T=36).GC finished] [GC for 2049 RELOCATABLE-BLOCKS pages..(T=29).GC finished] done. Successfully built /build/1st/acl2-8.5dfsg/saved_acl2. make[1]: Leaving directory '/build/1st/acl2-8.5dfsg' mv *saved_acl2.gcl saved_acl2 HOME=$(pwd) /usr/bin/make mini-proveall make[1]: Entering directory '/build/1st/acl2-8.5dfsg' Mini-proveall passed. make[1]: Leaving directory '/build/1st/acl2-8.5dfsg' mv mini-proveall.out debian/mini-proveall.out echo "(f-put-global 'old-certification-dir \"$(pwd)/books\" state)" \ "(f-put-global 'new-certification-dir \"/usr/share/acl2-8.5dfsg/books\" state)" \ ":q #-native-reloc (setq si::*multiply-stacks* 4) :q (in-package :acl2) " \ "#+(or sparc sparc64)(progn (si::sgc-on nil) (fmakunbound 'si::sgc-on))" \ "(save-exec \"saved_acl2.c\" \"Modified to produce final certification files\")" | HOME=$(pwd) ./saved_acl2 GCL (GNU Common Lisp) 2.6.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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 set to /tmp/ ; Hons-Note: grew SBITS to 9599716; 0.14 seconds, [unknown] bytes. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + ACL2 Version 8.5 + + built August 3, 2023 15:38:53. + + Copyright (C) 2022, Regents of the University of Texas. + + ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and + + you are welcome to redistribute it under certain conditions. For + + details, see the LICENSE file distributed with ACL2. + ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ System books directory "/build/1st/acl2-8.5dfsg/books/". Type :help for help. Type (quit) to quit completely out of ACL2. ACL2 !> ACL2 !> ACL2 !> Exiting the ACL2 read-eval-print loop. To re-enter, execute (LP). ACL2> :Q ACL2> #<"ACL2" package> ACL2>[GC for 52224 CONTIGUOUS-BLOCKS pages..(T=41).GC finished] [GC for 296 RELOCATABLE-BLOCKS pages..(T=33).GC finished] mv saved_acl2.c.gcl saved_acl2.c mv saved_acl2 saved_acl2.ori cp saved_acl2.c saved_acl2 EXCLUDED_PREFIXES="projects/x86isa/machine/instructions kestrel/x86 kestrel/axe" \ BUILDDIR="$(dirname $(pwd))" \ FINALDIR="/usr/share/acl2-8.5dfsg" \ HOME=$(pwd) \ GCL_MULTIPROCESS_MEMORY_POOL=t \ /usr/bin/make -j 15 -l 2.95 regression-fresh 2>&1 | tee debian/test.log & j=$! ; \ while sleep 1800; do echo Tick; done & k=$! ; \ wait $j ; kill $k make[1]: Entering directory '/build/1st/acl2-8.5dfsg' ACL2_WD is /build/1st/acl2-8.5dfsg ACL2 is /build/1st/acl2-8.5dfsg/saved_acl2 Linux ionos11-amd64 6.1.0-10-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.38-2 (2023-07-27) x86_64 GNU/Linux cd books ; /usr/bin/make -k ACL2=/build/1st/acl2-8.5dfsg/saved_acl2 moreclean make[2]: Entering directory '/build/1st/acl2-8.5dfsg/books' ACL2_SYSTEM_BOOKS is /build/1st/acl2-8.5dfsg/books Determining ACL2 features (for ACL2 = /build/1st/acl2-8.5dfsg/saved_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 := 1 ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_HAS_ACL2_DEVEL := ACL2_COMP_EXT := o ACL2_HOST_LISP := GCL OS_HAS_ABC := OS_HAS_GLUCOSE := OS_HAS_IPASIR := OS_HAS_SMTLINK := OS_HAS_STP := USE_QUICKLISP := 0 ACL2_USELESS_RUNES := -25 Done with features. Scanning for books... real 0m0.113s user 0m0.046s sys 0m0.069s Scanning for dependencies... real 4m59.333s user 2m44.740s sys 0m4.111s Done scanning. Reading book deps Makefile-deps created on Thu Aug 3 15:43:58 -12 2023 Excluding books that are CCL-only: [] Excluding non-GCL books: [acl2s/acl2s-sigs.cert acl2s/base-arithmetic.cert acl2s/base-lists.cert acl2s/base-theory.cert acl2s/cgen/base-cgen-rules.cert acl2s/cgen/callback.cert acl2s/cgen/cgen-search.cert acl2s/cgen/fixers-greedy.cert acl2s/cgen/incremental-search.cert acl2s/cgen/prove-cgen.cert acl2s/cgen/simple-search.cert acl2s/cgen/top.cert acl2s/cgen/with-timeout.cert acl2s/custom.cert acl2s/defdata-testing.cert acl2s/definec.cert acl2s/defintrange.cert acl2s/defunc.cert acl2s/doc.cert acl2s/match.cert acl2s/mode-acl2s-dependencies.cert acl2s/properties.cert acl2s/sorting/sorting.cert acl2s/top-doc.cert acl2s/top.cert build/test/dollar$test$$6.cert build/test/dollar$test$5.cert build/test/dollar$test4.cert build/test/dollar-test1$.cert build/test/dollar-test2.foo$.cert build/test/dollar-test3.$bar.cert build/test/top.cert centaur/lispfloat/ops-exec.cert centaur/lispfloat/top.cert demos/big-proof-talks/talk2-book.cert doc/top.cert models/y86/y86-basic/common/read-over-write-proofs.cert models/y86/y86-basic/common/read-over-write.cert models/y86/y86-basic/common/x86-state.cert models/y86/y86-basic/y86/y86-mem-init.cert models/y86/y86-basic/y86/y86.cert top.cert workshops/2015/jain-manolios/support/memory-controller/mem-array-cap-2.cert workshops/2015/jain-manolios/support/memory-controller/mem-array-cap-3.cert workshops/2015/jain-manolios/support/stack-machine/buffered-stack-cap-2.cert workshops/2015/jain-manolios/support/stack-machine/buffered-stack-cap-3.cert workshops/2015/jain-manolios/support/vectorizing-transformation/data-struct.cert workshops/2015/jain-manolios/support/vectorizing-transformation/op-semantics.cert workshops/2015/jain-manolios/support/vectorizing-transformation/scalar-vector.cert workshops/2022/walter-manolios/acl2s-utils/itest-cgen.cert workshops/2022/walter-manolios/acl2s-utils/itest-ithm.cert workshops/2022/walter-manolios/acl2s-utils/top.cert] 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: [] 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/1st/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 centaur/vl/bin directory Cleaning centaur/vl2014/bin directory if [ -d projects/milawa/ACL2 ] ; then \ cd projects/milawa/ACL2; /usr/bin/make clean ; \ fi make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/projects/milawa/ACL2' 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) Removing extra, explicitly temporary files. rm -rf /build/1st/acl2-8.5dfsg/books/build/Makefile-comp /build/1st/acl2-8.5dfsg/books/build/Makefile-comp-pre /build/1st/acl2-8.5dfsg/books/build/Makefile-deps /build/1st/acl2-8.5dfsg/books/build/Makefile-books /build/1st/acl2-8.5dfsg/books/build/Makefile-features /build/1st/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/1st/acl2-8.5dfsg/books/system/toothbrush' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush Note: For toothbrush, ACL2_DIR = /build/1st/acl2-8.5dfsg/. rm -f defined-syms.lsp rm -f success.txt cd tests ; /usr/bin/make clean make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test1' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2 rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test2' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/test-par' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' Updating dependencies in /build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification rm -f output.lsp success.txt tb-exec* make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests/dag-unification' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush/tests' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/system/toothbrush' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' rm -f \#*\# *~ rm -f scripts/interpret_sulfa_file /usr/bin/make PERL=perl SAT_SOLVER=/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA' for dir in scripts c-files books; do \ /usr/bin/make PERL=perl SAT_SOLVER=/build/1st/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/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/scripts' make[5]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/c-files' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[6]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat' make[6]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/clause-processors' make[6]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/sat-tests' make[6]: Entering directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books/bv-smt-solver' make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA/books' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/clause-processors/SULFA' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' Updating dependencies in /build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/translator' make[4]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2/examples/thacker' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/translators/l3-to-acl2' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/1999/multiplier' rm -f fmul.lisp fmul-star.lisp rm -f *.tem make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/1999/multiplier' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/input' make[3]: Entering directory '/build/1st/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/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/rtl' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/1st/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/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model' make[3]: Leaving directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model' make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books/projects/apply-model-2' make[3]: Leaving directory '/build/1st/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/1st/acl2-8.5dfsg/books' /usr/bin/make -k ACL2=/build/1st/acl2-8.5dfsg/saved_acl2 regression make[2]: Entering directory '/build/1st/acl2-8.5dfsg' ACL2_WD is /build/1st/acl2-8.5dfsg ACL2 is /build/1st/acl2-8.5dfsg/saved_acl2 Linux ionos11-amd64 6.1.0-10-amd64 #1 SMP PREEMPT_DYNAMIC Debian 6.1.38-2 (2023-07-27) x86_64 GNU/Linux cd books ; /usr/bin/make -k regression ACL2=/build/1st/acl2-8.5dfsg/saved_acl2 make[3]: Entering directory '/build/1st/acl2-8.5dfsg/books' ACL2_SYSTEM_BOOKS is /build/1st/acl2-8.5dfsg/books Determining ACL2 features (for ACL2 = /build/1st/acl2-8.5dfsg/saved_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 := 1 ACL2_HAS_PARALLEL := ACL2_HAS_REALS := ACL2_HAS_ACL2_DEVEL := ACL2_COMP_EXT := o ACL2_HOST_LISP := GCL OS_HAS_ABC := OS_HAS_GLUCOSE := OS_HAS_IPASIR := OS_HAS_SMTLINK := OS_HAS_STP := USE_QUICKLISP := 0 ACL2_USELESS_RUNES := -25 Done with features. Scanning for books... real 0m0.132s user 0m0.041s sys 0m0.076s Scanning for dependencies... real 4m41.078s user 2m48.754s sys 0m1.680s Done scanning. Reading book deps Makefile-deps created on Thu Aug 3 15:49:23 -12 2023 Excluding books that are CCL-only: [] Excluding non-GCL books: [acl2s/acl2s-sigs.cert acl2s/base-arithmetic.cert acl2s/base-lists.cert acl2s/base-theory.cert acl2s/cgen/base-cgen-rules.cert acl2s/cgen/callback.cert acl2s/cgen/cgen-search.cert acl2s/cgen/fixers-greedy.cert acl2s/cgen/incremental-search.cert acl2s/cgen/prove-cgen.cert acl2s/cgen/simple-search.cert acl2s/cgen/top.cert acl2s/cgen/with-timeout.cert acl2s/custom.cert acl2s/defdata-testing.cert acl2s/definec.cert acl2s/defintrange.cert acl2s/defunc.cert acl2s/doc.cert acl2s/match.cert acl2s/mode-acl2s-dependencies.cert acl2s/properties.cert acl2s/sorting/sorting.cert acl2s/top-doc.cert acl2s/top.cert build/test/dollar$test$$6.cert build/test/dollar$test$5.cert build/test/dollar$test4.cert build/test/dollar-test1$.cert build/test/dollar-test2.foo$.cert build/test/dollar-test3.$bar.cert build/test/top.cert centaur/lispfloat/ops-exec.cert centaur/lispfloat/top.cert demos/big-proof-talks/talk2-book.cert doc/top.cert models/y86/y86-basic/common/read-over-write-proofs.cert models/y86/y86-basic/common/read-over-write.cert models/y86/y86-basic/common/x86-state.cert models/y86/y86-basic/y86/y86-mem-init.cert models/y86/y86-basic/y86/y86.cert top.cert workshops/2015/jain-manolios/support/memory-controller/mem-array-cap-2.cert workshops/2015/jain-manolios/support/memory-controller/mem-array-cap-3.cert workshops/2015/jain-manolios/support/stack-machine/buffered-stack-cap-2.cert workshops/2015/jain-manolios/support/stack-machine/buffered-stack-cap-3.cert workshops/2015/jain-manolios/support/vectorizing-transformation/data-struct.cert workshops/2015/jain-manolios/support/vectorizing-transformation/op-semantics.cert workshops/2015/jain-manolios/support/vectorizing-transformation/scalar-vector.cert workshops/2022/walter-manolios/acl2s-utils/itest-cgen.cert workshops/2022/walter-manolios/acl2s-utils/itest-ithm.cert workshops/2022/walter-manolios/acl2s-utils/top.cert] 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: [] 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] Note: Skipping system/toothbrush/success.txt for host Lisp GCL. Making /build/1st/acl2-8.5dfsg/books/system/observation1-cw.cert on 03-Aug-2023 15:49:24.074 Built /build/1st/acl2-8.5dfsg/books/system/observation1-cw.cert (1.781s) at 03-Aug-2023 15:49:25.862 Making /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-definitions.cert on 03-Aug-2023 15:49:25.930 Built /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-definitions.cert (5.193s) at 03-Aug-2023 15:49:31.134 Making /build/1st/acl2-8.5dfsg/books/meta/term-defuns.cert on 03-Aug-2023 15:49:31.288 Built /build/1st/acl2-8.5dfsg/books/meta/term-defuns.cert (5.040s) at 03-Aug-2023 15:49:36.378 Making /build/1st/acl2-8.5dfsg/books/meta/pseudo-termp-lemmas.cert on 03-Aug-2023 15:49:36.548 Built /build/1st/acl2-8.5dfsg/books/meta/pseudo-termp-lemmas.cert (4.065s) at 03-Aug-2023 15:49:40.650 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/ground-zero.cert on 03-Aug-2023 15:49:40.807 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/ground-zero.cert (3.898s) at 03-Aug-2023 15:49:44.722 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/util.cert on 03-Aug-2023 15:49:44.887 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/util.cert (5.005s) at 03-Aug-2023 15:49:49.930 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/cat-def.cert on 03-Aug-2023 15:49:50.088 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/cat-def.cert (5.186s) at 03-Aug-2023 15:49:55.306 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/negative-syntaxp.cert on 03-Aug-2023 15:49:55.385 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/negative-syntaxp.cert (4.287s) at 03-Aug-2023 15:49:59.694 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/default-hint.cert on 03-Aug-2023 15:49:59.849 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/default-hint.cert (3.775s) at 03-Aug-2023 15:50:03.655 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/building-blocks.cert on 03-Aug-2023 15:50:03.764 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/building-blocks.cert (6.227s) at 03-Aug-2023 15:50:10.030 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/basic-arithmetic-helper.cert on 03-Aug-2023 15:50:10.145 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/basic-arithmetic-helper.cert (3.623s) at 03-Aug-2023 15:50:13.811 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/banner.cert on 03-Aug-2023 15:50:13.984 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/banner.cert (3.743s) at 03-Aug-2023 15:50:17.758 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/inverted-factor.cert on 03-Aug-2023 15:50:17.914 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/inverted-factor.cert (5.186s) at 03-Aug-2023 15:50:23.139 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/predicate.cert on 03-Aug-2023 15:50:23.236 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/predicate.cert (3.462s) at 03-Aug-2023 15:50:26.711 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/rewrite-theory.cert on 03-Aug-2023 15:50:26.872 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/rewrite-theory.cert (3.986s) at 03-Aug-2023 15:50:30.898 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logs.cert on 03-Aug-2023 15:50:30.973 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logs.cert (4.089s) at 03-Aug-2023 15:50:35.083 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/all-ones.cert on 03-Aug-2023 15:50:35.248 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/all-ones.cert (2.698s) at 03-Aug-2023 15:50:37.978 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logior1-proofs.cert on 03-Aug-2023 15:50:38.142 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logior1-proofs.cert (2.593s) at 03-Aug-2023 15:50:40.768 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/rom-helpers.cert on 03-Aug-2023 15:50:40.847 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/rom-helpers.cert (2.276s) at 03-Aug-2023 15:50:43.135 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/openers.cert on 03-Aug-2023 15:50:43.236 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/openers.cert (2.545s) at 03-Aug-2023 15:50:45.788 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/package-defs.cert on 03-Aug-2023 15:50:45.852 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/package-defs.cert (1.992s) at 03-Aug-2023 15:50:47.850 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/util.cert on 03-Aug-2023 15:50:47.938 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/util.cert (2.227s) at 03-Aug-2023 15:50:50.173 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/tool/wrapper.cert on 03-Aug-2023 15:50:50.248 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/kaufmann/support/tool/wrapper.cert (1.883s) at 03-Aug-2023 15:50:52.139 make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Updating dependencies in /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support Using ACL2=/build/1st/acl2-8.5dfsg/saved_acl2 make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/basis.cert on Thu Aug 3 15:50:52 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 10165 Aug 3 15:50 basis.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/total-order.cert on Thu Aug 3 15:50:55 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 1195 Aug 3 15:50 total-order.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/crit.cert on Thu Aug 3 15:50:57 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 7082 Aug 3 15:50 crit.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/sets.cert on Thu Aug 3 15:50:59 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 12595 Aug 3 15:51 sets.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/records.cert on Thu Aug 3 15:51:11 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 9898 Aug 3 15:51 records.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/mesi.cert on Thu Aug 3 15:51:24 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 15199 Aug 3 15:51 mesi.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support/success.txt on Thu Aug 3 15:51:28 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 49 Aug 3 15:52 success.txt make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/2004/sumners-ray/support' Making /build/1st/acl2-8.5dfsg/books/system/legal-variablep.cert on 03-Aug-2023 15:52:15.632 Built /build/1st/acl2-8.5dfsg/books/system/legal-variablep.cert (2.518s) at 03-Aug-2023 15:52:18.178 Making /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help.cert on 03-Aug-2023 15:52:18.283 Built /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help.cert (4.315s) at 03-Aug-2023 15:52:22.619 Making /build/1st/acl2-8.5dfsg/books/clause-processors/remove-hyp.cert on 03-Aug-2023 15:52:22.735 Built /build/1st/acl2-8.5dfsg/books/clause-processors/remove-hyp.cert (3.182s) at 03-Aug-2023 15:52:25.939 Making /build/1st/acl2-8.5dfsg/books/clause-processors/ev-find-rules.cert on 03-Aug-2023 15:52:26.042 Built /build/1st/acl2-8.5dfsg/books/clause-processors/ev-find-rules.cert (4.774s) at 03-Aug-2023 15:52:30.838 Making /build/1st/acl2-8.5dfsg/books/data-structures/no-duplicates.cert on 03-Aug-2023 15:52:30.914 Built /build/1st/acl2-8.5dfsg/books/data-structures/no-duplicates.cert (2.437s) at 03-Aug-2023 15:52:33.359 Making /build/1st/acl2-8.5dfsg/books/system/sublis-var.cert on 03-Aug-2023 15:52:33.522 Built /build/1st/acl2-8.5dfsg/books/system/sublis-var.cert (5.161s) at 03-Aug-2023 15:52:38.699 Making /build/1st/acl2-8.5dfsg/books/misc/definline.cert on 03-Aug-2023 15:52:38.875 Built /build/1st/acl2-8.5dfsg/books/misc/definline.cert (2.714s) at 03-Aug-2023 15:52:41.634 Making /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/portcullis.cert on 03-Aug-2023 15:52:41.761 Built /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/portcullis.cert (2.794s) at 03-Aug-2023 15:52:44.594 Making /build/1st/acl2-8.5dfsg/books/hacking/doc-section.cert on 03-Aug-2023 15:52:44.696 Built /build/1st/acl2-8.5dfsg/books/hacking/doc-section.cert (3.161s) at 03-Aug-2023 15:52:47.897 Making /build/1st/acl2-8.5dfsg/books/hacking/defstruct-parsing.cert on 03-Aug-2023 15:52:48.033 Built /build/1st/acl2-8.5dfsg/books/hacking/defstruct-parsing.cert (4.786s) at 03-Aug-2023 15:52:52.839 Making /build/1st/acl2-8.5dfsg/books/hacking/rewrite-code.cert on 03-Aug-2023 15:52:52.989 Built /build/1st/acl2-8.5dfsg/books/hacking/rewrite-code.cert (6.534s) at 03-Aug-2023 15:52:59.546 Making /build/1st/acl2-8.5dfsg/books/hacking/progn-bang-enh.cert on 03-Aug-2023 15:52:59.689 Built /build/1st/acl2-8.5dfsg/books/hacking/progn-bang-enh.cert (3.197s) at 03-Aug-2023 15:53:02.922 Making /build/1st/acl2-8.5dfsg/books/hacking/raw.cert on 03-Aug-2023 15:53:03.110 Built /build/1st/acl2-8.5dfsg/books/hacking/raw.cert (4.189s) at 03-Aug-2023 15:53:07.342 Making /build/1st/acl2-8.5dfsg/books/hacking/redefun.cert on 03-Aug-2023 15:53:07.457 Built /build/1st/acl2-8.5dfsg/books/hacking/redefun.cert (3.230s) at 03-Aug-2023 15:53:10.707 Making /build/1st/acl2-8.5dfsg/books/hacking/bridge.cert on 03-Aug-2023 15:53:10.828 Built /build/1st/acl2-8.5dfsg/books/hacking/bridge.cert (2.960s) at 03-Aug-2023 15:53:13.798 Making /build/1st/acl2-8.5dfsg/books/hacking/subsumption.cert on 03-Aug-2023 15:53:13.992 Built /build/1st/acl2-8.5dfsg/books/hacking/subsumption.cert (2.435s) at 03-Aug-2023 15:53:16.446 Making /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/symbol-fns.cert on 03-Aug-2023 15:53:16.537 Built /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/symbol-fns.cert (4.791s) at 03-Aug-2023 15:53:21.362 Making /build/1st/acl2-8.5dfsg/books/tools/defmacfun.cert on 03-Aug-2023 15:53:21.504 Built /build/1st/acl2-8.5dfsg/books/tools/defmacfun.cert (4.338s) at 03-Aug-2023 15:53:25.882 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/basic-arithmetic-helper.cert on 03-Aug-2023 15:53:26.054 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/basic-arithmetic-helper.cert (3.329s) at 03-Aug-2023 15:53:29.427 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/ground-zero.cert on 03-Aug-2023 15:53:29.564 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/ground-zero.cert (3.303s) at 03-Aug-2023 15:53:32.902 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/negative-syntaxp.cert on 03-Aug-2023 15:53:33.086 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/negative-syntaxp.cert (3.697s) at 03-Aug-2023 15:53:36.818 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/inverted-factor.cert on 03-Aug-2023 15:53:37.016 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/inverted-factor.cert (5.161s) at 03-Aug-2023 15:53:42.194 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/predicate.cert on 03-Aug-2023 15:53:42.314 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/predicate.cert (3.353s) at 03-Aug-2023 15:53:45.689 Making /build/1st/acl2-8.5dfsg/books/arithmetic/factorial.cert on 03-Aug-2023 15:53:45.784 Built /build/1st/acl2-8.5dfsg/books/arithmetic/factorial.cert (2.682s) at 03-Aug-2023 15:53:48.502 Making /build/1st/acl2-8.5dfsg/books/arithmetic/sumlist.cert on 03-Aug-2023 15:53:48.695 Built /build/1st/acl2-8.5dfsg/books/arithmetic/sumlist.cert (3.262s) at 03-Aug-2023 15:53:52.006 Making /build/1st/acl2-8.5dfsg/books/bdd/bdd-primitives.cert on 03-Aug-2023 15:53:52.188 Built /build/1st/acl2-8.5dfsg/books/bdd/bdd-primitives.cert (6.537s) at 03-Aug-2023 15:53:58.778 Making /build/1st/acl2-8.5dfsg/books/bdd/bool-ops.cert on 03-Aug-2023 15:53:58.953 Built /build/1st/acl2-8.5dfsg/books/bdd/bool-ops.cert (2.974s) at 03-Aug-2023 15:54:01.958 Making /build/1st/acl2-8.5dfsg/books/build/test/dollar-test1.cert on 03-Aug-2023 15:54:02.065 Built /build/1st/acl2-8.5dfsg/books/build/test/dollar-test1.cert (3.599s) at 03-Aug-2023 15:54:05.687 Making /build/1st/acl2-8.5dfsg/books/build/test/dollar-test2.foo.cert on 03-Aug-2023 15:54:05.903 Built /build/1st/acl2-8.5dfsg/books/build/test/dollar-test2.foo.cert (4.082s) at 03-Aug-2023 15:54:10.022 Making /build/1st/acl2-8.5dfsg/books/build/test/dollar-test3.bar.cert on 03-Aug-2023 15:54:10.222 Built /build/1st/acl2-8.5dfsg/books/build/test/dollar-test3.bar.cert (3.433s) at 03-Aug-2023 15:54:13.685 Making /build/1st/acl2-8.5dfsg/books/build/test/ifdeftest/thm-base.cert on 03-Aug-2023 15:54:13.852 Built /build/1st/acl2-8.5dfsg/books/build/test/ifdeftest/thm-base.cert (4.313s) at 03-Aug-2023 15:54:18.190 Making /build/1st/acl2-8.5dfsg/books/misc/gentle.cert on 03-Aug-2023 15:54:18.325 Built /build/1st/acl2-8.5dfsg/books/misc/gentle.cert (5.821s) at 03-Aug-2023 15:54:24.199 Making /build/1st/acl2-8.5dfsg/books/data-structures/list-defuns.cert on 03-Aug-2023 15:54:24.381 Built /build/1st/acl2-8.5dfsg/books/data-structures/list-defuns.cert (4.969s) at 03-Aug-2023 15:54:29.394 Making /build/1st/acl2-8.5dfsg/books/std/system/acceptable-rewrite-rule-p.cert on 03-Aug-2023 15:54:29.534 Built /build/1st/acl2-8.5dfsg/books/std/system/acceptable-rewrite-rule-p.cert (2.665s) at 03-Aug-2023 15:54:32.230 Making /build/1st/acl2-8.5dfsg/books/system/f-put-global.cert on 03-Aug-2023 15:54:32.348 Built /build/1st/acl2-8.5dfsg/books/system/f-put-global.cert (2.858s) at 03-Aug-2023 15:54:35.225 Making /build/1st/acl2-8.5dfsg/books/misc/computed-hint-rewrite.cert on 03-Aug-2023 15:54:35.350 Built /build/1st/acl2-8.5dfsg/books/misc/computed-hint-rewrite.cert (3.372s) at 03-Aug-2023 15:54:38.747 Making /build/1st/acl2-8.5dfsg/books/clause-processors/find-subterms.cert on 03-Aug-2023 15:54:38.850 Built /build/1st/acl2-8.5dfsg/books/clause-processors/find-subterms.cert (4.146s) at 03-Aug-2023 15:54:43.043 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/arrays.cert on 03-Aug-2023 15:54:43.228 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/arrays.cert (3.698s) at 03-Aug-2023 15:54:46.942 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/u32-listp.cert on 03-Aug-2023 15:54:47.136 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/u32-listp.cert (3.525s) at 03-Aug-2023 15:54:50.670 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/s32-listp.cert on 03-Aug-2023 15:54:50.852 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/s32-listp.cert (2.729s) at 03-Aug-2023 15:54:53.618 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/ap.cert on 03-Aug-2023 15:54:53.745 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/ap.cert (2.502s) at 03-Aug-2023 15:54:56.286 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/errmsg.cert on 03-Aug-2023 15:54:56.372 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/errmsg.cert (3.574s) at 03-Aug-2023 15:54:59.978 Making /build/1st/acl2-8.5dfsg/books/centaur/memoize/portcullis.cert on 03-Aug-2023 15:55:00.073 Built /build/1st/acl2-8.5dfsg/books/centaur/memoize/portcullis.cert (3.195s) at 03-Aug-2023 15:55:03.314 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/count-up.cert on 03-Aug-2023 15:55:03.509 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/count-up.cert (5.073s) at 03-Aug-2023 15:55:08.626 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/remove-assoc.cert on 03-Aug-2023 15:55:08.795 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/remove-assoc.cert (3.914s) at 03-Aug-2023 15:55:12.754 Making /build/1st/acl2-8.5dfsg/books/centaur/misc/stobj-swap.cert on 03-Aug-2023 15:55:12.915 Built /build/1st/acl2-8.5dfsg/books/centaur/misc/stobj-swap.cert (3.309s) at 03-Aug-2023 15:55:16.250 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/portcullis.cert on 03-Aug-2023 15:55:16.419 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/portcullis.cert (3.784s) at 03-Aug-2023 15:55:20.225 Making /build/1st/acl2-8.5dfsg/books/coi/nary/portcullis.cert on 03-Aug-2023 15:55:20.394 Built /build/1st/acl2-8.5dfsg/books/coi/nary/portcullis.cert (4.134s) at 03-Aug-2023 15:55:24.562 Making /build/1st/acl2-8.5dfsg/books/system/apply/apply-prim-support.cert on 03-Aug-2023 15:55:24.737 Built /build/1st/acl2-8.5dfsg/books/system/apply/apply-prim-support.cert (2.806s) at 03-Aug-2023 15:55:27.571 Making /build/1st/acl2-8.5dfsg/books/projects/apply/definductor.cert on 03-Aug-2023 15:55:27.683 Built /build/1st/acl2-8.5dfsg/books/projects/apply/definductor.cert (6.193s) at 03-Aug-2023 15:55:33.899 Making /build/1st/acl2-8.5dfsg/books/sorting/perm.cert on 03-Aug-2023 15:55:34.087 Built /build/1st/acl2-8.5dfsg/books/sorting/perm.cert (3.314s) at 03-Aug-2023 15:55:37.438 Making /build/1st/acl2-8.5dfsg/books/sorting/how-many.cert on 03-Aug-2023 15:55:37.578 Built /build/1st/acl2-8.5dfsg/books/sorting/how-many.cert (2.971s) at 03-Aug-2023 15:55:40.586 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/perm.cert on 03-Aug-2023 15:55:40.783 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/perm.cert (3.196s) at 03-Aug-2023 15:55:44.014 Making /build/1st/acl2-8.5dfsg/books/clause-processors/replace-impl.cert on 03-Aug-2023 15:55:44.129 Built /build/1st/acl2-8.5dfsg/books/clause-processors/replace-impl.cert (7.258s) at 03-Aug-2023 15:55:51.434 Making /build/1st/acl2-8.5dfsg/books/coi/adviser/portcullis.cert on 03-Aug-2023 15:55:51.565 Built /build/1st/acl2-8.5dfsg/books/coi/adviser/portcullis.cert (2.793s) at 03-Aug-2023 15:55:54.401 Making /build/1st/acl2-8.5dfsg/books/coi/syntax/portcullis.cert on 03-Aug-2023 15:55:54.534 Built /build/1st/acl2-8.5dfsg/books/coi/syntax/portcullis.cert (3.149s) at 03-Aug-2023 15:55:57.695 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/util.cert on 03-Aug-2023 15:55:57.779 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/util.cert (2.620s) at 03-Aug-2023 15:56:00.433 Making /build/1st/acl2-8.5dfsg/books/coi/defpun/defpun.cert on 03-Aug-2023 15:56:00.519 Built /build/1st/acl2-8.5dfsg/books/coi/defpun/defpun.cert (4.327s) at 03-Aug-2023 15:56:04.866 Making /build/1st/acl2-8.5dfsg/books/data-structures/memories/portcullis.cert on 03-Aug-2023 15:56:04.930 Built /build/1st/acl2-8.5dfsg/books/data-structures/memories/portcullis.cert (1.979s) at 03-Aug-2023 15:56:06.914 Making /build/1st/acl2-8.5dfsg/books/coi/defung/portcullis.cert on 03-Aug-2023 15:56:07.048 Built /build/1st/acl2-8.5dfsg/books/coi/defung/portcullis.cert (2.195s) at 03-Aug-2023 15:56:09.269 Making /build/1st/acl2-8.5dfsg/books/coi/quantification/portcullis.cert on 03-Aug-2023 15:56:09.361 Built /build/1st/acl2-8.5dfsg/books/coi/quantification/portcullis.cert (1.964s) at 03-Aug-2023 15:56:11.355 Making /build/1st/acl2-8.5dfsg/books/coi/super-ihs/symbols.cert on 03-Aug-2023 15:56:11.436 Built /build/1st/acl2-8.5dfsg/books/coi/super-ihs/symbols.cert (2.068s) at 03-Aug-2023 15:56:13.511 Making /build/1st/acl2-8.5dfsg/books/coi/super-ihs/min-max.cert on 03-Aug-2023 15:56:13.589 Built /build/1st/acl2-8.5dfsg/books/coi/super-ihs/min-max.cert (1.668s) at 03-Aug-2023 15:56:15.267 Making /build/1st/acl2-8.5dfsg/books/coi/nary/nth-rules.cert on 03-Aug-2023 15:56:15.353 Built /build/1st/acl2-8.5dfsg/books/coi/nary/nth-rules.cert (3.987s) at 03-Aug-2023 15:56:19.362 Making /build/1st/acl2-8.5dfsg/books/coi/nary/rewrite-equal-hint.cert on 03-Aug-2023 15:56:19.454 Built /build/1st/acl2-8.5dfsg/books/coi/nary/rewrite-equal-hint.cert (2.722s) at 03-Aug-2023 15:56:22.190 Making /build/1st/acl2-8.5dfsg/books/coi/nary/skip-rewrite.cert on 03-Aug-2023 15:56:22.281 Built /build/1st/acl2-8.5dfsg/books/coi/nary/skip-rewrite.cert (3.808s) at 03-Aug-2023 15:56:26.107 Making /build/1st/acl2-8.5dfsg/books/coi/pattern-hint/pattern-hint-xdoc.cert on 03-Aug-2023 15:56:26.174 Built /build/1st/acl2-8.5dfsg/books/coi/pattern-hint/pattern-hint-xdoc.cert (1.681s) at 03-Aug-2023 15:56:27.862 Making /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/symbol-fns-exports.cert on 03-Aug-2023 15:56:27.925 Built /build/1st/acl2-8.5dfsg/books/coi/symbol-fns/symbol-fns-exports.cert (2.475s) at 03-Aug-2023 15:56:30.406 Making /build/1st/acl2-8.5dfsg/books/coi/syntax/defbinding.cert on 03-Aug-2023 15:56:30.563 Built /build/1st/acl2-8.5dfsg/books/coi/syntax/defbinding.cert (4.239s) at 03-Aug-2023 15:56:34.842 Making /build/1st/acl2-8.5dfsg/books/coi/syntax/syn-pkg.cert on 03-Aug-2023 15:56:34.993 Built /build/1st/acl2-8.5dfsg/books/coi/syntax/syn-pkg.cert (4.302s) at 03-Aug-2023 15:56:39.330 Making /build/1st/acl2-8.5dfsg/books/coi/util/tau.cert on 03-Aug-2023 15:56:39.532 Built /build/1st/acl2-8.5dfsg/books/coi/util/tau.cert (4.996s) at 03-Aug-2023 15:56:44.566 Making /build/1st/acl2-8.5dfsg/books/data-structures/alist-defuns.cert on 03-Aug-2023 15:56:44.684 Built /build/1st/acl2-8.5dfsg/books/data-structures/alist-defuns.cert (8.978s) at 03-Aug-2023 15:56:53.686 Making /build/1st/acl2-8.5dfsg/books/data-structures/number-list-defuns.cert on 03-Aug-2023 15:56:53.867 Built /build/1st/acl2-8.5dfsg/books/data-structures/number-list-defuns.cert (4.016s) at 03-Aug-2023 15:56:57.922 Making /build/1st/acl2-8.5dfsg/books/defexec/find-path/graph/helpers.cert on 03-Aug-2023 15:56:58.082 Built /build/1st/acl2-8.5dfsg/books/defexec/find-path/graph/helpers.cert (3.766s) at 03-Aug-2023 15:57:01.886 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/misc/memos.cert on 03-Aug-2023 15:57:02.000 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/misc/memos.cert (5.138s) at 03-Aug-2023 15:57:07.166 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/misc/stobjsim.cert on 03-Aug-2023 15:57:07.323 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/misc/stobjsim.cert (7.523s) at 03-Aug-2023 15:57:14.859 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/total-order.cert on 03-Aug-2023 15:57:15.042 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/total-order.cert (4.436s) at 03-Aug-2023 15:57:19.514 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/nth-update-nth.cert on 03-Aug-2023 15:57:19.712 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/nth-update-nth.cert (4.714s) at 03-Aug-2023 15:57:24.454 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/permutations.cert on 03-Aug-2023 15:57:24.636 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/permutations.cert (6.233s) at 03-Aug-2023 15:57:30.898 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/records/inline.cert on 03-Aug-2023 15:57:31.084 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/records/inline.cert (6.574s) at 03-Aug-2023 15:57:37.702 Making /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-1.cert on 03-Aug-2023 15:57:37.874 Built /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-1.cert (19.234s) at 03-Aug-2023 15:57:57.170 Making /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-2.cert on 03-Aug-2023 15:57:57.354 Built /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-2.cert (9.409s) at 03-Aug-2023 15:58:06.814 Making /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-3.cert on 03-Aug-2023 15:58:06.970 Built /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-3.cert (9.268s) at 03-Aug-2023 15:58:16.294 Making /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-5.cert on 03-Aug-2023 15:58:16.397 Built /build/1st/acl2-8.5dfsg/books/demos/defabsstobj-example-5.cert (10.876s) at 03-Aug-2023 15:58:27.314 Making /build/1st/acl2-8.5dfsg/books/system/extend-pathname.cert on 03-Aug-2023 15:58:27.495 Built /build/1st/acl2-8.5dfsg/books/system/extend-pathname.cert (7.743s) at 03-Aug-2023 15:58:35.253 Making /build/1st/acl2-8.5dfsg/books/system/verified-termination-and-guards.cert on 03-Aug-2023 15:58:35.471 Built /build/1st/acl2-8.5dfsg/books/system/verified-termination-and-guards.cert (8.517s) at 03-Aug-2023 15:58:44.014 Making /build/1st/acl2-8.5dfsg/books/system/pseudo-termp-lemmas.cert on 03-Aug-2023 15:58:44.310 Built /build/1st/acl2-8.5dfsg/books/system/pseudo-termp-lemmas.cert (3.942s) at 03-Aug-2023 15:58:48.262 Making /build/1st/acl2-8.5dfsg/books/system/convert-normalized-term-to-pairs.cert on 03-Aug-2023 15:58:48.461 Built /build/1st/acl2-8.5dfsg/books/system/convert-normalized-term-to-pairs.cert (15.398s) at 03-Aug-2023 15:59:03.900 Making /build/1st/acl2-8.5dfsg/books/system/merge-sort-term-order.cert on 03-Aug-2023 15:59:04.091 Built /build/1st/acl2-8.5dfsg/books/system/merge-sort-term-order.cert (6.471s) at 03-Aug-2023 15:59:10.598 Making /build/1st/acl2-8.5dfsg/books/system/merge-sort-symbol-lt.cert on 03-Aug-2023 15:59:10.783 Built /build/1st/acl2-8.5dfsg/books/system/merge-sort-symbol-lt.cert (5.394s) at 03-Aug-2023 15:59:16.214 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/symbol-alistp.cert on 03-Aug-2023 15:59:16.408 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/symbol-alistp.cert (5.365s) at 03-Aug-2023 15:59:21.823 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keyword-value-listp.cert on 03-Aug-2023 15:59:22.006 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keyword-value-listp.cert (4.724s) at 03-Aug-2023 15:59:26.759 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lookup-keyword.cert on 03-Aug-2023 15:59:26.933 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lookup-keyword.cert (4.786s) at 03-Aug-2023 15:59:31.743 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/assoc-keyword.cert on 03-Aug-2023 15:59:31.919 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/assoc-keyword.cert (4.734s) at 03-Aug-2023 15:59:36.706 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/map-symbol-name.cert on 03-Aug-2023 15:59:36.860 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/map-symbol-name.cert (4.599s) at 03-Aug-2023 15:59:41.510 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/member-symbol-name.cert on 03-Aug-2023 15:59:41.687 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/member-symbol-name.cert (4.661s) at 03-Aug-2023 15:59:46.394 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/chk-length-and-keys.cert on 03-Aug-2023 15:59:46.651 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/chk-length-and-keys.cert (4.383s) at 03-Aug-2023 15:59:51.075 Making /build/1st/acl2-8.5dfsg/books/system/case-match.cert on 03-Aug-2023 15:59:51.232 Built /build/1st/acl2-8.5dfsg/books/system/case-match.cert (8.826s) at 03-Aug-2023 16:00:00.098 Making /build/1st/acl2-8.5dfsg/books/system/fmx-cw.cert on 03-Aug-2023 16:00:00.336 Built /build/1st/acl2-8.5dfsg/books/system/fmx-cw.cert (20.911s) at 03-Aug-2023 16:00:21.294 Making /build/1st/acl2-8.5dfsg/books/system/all-fnnames.cert on 03-Aug-2023 16:00:21.479 Built /build/1st/acl2-8.5dfsg/books/system/all-fnnames.cert (4.566s) at 03-Aug-2023 16:00:26.071 Making /build/1st/acl2-8.5dfsg/books/system/defstobj.cert on 03-Aug-2023 16:00:26.319 Built /build/1st/acl2-8.5dfsg/books/system/defstobj.cert (5.627s) at 03-Aug-2023 16:00:32.002 Making /build/1st/acl2-8.5dfsg/books/std/system/invariant-risk.cert on 03-Aug-2023 16:00:32.179 Built /build/1st/acl2-8.5dfsg/books/std/system/invariant-risk.cert (5.904s) at 03-Aug-2023 16:00:38.123 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/tables.cert on 03-Aug-2023 16:00:38.307 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/tables.cert (4.466s) at 03-Aug-2023 16:00:42.822 Making /build/1st/acl2-8.5dfsg/books/demos/list-equality-from-nth.cert on 03-Aug-2023 16:00:43.013 Built /build/1st/acl2-8.5dfsg/books/demos/list-equality-from-nth.cert (4.693s) at 03-Aug-2023 16:00:47.742 Making /build/1st/acl2-8.5dfsg/books/demos/list-theory.cert on 03-Aug-2023 16:00:47.908 Built /build/1st/acl2-8.5dfsg/books/demos/list-theory.cert (4.635s) at 03-Aug-2023 16:00:52.602 Making /build/1st/acl2-8.5dfsg/books/demos/marktoberdorf-08/perm.cert on 03-Aug-2023 16:00:52.873 Built /build/1st/acl2-8.5dfsg/books/demos/marktoberdorf-08/perm.cert (5.830s) at 03-Aug-2023 16:00:58.738 Making /build/1st/acl2-8.5dfsg/books/demos/meta-wf-guarantee-example.cert on 03-Aug-2023 16:00:58.925 Built /build/1st/acl2-8.5dfsg/books/demos/meta-wf-guarantee-example.cert (20.782s) at 03-Aug-2023 16:01:19.757 Making /build/1st/acl2-8.5dfsg/books/misc/defun-plus.cert on 03-Aug-2023 16:01:19.959 Built /build/1st/acl2-8.5dfsg/books/misc/defun-plus.cert (9.190s) at 03-Aug-2023 16:01:29.199 Making /build/1st/acl2-8.5dfsg/books/demos/modeling/nested-stobj-toy-isa.cert on 03-Aug-2023 16:01:29.380 Built /build/1st/acl2-8.5dfsg/books/demos/modeling/nested-stobj-toy-isa.cert (39.392s) at 03-Aug-2023 16:02:08.843 Making /build/1st/acl2-8.5dfsg/books/demos/nth-update-nth-meta-extract.cert on 03-Aug-2023 16:02:09.112 Built /build/1st/acl2-8.5dfsg/books/demos/nth-update-nth-meta-extract.cert (30.213s) at 03-Aug-2023 16:02:39.366 Making /build/1st/acl2-8.5dfsg/books/make-event/embeddable-event-forms.cert on 03-Aug-2023 16:02:39.647 Built /build/1st/acl2-8.5dfsg/books/make-event/embeddable-event-forms.cert (5.462s) at 03-Aug-2023 16:02:45.206 Making /build/1st/acl2-8.5dfsg/books/demos/parallel/matrix-multiplication-setup.cert on 03-Aug-2023 16:02:45.343 Built /build/1st/acl2-8.5dfsg/books/demos/parallel/matrix-multiplication-setup.cert (13.384s) at 03-Aug-2023 16:02:58.735 Making /build/1st/acl2-8.5dfsg/books/demos/proofs/linear.cert on 03-Aug-2023 16:02:58.891 Built /build/1st/acl2-8.5dfsg/books/demos/proofs/linear.cert (6.787s) at 03-Aug-2023 16:03:05.711 Making /build/1st/acl2-8.5dfsg/books/demos/proofs/type-prescription.cert on 03-Aug-2023 16:03:05.898 Built /build/1st/acl2-8.5dfsg/books/demos/proofs/type-prescription.cert (6.118s) at 03-Aug-2023 16:03:12.050 Making /build/1st/acl2-8.5dfsg/books/demos/register-invariant-risk-support.cert on 03-Aug-2023 16:03:12.361 Built /build/1st/acl2-8.5dfsg/books/demos/register-invariant-risk-support.cert (6.750s) at 03-Aug-2023 16:03:19.150 Making /build/1st/acl2-8.5dfsg/books/sorting/orderedp.cert on 03-Aug-2023 16:03:19.332 Built /build/1st/acl2-8.5dfsg/books/sorting/orderedp.cert (5.266s) at 03-Aug-2023 16:03:24.634 Making /build/1st/acl2-8.5dfsg/books/demos/stobj-equality-from-fields.cert on 03-Aug-2023 16:03:24.809 Built /build/1st/acl2-8.5dfsg/books/demos/stobj-equality-from-fields.cert (9.015s) at 03-Aug-2023 16:03:33.852 Making /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert on 03-Aug-2023 16:03:34.129 Built /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/equivalence-of-two-functions/kaufmann.cert (6.398s) at 03-Aug-2023 16:03:40.554 Making /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert on 03-Aug-2023 16:03:40.827 Built /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4-athena.cert (7.894s) at 03-Aug-2023 16:03:48.754 Making /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4.cert on 03-Aug-2023 16:03:48.945 Built /build/1st/acl2-8.5dfsg/books/demos/tutorial-problems/introductory-challenge-problem-4.cert (7.217s) at 03-Aug-2023 16:03:56.226 Making /build/1st/acl2-8.5dfsg/books/projects/sat/dimacs-reader/portcullis.cert on 03-Aug-2023 16:03:56.418 Built /build/1st/acl2-8.5dfsg/books/projects/sat/dimacs-reader/portcullis.cert (5.543s) at 03-Aug-2023 16:04:02.007 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/portcullis.cert on 03-Aug-2023 16:04:02.197 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/portcullis.cert (5.071s) at 03-Aug-2023 16:04:07.306 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/portcullis.cert on 03-Aug-2023 16:04:07.433 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/portcullis.cert (4.809s) at 03-Aug-2023 16:04:12.258 Making /build/1st/acl2-8.5dfsg/books/projects/farray/portcullis.cert on 03-Aug-2023 16:04:12.440 Built /build/1st/acl2-8.5dfsg/books/projects/farray/portcullis.cert (5.166s) at 03-Aug-2023 16:04:17.663 Making /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/portcullis.cert on 03-Aug-2023 16:04:17.853 Built /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/portcullis.cert (5.540s) at 03-Aug-2023 16:04:23.430 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/keccak/portcullis.cert on 03-Aug-2023 16:04:23.613 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/keccak/portcullis.cert (4.490s) at 03-Aug-2023 16:04:28.154 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/mimc/portcullis.cert on 03-Aug-2023 16:04:28.332 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/mimc/portcullis.cert (4.878s) at 03-Aug-2023 16:04:33.254 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/portcullis.cert on 03-Aug-2023 16:04:33.443 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/portcullis.cert (4.586s) at 03-Aug-2023 16:04:38.075 Making /build/1st/acl2-8.5dfsg/books/finite-set-theory/total-ordering.cert on 03-Aug-2023 16:04:38.351 Built /build/1st/acl2-8.5dfsg/books/finite-set-theory/total-ordering.cert (8.962s) at 03-Aug-2023 16:04:47.354 Making /build/1st/acl2-8.5dfsg/books/hacking/dynamic-make-event.cert on 03-Aug-2023 16:04:47.636 Built /build/1st/acl2-8.5dfsg/books/hacking/dynamic-make-event.cert (5.678s) at 03-Aug-2023 16:04:53.430 Making /build/1st/acl2-8.5dfsg/books/misc/evalable-printing.cert on 03-Aug-2023 16:04:53.635 Built /build/1st/acl2-8.5dfsg/books/misc/evalable-printing.cert (5.608s) at 03-Aug-2023 16:04:59.334 Making /build/1st/acl2-8.5dfsg/books/hints/huet-lang-algorithm.cert on 03-Aug-2023 16:04:59.512 Built /build/1st/acl2-8.5dfsg/books/hints/huet-lang-algorithm.cert (36.092s) at 03-Aug-2023 16:05:35.750 Making /build/1st/acl2-8.5dfsg/books/hints/use-pkg.cert on 03-Aug-2023 16:05:35.948 Built /build/1st/acl2-8.5dfsg/books/hints/use-pkg.cert (11.191s) at 03-Aug-2023 16:05:47.183 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/cons.cert on 03-Aug-2023 16:05:47.369 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/cons.cert (8.010s) at 03-Aug-2023 16:05:55.426 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/take.cert on 03-Aug-2023 16:05:55.621 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/take.cert (7.596s) at 03-Aug-2023 16:06:03.271 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/cdr.cert on 03-Aug-2023 16:06:03.539 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/cdr.cert (4.274s) at 03-Aug-2023 16:06:07.855 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/len.cert on 03-Aug-2023 16:06:08.047 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/len.cert (5.751s) at 03-Aug-2023 16:06:13.842 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/nth.cert on 03-Aug-2023 16:06:13.970 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/nth.cert (5.464s) at 03-Aug-2023 16:06:19.482 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/true-list-fix.cert on 03-Aug-2023 16:06:19.671 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/true-list-fix.cert (5.376s) at 03-Aug-2023 16:06:25.087 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/member-equal.cert on 03-Aug-2023 16:06:25.268 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/member-equal.cert (6.331s) at 03-Aug-2023 16:06:31.651 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove1-equal.cert on 03-Aug-2023 16:06:31.837 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove1-equal.cert (6.833s) at 03-Aug-2023 16:06:38.715 Making /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/bounded-nat-alists.cert on 03-Aug-2023 16:06:38.897 Built /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/bounded-nat-alists.cert (6.073s) at 03-Aug-2023 16:06:45.018 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/smaller-termp.cert on 03-Aug-2023 16:06:45.357 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/smaller-termp.cert (7.722s) at 03-Aug-2023 16:06:53.142 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acons-fast.cert on 03-Aug-2023 16:06:53.341 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acons-fast.cert (3.498s) at 03-Aug-2023 16:06:56.866 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/assoc-equal.cert on 03-Aug-2023 16:06:57.040 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/assoc-equal.cert (5.629s) at 03-Aug-2023 16:07:02.727 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus.cert on 03-Aug-2023 16:07:02.910 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus.cert (3.466s) at 03-Aug-2023 16:07:06.402 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/minus.cert on 03-Aug-2023 16:07:06.512 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/minus.cert (3.521s) at 03-Aug-2023 16:07:10.041 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/less-than.cert on 03-Aug-2023 16:07:10.141 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/less-than.cert (6.170s) at 03-Aug-2023 16:07:16.327 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/complex.cert on 03-Aug-2023 16:07:16.425 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/complex.cert (7.537s) at 03-Aug-2023 16:07:23.979 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus-and-minus.cert on 03-Aug-2023 16:07:24.230 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus-and-minus.cert (7.254s) at 03-Aug-2023 16:07:31.534 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/equal-of-booleans.cert on 03-Aug-2023 16:07:31.741 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/equal-of-booleans.cert (5.554s) at 03-Aug-2023 16:07:37.346 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/symbol-term-alistp.cert on 03-Aug-2023 16:07:37.652 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/symbol-term-alistp.cert (6.459s) at 03-Aug-2023 16:07:44.186 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/firstn-def.cert on 03-Aug-2023 16:07:44.417 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/firstn-def.cert (6.083s) at 03-Aug-2023 16:07:50.558 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subrange-def.cert on 03-Aug-2023 16:07:50.741 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subrange-def.cert (7.798s) at 03-Aug-2023 16:07:58.602 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp-def.cert on 03-Aug-2023 16:07:58.828 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp-def.cert (7.891s) at 03-Aug-2023 16:08:06.775 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm-def.cert on 03-Aug-2023 16:08:06.948 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm-def.cert (4.851s) at 03-Aug-2023 16:08:11.835 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsetp-equal.cert on 03-Aug-2023 16:08:11.994 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsetp-equal.cert (8.089s) at 03-Aug-2023 16:08:20.098 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/union-equal.cert on 03-Aug-2023 16:08:20.539 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/union-equal.cert (6.097s) at 03-Aug-2023 16:08:26.678 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/set-difference-equal.cert on 03-Aug-2023 16:08:26.852 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/set-difference-equal.cert (7.296s) at 03-Aug-2023 16:08:34.182 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/coerce.cert on 03-Aug-2023 16:08:34.365 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/coerce.cert (5.050s) at 03-Aug-2023 16:08:39.482 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/digit-to-char.cert on 03-Aug-2023 16:08:39.604 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/digit-to-char.cert (9.210s) at 03-Aug-2023 16:08:48.842 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/character-listp.cert on 03-Aug-2023 16:08:49.113 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/character-listp.cert (8.802s) at 03-Aug-2023 16:08:57.947 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-equal.cert on 03-Aug-2023 16:08:58.146 Tick Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-equal.cert (7.131s) at 03-Aug-2023 16:09:05.338 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-or.cert on 03-Aug-2023 16:09:05.528 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-or.cert (6.385s) at 03-Aug-2023 16:09:11.946 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-and.cert on 03-Aug-2023 16:09:12.132 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-and.cert (4.730s) at 03-Aug-2023 16:09:16.910 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp.cert on 03-Aug-2023 16:09:17.089 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp.cert (8.884s) at 03-Aug-2023 16:09:26.047 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/pairlis-dollar.cert on 03-Aug-2023 16:09:26.236 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/pairlis-dollar.cert (6.558s) at 03-Aug-2023 16:09:32.850 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/symbol-listp.cert on 03-Aug-2023 16:09:33.020 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/symbol-listp.cert (6.656s) at 03-Aug-2023 16:09:39.710 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/butlast.cert on 03-Aug-2023 16:09:39.910 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/butlast.cert (5.538s) at 03-Aug-2023 16:09:45.494 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-keyword-args.cert on 03-Aug-2023 16:09:45.604 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-keyword-args.cert (8.572s) at 03-Aug-2023 16:09:54.190 Making /build/1st/acl2-8.5dfsg/books/kestrel/algorithm-theories/generic-tail-rec.cert on 03-Aug-2023 16:09:54.320 Built /build/1st/acl2-8.5dfsg/books/kestrel/algorithm-theories/generic-tail-rec.cert (9.752s) at 03-Aug-2023 16:10:04.179 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/acons-unique.cert on 03-Aug-2023 16:10:04.345 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/acons-unique.cert (7.906s) at 03-Aug-2023 16:10:12.266 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/acons.cert on 03-Aug-2023 16:10:12.570 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/acons.cert (5.962s) at 03-Aug-2023 16:10:18.570 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/alistp.cert on 03-Aug-2023 16:10:18.844 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/alistp.cert (6.250s) at 03-Aug-2023 16:10:25.143 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/alists-equiv-on.cert on 03-Aug-2023 16:10:25.340 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/alists-equiv-on.cert (5.809s) at 03-Aug-2023 16:10:31.174 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/clear-key.cert on 03-Aug-2023 16:10:31.306 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/clear-key.cert (5.448s) at 03-Aug-2023 16:10:36.762 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/rassoc-equal.cert on 03-Aug-2023 16:10:36.952 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/rassoc-equal.cert (5.626s) at 03-Aug-2023 16:10:42.586 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cdrs.cert on 03-Aug-2023 16:10:42.886 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cdrs.cert (5.953s) at 03-Aug-2023 16:10:48.886 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/keep-pairs.cert on 03-Aug-2023 16:10:49.065 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/keep-pairs.cert (5.549s) at 03-Aug-2023 16:10:54.654 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal.cert on 03-Aug-2023 16:10:55.048 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal.cert (7.844s) at 03-Aug-2023 16:11:02.975 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/uniquify-alist-eq.cert on 03-Aug-2023 16:11:03.194 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/uniquify-alist-eq.cert (8.653s) at 03-Aug-2023 16:11:11.926 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/maybe-replace-var.cert on 03-Aug-2023 16:11:12.284 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/maybe-replace-var.cert (6.503s) at 03-Aug-2023 16:11:18.834 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/quote.cert on 03-Aug-2023 16:11:19.203 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/quote.cert (5.669s) at 03-Aug-2023 16:11:24.899 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/strings.cert on 03-Aug-2023 16:11:24.994 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/strings.cert (6.870s) at 03-Aug-2023 16:11:31.911 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/downcase.cert on 03-Aug-2023 16:11:32.079 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/downcase.cert (6.313s) at 03-Aug-2023 16:11:38.450 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-cons-nest.cert on 03-Aug-2023 16:11:38.786 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-cons-nest.cert (5.514s) at 03-Aug-2023 16:11:44.358 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/forms.cert on 03-Aug-2023 16:11:44.533 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/forms.cert (4.710s) at 03-Aug-2023 16:11:49.274 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/append-all.cert on 03-Aug-2023 16:11:49.490 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/append-all.cert (4.907s) at 03-Aug-2023 16:11:54.438 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/true-list-listp.cert on 03-Aug-2023 16:11:54.665 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/true-list-listp.cert (4.195s) at 03-Aug-2023 16:11:58.911 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-forms.cert on 03-Aug-2023 16:11:59.103 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-forms.cert (4.790s) at 03-Aug-2023 16:12:03.926 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defthm-forms.cert on 03-Aug-2023 16:12:04.173 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defthm-forms.cert (5.545s) at 03-Aug-2023 16:12:09.762 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/wrap-all.cert on 03-Aug-2023 16:12:09.965 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/wrap-all.cert (5.163s) at 03-Aug-2023 16:12:15.166 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/messages2.cert on 03-Aug-2023 16:12:15.446 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/messages2.cert (4.170s) at 03-Aug-2023 16:12:19.654 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/msgp.cert on 03-Aug-2023 16:12:19.796 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/msgp.cert (5.167s) at 03-Aug-2023 16:12:24.978 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/translate.cert on 03-Aug-2023 16:12:25.265 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/translate.cert (7.097s) at 03-Aug-2023 16:12:32.406 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/legal-variable-listp.cert on 03-Aug-2023 16:12:32.562 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/legal-variable-listp.cert (9.979s) at 03-Aug-2023 16:12:42.615 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/logic-termp.cert on 03-Aug-2023 16:12:42.757 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/logic-termp.cert (6.857s) at 03-Aug-2023 16:12:49.651 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/pseudo-term-listp.cert on 03-Aug-2023 16:12:49.973 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/pseudo-term-listp.cert (8.720s) at 03-Aug-2023 16:12:58.739 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/bool-fix.cert on 03-Aug-2023 16:12:58.944 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/bool-fix.cert (10.931s) at 03-Aug-2023 16:13:09.958 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/myif-def.cert on 03-Aug-2023 16:13:10.233 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/myif-def.cert (8.570s) at 03-Aug-2023 16:13:18.890 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pseudo-termp.cert on 03-Aug-2023 16:13:19.069 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pseudo-termp.cert (9.172s) at 03-Aug-2023 16:13:28.287 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/arities-okp.cert on 03-Aug-2023 16:13:28.512 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/arities-okp.cert (6.538s) at 03-Aug-2023 16:13:35.086 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-function-calls-on-formals.cert on 03-Aug-2023 16:13:35.296 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-function-calls-on-formals.cert (5.810s) at 03-Aug-2023 16:13:41.134 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/negate-term.cert on 03-Aug-2023 16:13:41.349 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/negate-term.cert (6.395s) at 03-Aug-2023 16:13:47.814 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/make-if-term.cert on 03-Aug-2023 16:13:48.020 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/make-if-term.cert (11.550s) at 03-Aug-2023 16:13:59.599 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/disjoin.cert on 03-Aug-2023 16:13:59.860 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/disjoin.cert (11.419s) at 03-Aug-2023 16:14:11.326 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acl2-count.cert on 03-Aug-2023 16:14:11.572 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acl2-count.cert (6.860s) at 03-Aug-2023 16:14:18.478 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/pseudo-term-list-listp.cert on 03-Aug-2023 16:14:18.759 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/pseudo-term-list-listp.cert (6.470s) at 03-Aug-2023 16:14:25.278 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acl2-defaults-table.cert on 03-Aug-2023 16:14:25.548 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/acl2-defaults-table.cert (5.855s) at 03-Aug-2023 16:14:31.467 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lets.cert on 03-Aug-2023 16:14:31.759 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lets.cert (5.934s) at 03-Aug-2023 16:14:37.722 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lambdas.cert on 03-Aug-2023 16:14:37.907 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/lambdas.cert (5.156s) at 03-Aug-2023 16:14:43.103 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/expr-calls-fn.cert on 03-Aug-2023 16:14:43.280 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/expr-calls-fn.cert (4.453s) at 03-Aug-2023 16:14:47.787 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/lambda-free-termp.cert on 03-Aug-2023 16:14:48.008 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/lambda-free-termp.cert (5.769s) at 03-Aug-2023 16:14:53.818 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/add-to-set-equal.cert on 03-Aug-2023 16:14:54.020 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/add-to-set-equal.cert (5.513s) at 03-Aug-2023 16:14:59.570 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/last.cert on 03-Aug-2023 16:14:59.793 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/last.cert (4.302s) at 03-Aug-2023 16:15:04.123 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/symbol-has-propsp.cert on 03-Aug-2023 16:15:04.265 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/symbol-has-propsp.cert (5.971s) at 03-Aug-2023 16:15:10.274 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-dollar.cert on 03-Aug-2023 16:15:10.433 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-dollar.cert (5.945s) at 03-Aug-2023 16:15:16.419 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/add-not-normalized-suffixes.cert on 03-Aug-2023 16:15:16.613 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/add-not-normalized-suffixes.cert (4.278s) at 03-Aug-2023 16:15:20.915 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-executable.cert on 03-Aug-2023 16:15:21.108 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-executable.cert (9.077s) at 03-Aug-2023 16:15:30.206 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/imported-symbols.cert on 03-Aug-2023 16:15:30.373 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/imported-symbols.cert (4.860s) at 03-Aug-2023 16:15:35.278 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep-equal-def.cert on 03-Aug-2023 16:15:35.446 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep-equal-def.cert (4.323s) at 03-Aug-2023 16:15:39.798 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/conjunctions.cert on 03-Aug-2023 16:15:40.082 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/conjunctions.cert (5.421s) at 03-Aug-2023 16:15:45.554 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/negate-form.cert on 03-Aug-2023 16:15:45.766 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/negate-form.cert (5.274s) at 03-Aug-2023 16:15:51.079 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/remove-duplicates-equal-dollar.cert on 03-Aug-2023 16:15:51.175 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/remove-duplicates-equal-dollar.cert (5.372s) at 03-Aug-2023 16:15:56.574 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/dont-remove-trivial-equivalences.cert on 03-Aug-2023 16:15:56.862 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/dont-remove-trivial-equivalences.cert (4.675s) at 03-Aug-2023 16:16:01.570 Making /build/1st/acl2-8.5dfsg/books/workshops/2017/coglio-kaufmann-smith/support/make-executable.cert on 03-Aug-2023 16:16:01.753 Built /build/1st/acl2-8.5dfsg/books/workshops/2017/coglio-kaufmann-smith/support/make-executable.cert (8.946s) at 03-Aug-2023 16:16:10.739 Making /build/1st/acl2-8.5dfsg/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert on 03-Aug-2023 16:16:10.928 Built /build/1st/acl2-8.5dfsg/books/workshops/2017/coglio-kaufmann-smith/support/transformation-table.cert (5.382s) at 03-Aug-2023 16:16:16.339 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/syntactic-lists.cert on 03-Aug-2023 16:16:16.626 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/syntactic-lists.cert (7.765s) at 03-Aug-2023 16:16:24.434 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/num-return-values-of-fn.cert on 03-Aug-2023 16:16:24.614 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/num-return-values-of-fn.cert (6.485s) at 03-Aug-2023 16:16:31.138 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/types.cert on 03-Aug-2023 16:16:31.314 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/types.cert (5.289s) at 03-Aug-2023 16:16:36.650 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/dargp.cert on 03-Aug-2023 16:16:36.867 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/dargp.cert (5.929s) at 03-Aug-2023 16:16:42.846 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-list-fast.cert on 03-Aug-2023 16:16:43.049 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-list-fast.cert (6.671s) at 03-Aug-2023 16:16:49.766 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp.cert on 03-Aug-2023 16:16:50.047 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp.cert (5.492s) at 03-Aug-2023 16:16:55.582 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/printing.cert on 03-Aug-2023 16:16:55.690 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/printing.cert (4.356s) at 03-Aug-2023 16:17:00.087 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mv-nth.cert on 03-Aug-2023 16:17:00.247 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mv-nth.cert (4.370s) at 03-Aug-2023 16:17:04.650 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/rational-listp.cert on 03-Aug-2023 16:17:04.826 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/rational-listp.cert (5.385s) at 03-Aug-2023 16:17:10.251 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/keep-atoms.cert on 03-Aug-2023 16:17:10.528 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/keep-atoms.cert (5.490s) at 03-Aug-2023 16:17:16.058 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/merge-sort-symbol-less-than.cert on 03-Aug-2023 16:17:16.351 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/merge-sort-symbol-less-than.cert (4.894s) at 03-Aug-2023 16:17:21.286 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/erp.cert on 03-Aug-2023 16:17:21.485 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/erp.cert (5.262s) at 03-Aug-2023 16:17:26.787 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/all-quotep.cert on 03-Aug-2023 16:17:26.974 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/all-quotep.cert (5.811s) at 03-Aug-2023 16:17:32.843 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/natp.cert on 03-Aug-2023 16:17:33.169 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/natp.cert (6.710s) at 03-Aug-2023 16:17:39.918 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/shorter-list.cert on 03-Aug-2023 16:17:40.208 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/shorter-list.cert (6.750s) at 03-Aug-2023 16:17:46.998 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/unguarded-primitives.cert on 03-Aug-2023 16:17:47.212 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/unguarded-primitives.cert (7.348s) at 03-Aug-2023 16:17:54.598 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/unsigned-byte-listp-def.cert on 03-Aug-2023 16:17:54.827 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/unsigned-byte-listp-def.cert (4.963s) at 03-Aug-2023 16:17:59.823 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus-and-times.cert on 03-Aug-2023 16:18:00.005 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/plus-and-times.cert (5.506s) at 03-Aug-2023 16:18:05.555 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolxor.cert on 03-Aug-2023 16:18:05.729 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolxor.cert (6.857s) at 03-Aug-2023 16:18:12.626 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/iff.cert on 03-Aug-2023 16:18:12.850 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/iff.cert (5.022s) at 03-Aug-2023 16:18:17.906 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/not.cert on 03-Aug-2023 16:18:18.143 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/not.cert (5.423s) at 03-Aug-2023 16:18:23.598 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv/unsigned-byte-p-forced.cert on 03-Aug-2023 16:18:23.772 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv/unsigned-byte-p-forced.cert (6.522s) at 03-Aug-2023 16:18:30.330 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/min.cert on 03-Aug-2023 16:18:30.489 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/min.cert (5.345s) at 03-Aug-2023 16:18:35.878 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/max.cert on 03-Aug-2023 16:18:36.164 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/max.cert (5.627s) at 03-Aug-2023 16:18:41.823 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/tries.cert on 03-Aug-2023 16:18:42.072 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/tries.cert (5.233s) at 03-Aug-2023 16:18:47.346 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/print-levels.cert on 03-Aug-2023 16:18:47.526 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/print-levels.cert (5.498s) at 03-Aug-2023 16:18:53.054 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/axe-syntax.cert on 03-Aug-2023 16:18:53.223 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/axe-syntax.cert (5.512s) at 03-Aug-2023 16:18:58.764 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/merge-and-remove-dups.cert on 03-Aug-2023 16:18:58.950 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/merge-and-remove-dups.cert (4.848s) at 03-Aug-2023 16:19:03.826 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/less-than-or-equal-all.cert on 03-Aug-2023 16:19:04.063 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/less-than-or-equal-all.cert (4.810s) at 03-Aug-2023 16:19:08.970 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/sortedp-less-than-or-equal.cert on 03-Aug-2023 16:19:09.147 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/sortedp-less-than-or-equal.cert (4.840s) at 03-Aug-2023 16:19:14.010 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defconst-computed.cert on 03-Aug-2023 16:19:14.119 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defconst-computed.cert (3.856s) at 03-Aug-2023 16:19:17.999 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-event-quiet.cert on 03-Aug-2023 16:19:18.186 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-event-quiet.cert (4.638s) at 03-Aug-2023 16:19:22.866 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/with-local-stobjs.cert on 03-Aug-2023 16:19:23.045 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/with-local-stobjs.cert (4.962s) at 03-Aug-2023 16:19:28.050 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/resize-list.cert on 03-Aug-2023 16:19:28.239 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/resize-list.cert (4.293s) at 03-Aug-2023 16:19:32.587 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/make-list-ac.cert on 03-Aug-2023 16:19:32.775 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/make-list-ac.cert (2.863s) at 03-Aug-2023 16:19:35.678 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/less-than-or-equal.cert on 03-Aug-2023 16:19:35.845 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/less-than-or-equal.cert (4.122s) at 03-Aug-2023 16:19:40.010 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/axe-types.cert on 03-Aug-2023 16:19:40.195 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/axe-types.cert (5.631s) at 03-Aug-2023 16:19:45.870 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv/bv-syntax.cert on 03-Aug-2023 16:19:46.024 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv/bv-syntax.cert (7.849s) at 03-Aug-2023 16:19:53.907 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/abs.cert on 03-Aug-2023 16:19:54.053 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/abs.cert (3.975s) at 03-Aug-2023 16:19:58.071 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/ifix.cert on 03-Aug-2023 16:19:58.292 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/ifix.cert (4.041s) at 03-Aug-2023 16:20:02.370 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/limit-expt.cert on 03-Aug-2023 16:20:02.552 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/limit-expt.cert (4.262s) at 03-Aug-2023 16:20:06.846 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/items-have-len.cert on 03-Aug-2023 16:20:07.110 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/items-have-len.cert (4.221s) at 03-Aug-2023 16:20:11.358 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-true-listp.cert on 03-Aug-2023 16:20:11.519 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-true-listp.cert (4.134s) at 03-Aug-2023 16:20:15.694 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/blake/portcullis.cert on 03-Aug-2023 16:20:15.858 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/blake/portcullis.cert (3.940s) at 03-Aug-2023 16:20:19.814 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/kdf/portcullis.cert on 03-Aug-2023 16:20:19.922 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/kdf/portcullis.cert (4.039s) at 03-Aug-2023 16:20:23.987 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/padding/portcullis.cert on 03-Aug-2023 16:20:24.169 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/padding/portcullis.cert (3.974s) at 03-Aug-2023 16:20:28.174 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/sha-2/portcullis.cert on 03-Aug-2023 16:20:28.290 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/sha-2/portcullis.cert (3.487s) at 03-Aug-2023 16:20:31.811 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/hmac/portcullis.cert on 03-Aug-2023 16:20:31.988 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/hmac/portcullis.cert (3.650s) at 03-Aug-2023 16:20:35.662 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/portcullis.cert on 03-Aug-2023 16:20:35.798 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/portcullis.cert (3.175s) at 03-Aug-2023 16:20:38.994 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/salsa/portcullis.cert on 03-Aug-2023 16:20:39.173 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/salsa/portcullis.cert (3.387s) at 03-Aug-2023 16:20:42.591 Making /build/1st/acl2-8.5dfsg/books/projects/apply-model-2/portcullis.cert on 03-Aug-2023 16:20:42.792 Built /build/1st/acl2-8.5dfsg/books/projects/apply-model-2/portcullis.cert (4.149s) at 03-Aug-2023 16:20:46.986 Making /build/1st/acl2-8.5dfsg/books/projects/fm9001/portcullis.cert on 03-Aug-2023 16:20:47.168 Built /build/1st/acl2-8.5dfsg/books/projects/fm9001/portcullis.cert (3.554s) at 03-Aug-2023 16:20:50.758 Making /build/1st/acl2-8.5dfsg/books/workshops/2022/walter-manolios/acl2s-utils/portcullis.cert on 03-Aug-2023 16:20:50.963 Built /build/1st/acl2-8.5dfsg/books/workshops/2022/walter-manolios/acl2s-utils/portcullis.cert (3.982s) at 03-Aug-2023 16:20:54.986 Making /build/1st/acl2-8.5dfsg/books/workshops/2022/walter-manolios/portcullis.cert on 03-Aug-2023 16:20:55.145 Built /build/1st/acl2-8.5dfsg/books/workshops/2022/walter-manolios/portcullis.cert (3.287s) at 03-Aug-2023 16:20:58.462 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv/bytep.cert on 03-Aug-2023 16:20:58.656 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv/bytep.cert (5.659s) at 03-Aug-2023 16:21:04.359 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/bit-listp.cert on 03-Aug-2023 16:21:04.596 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/bit-listp.cert (6.183s) at 03-Aug-2023 16:21:10.811 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-equal-dollar.cert on 03-Aug-2023 16:21:11.082 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-equal-dollar.cert (7.869s) at 03-Aug-2023 16:21:18.975 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv/bit-to-bool.cert on 03-Aug-2023 16:21:19.287 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv/bit-to-bool.cert (10.620s) at 03-Aug-2023 16:21:29.945 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv/bitp.cert on 03-Aug-2023 16:21:30.464 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv/bitp.cert (10.019s) at 03-Aug-2023 16:21:40.527 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/hex-char-to-val.cert on 03-Aug-2023 16:21:41.017 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/hex-char-to-val.cert (9.993s) at 03-Aug-2023 16:21:51.039 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/file-existsp.cert on 03-Aug-2023 16:21:51.568 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/file-existsp.cert (9.231s) at 03-Aug-2023 16:22:00.835 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-file-into-character-list.cert on 03-Aug-2023 16:22:01.264 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-file-into-character-list.cert (10.687s) at 03-Aug-2023 16:22:11.983 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pos-fix.cert on 03-Aug-2023 16:22:12.475 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pos-fix.cert (10.112s) at 03-Aug-2023 16:22:22.622 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/operations.cert on 03-Aug-2023 16:22:22.957 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/operations.cert (12.177s) at 03-Aug-2023 16:22:35.158 Making /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/bind-free-common.cert on 03-Aug-2023 16:22:35.617 Built /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/bind-free-common.cert (11.368s) at 03-Aug-2023 16:22:47.015 Making /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/rule-lists.cert on 03-Aug-2023 16:22:47.406 Built /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/rule-lists.cert (12.140s) at 03-Aug-2023 16:22:59.616 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/nat-listp.cert on 03-Aug-2023 16:22:59.734 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/nat-listp.cert (15.097s) at 03-Aug-2023 16:23:14.850 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-duplicates-equal.cert on 03-Aug-2023 16:23:15.273 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-duplicates-equal.cert (15.042s) at 03-Aug-2023 16:23:30.350 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/consecutivep.cert on 03-Aug-2023 16:23:30.772 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/consecutivep.cert (16.361s) at 03-Aug-2023 16:23:47.190 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/equal.cert on 03-Aug-2023 16:23:47.922 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/equal.cert (13.726s) at 03-Aug-2023 16:24:01.738 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-list-fast-rules.cert on 03-Aug-2023 16:24:01.873 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/split-list-fast-rules.cert (12.571s) at 03-Aug-2023 16:24:14.457 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/proof-support.cert on 03-Aug-2023 16:24:15.045 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/proof-support.cert (12.253s) at 03-Aug-2023 16:24:27.335 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/sparse/rule-lists.cert on 03-Aug-2023 16:24:27.788 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/sparse/rule-lists.cert (11.973s) at 03-Aug-2023 16:24:39.824 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/tools/filter-and-combine-symbol-alists.cert on 03-Aug-2023 16:24:40.273 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/r1cs/tools/filter-and-combine-symbol-alists.cert (17.897s) at 03-Aug-2023 16:24:58.222 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/finalcdr.cert on 03-Aug-2023 16:24:58.760 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/finalcdr.cert (11.732s) at 03-Aug-2023 16:25:10.590 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/if.cert on 03-Aug-2023 16:25:10.993 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/if.cert (11.918s) at 03-Aug-2023 16:25:22.974 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp-def.cert on 03-Aug-2023 16:25:23.535 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp-def.cert (11.018s) at 03-Aug-2023 16:25:34.589 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/lenconsmeta.cert on 03-Aug-2023 16:25:35.133 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/lenconsmeta.cert (15.939s) at 03-Aug-2023 16:25:51.115 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/fix.cert on 03-Aug-2023 16:25:51.664 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/fix.cert (11.279s) at 03-Aug-2023 16:26:02.998 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/channels.cert on 03-Aug-2023 16:26:03.536 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/channels.cert (16.513s) at 03-Aug-2023 16:26:20.117 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/channel-contents.cert on 03-Aug-2023 16:26:20.732 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/channel-contents.cert (11.732s) at 03-Aug-2023 16:26:32.569 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-length-dollar.cert on 03-Aug-2023 16:26:33.123 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-length-dollar.cert (11.218s) at 03-Aug-2023 16:26:44.395 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-write-date-dollar.cert on 03-Aug-2023 16:26:44.898 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-write-date-dollar.cert (11.157s) at 03-Aug-2023 16:26:56.122 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-is-newer-thanp.cert on 03-Aug-2023 16:26:56.485 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/file-is-newer-thanp.cert (12.771s) at 03-Aug-2023 16:27:09.274 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/string-ends-inp.cert on 03-Aug-2023 16:27:09.503 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/string-ends-inp.cert (11.208s) at 03-Aug-2023 16:27:20.749 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ld-history.cert on 03-Aug-2023 16:27:21.245 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ld-history.cert (12.931s) at 03-Aug-2023 16:27:34.198 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/checkpoints.cert on 03-Aug-2023 16:27:34.720 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/checkpoints.cert (15.162s) at 03-Aug-2023 16:27:50.015 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/theory-invariants.cert on 03-Aug-2023 16:27:50.173 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/theory-invariants.cert (8.980s) at 03-Aug-2023 16:27:59.168 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/non-trivial-formals.cert on 03-Aug-2023 16:27:59.683 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/non-trivial-formals.cert (10.001s) at 03-Aug-2023 16:28:09.738 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/types.cert on 03-Aug-2023 16:28:09.920 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/types.cert (13.085s) at 03-Aug-2023 16:28:23.066 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/first-non-member.cert on 03-Aug-2023 16:28:23.375 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/first-non-member.cert (8.804s) at 03-Aug-2023 16:28:32.206 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-contains-charp.cert on 03-Aug-2023 16:28:32.585 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-contains-charp.cert (6.602s) at 03-Aug-2023 16:28:39.219 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/read-chars.cert on 03-Aug-2023 16:28:39.308 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/read-chars.cert (8.009s) at 03-Aug-2023 16:28:47.334 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/len-at-least.cert on 03-Aug-2023 16:28:47.501 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/len-at-least.cert (8.065s) at 03-Aug-2023 16:28:55.623 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/find-index.cert on 03-Aug-2023 16:28:55.949 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/find-index.cert (8.231s) at 03-Aug-2023 16:29:04.199 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mydefconst.cert on 03-Aug-2023 16:29:04.453 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mydefconst.cert (6.526s) at 03-Aug-2023 16:29:11.014 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/depends-on-table.cert on 03-Aug-2023 16:29:11.316 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/depends-on-table.cert (9.297s) at 03-Aug-2023 16:29:20.651 Making /build/1st/acl2-8.5dfsg/books/kestrel/library-wrappers/list-defpkg.cert on 03-Aug-2023 16:29:20.985 Built /build/1st/acl2-8.5dfsg/books/kestrel/library-wrappers/list-defpkg.cert (7.712s) at 03-Aug-2023 16:29:28.726 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/add-to-end.cert on 03-Aug-2023 16:29:29.224 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/add-to-end.cert (7.596s) at 03-Aug-2023 16:29:36.860 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-eql-dollar.cert on 03-Aug-2023 16:29:37.228 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-eql-dollar.cert (8.461s) at 03-Aug-2023 16:29:45.727 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep-equal.cert on 03-Aug-2023 16:29:45.907 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep-equal.cert (7.412s) at 03-Aug-2023 16:29:53.347 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/length.cert on 03-Aug-2023 16:29:53.688 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/length.cert (6.347s) at 03-Aug-2023 16:30:00.079 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/equiv-def.cert on 03-Aug-2023 16:30:00.299 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/equiv-def.cert (8.406s) at 03-Aug-2023 16:30:08.751 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/last-elem.cert on 03-Aug-2023 16:30:09.122 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/last-elem.cert (7.702s) at 03-Aug-2023 16:30:16.931 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/count-occs.cert on 03-Aug-2023 16:30:17.217 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/count-occs.cert (7.924s) at 03-Aug-2023 16:30:25.170 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-nth.cert on 03-Aug-2023 16:30:25.434 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove-nth.cert (9.026s) at 03-Aug-2023 16:30:34.474 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/union-eql-tail.cert on 03-Aug-2023 16:30:34.719 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/union-eql-tail.cert (7.640s) at 03-Aug-2023 16:30:42.398 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/replace-item.cert on 03-Aug-2023 16:30:42.725 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/replace-item.cert (8.421s) at 03-Aug-2023 16:30:51.178 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove1-dollar-def.cert on 03-Aug-2023 16:30:51.551 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/remove1-dollar-def.cert (6.632s) at 03-Aug-2023 16:30:58.226 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/length.cert on 03-Aug-2023 16:30:58.553 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/length.cert (7.142s) at 03-Aug-2023 16:31:05.730 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/upcase.cert on 03-Aug-2023 16:31:06.067 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/upcase.cert (8.714s) at 03-Aug-2023 16:31:14.814 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/character-list-listp.cert on 03-Aug-2023 16:31:15.183 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/character-list-listp.cert (7.261s) at 03-Aug-2023 16:31:22.461 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/parse-binary-digits.cert on 03-Aug-2023 16:31:22.878 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/parse-binary-digits.cert (10.649s) at 03-Aug-2023 16:31:33.567 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/parse-decimal-digits.cert on 03-Aug-2023 16:31:33.932 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/parse-decimal-digits.cert (11.249s) at 03-Aug-2023 16:31:45.230 Making /build/1st/acl2-8.5dfsg/books/tools/nld.cert on 03-Aug-2023 16:31:45.552 Built /build/1st/acl2-8.5dfsg/books/tools/nld.cert (8.098s) at 03-Aug-2023 16:31:53.698 Making /build/1st/acl2-8.5dfsg/books/kestrel/syntheto/examples/ams-types.cert on 03-Aug-2023 16:31:54.049 Built /build/1st/acl2-8.5dfsg/books/kestrel/syntheto/examples/ams-types.cert (7.534s) at 03-Aug-2023 16:32:01.597 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/count-ifs-in-term.cert on 03-Aug-2023 16:32:02.158 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/count-ifs-in-term.cert (7.725s) at 03-Aug-2023 16:32:09.994 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/count-ifs-in-then-and-else-branches.cert on 03-Aug-2023 16:32:10.325 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/count-ifs-in-then-and-else-branches.cert (9.209s) at 03-Aug-2023 16:32:19.578 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/non-trivial-bindings.cert on 03-Aug-2023 16:32:19.906 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/non-trivial-bindings.cert (6.477s) at 03-Aug-2023 16:32:26.422 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/integer-listp.cert on 03-Aug-2023 16:32:26.695 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/integer-listp.cert (6.467s) at 03-Aug-2023 16:32:33.201 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/string-listp.cert on 03-Aug-2023 16:32:33.384 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/string-listp.cert (5.607s) at 03-Aug-2023 16:32:38.999 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/keyword-listp.cert on 03-Aug-2023 16:32:39.158 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/keyword-listp.cert (5.958s) at 03-Aug-2023 16:32:45.159 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/cons-listp-dollar.cert on 03-Aug-2023 16:32:45.374 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/cons-listp-dollar.cert (6.183s) at 03-Aug-2023 16:32:51.585 Making /build/1st/acl2-8.5dfsg/books/unicode/uchar.cert on 03-Aug-2023 16:32:51.664 Built /build/1st/acl2-8.5dfsg/books/unicode/uchar.cert (7.610s) at 03-Aug-2023 16:32:59.286 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/assert-with-stobjs.cert on 03-Aug-2023 16:32:59.622 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/assert-with-stobjs.cert (7.109s) at 03-Aug-2023 16:33:06.747 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/bind-from-rules.cert on 03-Aug-2023 16:33:06.915 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/bind-from-rules.cert (7.017s) at 03-Aug-2023 16:33:13.944 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/book-of-event.cert on 03-Aug-2023 16:33:14.115 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/book-of-event.cert (8.013s) at 03-Aug-2023 16:33:22.153 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/check-boolean.cert on 03-Aug-2023 16:33:22.322 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/check-boolean.cert (5.350s) at 03-Aug-2023 16:33:27.694 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/clause-identifiers.cert on 03-Aug-2023 16:33:27.909 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/clause-identifiers.cert (4.883s) at 03-Aug-2023 16:33:32.818 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/disables.cert on 03-Aug-2023 16:33:33.246 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/disables.cert (6.358s) at 03-Aug-2023 16:33:39.634 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/exit-if-function-not-defined.cert on 03-Aug-2023 16:33:39.937 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/exit-if-function-not-defined.cert (7.022s) at 03-Aug-2023 16:33:47.010 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-trees.cert on 03-Aug-2023 16:33:47.311 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-trees.cert (6.822s) at 03-Aug-2023 16:33:54.179 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/format-strings.cert on 03-Aug-2023 16:33:54.441 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/format-strings.cert (17.209s) at 03-Aug-2023 16:34:11.682 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ints-in-range.cert on 03-Aug-2023 16:34:12.001 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ints-in-range.cert (5.854s) at 03-Aug-2023 16:34:17.902 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-or-nice.cert on 03-Aug-2023 16:34:18.258 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-or-nice.cert (6.188s) at 03-Aug-2023 16:34:24.478 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-ord.cert on 03-Aug-2023 16:34:24.702 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-ord.cert (5.826s) at 03-Aug-2023 16:34:30.561 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mydefconst-tests.cert on 03-Aug-2023 16:34:30.728 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mydefconst-tests.cert (6.070s) at 03-Aug-2023 16:34:36.819 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/nfix.cert on 03-Aug-2023 16:34:36.999 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/nfix.cert (5.485s) at 03-Aug-2023 16:34:42.571 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pack-lists.cert on 03-Aug-2023 16:34:42.831 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/pack-lists.cert (6.624s) at 03-Aug-2023 16:34:49.494 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/preceding-theory.cert on 03-Aug-2023 16:34:49.707 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/preceding-theory.cert (6.741s) at 03-Aug-2023 16:34:56.466 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/progn.cert on 03-Aug-2023 16:34:56.723 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/progn.cert (6.790s) at 03-Aug-2023 16:35:03.548 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/subtermp.cert on 03-Aug-2023 16:35:03.786 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/subtermp.cert (7.719s) at 03-Aug-2023 16:35:11.533 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/suppress-invariant-risk.cert on 03-Aug-2023 16:35:11.720 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/suppress-invariant-risk.cert (7.794s) at 03-Aug-2023 16:35:19.535 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ubi.cert on 03-Aug-2023 16:35:19.815 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/ubi.cert (8.844s) at 03-Aug-2023 16:35:28.693 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-program.cert on 03-Aug-2023 16:35:28.892 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/verify-guards-program.cert (12.954s) at 03-Aug-2023 16:35:41.895 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/w.cert on 03-Aug-2023 16:35:42.072 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/w.cert (5.256s) at 03-Aug-2023 16:35:47.353 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/with-local-stobjs-tests.cert on 03-Aug-2023 16:35:47.553 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/with-local-stobjs-tests.cert (11.012s) at 03-Aug-2023 16:35:58.605 Making /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help-test.acl2x on 03-Aug-2023 16:35:58.947 Built /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help-test.acl2x (3.207s) at 03-Aug-2023 16:36:02.183 Making /build/1st/acl2-8.5dfsg/books/make-event/basic-check.cert on 03-Aug-2023 16:36:02.348 Built /build/1st/acl2-8.5dfsg/books/make-event/basic-check.cert (4.783s) at 03-Aug-2023 16:36:07.186 Making /build/1st/acl2-8.5dfsg/books/make-event/basic-pkg-check.cert on 03-Aug-2023 16:36:07.425 Built /build/1st/acl2-8.5dfsg/books/make-event/basic-pkg-check.cert (7.037s) at 03-Aug-2023 16:36:14.491 Making /build/1st/acl2-8.5dfsg/books/make-event/basic-pkg.cert on 03-Aug-2023 16:36:14.722 Built /build/1st/acl2-8.5dfsg/books/make-event/basic-pkg.cert (6.633s) at 03-Aug-2023 16:36:21.380 Making /build/1st/acl2-8.5dfsg/books/make-event/basic.cert on 03-Aug-2023 16:36:21.609 Built /build/1st/acl2-8.5dfsg/books/make-event/basic.cert (6.596s) at 03-Aug-2023 16:36:28.231 Making /build/1st/acl2-8.5dfsg/books/make-event/defconst-fast.cert on 03-Aug-2023 16:36:28.406 Built /build/1st/acl2-8.5dfsg/books/make-event/defconst-fast.cert (5.831s) at 03-Aug-2023 16:36:34.271 Making /build/1st/acl2-8.5dfsg/books/make-event/defrule.cert on 03-Aug-2023 16:36:34.536 Built /build/1st/acl2-8.5dfsg/books/make-event/defrule.cert (8.364s) at 03-Aug-2023 16:36:42.929 Making /build/1st/acl2-8.5dfsg/books/make-event/dotimes.cert on 03-Aug-2023 16:36:43.152 Built /build/1st/acl2-8.5dfsg/books/make-event/dotimes.cert (19.049s) at 03-Aug-2023 16:37:02.239 Making /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test-1.acl2x on 03-Aug-2023 16:37:02.584 Built /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test-1.acl2x (5.595s) at 03-Aug-2023 16:37:08.219 Making /build/1st/acl2-8.5dfsg/books/make-event/gen-defun-check.cert on 03-Aug-2023 16:37:08.446 Built /build/1st/acl2-8.5dfsg/books/make-event/gen-defun-check.cert (10.615s) at 03-Aug-2023 16:37:19.078 Making /build/1st/acl2-8.5dfsg/books/make-event/gen-defun.cert on 03-Aug-2023 16:37:19.443 Built /build/1st/acl2-8.5dfsg/books/make-event/gen-defun.cert (11.102s) at 03-Aug-2023 16:37:30.566 Making /build/1st/acl2-8.5dfsg/books/make-event/inline-book.cert on 03-Aug-2023 16:37:30.968 Built /build/1st/acl2-8.5dfsg/books/make-event/inline-book.cert (11.305s) at 03-Aug-2023 16:37:42.307 Making /build/1st/acl2-8.5dfsg/books/make-event/local-elided.cert on 03-Aug-2023 16:37:42.637 Built /build/1st/acl2-8.5dfsg/books/make-event/local-elided.cert (6.892s) at 03-Aug-2023 16:37:49.559 Making /build/1st/acl2-8.5dfsg/books/make-event/logical-tangent.cert on 03-Aug-2023 16:37:49.784 Built /build/1st/acl2-8.5dfsg/books/make-event/logical-tangent.cert (5.259s) at 03-Aug-2023 16:37:55.074 Making /build/1st/acl2-8.5dfsg/books/make-event/macros-skip-proofs.cert on 03-Aug-2023 16:37:55.353 Built /build/1st/acl2-8.5dfsg/books/make-event/macros-skip-proofs.cert (5.743s) at 03-Aug-2023 16:38:01.155 Making /build/1st/acl2-8.5dfsg/books/make-event/make-redundant.cert on 03-Aug-2023 16:38:01.300 Built /build/1st/acl2-8.5dfsg/books/make-event/make-redundant.cert (5.044s) at 03-Aug-2023 16:38:06.378 Making /build/1st/acl2-8.5dfsg/books/make-event/nested-check.cert on 03-Aug-2023 16:38:06.601 Built /build/1st/acl2-8.5dfsg/books/make-event/nested-check.cert (5.733s) at 03-Aug-2023 16:38:12.370 Making /build/1st/acl2-8.5dfsg/books/make-event/nested.cert on 03-Aug-2023 16:38:12.580 Built /build/1st/acl2-8.5dfsg/books/make-event/nested.cert (3.742s) at 03-Aug-2023 16:38:16.362 Making /build/1st/acl2-8.5dfsg/books/make-event/require-book.cert on 03-Aug-2023 16:38:16.570 Built /build/1st/acl2-8.5dfsg/books/make-event/require-book.cert (8.819s) at 03-Aug-2023 16:38:25.451 Making /build/1st/acl2-8.5dfsg/books/make-event/search-generation.cert on 03-Aug-2023 16:38:25.640 Built /build/1st/acl2-8.5dfsg/books/make-event/search-generation.cert (6.226s) at 03-Aug-2023 16:38:31.922 Making /build/1st/acl2-8.5dfsg/books/make-event/stobj-test.acl2x on 03-Aug-2023 16:38:32.102 Built /build/1st/acl2-8.5dfsg/books/make-event/stobj-test.acl2x (2.872s) at 03-Aug-2023 16:38:35.027 Making /build/1st/acl2-8.5dfsg/books/misc/book-checks.cert on 03-Aug-2023 16:38:35.361 Built /build/1st/acl2-8.5dfsg/books/misc/book-checks.cert (15.602s) at 03-Aug-2023 16:38:51.006 Making /build/1st/acl2-8.5dfsg/books/misc/callers-and-ancestors.cert on 03-Aug-2023 16:38:52.589 Tick Built /build/1st/acl2-8.5dfsg/books/misc/callers-and-ancestors.cert (16.357s) at 03-Aug-2023 16:39:08.974 Making /build/1st/acl2-8.5dfsg/books/misc/character-encoding-test.cert on 03-Aug-2023 16:39:09.161 Built /build/1st/acl2-8.5dfsg/books/misc/character-encoding-test.cert (5.546s) at 03-Aug-2023 16:39:14.775 Making /build/1st/acl2-8.5dfsg/books/misc/check-acl2-exports.cert on 03-Aug-2023 16:39:14.899 Built /build/1st/acl2-8.5dfsg/books/misc/check-acl2-exports.cert (8.338s) at 03-Aug-2023 16:39:23.259 Making /build/1st/acl2-8.5dfsg/books/misc/check-fn-inst.cert on 03-Aug-2023 16:39:23.412 Built /build/1st/acl2-8.5dfsg/books/misc/check-fn-inst.cert (5.398s) at 03-Aug-2023 16:39:28.850 Making /build/1st/acl2-8.5dfsg/books/misc/computed-hint.cert on 03-Aug-2023 16:39:29.032 Built /build/1st/acl2-8.5dfsg/books/misc/computed-hint.cert (9.539s) at 03-Aug-2023 16:39:38.618 Making /build/1st/acl2-8.5dfsg/books/misc/csort.cert on 03-Aug-2023 16:39:38.812 Built /build/1st/acl2-8.5dfsg/books/misc/csort.cert (13.426s) at 03-Aug-2023 16:39:52.295 Making /build/1st/acl2-8.5dfsg/books/tools/dead-events.cert on 03-Aug-2023 16:39:52.457 Built /build/1st/acl2-8.5dfsg/books/tools/dead-events.cert (8.128s) at 03-Aug-2023 16:40:00.602 Making /build/1st/acl2-8.5dfsg/books/misc/defattach-bang.cert on 03-Aug-2023 16:40:00.751 Built /build/1st/acl2-8.5dfsg/books/misc/defattach-bang.cert (4.726s) at 03-Aug-2023 16:40:05.514 Making /build/1st/acl2-8.5dfsg/books/misc/defproxy-test.cert on 03-Aug-2023 16:40:05.600 Built /build/1st/acl2-8.5dfsg/books/misc/defproxy-test.cert (5.801s) at 03-Aug-2023 16:40:11.431 Making /build/1st/acl2-8.5dfsg/books/misc/dijkstra-shortest-path.cert on 03-Aug-2023 16:40:11.631 Built /build/1st/acl2-8.5dfsg/books/misc/dijkstra-shortest-path.cert (32.063s) at 03-Aug-2023 16:40:43.786 Making /build/1st/acl2-8.5dfsg/books/misc/disassemble.cert on 03-Aug-2023 16:40:44.029 Built /build/1st/acl2-8.5dfsg/books/misc/disassemble.cert (4.612s) at 03-Aug-2023 16:40:48.678 Making /build/1st/acl2-8.5dfsg/books/misc/eliminate-irrelevance-tests.cert on 03-Aug-2023 16:40:48.846 Built /build/1st/acl2-8.5dfsg/books/misc/eliminate-irrelevance-tests.cert (5.482s) at 03-Aug-2023 16:40:54.382 Making /build/1st/acl2-8.5dfsg/books/misc/enumerate.cert on 03-Aug-2023 16:40:54.555 Built /build/1st/acl2-8.5dfsg/books/misc/enumerate.cert (4.578s) at 03-Aug-2023 16:40:59.178 Making /build/1st/acl2-8.5dfsg/books/misc/getprop.cert on 03-Aug-2023 16:40:59.342 Built /build/1st/acl2-8.5dfsg/books/misc/getprop.cert (6.774s) at 03-Aug-2023 16:41:06.152 Making /build/1st/acl2-8.5dfsg/books/misc/hanoi.cert on 03-Aug-2023 16:41:06.364 Built /build/1st/acl2-8.5dfsg/books/misc/hanoi.cert (11.601s) at 03-Aug-2023 16:41:18.026 Making /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/pkg1.cert on 03-Aug-2023 16:41:18.225 Built /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/pkg1.cert (5.507s) at 03-Aug-2023 16:41:23.750 Making /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/pkg2.cert on 03-Aug-2023 16:41:24.018 Built /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/pkg2.cert (5.228s) at 03-Aug-2023 16:41:29.270 Making /build/1st/acl2-8.5dfsg/books/misc/how-to-prove-thms.cert on 03-Aug-2023 16:41:29.514 Built /build/1st/acl2-8.5dfsg/books/misc/how-to-prove-thms.cert (12.245s) at 03-Aug-2023 16:41:41.831 Making /build/1st/acl2-8.5dfsg/books/misc/integer-type-set-test.cert on 03-Aug-2023 16:41:42.096 Built /build/1st/acl2-8.5dfsg/books/misc/integer-type-set-test.cert (6.950s) at 03-Aug-2023 16:41:49.086 Making /build/1st/acl2-8.5dfsg/books/misc/multi-v-uni.cert on 03-Aug-2023 16:41:49.347 Built /build/1st/acl2-8.5dfsg/books/misc/multi-v-uni.cert (17.975s) at 03-Aug-2023 16:42:07.422 Making /build/1st/acl2-8.5dfsg/books/misc/oprof.cert on 03-Aug-2023 16:42:07.649 Built /build/1st/acl2-8.5dfsg/books/misc/oprof.cert (5.087s) at 03-Aug-2023 16:42:12.778 Making /build/1st/acl2-8.5dfsg/books/misc/priorities.cert on 03-Aug-2023 16:42:12.926 Built /build/1st/acl2-8.5dfsg/books/misc/priorities.cert (6.165s) at 03-Aug-2023 16:42:19.138 Making /build/1st/acl2-8.5dfsg/books/misc/process-book-readme.cert on 03-Aug-2023 16:42:19.326 Built /build/1st/acl2-8.5dfsg/books/misc/process-book-readme.cert (10.401s) at 03-Aug-2023 16:42:29.766 Making /build/1st/acl2-8.5dfsg/books/misc/profiling.cert on 03-Aug-2023 16:42:29.997 Built /build/1st/acl2-8.5dfsg/books/misc/profiling.cert (6.643s) at 03-Aug-2023 16:42:36.662 Making /build/1st/acl2-8.5dfsg/books/misc/redef-pkg.cert on 03-Aug-2023 16:42:36.926 Built /build/1st/acl2-8.5dfsg/books/misc/redef-pkg.cert (10.550s) at 03-Aug-2023 16:42:47.538 Making /build/1st/acl2-8.5dfsg/books/misc/save-time.cert on 03-Aug-2023 16:42:47.865 Built /build/1st/acl2-8.5dfsg/books/misc/save-time.cert (8.304s) at 03-Aug-2023 16:42:56.212 Making /build/1st/acl2-8.5dfsg/books/misc/sort-symbols.cert on 03-Aug-2023 16:42:56.398 Built /build/1st/acl2-8.5dfsg/books/misc/sort-symbols.cert (9.755s) at 03-Aug-2023 16:43:06.211 Making /build/1st/acl2-8.5dfsg/books/misc/sticky-disable.cert on 03-Aug-2023 16:43:06.481 Built /build/1st/acl2-8.5dfsg/books/misc/sticky-disable.cert (6.969s) at 03-Aug-2023 16:43:13.510 Making /build/1st/acl2-8.5dfsg/books/misc/transfinite.cert on 03-Aug-2023 16:43:13.774 Built /build/1st/acl2-8.5dfsg/books/misc/transfinite.cert (8.469s) at 03-Aug-2023 16:43:22.282 Making /build/1st/acl2-8.5dfsg/books/misc/wet.cert on 03-Aug-2023 16:43:22.599 Built /build/1st/acl2-8.5dfsg/books/misc/wet.cert (8.069s) at 03-Aug-2023 16:43:30.806 Making /build/1st/acl2-8.5dfsg/books/models/jvm/guard-verified-m1/use-when.cert on 03-Aug-2023 16:43:30.952 Built /build/1st/acl2-8.5dfsg/books/models/jvm/guard-verified-m1/use-when.cert (6.081s) at 03-Aug-2023 16:43:37.090 Making /build/1st/acl2-8.5dfsg/books/models/jvm/m1-original/problem-set-1-answers.cert on 03-Aug-2023 16:43:37.217 Built /build/1st/acl2-8.5dfsg/books/models/jvm/m1-original/problem-set-1-answers.cert (10.795s) at 03-Aug-2023 16:43:48.074 Making /build/1st/acl2-8.5dfsg/books/models/jvm/m5/perm.cert on 03-Aug-2023 16:43:48.289 Built /build/1st/acl2-8.5dfsg/books/models/jvm/m5/perm.cert (6.498s) at 03-Aug-2023 16:43:54.794 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert on 03-Aug-2023 16:43:54.985 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partition-defuns.cert (7.109s) at 03-Aug-2023 16:44:02.130 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 03-Aug-2023 16:44:02.381 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (7.130s) at 03-Aug-2023 16:44:09.554 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert on 03-Aug-2023 16:44:09.828 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/composition-helpers.cert (11.973s) at 03-Aug-2023 16:44:21.858 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert on 03-Aug-2023 16:44:22.189 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/2011/reid-gamboa-differentiator/support/defderivative.cert (5.206s) at 03-Aug-2023 16:44:27.426 Making /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-counter-examples.cert on 03-Aug-2023 16:44:27.684 Built /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-counter-examples.cert (4.816s) at 03-Aug-2023 16:44:32.554 Making /build/1st/acl2-8.5dfsg/books/ordinals/proof-of-well-foundedness.cert on 03-Aug-2023 16:44:32.733 Built /build/1st/acl2-8.5dfsg/books/ordinals/proof-of-well-foundedness.cert (9.210s) at 03-Aug-2023 16:44:41.995 Making /build/1st/acl2-8.5dfsg/books/tools/theory-tools.cert on 03-Aug-2023 16:44:42.182 Built /build/1st/acl2-8.5dfsg/books/tools/theory-tools.cert (4.759s) at 03-Aug-2023 16:44:46.979 Making /build/1st/acl2-8.5dfsg/books/projects/async/tools/convert-edif.cert on 03-Aug-2023 16:44:47.161 Built /build/1st/acl2-8.5dfsg/books/projects/async/tools/convert-edif.cert (5.334s) at 03-Aug-2023 16:44:52.519 Making /build/1st/acl2-8.5dfsg/books/projects/codewalker/if-tracker.cert on 03-Aug-2023 16:44:52.788 Built /build/1st/acl2-8.5dfsg/books/projects/codewalker/if-tracker.cert (8.147s) at 03-Aug-2023 16:45:00.970 Making /build/1st/acl2-8.5dfsg/books/projects/dpss/Util/except.cert on 03-Aug-2023 16:45:01.150 Built /build/1st/acl2-8.5dfsg/books/projects/dpss/Util/except.cert (6.638s) at 03-Aug-2023 16:45:07.831 Making /build/1st/acl2-8.5dfsg/books/projects/equational/bewijs.cert on 03-Aug-2023 16:45:08.114 Built /build/1st/acl2-8.5dfsg/books/projects/equational/bewijs.cert (7.081s) at 03-Aug-2023 16:45:15.254 Making /build/1st/acl2-8.5dfsg/books/projects/equational/general.cert on 03-Aug-2023 16:45:15.534 Built /build/1st/acl2-8.5dfsg/books/projects/equational/general.cert (6.664s) at 03-Aug-2023 16:45:22.254 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/bounded-nat-listp.cert on 03-Aug-2023 16:45:22.444 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/bounded-nat-listp.cert (6.645s) at 03-Aug-2023 16:45:29.142 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/generate-index-list.cert on 03-Aug-2023 16:45:29.334 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/generate-index-list.cert (7.022s) at 03-Aug-2023 16:45:36.443 Making /build/1st/acl2-8.5dfsg/books/projects/fm9001/constants.cert on 03-Aug-2023 16:45:36.552 Built /build/1st/acl2-8.5dfsg/books/projects/fm9001/constants.cert (4.835s) at 03-Aug-2023 16:45:41.431 Making /build/1st/acl2-8.5dfsg/books/projects/fm9001/primp-database.cert on 03-Aug-2023 16:45:41.622 Built /build/1st/acl2-8.5dfsg/books/projects/fm9001/primp-database.cert (5.718s) at 03-Aug-2023 16:45:47.378 Making /build/1st/acl2-8.5dfsg/books/projects/leftist-trees/leftist-tree-defuns.cert on 03-Aug-2023 16:45:47.493 Built /build/1st/acl2-8.5dfsg/books/projects/leftist-trees/leftist-tree-defuns.cert (7.061s) at 03-Aug-2023 16:45:54.583 Making /build/1st/acl2-8.5dfsg/books/projects/legacy-defrstobj/portcullis.cert on 03-Aug-2023 16:45:54.823 Built /build/1st/acl2-8.5dfsg/books/projects/legacy-defrstobj/portcullis.cert (5.870s) at 03-Aug-2023 16:46:00.730 Making /build/1st/acl2-8.5dfsg/books/projects/pltpa/pltpa.cert on 03-Aug-2023 16:46:00.921 Built /build/1st/acl2-8.5dfsg/books/projects/pltpa/pltpa.cert (47.047s) at 03-Aug-2023 16:46:48.131 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/incremental/limits.cert on 03-Aug-2023 16:46:48.326 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/incremental/limits.cert (9.427s) at 03-Aug-2023 16:46:57.807 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert on 03-Aug-2023 16:46:58.003 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/ternary.cert (4.626s) at 03-Aug-2023 16:47:02.662 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/literal.cert on 03-Aug-2023 16:47:02.830 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/literal.cert (6.189s) at 03-Aug-2023 16:47:09.058 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert on 03-Aug-2023 16:47:09.347 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/mv-nth.cert (5.066s) at 03-Aug-2023 16:47:14.466 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/lrat-checker.cert on 03-Aug-2023 16:47:14.655 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/lrat-checker.cert (27.123s) at 03-Aug-2023 16:47:41.842 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/lrat-checker.cert on 03-Aug-2023 16:47:42.080 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/lrat-checker.cert (25.820s) at 03-Aug-2023 16:48:07.966 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/stobj-based/limits.cert on 03-Aug-2023 16:48:08.213 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/stobj-based/limits.cert (9.996s) at 03-Aug-2023 16:48:18.258 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/sb60.cert on 03-Aug-2023 16:48:18.523 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/sb60.cert (5.216s) at 03-Aug-2023 16:48:23.798 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/ternary.cert on 03-Aug-2023 16:48:24.069 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/ternary.cert (6.093s) at 03-Aug-2023 16:48:30.210 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert on 03-Aug-2023 16:48:30.381 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/mv-nth.cert (4.468s) at 03-Aug-2023 16:48:34.863 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/old-literal.cert on 03-Aug-2023 16:48:35.058 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/old-literal.cert (5.821s) at 03-Aug-2023 16:48:40.914 Making /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/encryption.cert on 03-Aug-2023 16:48:41.024 Built /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/encryption.cert (7.507s) at 03-Aug-2023 16:48:48.544 Making /build/1st/acl2-8.5dfsg/books/tau/bounders/find-minimal-2d.cert on 03-Aug-2023 16:48:48.677 Built /build/1st/acl2-8.5dfsg/books/tau/bounders/find-minimal-2d.cert (6.530s) at 03-Aug-2023 16:48:55.242 Making /build/1st/acl2-8.5dfsg/books/tau/bounders/find-maximal-2d.cert on 03-Aug-2023 16:48:55.417 Built /build/1st/acl2-8.5dfsg/books/tau/bounders/find-maximal-2d.cert (7.363s) at 03-Aug-2023 16:49:02.818 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/code/tree-manip/quicksort.cert on 03-Aug-2023 16:49:03.100 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/code/tree-manip/quicksort.cert (6.051s) at 03-Aug-2023 16:49:09.194 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/database/db-from-list.cert on 03-Aug-2023 16:49:09.364 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/database/db-from-list.cert (4.777s) at 03-Aug-2023 16:49:14.173 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/sets.cert on 03-Aug-2023 16:49:14.363 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/sets.cert (8.584s) at 03-Aug-2023 16:49:22.992 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert on 03-Aug-2023 16:49:23.169 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/tree-generation/distance-based/naive-quartet-method.cert (30.479s) at 03-Aug-2023 16:49:53.707 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/tree-score/efficient-pscores-help.cert on 03-Aug-2023 16:49:53.957 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/tree-score/efficient-pscores-help.cert (5.893s) at 03-Aug-2023 16:49:59.886 Making /build/1st/acl2-8.5dfsg/books/projects/wp-gen/shared.cert on 03-Aug-2023 16:50:00.071 Built /build/1st/acl2-8.5dfsg/books/projects/wp-gen/shared.cert (5.203s) at 03-Aug-2023 16:50:05.326 Making /build/1st/acl2-8.5dfsg/books/proofstyles/completeness/generic-partial.cert on 03-Aug-2023 16:50:05.499 Built /build/1st/acl2-8.5dfsg/books/proofstyles/completeness/generic-partial.cert (6.593s) at 03-Aug-2023 16:50:12.127 Making /build/1st/acl2-8.5dfsg/books/proofstyles/completeness/generic-total.cert on 03-Aug-2023 16:50:12.304 Built /build/1st/acl2-8.5dfsg/books/proofstyles/completeness/generic-total.cert (7.085s) at 03-Aug-2023 16:50:19.423 Making /build/1st/acl2-8.5dfsg/books/proofstyles/soundness/clock-partial.cert on 03-Aug-2023 16:50:19.580 Built /build/1st/acl2-8.5dfsg/books/proofstyles/soundness/clock-partial.cert (6.124s) at 03-Aug-2023 16:50:25.734 Making /build/1st/acl2-8.5dfsg/books/proofstyles/soundness/clock-total.cert on 03-Aug-2023 16:50:25.877 Built /build/1st/acl2-8.5dfsg/books/proofstyles/soundness/clock-total.cert (5.615s) at 03-Aug-2023 16:50:31.518 Making /build/1st/acl2-8.5dfsg/books/rtl/rel1/support/rewrite-theory.cert on 03-Aug-2023 16:50:31.781 Built /build/1st/acl2-8.5dfsg/books/rtl/rel1/support/rewrite-theory.cert (5.946s) at 03-Aug-2023 16:50:37.758 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/openers.cert on 03-Aug-2023 16:50:37.939 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/openers.cert (6.181s) at 03-Aug-2023 16:50:44.182 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/package-defs.cert on 03-Aug-2023 16:50:44.416 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/package-defs.cert (4.475s) at 03-Aug-2023 16:50:48.991 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/rom-helpers.cert on 03-Aug-2023 16:50:49.224 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/lib/rom-helpers.cert (8.672s) at 03-Aug-2023 16:50:57.955 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/fast-and.cert on 03-Aug-2023 16:50:58.309 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/fast-and.cert (6.862s) at 03-Aug-2023 16:51:05.226 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/log-equal.cert on 03-Aug-2023 16:51:05.549 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/log-equal.cert (8.178s) at 03-Aug-2023 16:51:13.766 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/rewrite-theory.cert on 03-Aug-2023 16:51:13.938 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/rewrite-theory.cert (8.068s) at 03-Aug-2023 16:51:22.054 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/cat-def.cert on 03-Aug-2023 16:51:22.224 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/cat-def.cert (9.433s) at 03-Aug-2023 16:51:31.774 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logs.cert on 03-Aug-2023 16:51:32.239 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logs.cert (11.686s) at 03-Aug-2023 16:51:43.982 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/all-ones.cert on 03-Aug-2023 16:51:44.268 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/all-ones.cert (6.479s) at 03-Aug-2023 16:51:50.799 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logior1-proofs.cert on 03-Aug-2023 16:51:51.040 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logior1-proofs.cert (6.186s) at 03-Aug-2023 16:51:57.270 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/rom-helpers.cert on 03-Aug-2023 16:51:57.600 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/rom-helpers.cert (6.166s) at 03-Aug-2023 16:52:03.803 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/openers.cert on 03-Aug-2023 16:52:03.991 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/openers.cert (4.661s) at 03-Aug-2023 16:52:08.686 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/package-defs.cert on 03-Aug-2023 16:52:08.879 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/package-defs.cert (3.606s) at 03-Aug-2023 16:52:12.523 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/util.cert on 03-Aug-2023 16:52:12.711 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/util.cert (4.936s) at 03-Aug-2023 16:52:17.686 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/rom-helpers.cert on 03-Aug-2023 16:52:17.792 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/rom-helpers.cert (5.829s) at 03-Aug-2023 16:52:23.648 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert on 03-Aug-2023 16:52:23.839 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3.delta2/rom-helpers.cert (5.562s) at 03-Aug-2023 16:52:29.438 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/openers.cert on 03-Aug-2023 16:52:29.602 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/openers.cert (6.088s) at 03-Aug-2023 16:52:35.722 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/package-defs.cert on 03-Aug-2023 16:52:35.907 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/package-defs.cert (5.430s) at 03-Aug-2023 16:52:41.374 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/rom-helpers.cert on 03-Aug-2023 16:52:41.545 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/lib/rom-helpers.cert (5.545s) at 03-Aug-2023 16:52:47.139 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/openers.cert on 03-Aug-2023 16:52:47.325 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/openers.cert (4.637s) at 03-Aug-2023 16:52:52.002 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/package-defs.cert on 03-Aug-2023 16:52:52.135 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/package-defs.cert (4.016s) at 03-Aug-2023 16:52:56.175 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/rom-helpers.cert on 03-Aug-2023 16:52:56.350 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib1/rom-helpers.cert (5.942s) at 03-Aug-2023 16:53:02.330 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/openers.cert on 03-Aug-2023 16:53:02.579 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/openers.cert (6.505s) at 03-Aug-2023 16:53:09.122 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/package-defs.cert on 03-Aug-2023 16:53:09.396 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib2/package-defs.cert (5.922s) at 03-Aug-2023 16:53:15.342 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/openers.cert on 03-Aug-2023 16:53:15.626 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/openers.cert (6.480s) at 03-Aug-2023 16:53:22.156 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/package-defs.cert on 03-Aug-2023 16:53:22.394 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/package-defs.cert (6.290s) at 03-Aug-2023 16:53:28.722 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/rom-helpers.cert on 03-Aug-2023 16:53:28.935 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/lib3/rom-helpers.cert (6.147s) at 03-Aug-2023 16:53:35.130 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/fast-and.cert on 03-Aug-2023 16:53:35.334 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/fast-and.cert (4.824s) at 03-Aug-2023 16:53:40.193 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/log-equal.cert on 03-Aug-2023 16:53:40.311 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/log-equal.cert (5.567s) at 03-Aug-2023 16:53:45.927 Making /build/1st/acl2-8.5dfsg/books/system/bigger-limits.cert on 03-Aug-2023 16:53:46.100 Built /build/1st/acl2-8.5dfsg/books/system/bigger-limits.cert (6.144s) at 03-Aug-2023 16:53:52.281 Making /build/1st/acl2-8.5dfsg/books/system/compare-out-files.cert on 03-Aug-2023 16:53:52.505 Built /build/1st/acl2-8.5dfsg/books/system/compare-out-files.cert (29.465s) at 03-Aug-2023 16:54:22.070 Making /build/1st/acl2-8.5dfsg/books/system/dead-source-code.cert on 03-Aug-2023 16:54:22.264 Built /build/1st/acl2-8.5dfsg/books/system/dead-source-code.cert (11.354s) at 03-Aug-2023 16:54:33.679 Making /build/1st/acl2-8.5dfsg/books/system/optimize-check-aux.cert on 03-Aug-2023 16:54:33.875 Built /build/1st/acl2-8.5dfsg/books/system/optimize-check-aux.cert (7.046s) at 03-Aug-2023 16:54:40.962 Making /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-1.acl2x on 03-Aug-2023 16:54:41.150 Built /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-1.acl2x (2.775s) at 03-Aug-2023 16:54:43.974 Making /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-2.acl2x on 03-Aug-2023 16:54:44.158 Built /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-2.acl2x (2.695s) at 03-Aug-2023 16:54:46.890 Making /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.pcert0 on 03-Aug-2023 16:54:47.088 Built /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.pcert0 (3.053s) at 03-Aug-2023 16:54:50.190 Making /build/1st/acl2-8.5dfsg/books/system/pcert/sub.pcert0 on 03-Aug-2023 16:54:50.372 Built /build/1st/acl2-8.5dfsg/books/system/pcert/sub.pcert0 (5.021s) at 03-Aug-2023 16:54:55.431 Making /build/1st/acl2-8.5dfsg/books/system/pcert/pkg-test.cert on 03-Aug-2023 16:54:55.600 Built /build/1st/acl2-8.5dfsg/books/system/pcert/pkg-test.cert (5.010s) at 03-Aug-2023 16:55:00.651 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/abs-abs.cert on 03-Aug-2023 16:55:00.848 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/abs-abs.cert (13.866s) at 03-Aug-2023 16:55:14.766 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/absstobj-with-arrays.cert on 03-Aug-2023 16:55:14.965 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/absstobj-with-arrays.cert (13.883s) at 03-Aug-2023 16:55:28.894 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/absstobj-with-hash-tables.cert on 03-Aug-2023 16:55:29.072 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/absstobj-with-hash-tables.cert (16.723s) at 03-Aug-2023 16:55:45.839 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/input-signature-mismatch-with-logic-ok.cert on 03-Aug-2023 16:55:46.136 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/input-signature-mismatch-with-logic-ok.cert (8.641s) at 03-Aug-2023 16:55:54.814 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj.cert on 03-Aug-2023 16:55:55.077 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj.cert (15.230s) at 03-Aug-2023 16:56:10.358 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-ordered-nums-stobj.cert on 03-Aug-2023 16:56:10.538 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-ordered-nums-stobj.cert (18.262s) at 03-Aug-2023 16:56:28.843 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj-simpler.cert on 03-Aug-2023 16:56:29.128 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/two-usuallyequal-nums-stobj-simpler.cert (13.659s) at 03-Aug-2023 16:56:42.836 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/encap.cert on 03-Aug-2023 16:56:43.121 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/encap.cert (4.958s) at 03-Aug-2023 16:56:48.114 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/redef.cert on 03-Aug-2023 16:56:48.257 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/redef.cert (4.727s) at 03-Aug-2023 16:56:53.030 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/sub1.cert on 03-Aug-2023 16:56:53.244 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/sub1.cert (6.650s) at 03-Aug-2023 16:56:59.926 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/verify-termination.cert on 03-Aug-2023 16:57:00.081 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/verify-termination.cert (6.201s) at 03-Aug-2023 16:57:06.342 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-const-hons.cert on 03-Aug-2023 16:57:06.652 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-const-hons.cert (26.024s) at 03-Aug-2023 16:57:32.700 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-const.cert on 03-Aug-2023 16:57:32.917 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-const.cert (23.962s) at 03-Aug-2023 16:57:56.918 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-def-hons.cert on 03-Aug-2023 16:57:57.053 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/big-def-hons.cert (16.953s) at 03-Aug-2023 16:58:14.015 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/defun-fast-alist.cert on 03-Aug-2023 16:58:14.169 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/defun-fast-alist.cert (5.151s) at 03-Aug-2023 16:58:19.362 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/eq-test.cert on 03-Aug-2023 16:58:19.558 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/eq-test.cert (16.682s) at 03-Aug-2023 16:58:36.278 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-hons-copy-local.cert on 03-Aug-2023 16:58:36.490 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-hons-copy-local.cert (5.039s) at 03-Aug-2023 16:58:41.575 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-hons-copy.cert on 03-Aug-2023 16:58:41.857 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-hons-copy.cert (5.416s) at 03-Aug-2023 16:58:47.298 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-local.cert on 03-Aug-2023 16:58:47.557 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist-local.cert (6.254s) at 03-Aug-2023 16:58:53.858 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist.cert on 03-Aug-2023 16:58:54.023 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/fast-alist.cert (5.637s) at 03-Aug-2023 16:58:59.711 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-acons-bang-local.cert on 03-Aug-2023 16:58:59.998 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-acons-bang-local.cert (4.834s) at 03-Aug-2023 16:59:04.866 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-acons-bang.cert on 03-Aug-2023 16:59:05.132 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-acons-bang.cert (4.471s) at 03-Aug-2023 16:59:09.654 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-local.cert on 03-Aug-2023 16:59:09.943 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons-local.cert (4.890s) at 03-Aug-2023 16:59:14.874 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons.cert on 03-Aug-2023 16:59:15.060 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/hons.cert (4.399s) at 03-Aug-2023 16:59:19.487 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test1-local.cert on 03-Aug-2023 16:59:19.664 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test1-local.cert (6.114s) at 03-Aug-2023 16:59:25.815 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test1.cert on 03-Aug-2023 16:59:26.024 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test1.cert (5.955s) at 03-Aug-2023 16:59:32.006 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test2-local.cert on 03-Aug-2023 16:59:32.195 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test2-local.cert (4.260s) at 03-Aug-2023 16:59:36.484 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test2.cert on 03-Aug-2023 16:59:36.661 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/test2.cert (5.341s) at 03-Aug-2023 16:59:42.030 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/ttag.cert on 03-Aug-2023 16:59:42.289 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/ttag.cert (5.346s) at 03-Aug-2023 16:59:47.670 Making /build/1st/acl2-8.5dfsg/books/system/tests/fmt-to-string-pkg.cert on 03-Aug-2023 16:59:47.832 Built /build/1st/acl2-8.5dfsg/books/system/tests/fmt-to-string-pkg.cert (5.071s) at 03-Aug-2023 16:59:52.954 Making /build/1st/acl2-8.5dfsg/books/system/tests/fmt-to-string.cert on 03-Aug-2023 16:59:53.220 Built /build/1st/acl2-8.5dfsg/books/system/tests/fmt-to-string.cert (4.378s) at 03-Aug-2023 16:59:57.622 Making /build/1st/acl2-8.5dfsg/books/system/tests/induction-rule-with-disabled-scheme.cert on 03-Aug-2023 16:59:57.805 Built /build/1st/acl2-8.5dfsg/books/system/tests/induction-rule-with-disabled-scheme.cert (5.902s) at 03-Aug-2023 17:00:03.758 Making /build/1st/acl2-8.5dfsg/books/system/tests/local-port.cert on 03-Aug-2023 17:00:03.924 Built /build/1st/acl2-8.5dfsg/books/system/tests/local-port.cert (4.658s) at 03-Aug-2023 17:00:08.610 Making /build/1st/acl2-8.5dfsg/books/system/tests/nested-stobj-formals.cert on 03-Aug-2023 17:00:08.786 Built /build/1st/acl2-8.5dfsg/books/system/tests/nested-stobj-formals.cert (9.306s) at 03-Aug-2023 17:00:18.126 Making /build/1st/acl2-8.5dfsg/books/system/tests/nested-stobj-two-updates.cert on 03-Aug-2023 17:00:18.407 Built /build/1st/acl2-8.5dfsg/books/system/tests/nested-stobj-two-updates.cert (13.647s) at 03-Aug-2023 17:00:32.102 Making /build/1st/acl2-8.5dfsg/books/system/tests/state-p-in-guard.cert on 03-Aug-2023 17:00:32.285 Built /build/1st/acl2-8.5dfsg/books/system/tests/state-p-in-guard.cert (5.199s) at 03-Aug-2023 17:00:37.530 Making /build/1st/acl2-8.5dfsg/books/system/tests/stobj-issues.cert on 03-Aug-2023 17:00:37.736 Built /build/1st/acl2-8.5dfsg/books/system/tests/stobj-issues.cert (19.105s) at 03-Aug-2023 17:00:56.882 Making /build/1st/acl2-8.5dfsg/books/system/tests/tau-contradiction.cert on 03-Aug-2023 17:00:57.070 Built /build/1st/acl2-8.5dfsg/books/system/tests/tau-contradiction.cert (4.707s) at 03-Aug-2023 17:01:01.810 Making /build/1st/acl2-8.5dfsg/books/system/tests/verify-termination/sub.cert on 03-Aug-2023 17:01:01.993 Built /build/1st/acl2-8.5dfsg/books/system/tests/verify-termination/sub.cert (3.955s) at 03-Aug-2023 17:01:05.990 Making /build/1st/acl2-8.5dfsg/books/system/update-state.cert on 03-Aug-2023 17:01:06.171 Built /build/1st/acl2-8.5dfsg/books/system/update-state.cert (9.828s) at 03-Aug-2023 17:01:16.074 Making /build/1st/acl2-8.5dfsg/books/tau/bounders/find-maximal-1d.cert on 03-Aug-2023 17:01:16.246 Built /build/1st/acl2-8.5dfsg/books/tau/bounders/find-maximal-1d.cert (4.977s) at 03-Aug-2023 17:01:21.266 Making /build/1st/acl2-8.5dfsg/books/tau/bounders/find-minimal-1d.cert on 03-Aug-2023 17:01:21.392 Built /build/1st/acl2-8.5dfsg/books/tau/bounders/find-minimal-1d.cert (4.580s) at 03-Aug-2023 17:01:26.007 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/ac-example.cert on 03-Aug-2023 17:01:26.207 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/ac-example.cert (3.982s) at 03-Aug-2023 17:01:30.226 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/adder.cert on 03-Aug-2023 17:01:30.423 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/adder.cert (6.953s) at 03-Aug-2023 17:01:37.418 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/compiler.cert on 03-Aug-2023 17:01:37.698 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/compiler.cert (8.816s) at 03-Aug-2023 17:01:46.554 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/fact.cert on 03-Aug-2023 17:01:46.783 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/fact.cert (4.530s) at 03-Aug-2023 17:01:51.355 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/insertion-sort.cert on 03-Aug-2023 17:01:51.525 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/insertion-sort.cert (5.042s) at 03-Aug-2023 17:01:56.602 Making /build/1st/acl2-8.5dfsg/books/textbook/chap10/tree.cert on 03-Aug-2023 17:01:56.798 Built /build/1st/acl2-8.5dfsg/books/textbook/chap10/tree.cert (5.413s) at 03-Aug-2023 17:02:02.250 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/compress.cert on 03-Aug-2023 17:02:02.440 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/compress.cert (6.023s) at 03-Aug-2023 17:02:08.499 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/encap.cert on 03-Aug-2023 17:02:08.686 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/encap.cert (6.902s) at 03-Aug-2023 17:02:15.626 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/how-many-soln2.cert on 03-Aug-2023 17:02:15.927 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/how-many-soln2.cert (8.367s) at 03-Aug-2023 17:02:24.354 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/summations.cert on 03-Aug-2023 17:02:24.535 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/summations.cert (7.267s) at 03-Aug-2023 17:02:31.858 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/xtr.cert on 03-Aug-2023 17:02:32.000 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/xtr.cert (6.699s) at 03-Aug-2023 17:02:38.730 Making /build/1st/acl2-8.5dfsg/books/textbook/chap3/programs.cert on 03-Aug-2023 17:02:39.000 Built /build/1st/acl2-8.5dfsg/books/textbook/chap3/programs.cert (9.023s) at 03-Aug-2023 17:02:48.070 Making /build/1st/acl2-8.5dfsg/books/textbook/chap4/solutions-program-mode.cert on 03-Aug-2023 17:02:48.264 Built /build/1st/acl2-8.5dfsg/books/textbook/chap4/solutions-program-mode.cert (20.953s) at 03-Aug-2023 17:03:09.278 Making /build/1st/acl2-8.5dfsg/books/textbook/chap5/solutions.cert on 03-Aug-2023 17:03:09.535 Built /build/1st/acl2-8.5dfsg/books/textbook/chap5/solutions.cert (7.220s) at 03-Aug-2023 17:03:16.806 Making /build/1st/acl2-8.5dfsg/books/tools/cws.cert on 03-Aug-2023 17:03:17.105 Built /build/1st/acl2-8.5dfsg/books/tools/cws.cert (5.866s) at 03-Aug-2023 17:03:22.995 Making /build/1st/acl2-8.5dfsg/books/tools/define-keyed-function.cert on 03-Aug-2023 17:03:23.190 Built /build/1st/acl2-8.5dfsg/books/tools/define-keyed-function.cert (6.218s) at 03-Aug-2023 17:03:29.463 Making /build/1st/acl2-8.5dfsg/books/tools/defined-const.cert on 03-Aug-2023 17:03:29.558 Built /build/1st/acl2-8.5dfsg/books/tools/defined-const.cert (6.765s) at 03-Aug-2023 17:03:36.362 Making /build/1st/acl2-8.5dfsg/books/tools/defttag-muffled.cert on 03-Aug-2023 17:03:36.546 Built /build/1st/acl2-8.5dfsg/books/tools/defttag-muffled.cert (5.630s) at 03-Aug-2023 17:03:42.223 Making /build/1st/acl2-8.5dfsg/books/tools/in-raw-mode.cert on 03-Aug-2023 17:03:42.411 Built /build/1st/acl2-8.5dfsg/books/tools/in-raw-mode.cert (5.594s) at 03-Aug-2023 17:03:48.050 Making /build/1st/acl2-8.5dfsg/books/tools/k-induction.cert on 03-Aug-2023 17:03:48.226 Built /build/1st/acl2-8.5dfsg/books/tools/k-induction.cert (7.253s) at 03-Aug-2023 17:03:55.519 Making /build/1st/acl2-8.5dfsg/books/tools/oracle-eval-real.cert on 03-Aug-2023 17:03:55.639 Built /build/1st/acl2-8.5dfsg/books/tools/oracle-eval-real.cert (6.308s) at 03-Aug-2023 17:04:01.955 Making /build/1st/acl2-8.5dfsg/books/tools/rewrite-with-equality.cert on 03-Aug-2023 17:04:02.099 Built /build/1st/acl2-8.5dfsg/books/tools/rewrite-with-equality.cert (17.359s) at 03-Aug-2023 17:04:19.498 Making /build/1st/acl2-8.5dfsg/books/tools/saved-errors.cert on 03-Aug-2023 17:04:19.844 Built /build/1st/acl2-8.5dfsg/books/tools/saved-errors.cert (9.471s) at 03-Aug-2023 17:04:29.358 Making /build/1st/acl2-8.5dfsg/books/tools/table-replay.cert on 03-Aug-2023 17:04:29.651 Built /build/1st/acl2-8.5dfsg/books/tools/table-replay.cert (7.374s) at 03-Aug-2023 17:04:37.074 Making /build/1st/acl2-8.5dfsg/books/tools/time-dollar-with-gc.cert on 03-Aug-2023 17:04:37.396 Built /build/1st/acl2-8.5dfsg/books/tools/time-dollar-with-gc.cert (6.554s) at 03-Aug-2023 17:04:43.998 Making /build/1st/acl2-8.5dfsg/books/tools/with-supporters-test-sub.cert on 03-Aug-2023 17:04:44.287 Built /build/1st/acl2-8.5dfsg/books/tools/with-supporters-test-sub.cert (6.182s) at 03-Aug-2023 17:04:50.506 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partition-defuns.cert on 03-Aug-2023 17:04:50.703 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partition-defuns.cert (7.627s) at 03-Aug-2023 17:04:58.370 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert on 03-Aug-2023 17:04:58.684 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/riemann-rcfn-helpers.cert (5.962s) at 03-Aug-2023 17:05:04.678 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/de-hdl/help-defuns.cert on 03-Aug-2023 17:05:05.036 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/de-hdl/help-defuns.cert (9.525s) at 03-Aug-2023 17:05:14.659 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert on 03-Aug-2023 17:05:14.876 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Exercises/Exercise1-1/Exercise1.1.cert (6.967s) at 03-Aug-2023 17:05:21.887 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert on 03-Aug-2023 17:05:22.105 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Exercises/Exercise1-3/Exercise1.3.cert (7.020s) at 03-Aug-2023 17:05:29.170 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert on 03-Aug-2023 17:05:29.524 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Generic.cert (7.400s) at 03-Aug-2023 17:05:36.959 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert on 03-Aug-2023 17:05:37.171 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Memory-Assoc.cert (10.722s) at 03-Aug-2023 17:05:47.949 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/graph/helpers.cert on 03-Aug-2023 17:05:48.247 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/graph/helpers.cert (7.321s) at 03-Aug-2023 17:05:55.607 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert on 03-Aug-2023 17:05:55.823 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/sets.cert (10.461s) at 03-Aug-2023 17:06:06.366 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert on 03-Aug-2023 17:06:06.548 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/gensym-e.cert (15.177s) at 03-Aug-2023 17:06:21.781 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert on 03-Aug-2023 17:06:21.988 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/exercises/solution6.cert (13.303s) at 03-Aug-2023 17:06:35.319 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise1.cert on 03-Aug-2023 17:06:35.499 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise1.cert (5.262s) at 03-Aug-2023 17:06:40.822 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise2.cert on 03-Aug-2023 17:06:41.050 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise2.cert (6.066s) at 03-Aug-2023 17:06:47.166 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise4a.cert on 03-Aug-2023 17:06:47.424 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise4a.cert (6.570s) at 03-Aug-2023 17:06:54.043 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise4b.cert on 03-Aug-2023 17:06:54.312 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise4b.cert (5.701s) at 03-Aug-2023 17:07:00.062 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise5.cert on 03-Aug-2023 17:07:00.244 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise5.cert (7.046s) at 03-Aug-2023 17:07:07.326 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise6a.cert on 03-Aug-2023 17:07:07.518 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise6a.cert (6.782s) at 03-Aug-2023 17:07:14.351 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise6b.cert on 03-Aug-2023 17:07:14.542 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise6b.cert (5.826s) at 03-Aug-2023 17:07:20.414 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise7a.cert on 03-Aug-2023 17:07:20.577 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise7a.cert (4.509s) at 03-Aug-2023 17:07:25.125 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise7b.cert on 03-Aug-2023 17:07:25.400 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/knuth-91/exercise7b.cert (6.210s) at 03-Aug-2023 17:07:31.698 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/sets.cert on 03-Aug-2023 17:07:32.056 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/sets.cert (9.202s) at 03-Aug-2023 17:07:41.306 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/solutions/defung.cert on 03-Aug-2023 17:07:41.562 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/solutions/defung.cert (9.598s) at 03-Aug-2023 17:07:51.207 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/pipeline/exercise.cert on 03-Aug-2023 17:07:51.520 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/pipeline/exercise.cert (7.625s) at 03-Aug-2023 17:07:59.186 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/vhdl.cert on 03-Aug-2023 17:07:59.357 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/vhdl.cert (25.077s) at 03-Aug-2023 17:08:24.506 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert on 03-Aug-2023 17:08:24.696 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/util.cert (7.792s) at 03-Aug-2023 17:08:32.522 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert on 03-Aug-2023 17:08:32.797 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/gensym-e.cert (15.288s) at 03-Aug-2023 17:08:48.144 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert on 03-Aug-2023 17:08:48.352 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/alist-thms.cert (7.365s) at 03-Aug-2023 17:08:55.754 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert on 03-Aug-2023 17:08:55.987 Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/nth-thms.cert (6.205s) at 03-Aug-2023 17:09:02.230 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert on 03-Aug-2023 17:09:02.451 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/top/defun-weak-sk.cert (6.739s) at 03-Aug-2023 17:09:09.232 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert on 03-Aug-2023 17:09:09.417 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/inst.cert (5.691s) at 03-Aug-2023 17:09:15.159 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert on 03-Aug-2023 17:09:15.446 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/top/det-macros.cert (7.562s) at 03-Aug-2023 17:09:23.054 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert on 03-Aug-2023 17:09:23.145 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/inst.cert (5.366s) at 03-Aug-2023 17:09:28.566 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert on 03-Aug-2023 17:09:28.669 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/top/non-det-macros.cert (8.574s) at 03-Aug-2023 17:09:37.294 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/term.cert on 03-Aug-2023 17:09:37.439 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/term.cert (8.265s) at 03-Aug-2023 17:09:45.750 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert on 03-Aug-2023 17:09:46.063 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/defpun-original.cert (13.333s) at 03-Aug-2023 17:09:59.458 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert on 03-Aug-2023 17:09:59.673 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/tjvm.cert (21.511s) at 03-Aug-2023 17:10:21.262 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-mgr.cert on 03-Aug-2023 17:10:21.620 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-mgr.cert (28.750s) at 03-Aug-2023 17:10:50.468 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat.cert on 03-Aug-2023 17:10:50.747 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat.cert (21.530s) at 03-Aug-2023 17:11:12.374 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/bad-def.cert on 03-Aug-2023 17:11:12.980 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/bad-def.cert (6.525s) at 03-Aug-2023 17:11:19.570 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/bad-def1.cert on 03-Aug-2023 17:11:19.787 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/bad-def1.cert (6.610s) at 03-Aug-2023 17:11:26.434 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/defpr.cert on 03-Aug-2023 17:11:26.612 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/defpr.cert (9.957s) at 03-Aug-2023 17:11:36.626 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/fix.cert on 03-Aug-2023 17:11:36.817 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/fix.cert (5.828s) at 03-Aug-2023 17:11:42.670 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/primitive.cert on 03-Aug-2023 17:11:42.964 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/primitive.cert (9.542s) at 03-Aug-2023 17:11:52.564 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/tail.cert on 03-Aug-2023 17:11:52.683 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-primrec/support/tail.cert (7.264s) at 03-Aug-2023 17:11:59.956 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert on 03-Aug-2023 17:12:00.164 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering-original.cert (12.174s) at 03-Aug-2023 17:12:12.394 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert on 03-Aug-2023 17:12:12.825 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/finite-set-theory/total-ordering.cert (8.588s) at 03-Aug-2023 17:12:21.470 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert on 03-Aug-2023 17:12:21.763 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/records/records-original.cert (39.959s) at 03-Aug-2023 17:13:01.787 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert on 03-Aug-2023 17:13:02.047 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/manolios-kaufmann/support/sorting/perm.cert (7.613s) at 03-Aug-2023 17:13:09.702 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert on 03-Aug-2023 17:13:09.888 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-theory.cert (6.569s) at 03-Aug-2023 17:13:16.494 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert on 03-Aug-2023 17:13:16.645 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-perez-sancho/support/Adleman.cert (16.292s) at 03-Aug-2023 17:13:33.026 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert on 03-Aug-2023 17:13:33.313 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-2.cert (9.253s) at 03-Aug-2023 17:13:42.608 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert on 03-Aug-2023 17:13:42.879 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/upol-1.cert (9.708s) at 03-Aug-2023 17:13:52.634 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert on 03-Aug-2023 17:13:52.922 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/term.cert (7.609s) at 03-Aug-2023 17:14:00.590 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert on 03-Aug-2023 17:14:00.784 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/ordinal-ordering.cert (8.837s) at 03-Aug-2023 17:14:09.666 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert on 03-Aug-2023 17:14:10.009 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-dags/support/defpun.cert (14.602s) at 03-Aug-2023 17:14:24.674 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert on 03-Aug-2023 17:14:25.002 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/basic.cert (19.681s) at 03-Aug-2023 17:14:44.738 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/austel/support/abs-type.cert on 03-Aug-2023 17:14:45.086 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/austel/support/abs-type.cert (15.225s) at 03-Aug-2023 17:15:00.402 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert on 03-Aug-2023 17:15:00.544 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/alist2.cert (10.601s) at 03-Aug-2023 17:15:11.189 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert on 03-Aug-2023 17:15:11.476 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/cowles-gamboa-van-baalen_matrix/support/array2.cert (13.660s) at 03-Aug-2023 17:15:25.206 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert on 03-Aug-2023 17:15:25.455 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/total-order.cert (6.599s) at 03-Aug-2023 17:15:32.093 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/bis.cert on 03-Aug-2023 17:15:32.325 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/bis.cert (6.913s) at 03-Aug-2023 17:15:39.247 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/sumners/support/n2n.cert on 03-Aug-2023 17:15:39.456 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/sumners/support/n2n.cert (17.164s) at 03-Aug-2023 17:15:56.658 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/sumners/support/simple.cert on 03-Aug-2023 17:15:56.853 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/sumners/support/simple.cert (7.947s) at 03-Aug-2023 17:16:04.839 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1.cert on 03-Aug-2023 17:16:05.151 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/cowles-gamboa/support/WyoM1.cert (13.493s) at 03-Aug-2023 17:16:18.707 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/instance.cert on 03-Aug-2023 17:16:19.004 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/instance.cert (14.387s) at 03-Aug-2023 17:16:33.450 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/primitives.cert on 03-Aug-2023 17:16:33.752 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/primitives.cert (16.863s) at 03-Aug-2023 17:16:50.670 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/gameiro-manolios/support/nth-thms.cert on 03-Aug-2023 17:16:51.075 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/gameiro-manolios/support/nth-thms.cert (5.460s) at 03-Aug-2023 17:16:56.591 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theories.cert on 03-Aug-2023 17:16:56.952 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theories.cert (15.721s) at 03-Aug-2023 17:17:12.726 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert on 03-Aug-2023 17:17:13.000 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/det-macros.cert (6.819s) at 03-Aug-2023 17:17:19.874 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert on 03-Aug-2023 17:17:20.121 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/total-order.cert (4.562s) at 03-Aug-2023 17:17:24.722 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert on 03-Aug-2023 17:17:24.908 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/seq.cert (7.013s) at 03-Aug-2023 17:17:31.947 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert on 03-Aug-2023 17:17:32.128 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/roach-fraij/support/roach-fraij-script.cert (14.210s) at 03-Aug-2023 17:17:46.414 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/ruiz-et-al/support/lists.cert on 03-Aug-2023 17:17:46.612 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/ruiz-et-al/support/lists.cert (12.115s) at 03-Aug-2023 17:17:58.762 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert on 03-Aug-2023 17:17:59.042 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/predicatesNCie.cert (19.270s) at 03-Aug-2023 17:18:18.373 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/switch.cert on 03-Aug-2023 17:18:18.629 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/switch.cert (7.780s) at 03-Aug-2023 17:18:26.463 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/lists/list-exports.cert on 03-Aug-2023 17:18:26.643 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/lists/list-exports.cert (6.468s) at 03-Aug-2023 17:18:33.147 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert on 03-Aug-2023 17:18:33.445 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/syntax/syn-pkg.cert (6.150s) at 03-Aug-2023 17:18:39.638 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert on 03-Aug-2023 17:18:40.033 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/lists/mv-nth.cert (9.729s) at 03-Aug-2023 17:18:49.798 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert on 03-Aug-2023 17:18:50.227 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns-exports.cert (4.646s) at 03-Aug-2023 17:18:54.934 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/cons.cert on 03-Aug-2023 17:18:55.323 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/cons.cert (6.602s) at 03-Aug-2023 17:19:01.962 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert on 03-Aug-2023 17:19:02.170 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/coe-fld.cert (9.227s) at 03-Aug-2023 17:19:11.473 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert on 03-Aug-2023 17:19:11.673 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/futermino.cert (6.575s) at 03-Aug-2023 17:19:18.294 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/greve/nary/nary.cert on 03-Aug-2023 17:19:18.604 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/greve/nary/nary.cert (21.710s) at 03-Aug-2023 17:19:40.402 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/greve/nary/nth-rules.cert on 03-Aug-2023 17:19:40.635 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/greve/nary/nth-rules.cert (14.342s) at 03-Aug-2023 17:19:55.059 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/acl2.cert on 03-Aug-2023 17:19:55.267 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/acl2.cert (10.002s) at 03-Aug-2023 17:20:05.307 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/bdd.cert on 03-Aug-2023 17:20:05.545 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/bdd.cert (19.787s) at 03-Aug-2023 17:20:25.406 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/sat.cert on 03-Aug-2023 17:20:25.584 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/hunt-reeber/support/sat.cert (7.752s) at 03-Aug-2023 17:20:33.386 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/austel.cert on 03-Aug-2023 17:20:33.582 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/austel.cert (6.238s) at 03-Aug-2023 17:20:39.874 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve1.cert on 03-Aug-2023 17:20:40.096 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve1.cert (7.126s) at 03-Aug-2023 17:20:47.274 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve2.cert on 03-Aug-2023 17:20:47.447 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve2.cert (7.007s) at 03-Aug-2023 17:20:54.499 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve3.cert on 03-Aug-2023 17:20:54.788 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/greve3.cert (6.321s) at 03-Aug-2023 17:21:01.150 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert on 03-Aug-2023 17:21:01.333 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall.cert (7.988s) at 03-Aug-2023 17:21:09.382 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert on 03-Aug-2023 17:21:09.622 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs1-iff.cert (4.502s) at 03-Aug-2023 17:21:14.154 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs1.cert on 03-Aug-2023 17:21:14.320 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs1.cert (4.088s) at 03-Aug-2023 17:21:18.443 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs2.cert on 03-Aug-2023 17:21:18.622 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/rhs2.cert (3.678s) at 03-Aug-2023 17:21:22.338 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/smith1.cert on 03-Aug-2023 17:21:22.532 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/smith1.cert (4.311s) at 03-Aug-2023 17:21:26.875 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/sumners1.cert on 03-Aug-2023 17:21:27.033 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/sumners1.cert (5.829s) at 03-Aug-2023 17:21:32.883 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/warnings.cert on 03-Aug-2023 17:21:33.123 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/warnings.cert (5.247s) at 03-Aug-2023 17:21:38.383 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert on 03-Aug-2023 17:21:38.549 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/pike-shields-matthews/core_verifier/books/symbol-manip.cert (3.286s) at 03-Aug-2023 17:21:41.846 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/rager/support/ptest-fib.cert on 03-Aug-2023 17:21:42.012 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/rager/support/ptest-fib.cert (4.713s) at 03-Aug-2023 17:21:46.775 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/rager/support/ptest-if-normalization.cert on 03-Aug-2023 17:21:46.950 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/rager/support/ptest-if-normalization.cert (15.707s) at 03-Aug-2023 17:22:02.726 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/ray/tail/exists.cert on 03-Aug-2023 17:22:02.878 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/ray/tail/exists.cert (5.691s) at 03-Aug-2023 17:22:08.606 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/ray/tail/forall.cert on 03-Aug-2023 17:22:08.789 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/ray/tail/forall.cert (4.223s) at 03-Aug-2023 17:22:13.026 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert on 03-Aug-2023 17:22:13.141 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-interfaces.cert (2.906s) at 03-Aug-2023 17:22:16.066 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert on 03-Aug-2023 17:22:16.251 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/schmaltz-borrione/GeNoC-support/GeNoC-nodeset.cert (6.134s) at 03-Aug-2023 17:22:22.414 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/cowles-et-al/support/greve/defpun.cert on 03-Aug-2023 17:22:22.594 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/cowles-et-al/support/greve/defpun.cert (11.759s) at 03-Aug-2023 17:22:34.422 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert on 03-Aug-2023 17:22:34.796 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/dillinger-et-al/code/rewrite-code.cert (20.235s) at 03-Aug-2023 17:22:55.134 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/bash.cert on 03-Aug-2023 17:22:55.324 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/bash.cert (8.946s) at 03-Aug-2023 17:23:04.326 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/gen.cert on 03-Aug-2023 17:23:04.516 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/gen.cert (5.622s) at 03-Aug-2023 17:23:10.174 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/rimlinger/support/Rimlinger.cert on 03-Aug-2023 17:23:10.366 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/rimlinger/support/Rimlinger.cert (38.029s) at 03-Aug-2023 17:23:48.494 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert on 03-Aug-2023 17:23:48.718 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-interfaces.cert (4.594s) at 03-Aug-2023 17:23:53.354 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert on 03-Aug-2023 17:23:53.529 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/generic-modules/GeNoC-nodeset.cert (3.770s) at 03-Aug-2023 17:23:57.334 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert on 03-Aug-2023 17:23:57.510 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/hardin/deque-stobj/deque-stobj.cert (19.429s) at 03-Aug-2023 17:24:16.978 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/liu/support/mylet.cert on 03-Aug-2023 17:24:17.158 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/liu/support/mylet.cert (5.039s) at 03-Aug-2023 17:24:22.239 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/sumners/support/kas.cert on 03-Aug-2023 17:24:22.422 Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2009/sumners/support/kas.cert (1554.518s) at 03-Aug-2023 17:50:17.238 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert on 03-Aug-2023 17:50:18.583 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/vandenbroek-schmaltz/GeNoC/generic-modules/types.cert (29.396s) at 03-Aug-2023 17:50:48.027 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert on 03-Aug-2023 17:50:48.221 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/verbeek-schmaltz/verbeek/instantiations/genoc/simple-ct-global/sets.cert (3.449s) at 03-Aug-2023 17:50:51.706 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert on 03-Aug-2023 17:50:51.850 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/krug-et-al/support/Memory/memory-raw.cert (3.352s) at 03-Aug-2023 17:50:55.245 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 on 03-Aug-2023 17:50:55.419 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert0 (3.476s) at 03-Aug-2023 17:50:58.931 Making /build/1st/acl2-8.5dfsg/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert on 03-Aug-2023 17:50:59.049 Built /build/1st/acl2-8.5dfsg/books/workshops/2013/hardin-hardin/support/integer-listp-theorems.cert (2.823s) at 03-Aug-2023 17:51:01.886 Making /build/1st/acl2-8.5dfsg/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert on 03-Aug-2023 17:51:02.021 Built /build/1st/acl2-8.5dfsg/books/workshops/2013/joosten-van-gastel-schmaltz/books/perm.cert (3.009s) at 03-Aug-2023 17:51:05.046 Making /build/1st/acl2-8.5dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.cert on 03-Aug-2023 17:51:05.162 Built /build/1st/acl2-8.5dfsg/books/workshops/2013/van-gastel-schmaltz/books/perm.cert (4.026s) at 03-Aug-2023 17:51:09.210 Making /build/1st/acl2-8.5dfsg/books/workshops/2017/kaufmann-swords/support/intro.cert on 03-Aug-2023 17:51:09.379 Built /build/1st/acl2-8.5dfsg/books/workshops/2017/kaufmann-swords/support/intro.cert (3.715s) at 03-Aug-2023 17:51:13.110 Making /build/1st/acl2-8.5dfsg/books/workshops/2018/mehta/bounded-nat-listp.cert on 03-Aug-2023 17:51:13.262 Built /build/1st/acl2-8.5dfsg/books/workshops/2018/mehta/bounded-nat-listp.cert (3.434s) at 03-Aug-2023 17:51:16.750 Making /build/1st/acl2-8.5dfsg/books/workshops/2018/mehta/generate-index-list.cert on 03-Aug-2023 17:51:16.938 Built /build/1st/acl2-8.5dfsg/books/workshops/2018/mehta/generate-index-list.cert (2.807s) at 03-Aug-2023 17:51:19.755 Making /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-total-order.cert on 03-Aug-2023 17:51:19.832 Built /build/1st/acl2-8.5dfsg/books/ordinals/ordinal-total-order.cert (8.121s) at 03-Aug-2023 17:51:27.974 Making /build/1st/acl2-8.5dfsg/books/meta/term-lemmas.cert on 03-Aug-2023 17:51:28.075 Built /build/1st/acl2-8.5dfsg/books/meta/term-lemmas.cert (3.327s) at 03-Aug-2023 17:51:31.430 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/ground-zero.cert on 03-Aug-2023 17:51:31.584 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/ground-zero.cert (3.443s) at 03-Aug-2023 17:51:35.054 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/basic-arithmetic.cert on 03-Aug-2023 17:51:35.232 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/basic-arithmetic.cert (4.627s) at 03-Aug-2023 17:51:39.902 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/remove-weak-inequalities.cert on 03-Aug-2023 17:51:40.197 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/remove-weak-inequalities.cert (5.562s) at 03-Aug-2023 17:51:45.798 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/rationalp.cert on 03-Aug-2023 17:51:45.929 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/rationalp.cert (5.366s) at 03-Aug-2023 17:51:51.326 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/common-factor-defuns.cert on 03-Aug-2023 17:51:51.494 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/common-factor-defuns.cert (8.890s) at 03-Aug-2023 17:52:00.438 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/complex-rationalp.cert on 03-Aug-2023 17:52:00.624 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/arithmetic/complex-rationalp.cert (4.150s) at 03-Aug-2023 17:52:04.814 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logior1.cert on 03-Aug-2023 17:52:05.059 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/support/logior1.cert (7.098s) at 03-Aug-2023 17:52:12.202 Making /build/1st/acl2-8.5dfsg/books/system/termp.cert on 03-Aug-2023 17:52:12.413 Built /build/1st/acl2-8.5dfsg/books/system/termp.cert (13.209s) at 03-Aug-2023 17:52:25.672 Making /build/1st/acl2-8.5dfsg/books/clause-processors/join-thms.cert on 03-Aug-2023 17:52:25.811 Built /build/1st/acl2-8.5dfsg/books/clause-processors/join-thms.cert (12.057s) at 03-Aug-2023 17:52:37.922 Making /build/1st/acl2-8.5dfsg/books/system/meta-extract.cert on 03-Aug-2023 17:52:38.102 Built /build/1st/acl2-8.5dfsg/books/system/meta-extract.cert (8.633s) at 03-Aug-2023 17:52:46.818 Making /build/1st/acl2-8.5dfsg/books/hacking/hacker.cert on 03-Aug-2023 17:52:47.027 Built /build/1st/acl2-8.5dfsg/books/hacking/hacker.cert (10.091s) at 03-Aug-2023 17:52:57.246 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/basic-arithmetic.cert on 03-Aug-2023 17:52:57.568 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/basic-arithmetic.cert (6.775s) at 03-Aug-2023 17:53:04.402 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/rationalp.cert on 03-Aug-2023 17:53:04.588 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/rationalp.cert (9.058s) at 03-Aug-2023 17:53:13.692 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/common-factor-defuns.cert on 03-Aug-2023 17:53:13.879 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/common-factor-defuns.cert (9.777s) at 03-Aug-2023 17:53:23.710 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/complex-rationalp.cert on 03-Aug-2023 17:53:23.948 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/arithmetic/complex-rationalp.cert (5.868s) at 03-Aug-2023 17:53:29.862 Making /build/1st/acl2-8.5dfsg/books/bdd/alu.cert on 03-Aug-2023 17:53:30.095 Built /build/1st/acl2-8.5dfsg/books/bdd/alu.cert (14.256s) at 03-Aug-2023 17:53:44.402 Making /build/1st/acl2-8.5dfsg/books/bdd/cbf.cert on 03-Aug-2023 17:53:44.594 Built /build/1st/acl2-8.5dfsg/books/bdd/cbf.cert (11.677s) at 03-Aug-2023 17:53:56.315 Making /build/1st/acl2-8.5dfsg/books/bdd/hamming.cert on 03-Aug-2023 17:53:56.571 Built /build/1st/acl2-8.5dfsg/books/bdd/hamming.cert (8.082s) at 03-Aug-2023 17:54:04.694 Making /build/1st/acl2-8.5dfsg/books/bdd/pg-theory.cert on 03-Aug-2023 17:54:04.849 Built /build/1st/acl2-8.5dfsg/books/bdd/pg-theory.cert (11.141s) at 03-Aug-2023 17:54:16.050 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/lrat-checker.cert on 03-Aug-2023 17:54:16.301 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/lrat-checker.cert (22.580s) at 03-Aug-2023 17:54:38.966 Making /build/1st/acl2-8.5dfsg/books/sorting/term-ordered-perms.cert on 03-Aug-2023 17:54:39.159 Built /build/1st/acl2-8.5dfsg/books/sorting/term-ordered-perms.cert (8.438s) at 03-Aug-2023 17:54:47.634 Making /build/1st/acl2-8.5dfsg/books/sorting/convert-perm-to-how-many.cert on 03-Aug-2023 17:54:47.829 Built /build/1st/acl2-8.5dfsg/books/sorting/convert-perm-to-how-many.cert (6.613s) at 03-Aug-2023 17:54:54.494 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/perm-append.cert on 03-Aug-2023 17:54:54.747 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/perm-append.cert (5.355s) at 03-Aug-2023 17:55:00.182 Making /build/1st/acl2-8.5dfsg/books/clause-processors/null-fail-hints.cert on 03-Aug-2023 17:55:00.351 Built /build/1st/acl2-8.5dfsg/books/clause-processors/null-fail-hints.cert (5.453s) at 03-Aug-2023 17:55:05.842 Making /build/1st/acl2-8.5dfsg/books/coi/adviser/adviser-pkg.cert on 03-Aug-2023 17:55:06.001 Built /build/1st/acl2-8.5dfsg/books/coi/adviser/adviser-pkg.cert (4.831s) at 03-Aug-2023 17:55:10.875 Making /build/1st/acl2-8.5dfsg/books/coi/syntax/auxilary.cert on 03-Aug-2023 17:55:11.054 Built /build/1st/acl2-8.5dfsg/books/coi/syntax/auxilary.cert (5.323s) at 03-Aug-2023 17:55:16.498 Making /build/1st/acl2-8.5dfsg/books/coi/syntax/defevaluator.cert on 03-Aug-2023 17:55:16.712 Built /build/1st/acl2-8.5dfsg/books/coi/syntax/defevaluator.cert (4.654s) at 03-Aug-2023 17:55:21.451 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/ground-zero.cert on 03-Aug-2023 17:55:21.654 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/ground-zero.cert (4.120s) at 03-Aug-2023 17:55:25.823 Making /build/1st/acl2-8.5dfsg/books/coi/defung/map-ec-call.cert on 03-Aug-2023 17:55:26.068 Built /build/1st/acl2-8.5dfsg/books/coi/defung/map-ec-call.cert (8.699s) at 03-Aug-2023 17:55:34.805 Making /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/intermediate-program.cert on 03-Aug-2023 17:55:34.946 Built /build/1st/acl2-8.5dfsg/books/defexec/other-apps/qsort/intermediate-program.cert (7.861s) at 03-Aug-2023 17:55:42.816 Making /build/1st/acl2-8.5dfsg/books/system/subst-var.cert on 03-Aug-2023 17:55:42.950 Built /build/1st/acl2-8.5dfsg/books/system/subst-var.cert (8.017s) at 03-Aug-2023 17:55:51.025 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keyword-value-lists2.cert on 03-Aug-2023 17:55:51.189 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keyword-value-lists2.cert (3.482s) at 03-Aug-2023 17:55:54.698 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/intern-in-package-of-symbol.cert on 03-Aug-2023 17:55:54.857 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/intern-in-package-of-symbol.cert (3.461s) at 03-Aug-2023 17:55:58.366 Making /build/1st/acl2-8.5dfsg/books/demos/register-invariant-risk.cert on 03-Aug-2023 17:55:58.563 Built /build/1st/acl2-8.5dfsg/books/demos/register-invariant-risk.cert (3.855s) at 03-Aug-2023 17:56:02.454 Making /build/1st/acl2-8.5dfsg/books/sorting/ordered-perms.cert on 03-Aug-2023 17:56:02.585 Built /build/1st/acl2-8.5dfsg/books/sorting/ordered-perms.cert (3.993s) at 03-Aug-2023 17:56:06.602 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/nthcdr.cert on 03-Aug-2023 17:56:06.770 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/nthcdr.cert (5.480s) at 03-Aug-2023 17:56:12.306 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/intersection-equal.cert on 03-Aug-2023 17:56:12.464 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/intersection-equal.cert (4.124s) at 03-Aug-2023 17:56:16.630 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/imagpart.cert on 03-Aug-2023 17:56:16.748 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/imagpart.cert (4.730s) at 03-Aug-2023 17:56:21.542 Making /build/1st/acl2-8.5dfsg/books/kestrel/algorithm-theories/top.cert on 03-Aug-2023 17:56:21.677 Built /build/1st/acl2-8.5dfsg/books/kestrel/algorithm-theories/top.cert (3.939s) at 03-Aug-2023 17:56:25.654 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq.cert on 03-Aug-2023 17:56:25.832 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq.cert (3.714s) at 03-Aug-2023 17:56:29.582 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup.cert on 03-Aug-2023 17:56:29.759 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup.cert (4.465s) at 03-Aug-2023 17:56:34.270 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-required.cert on 03-Aug-2023 17:56:34.385 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-required.cert (4.641s) at 03-Aug-2023 17:56:39.046 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-safe.cert on 03-Aug-2023 17:56:39.220 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-safe.cert (10.339s) at 03-Aug-2023 17:56:49.599 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal-safe.cert on 03-Aug-2023 17:56:49.755 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal-safe.cert (5.271s) at 03-Aug-2023 17:56:55.070 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-safe.cert on 03-Aug-2023 17:56:55.224 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-safe.cert (5.955s) at 03-Aug-2023 17:57:01.206 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-lst.cert on 03-Aug-2023 17:57:01.451 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-eq-lst.cert (8.582s) at 03-Aug-2023 17:57:10.123 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal-lst.cert on 03-Aug-2023 17:57:10.284 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/lookup-equal-lst.cert (8.763s) at 03-Aug-2023 17:57:19.102 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/macro-args.cert on 03-Aug-2023 17:57:19.324 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/macro-args.cert (10.938s) at 03-Aug-2023 17:57:30.322 Making /build/1st/acl2-8.5dfsg/books/kestrel/untranslated-terms/add-conjunct-to-uterm.cert on 03-Aug-2023 17:57:30.542 Built /build/1st/acl2-8.5dfsg/books/kestrel/untranslated-terms/add-conjunct-to-uterm.cert (5.747s) at 03-Aug-2023 17:57:36.342 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/world.cert on 03-Aug-2023 17:57:36.709 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/world.cert (14.061s) at 03-Aug-2023 17:57:50.842 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/conjunctions-and-disjunctions.cert on 03-Aug-2023 17:57:50.985 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/conjunctions-and-disjunctions.cert (12.245s) at 03-Aug-2023 17:58:03.282 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booland.cert on 03-Aug-2023 17:58:03.595 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booland.cert (8.781s) at 03-Aug-2023 17:58:12.434 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolor.cert on 03-Aug-2023 17:58:12.717 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolor.cert (7.670s) at 03-Aug-2023 17:58:20.434 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolif.cert on 03-Aug-2023 17:58:20.773 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/boolif.cert (7.145s) at 03-Aug-2023 17:58:27.974 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/myif.cert on 03-Aug-2023 17:58:28.268 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/myif.cert (6.873s) at 03-Aug-2023 17:58:35.183 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/negate-terms.cert on 03-Aug-2023 17:58:35.512 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/negate-terms.cert (7.071s) at 03-Aug-2023 17:58:42.634 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/repeat.cert on 03-Aug-2023 17:58:42.890 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/repeat.cert (8.695s) at 03-Aug-2023 17:58:51.627 Making /build/1st/acl2-8.5dfsg/books/kestrel/untranslated-terms/helpers.cert on 03-Aug-2023 17:58:51.964 Built /build/1st/acl2-8.5dfsg/books/kestrel/untranslated-terms/helpers.cert (11.844s) at 03-Aug-2023 17:59:03.882 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/imported-symbols-theorems.cert on 03-Aug-2023 17:59:04.161 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/imported-symbols-theorems.cert (7.276s) at 03-Aug-2023 17:59:11.490 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-and-nice.cert on 03-Aug-2023 17:59:11.871 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-and-nice.cert (9.230s) at 03-Aug-2023 17:59:21.158 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/restore-mv-in-branches.cert on 03-Aug-2023 17:59:21.503 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/restore-mv-in-branches.cert (10.286s) at 03-Aug-2023 17:59:31.854 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/dargp-less-than.cert on 03-Aug-2023 17:59:32.159 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/dargp-less-than.cert (9.053s) at 03-Aug-2023 17:59:41.266 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/list-sets.cert on 03-Aug-2023 17:59:41.452 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/list-sets.cert (9.166s) at 03-Aug-2023 17:59:50.734 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/unguarded-built-ins.cert on 03-Aug-2023 17:59:51.065 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/unguarded-built-ins.cert (12.775s) at 03-Aug-2023 18:00:03.918 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booleans.cert on 03-Aug-2023 18:00:04.192 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booleans.cert (10.291s) at 03-Aug-2023 18:00:14.542 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/repeat-tail.cert on 03-Aug-2023 18:00:14.859 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/repeat-tail.cert (8.630s) at 03-Aug-2023 18:00:23.546 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/byte-listp.cert on 03-Aug-2023 18:00:23.796 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/byte-listp.cert (9.587s) at 03-Aug-2023 18:00:33.430 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp-of-repeat.cert on 03-Aug-2023 18:00:33.701 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp-of-repeat.cert (8.203s) at 03-Aug-2023 18:00:41.970 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booleans2.cert on 03-Aug-2023 18:00:42.317 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/booleans2.cert (7.898s) at 03-Aug-2023 18:00:50.254 Making /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/bit-listp-rules.cert on 03-Aug-2023 18:00:50.608 Built /build/1st/acl2-8.5dfsg/books/kestrel/bv-lists/bit-listp-rules.cert (7.711s) at 03-Aug-2023 18:00:58.366 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/take2.cert on 03-Aug-2023 18:00:58.731 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/take2.cert (9.818s) at 03-Aug-2023 18:01:08.599 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-equal-dollar2.cert on 03-Aug-2023 18:01:08.850 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-equal-dollar2.cert (6.767s) at 03-Aug-2023 18:01:15.674 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-same.cert on 03-Aug-2023 18:01:16.000 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-same.cert (5.639s) at 03-Aug-2023 18:01:21.698 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert on 03-Aug-2023 18:01:21.861 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/meta-iplus-equal.cert (21.323s) at 03-Aug-2023 18:01:43.223 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/equivs.cert on 03-Aug-2023 18:01:43.512 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/equivs.cert (7.337s) at 03-Aug-2023 18:01:50.906 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/supporting-functions.cert on 03-Aug-2023 18:01:51.193 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/supporting-functions.cert (9.500s) at 03-Aug-2023 18:02:00.758 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/r1cs/lift-r1cs-rule-lists.cert on 03-Aug-2023 18:02:01.023 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/r1cs/lift-r1cs-rule-lists.cert (7.190s) at 03-Aug-2023 18:02:08.266 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/basic-rules.cert on 03-Aug-2023 18:02:08.514 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/basic-rules.cert (5.637s) at 03-Aug-2023 18:02:14.202 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/state.cert on 03-Aug-2023 18:02:14.512 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/state.cert (10.630s) at 03-Aug-2023 18:02:25.242 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/fields.cert on 03-Aug-2023 18:02:25.549 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/fields.cert (7.964s) at 03-Aug-2023 18:02:33.574 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/descriptors.cert on 03-Aug-2023 18:02:33.763 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/descriptors.cert (9.718s) at 03-Aug-2023 18:02:43.522 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-utilities.cert on 03-Aug-2023 18:02:43.755 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/string-utilities.cert (8.582s) at 03-Aug-2023 18:02:52.398 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/include-book-dir-dollar.cert on 03-Aug-2023 18:02:52.567 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/include-book-dir-dollar.cert (5.750s) at 03-Aug-2023 18:02:58.362 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-same-eql.cert on 03-Aug-2023 18:02:58.717 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/all-same-eql.cert (5.791s) at 03-Aug-2023 18:03:04.570 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep.cert on 03-Aug-2023 18:03:04.732 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subsequencep.cert (3.865s) at 03-Aug-2023 18:03:08.622 Making /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/reconstruct-lets-in-term.cert on 03-Aug-2023 18:03:08.753 Built /build/1st/acl2-8.5dfsg/books/kestrel/terms-light/reconstruct-lets-in-term.cert (3.971s) at 03-Aug-2023 18:03:12.774 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/map-code-char.cert on 03-Aug-2023 18:03:13.012 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/map-code-char.cert (4.335s) at 03-Aug-2023 18:03:17.390 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/minelem.cert on 03-Aug-2023 18:03:17.607 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/minelem.cert (5.680s) at 03-Aug-2023 18:03:23.334 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/call-script.cert on 03-Aug-2023 18:03:23.510 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/call-script.cert (5.248s) at 03-Aug-2023 18:03:28.802 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-tuple.cert on 03-Aug-2023 18:03:28.950 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-tuple.cert (4.308s) at 03-Aug-2023 18:03:33.290 Making /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help-test.cert on 03-Aug-2023 18:03:33.430 Built /build/1st/acl2-8.5dfsg/books/make-event/acl2x-help-test.cert (3.899s) at 03-Aug-2023 18:03:37.382 Making /build/1st/acl2-8.5dfsg/books/make-event/defconst-fast-examples.cert on 03-Aug-2023 18:03:37.494 Built /build/1st/acl2-8.5dfsg/books/make-event/defconst-fast-examples.cert (3.698s) at 03-Aug-2023 18:03:41.214 Making /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test-1.cert on 03-Aug-2023 18:03:41.357 Built /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test-1.cert (4.335s) at 03-Aug-2023 18:03:45.734 Making /build/1st/acl2-8.5dfsg/books/make-event/stobj-test.cert on 03-Aug-2023 18:03:45.891 Built /build/1st/acl2-8.5dfsg/books/make-event/stobj-test.cert (4.840s) at 03-Aug-2023 18:03:50.783 Making /build/1st/acl2-8.5dfsg/books/misc/dead-events.cert on 03-Aug-2023 18:03:50.991 Built /build/1st/acl2-8.5dfsg/books/misc/dead-events.cert (3.817s) at 03-Aug-2023 18:03:54.848 Making /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/sub1.cert on 03-Aug-2023 18:03:55.058 Built /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/sub1.cert (4.960s) at 03-Aug-2023 18:04:00.031 Making /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/sub2.cert on 03-Aug-2023 18:04:00.212 Built /build/1st/acl2-8.5dfsg/books/misc/hidden-defpkg-checks/sub2.cert (3.941s) at 03-Aug-2023 18:04:04.199 Making /build/1st/acl2-8.5dfsg/books/models/jvm/guard-verified-m1/good-statep.cert on 03-Aug-2023 18:04:04.384 Built /build/1st/acl2-8.5dfsg/books/models/jvm/guard-verified-m1/good-statep.cert (138.999s) at 03-Aug-2023 18:06:23.490 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert on 03-Aug-2023 18:06:23.628 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-append.cert (7.550s) at 03-Aug-2023 18:06:31.230 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert on 03-Aug-2023 18:06:31.398 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/mesh-make-partition.cert (3.476s) at 03-Aug-2023 18:06:34.906 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 03-Aug-2023 18:06:35.046 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (3.497s) at 03-Aug-2023 18:06:38.581 Making /build/1st/acl2-8.5dfsg/books/tools/types-misc.cert on 03-Aug-2023 18:06:38.730 Built /build/1st/acl2-8.5dfsg/books/tools/types-misc.cert (5.748s) at 03-Aug-2023 18:06:44.535 Making /build/1st/acl2-8.5dfsg/books/projects/codewalker/simplify-under-hyps.cert on 03-Aug-2023 18:06:44.697 Built /build/1st/acl2-8.5dfsg/books/projects/codewalker/simplify-under-hyps.cert (8.291s) at 03-Aug-2023 18:06:53.042 Making /build/1st/acl2-8.5dfsg/books/projects/equational/unification.cert on 03-Aug-2023 18:06:53.207 Built /build/1st/acl2-8.5dfsg/books/projects/equational/unification.cert (9.654s) at 03-Aug-2023 18:07:02.902 Making /build/1st/acl2-8.5dfsg/books/sorting/equisort.cert on 03-Aug-2023 18:07:03.156 Built /build/1st/acl2-8.5dfsg/books/sorting/equisort.cert (5.021s) at 03-Aug-2023 18:07:08.234 Making /build/1st/acl2-8.5dfsg/books/sorting/equisort2.cert on 03-Aug-2023 18:07:08.389 Built /build/1st/acl2-8.5dfsg/books/sorting/equisort2.cert (4.470s) at 03-Aug-2023 18:07:12.898 Making /build/1st/acl2-8.5dfsg/books/sorting/equisort3.cert on 03-Aug-2023 18:07:13.062 Built /build/1st/acl2-8.5dfsg/books/sorting/equisort3.cert (3.603s) at 03-Aug-2023 18:07:16.695 Making /build/1st/acl2-8.5dfsg/books/projects/legacy-defrstobj/array-lemmas.cert on 03-Aug-2023 18:07:16.817 Built /build/1st/acl2-8.5dfsg/books/projects/legacy-defrstobj/array-lemmas.cert (5.285s) at 03-Aug-2023 18:07:22.151 Making /build/1st/acl2-8.5dfsg/books/projects/pltpa/chk-jacm-proveall.cert on 03-Aug-2023 18:07:22.362 Built /build/1st/acl2-8.5dfsg/books/projects/pltpa/chk-jacm-proveall.cert (4.949s) at 03-Aug-2023 18:07:27.353 Making /build/1st/acl2-8.5dfsg/books/projects/pltpa/chk-standard-proveall.cert on 03-Aug-2023 18:07:27.603 Built /build/1st/acl2-8.5dfsg/books/projects/pltpa/chk-standard-proveall.cert (4.583s) at 03-Aug-2023 18:07:32.223 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/truth-monotone.cert on 03-Aug-2023 18:07:32.381 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/truth-monotone.cert (3.547s) at 03-Aug-2023 18:07:35.971 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert on 03-Aug-2023 18:07:36.132 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-monotone.cert (14.355s) at 03-Aug-2023 18:07:50.534 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/sets.cert on 03-Aug-2023 18:07:50.780 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/sets.cert (8.508s) at 03-Aug-2023 18:07:59.322 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/truth-monotone.cert on 03-Aug-2023 18:07:59.472 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/truth-monotone.cert (3.692s) at 03-Aug-2023 18:08:03.190 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert on 03-Aug-2023 18:08:03.396 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-monotone.cert (9.728s) at 03-Aug-2023 18:08:13.167 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/truth-monotone.cert on 03-Aug-2023 18:08:13.386 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/truth-monotone.cert (3.141s) at 03-Aug-2023 18:08:16.562 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert on 03-Aug-2023 18:08:16.725 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-monotone.cert (9.819s) at 03-Aug-2023 18:08:26.590 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/omerge-good-order.cert on 03-Aug-2023 18:08:26.757 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/omerge-good-order.cert (11.007s) at 03-Aug-2023 18:08:37.815 Making /build/1st/acl2-8.5dfsg/books/rtl/rel4/user/logior1.cert on 03-Aug-2023 18:08:37.985 Built /build/1st/acl2-8.5dfsg/books/rtl/rel4/user/logior1.cert (5.823s) at 03-Aug-2023 18:08:43.838 Making /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logior1.cert on 03-Aug-2023 18:08:44.001 Built /build/1st/acl2-8.5dfsg/books/rtl/rel9/support/support/logior1.cert (3.719s) at 03-Aug-2023 18:08:47.750 Making /build/1st/acl2-8.5dfsg/books/sorting/bsort.cert on 03-Aug-2023 18:08:47.880 Built /build/1st/acl2-8.5dfsg/books/sorting/bsort.cert (4.481s) at 03-Aug-2023 18:08:52.398 Making /build/1st/acl2-8.5dfsg/books/sorting/msort.cert on 03-Aug-2023 18:08:52.579 Built /build/1st/acl2-8.5dfsg/books/sorting/msort.cert (4.264s) at 03-Aug-2023 18:08:56.882 Making /build/1st/acl2-8.5dfsg/books/system/optimize-check.cert on 03-Aug-2023 18:08:57.047 Tick Built /build/1st/acl2-8.5dfsg/books/system/optimize-check.cert (5.351s) at 03-Aug-2023 18:09:02.446 Making /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-1.cert on 03-Aug-2023 18:09:02.592 Built /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-1.cert (4.195s) at 03-Aug-2023 18:09:06.795 Making /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-2.cert on 03-Aug-2023 18:09:07.065 Built /build/1st/acl2-8.5dfsg/books/system/pcert/acl2x-pcert-test-2.cert (4.998s) at 03-Aug-2023 18:09:12.106 Making /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.pcert1 on 03-Aug-2023 18:09:12.217 Built /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.pcert1 (2.017s) at 03-Aug-2023 18:09:14.248 Making /build/1st/acl2-8.5dfsg/books/system/pcert/sub.pcert1 on 03-Aug-2023 18:09:14.352 Built /build/1st/acl2-8.5dfsg/books/system/pcert/sub.pcert1 (2.597s) at 03-Aug-2023 18:09:16.982 Making /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/swap-stobjs-test.cert on 03-Aug-2023 18:09:17.159 Built /build/1st/acl2-8.5dfsg/books/system/tests/abstract-stobj-nesting/swap-stobjs-test.cert (7.573s) at 03-Aug-2023 18:09:24.770 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top1.cert on 03-Aug-2023 18:09:25.040 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top1.cert (8.247s) at 03-Aug-2023 18:09:33.334 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top1a.cert on 03-Aug-2023 18:09:33.493 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top1a.cert (5.993s) at 03-Aug-2023 18:09:39.513 Making /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/top.cert on 03-Aug-2023 18:09:39.765 Built /build/1st/acl2-8.5dfsg/books/system/tests/early-load-of-compiled/top.cert (39.904s) at 03-Aug-2023 18:10:19.746 Making /build/1st/acl2-8.5dfsg/books/system/tests/local-port-include.cert on 03-Aug-2023 18:10:19.860 Built /build/1st/acl2-8.5dfsg/books/system/tests/local-port-include.cert (3.924s) at 03-Aug-2023 18:10:23.803 Making /build/1st/acl2-8.5dfsg/books/system/tests/verify-termination/top.cert on 03-Aug-2023 18:10:23.993 Built /build/1st/acl2-8.5dfsg/books/system/tests/verify-termination/top.cert (5.339s) at 03-Aug-2023 18:10:29.371 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/mergesort.cert on 03-Aug-2023 18:10:29.623 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/mergesort.cert (6.387s) at 03-Aug-2023 18:10:36.062 Making /build/1st/acl2-8.5dfsg/books/textbook/chap11/qsort.cert on 03-Aug-2023 18:10:36.249 Built /build/1st/acl2-8.5dfsg/books/textbook/chap11/qsort.cert (5.808s) at 03-Aug-2023 18:10:42.135 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/mesh-append.cert on 03-Aug-2023 18:10:42.332 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/mesh-append.cert (4.709s) at 03-Aug-2023 18:10:47.086 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/mesh-make-partition.cert on 03-Aug-2023 18:10:47.262 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/mesh-make-partition.cert (5.066s) at 03-Aug-2023 18:10:52.378 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert on 03-Aug-2023 18:10:52.597 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition-rec.cert (4.918s) at 03-Aug-2023 18:10:57.554 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert on 03-Aug-2023 18:10:57.764 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/embedded/Proof-Of-Contribution/Mapping.cert (6.600s) at 03-Aug-2023 18:11:04.416 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert on 03-Aug-2023 18:11:04.507 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/ivy/ivy-v2/ivy-sources/permutations.cert (9.591s) at 03-Aug-2023 18:11:14.159 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/fast-sets.cert on 03-Aug-2023 18:11:14.329 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/fast-sets.cert (10.563s) at 03-Aug-2023 18:11:24.978 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/fixpoints.cert on 03-Aug-2023 18:11:25.173 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/fixpoints.cert (6.782s) at 03-Aug-2023 18:11:31.994 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/solutions/perm.cert on 03-Aug-2023 18:11:32.220 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/solutions/perm.cert (5.070s) at 03-Aug-2023 18:11:37.362 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/fact.cert on 03-Aug-2023 18:11:37.618 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/fact.cert (10.730s) at 03-Aug-2023 18:11:48.394 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert on 03-Aug-2023 18:11:48.635 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/base.cert (6.317s) at 03-Aug-2023 18:11:54.994 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert on 03-Aug-2023 18:11:55.192 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/isa128.cert (7.027s) at 03-Aug-2023 18:12:02.270 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert on 03-Aug-2023 18:12:02.427 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/isa.cert (6.935s) at 03-Aug-2023 18:12:09.394 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert on 03-Aug-2023 18:12:09.550 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/ma/ma.cert (6.848s) at 03-Aug-2023 18:12:16.418 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert on 03-Aug-2023 18:12:16.580 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/isa128int.cert (7.106s) at 03-Aug-2023 18:12:23.718 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert on 03-Aug-2023 18:12:23.868 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/isa-int.cert (8.055s) at 03-Aug-2023 18:12:31.942 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert on 03-Aug-2023 18:12:32.277 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/isa.cert (9.389s) at 03-Aug-2023 18:12:41.698 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert on 03-Aug-2023 18:12:41.860 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/ma/ma.cert (14.444s) at 03-Aug-2023 18:12:56.338 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/monomial.cert on 03-Aug-2023 18:12:56.656 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/monomial.cert (11.020s) at 03-Aug-2023 18:13:07.762 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/examples.cert on 03-Aug-2023 18:13:08.001 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/moore-manolios/partial-functions/examples.cert (19.130s) at 03-Aug-2023 18:13:27.214 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-spec.cert on 03-Aug-2023 18:13:27.411 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-spec.cert (23.047s) at 03-Aug-2023 18:13:50.534 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-ackermann.cert on 03-Aug-2023 18:13:50.705 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-ackermann.cert (62.298s) at 03-Aug-2023 18:14:53.067 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-nested.cert on 03-Aug-2023 18:14:53.294 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-nested.cert (15.831s) at 03-Aug-2023 18:15:09.182 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-primitive.cert on 03-Aug-2023 18:15:09.352 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-primitive.cert (7.720s) at 03-Aug-2023 18:15:17.150 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-reverse.cert on 03-Aug-2023 18:15:17.306 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-reverse.cert (789.660s) at 03-Aug-2023 18:28:27.086 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-tail.cert on 03-Aug-2023 18:28:28.476 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-tail.cert (16.851s) at 03-Aug-2023 18:28:45.386 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-z.cert on 03-Aug-2023 18:28:45.622 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/cowles-flat/support/flat-z.cert (7.135s) at 03-Aug-2023 18:28:52.829 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert on 03-Aug-2023 18:28:52.996 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/generic-multiset.cert (18.163s) at 03-Aug-2023 18:29:11.227 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert on 03-Aug-2023 18:29:11.557 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-2/npol.cert (7.072s) at 03-Aug-2023 18:29:18.679 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert on 03-Aug-2023 18:29:19.078 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/monomial.cert (8.476s) at 03-Aug-2023 18:29:27.583 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert on 03-Aug-2023 18:29:27.922 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/terms.cert (23.221s) at 03-Aug-2023 18:29:51.261 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert on 03-Aug-2023 18:29:51.508 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/apply-total-order.cert (9.823s) at 03-Aug-2023 18:30:01.362 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/computed-hints.cert on 03-Aug-2023 18:30:01.617 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/computed-hints.cert (8.016s) at 03-Aug-2023 18:30:09.706 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert on 03-Aug-2023 18:30:10.005 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/manolios-srinivasan/support/Supporting-Books/records.cert (10.514s) at 03-Aug-2023 18:30:20.558 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert on 03-Aug-2023 18:30:20.712 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/bag-pkg.cert (5.412s) at 03-Aug-2023 18:30:26.139 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert on 03-Aug-2023 18:30:26.463 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/symbol-fns/symbol-fns.cert (9.688s) at 03-Aug-2023 18:30:36.174 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert on 03-Aug-2023 18:30:36.442 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fumonomio.cert (13.963s) at 03-Aug-2023 18:30:50.455 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert on 03-Aug-2023 18:30:50.702 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/kaufmann-moore/support/mini-proveall-plus.cert (6.761s) at 03-Aug-2023 18:30:57.515 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/refute.cert on 03-Aug-2023 18:30:57.793 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/refute.cert (17.414s) at 03-Aug-2023 18:31:15.242 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert on 03-Aug-2023 18:31:15.564 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/2D-mesh-nodeset.cert (10.837s) at 03-Aug-2023 18:31:26.418 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert on 03-Aug-2023 18:31:26.647 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/nodeset/octagon-nodeset.cert (6.575s) at 03-Aug-2023 18:31:33.271 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 on 03-Aug-2023 18:31:33.508 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.pcert1 (4.227s) at 03-Aug-2023 18:31:37.770 cd bdd ; /bin/bash -c "(echo '(ld \"create-benchmarks.lsp\")' | /build/1st/acl2-8.5dfsg/saved_acl2)" GCL (GNU Common Lisp) 2.6.14 Fri Jan 13 10:47:56 AM EST 2023 ANSI git: Version_2_6_15pre3 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 set to /tmp/ ; Hons-Note: grew SBITS to 12479630; 1.11 seconds, [unknown] bytes. ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ + ACL2 Version 8.5 + + built August 3, 2023 15:38:53 then August 3, 2023 15:38:56. + + Copyright (C) 2022, Regents of the University of Texas. + + ACL2 comes with ABSOLUTELY NO WARRANTY. This is free software and + + you are welcome to redistribute it under certain conditions. For + + details, see the LICENSE file distributed with ACL2. + ++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++ MODIFICATION NOTICE: Modified to produce final certification files System books directory "/build/1st/acl2-8.5dfsg/books/". Type :help for help. Type (quit) to quit completely out of ACL2. ACL2 !> System books directory "/build/1st/acl2-8.5dfsg/books/". Type :help for help. Type (quit) to quit completely out of ACL2. ACL2 !>> "ACL2" ACL2 !>> :NEVER ACL2 !>> (PROVE PROOF-TREE WARNING OBSERVATION) ACL2 !>> Summary Form: ( INCLUDE-BOOK "cbf" ...) Rules: NIL Time: 0.02 seconds (prove: 0.00, print: 0.00, other: 0.02) "/build/1st/acl2-8.5dfsg/books/bdd/cbf.lisp" ACL2 !>>ACL2 !>>Bye. :EOF ACL2 !>Bye. Making /build/1st/acl2-8.5dfsg/books/meta/meta-plus-equal.cert on 03-Aug-2023 18:31:40.588 Built /build/1st/acl2-8.5dfsg/books/meta/meta-plus-equal.cert (12.392s) at 03-Aug-2023 18:31:53.034 Making /build/1st/acl2-8.5dfsg/books/meta/meta-plus-lessp.cert on 03-Aug-2023 18:31:53.376 Built /build/1st/acl2-8.5dfsg/books/meta/meta-plus-lessp.cert (11.594s) at 03-Aug-2023 18:32:05.030 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/inequalities.cert on 03-Aug-2023 18:32:05.195 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/inequalities.cert (5.634s) at 03-Aug-2023 18:32:10.861 Making /build/1st/acl2-8.5dfsg/books/clause-processors/ev-theoremp.cert on 03-Aug-2023 18:32:11.040 Built /build/1st/acl2-8.5dfsg/books/clause-processors/ev-theoremp.cert (7.984s) at 03-Aug-2023 18:32:19.064 Making /build/1st/acl2-8.5dfsg/books/hacking/defcode.cert on 03-Aug-2023 18:32:19.464 Built /build/1st/acl2-8.5dfsg/books/hacking/defcode.cert (9.907s) at 03-Aug-2023 18:32:29.417 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/inequalities.cert on 03-Aug-2023 18:32:29.702 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/inequalities.cert (6.401s) at 03-Aug-2023 18:32:36.150 Making /build/1st/acl2-8.5dfsg/books/bdd/alu-proofs.cert on 03-Aug-2023 18:32:36.326 Built /build/1st/acl2-8.5dfsg/books/bdd/alu-proofs.cert (10.745s) at 03-Aug-2023 18:32:47.134 Making /build/1st/acl2-8.5dfsg/books/sorting/merge-sort-term-order.cert on 03-Aug-2023 18:32:47.357 Built /build/1st/acl2-8.5dfsg/books/sorting/merge-sort-term-order.cert (7.194s) at 03-Aug-2023 18:32:54.586 Making /build/1st/acl2-8.5dfsg/books/system/subst-expr.cert on 03-Aug-2023 18:32:54.987 Built /build/1st/acl2-8.5dfsg/books/system/subst-expr.cert (14.088s) at 03-Aug-2023 18:33:09.099 Making /build/1st/acl2-8.5dfsg/books/sorting/isort.cert on 03-Aug-2023 18:33:09.376 Built /build/1st/acl2-8.5dfsg/books/sorting/isort.cert (7.538s) at 03-Aug-2023 18:33:16.956 Making /build/1st/acl2-8.5dfsg/books/hacking/dynamic-make-event-test.cert on 03-Aug-2023 18:33:17.242 Built /build/1st/acl2-8.5dfsg/books/hacking/dynamic-make-event-test.cert (18.771s) at 03-Aug-2023 18:33:36.046 Making /build/1st/acl2-8.5dfsg/books/hacking/evalable-ld-printing.cert on 03-Aug-2023 18:33:36.268 Built /build/1st/acl2-8.5dfsg/books/hacking/evalable-ld-printing.cert (8.879s) at 03-Aug-2023 18:33:45.189 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/append.cert on 03-Aug-2023 18:33:45.416 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/append.cert (6.364s) at 03-Aug-2023 18:33:51.818 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/no-duplicatesp-equal.cert on 03-Aug-2023 18:33:52.129 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/no-duplicatesp-equal.cert (8.447s) at 03-Aug-2023 18:34:00.610 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/realpart.cert on 03-Aug-2023 18:34:00.853 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/realpart.cert (6.309s) at 03-Aug-2023 18:34:07.215 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm.cert on 03-Aug-2023 18:34:07.573 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm.cert (18.962s) at 03-Aug-2023 18:34:26.602 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subrange.cert on 03-Aug-2023 18:34:26.945 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/subrange.cert (9.544s) at 03-Aug-2023 18:34:36.546 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/revappend.cert on 03-Aug-2023 18:34:36.984 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/revappend.cert (8.926s) at 03-Aug-2023 18:34:45.963 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/declares0.cert on 03-Aug-2023 18:34:46.420 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/declares0.cert (39.015s) at 03-Aug-2023 18:35:25.574 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/legal-variablep.cert on 03-Aug-2023 18:35:26.016 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/legal-variablep.cert (15.065s) at 03-Aug-2023 18:35:41.158 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/firstn.cert on 03-Aug-2023 18:35:41.625 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/firstn.cert (12.870s) at 03-Aug-2023 18:35:54.547 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/maxelem.cert on 03-Aug-2023 18:35:54.913 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/maxelem.cert (13.973s) at 03-Aug-2023 18:36:09.006 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-nth.cert on 03-Aug-2023 18:36:09.482 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-nth.cert (13.417s) at 03-Aug-2023 18:36:22.947 Making /build/1st/acl2-8.5dfsg/books/kestrel/booleans/top.cert on 03-Aug-2023 18:36:23.291 Built /build/1st/acl2-8.5dfsg/books/kestrel/booleans/top.cert (10.547s) at 03-Aug-2023 18:36:33.890 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/meta-rules.cert on 03-Aug-2023 18:36:34.341 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/integer-arithmetic/meta-rules.cert (9.678s) at 03-Aug-2023 18:36:44.067 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/list-rules.cert on 03-Aug-2023 18:36:44.469 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/list-rules.cert (13.473s) at 03-Aug-2023 18:36:57.986 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp.cert on 03-Aug-2023 18:36:58.406 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp.cert (18.762s) at 03-Aug-2023 18:37:17.242 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-byte-dollar.cert on 03-Aug-2023 18:37:17.733 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-byte-dollar.cert (11.137s) at 03-Aug-2023 18:37:28.919 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-char-dollar.cert on 03-Aug-2023 18:37:29.263 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-char-dollar.cert (8.421s) at 03-Aug-2023 18:37:37.734 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-object.cert on 03-Aug-2023 18:37:38.021 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/read-object.cert (11.465s) at 03-Aug-2023 18:37:49.566 Making /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/print-object-dollar.cert on 03-Aug-2023 18:37:49.834 Built /build/1st/acl2-8.5dfsg/books/kestrel/file-io-light/print-object-dollar.cert (8.007s) at 03-Aug-2023 18:37:57.878 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/method-descriptors.cert on 03-Aug-2023 18:37:58.300 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/method-descriptors.cert (13.777s) at 03-Aug-2023 18:38:12.158 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/first-n-ac.cert on 03-Aug-2023 18:38:12.411 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/first-n-ac.cert (6.986s) at 03-Aug-2023 18:38:19.438 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp2.cert on 03-Aug-2023 18:38:19.705 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/prefixp2.cert (6.918s) at 03-Aug-2023 18:38:26.658 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/index-of-subseq.cert on 03-Aug-2023 18:38:26.864 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/index-of-subseq.cert (4.794s) at 03-Aug-2023 18:38:31.702 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/reverse.cert on 03-Aug-2023 18:38:31.890 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/reverse.cert (5.056s) at 03-Aug-2023 18:38:36.979 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/minelem2.cert on 03-Aug-2023 18:38:37.170 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/minelem2.cert (5.441s) at 03-Aug-2023 18:38:42.694 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/get-process-id.cert on 03-Aug-2023 18:38:42.975 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/get-process-id.cert (7.689s) at 03-Aug-2023 18:38:50.726 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-legal-var-in-acl2-package.cert on 03-Aug-2023 18:38:50.923 Tick Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/make-legal-var-in-acl2-package.cert (15.235s) at 03-Aug-2023 18:39:06.194 Making /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test.cert on 03-Aug-2023 18:39:06.459 Built /build/1st/acl2-8.5dfsg/books/make-event/double-cert-test.cert (5.211s) at 03-Aug-2023 18:39:11.714 Making /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 03-Aug-2023 18:39:11.988 Built /build/1st/acl2-8.5dfsg/books/nonstd/workshops/1999/calculus/solutions/partitionp-make-partition.cert (6.437s) at 03-Aug-2023 18:39:18.470 Making /build/1st/acl2-8.5dfsg/books/projects/equational/weighting.cert on 03-Aug-2023 18:39:18.708 Built /build/1st/acl2-8.5dfsg/books/projects/equational/weighting.cert (11.727s) at 03-Aug-2023 18:39:30.495 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-implies-unsat.cert on 03-Aug-2023 18:39:30.792 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-implies-unsat.cert (6.561s) at 03-Aug-2023 18:39:37.406 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/unique.cert on 03-Aug-2023 18:39:37.604 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/unique.cert (6.651s) at 03-Aug-2023 18:39:44.327 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert on 03-Aug-2023 18:39:44.429 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-implies-unsat.cert (5.082s) at 03-Aug-2023 18:39:49.534 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert on 03-Aug-2023 18:39:49.778 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-implies-unsat.cert (5.397s) at 03-Aug-2023 18:39:55.222 Making /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/fringes-taspi.cert on 03-Aug-2023 18:39:55.408 Built /build/1st/acl2-8.5dfsg/books/projects/taspi/proofs/fringes-taspi.cert (62.418s) at 03-Aug-2023 18:40:57.906 Making /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.cert on 03-Aug-2023 18:40:58.201 Built /build/1st/acl2-8.5dfsg/books/system/pcert/elide-test.cert (4.782s) at 03-Aug-2023 18:41:03.043 Making /build/1st/acl2-8.5dfsg/books/system/pcert/sub.cert on 03-Aug-2023 18:41:03.310 Built /build/1st/acl2-8.5dfsg/books/system/pcert/sub.cert (3.655s) at 03-Aug-2023 18:41:07.014 Making /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top.cert on 03-Aug-2023 18:41:07.261 Built /build/1st/acl2-8.5dfsg/books/system/tests/cert-data/top.cert (4.979s) at 03-Aug-2023 18:41:12.274 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert on 03-Aug-2023 18:41:12.559 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/calculus/solutions/partitionp-make-partition.cert (4.513s) at 03-Aug-2023 18:41:17.089 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/relations.cert on 03-Aug-2023 18:41:17.368 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/relations.cert (8.726s) at 03-Aug-2023 18:41:26.130 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/exercises.cert on 03-Aug-2023 18:41:26.360 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/vhdl/exercises.cert (4.983s) at 03-Aug-2023 18:41:31.386 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert on 03-Aug-2023 18:41:31.556 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/expr.cert (37.937s) at 03-Aug-2023 18:42:09.530 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert on 03-Aug-2023 18:42:09.726 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/deterministic-systems/128/top/ma128.cert (12.329s) at 03-Aug-2023 18:42:22.106 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert on 03-Aug-2023 18:42:22.324 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/128/top/ma128int.cert (14.865s) at 03-Aug-2023 18:42:37.258 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert on 03-Aug-2023 18:42:37.439 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/manolios/pipeline/pipeline/non-deterministic-systems/int/ma-int.cert (7.217s) at 03-Aug-2023 18:42:44.707 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/polynomial.cert on 03-Aug-2023 18:42:44.889 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/medina/polynomials/polynomial.cert (6.667s) at 03-Aug-2023 18:42:51.642 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-prf.cert on 03-Aug-2023 18:42:51.782 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/sumners2/bdds/bdd-prf.cert (26.894s) at 03-Aug-2023 18:43:18.806 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert on 03-Aug-2023 18:43:19.096 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-assoc.cert (11.315s) at 03-Aug-2023 18:43:30.467 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert on 03-Aug-2023 18:43:30.748 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/martin-alonso-hidalgo-ruiz/support/multiset-list.cert (7.746s) at 03-Aug-2023 18:43:38.542 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert on 03-Aug-2023 18:43:38.827 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/medina-palomo-alonso/support/section-3/upol.cert (7.591s) at 03-Aug-2023 18:43:46.479 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert on 03-Aug-2023 18:43:46.746 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/matching.cert (7.813s) at 03-Aug-2023 18:43:54.634 Making /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert on 03-Aug-2023 18:43:54.863 Built /build/1st/acl2-8.5dfsg/books/workshops/2002/ruiz-alonso-hidalgo-martin-theory-terms/support/subsumption-definition-v0.cert (6.183s) at 03-Aug-2023 18:44:01.102 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/records.cert on 03-Aug-2023 18:44:01.369 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/records.cert (10.185s) at 03-Aug-2023 18:44:11.574 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/membership.cert on 03-Aug-2023 18:44:11.730 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/membership.cert (12.122s) at 03-Aug-2023 18:44:23.915 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert on 03-Aug-2023 18:44:24.176 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/bags/bag-exports.cert (6.435s) at 03-Aug-2023 18:44:30.631 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert on 03-Aug-2023 18:44:30.873 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/smith-et-al/support/syntax/auxilary.cert (6.747s) at 03-Aug-2023 18:44:37.670 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert on 03-Aug-2023 18:44:37.939 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio.cert (7.935s) at 03-Aug-2023 18:44:45.926 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/lemgen.cert on 03-Aug-2023 18:44:46.164 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/lemgen.cert (98.476s) at 03-Aug-2023 18:46:24.790 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.cert on 03-Aug-2023 18:46:25.055 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/verbeek-schmaltz/sources/perm.cert (3.479s) at 03-Aug-2023 18:46:28.587 Making /build/1st/acl2-8.5dfsg/books/bdd/benchmarks.cert on 03-Aug-2023 18:46:28.859 Built /build/1st/acl2-8.5dfsg/books/bdd/benchmarks.cert (13.640s) at 03-Aug-2023 18:46:42.858 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/prefer-times.cert on 03-Aug-2023 18:46:43.178 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/prefer-times.cert (5.632s) at 03-Aug-2023 18:46:48.863 Making /build/1st/acl2-8.5dfsg/books/hacking/table-guard.cert on 03-Aug-2023 18:46:49.116 Built /build/1st/acl2-8.5dfsg/books/hacking/table-guard.cert (23.785s) at 03-Aug-2023 18:47:12.939 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/prefer-times.cert on 03-Aug-2023 18:47:13.146 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/prefer-times.cert (5.724s) at 03-Aug-2023 18:47:18.921 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse-list.cert on 03-Aug-2023 18:47:19.186 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse-list.cert (8.858s) at 03-Aug-2023 18:47:28.083 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/times.cert on 03-Aug-2023 18:47:28.336 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/times.cert (8.608s) at 03-Aug-2023 18:47:36.994 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse.cert on 03-Aug-2023 18:47:37.302 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse.cert (6.690s) at 03-Aug-2023 18:47:44.014 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cars.cert on 03-Aug-2023 18:47:44.314 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cars.cert (7.173s) at 03-Aug-2023 18:47:51.539 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cars2.cert on 03-Aug-2023 18:47:51.868 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/strip-cars2.cert (5.941s) at 03-Aug-2023 18:47:57.847 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defun-forms.cert on 03-Aug-2023 18:47:58.136 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defun-forms.cert (14.274s) at 03-Aug-2023 18:48:12.470 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-greater.cert on 03-Aug-2023 18:48:12.728 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-greater.cert (6.224s) at 03-Aug-2023 18:48:18.985 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-nth2.cert on 03-Aug-2023 18:48:19.216 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-nth2.cert (7.048s) at 03-Aug-2023 18:48:26.286 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm2.cert on 03-Aug-2023 18:48:26.560 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/perm2.cert (6.363s) at 03-Aug-2023 18:48:32.974 Making /build/1st/acl2-8.5dfsg/books/kestrel/arrays-2d/arrays-2d.cert on 03-Aug-2023 18:48:33.234 Built /build/1st/acl2-8.5dfsg/books/kestrel/arrays-2d/arrays-2d.cert (13.088s) at 03-Aug-2023 18:48:46.362 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp2.cert on 03-Aug-2023 18:48:46.668 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/all-integerp2.cert (5.851s) at 03-Aug-2023 18:48:52.550 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-subrange.cert on 03-Aug-2023 18:48:52.759 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-subrange.cert (11.196s) at 03-Aug-2023 18:49:04.034 Making /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/support.cert on 03-Aug-2023 18:49:04.293 Built /build/1st/acl2-8.5dfsg/books/kestrel/prime-fields/support.cert (6.627s) at 03-Aug-2023 18:49:10.970 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/elaborate-rule-items.cert on 03-Aug-2023 18:49:11.181 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/elaborate-rule-items.cert (9.213s) at 03-Aug-2023 18:49:20.455 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/symbol-listp2.cert on 03-Aug-2023 18:49:20.773 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/symbol-listp2.cert (6.283s) at 03-Aug-2023 18:49:27.083 Making /build/1st/acl2-8.5dfsg/books/kestrel/jvm/operand-stacks.cert on 03-Aug-2023 18:49:27.495 Built /build/1st/acl2-8.5dfsg/books/kestrel/jvm/operand-stacks.cert (10.697s) at 03-Aug-2023 18:49:38.242 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-chars.cert on 03-Aug-2023 18:49:38.440 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-chars.cert (8.411s) at 03-Aug-2023 18:49:46.882 Making /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/maxelem2.cert on 03-Aug-2023 18:49:47.105 Built /build/1st/acl2-8.5dfsg/books/kestrel/typed-lists-light/maxelem2.cert (11.778s) at 03-Aug-2023 18:49:58.906 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keywords-to-acl2-package.cert on 03-Aug-2023 18:49:59.211 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/keywords-to-acl2-package.cert (6.778s) at 03-Aug-2023 18:50:06.030 Making /build/1st/acl2-8.5dfsg/books/projects/equational/paramod.cert on 03-Aug-2023 18:50:06.283 Built /build/1st/acl2-8.5dfsg/books/projects/equational/paramod.cert (9.800s) at 03-Aug-2023 18:50:16.134 Making /build/1st/acl2-8.5dfsg/books/projects/equational/resolution.cert on 03-Aug-2023 18:50:16.445 Built /build/1st/acl2-8.5dfsg/books/projects/equational/resolution.cert (12.396s) at 03-Aug-2023 18:50:28.886 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-correct.cert on 03-Aug-2023 18:50:29.171 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/unit-propagation-correct.cert (9.022s) at 03-Aug-2023 18:50:38.242 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/assignment.cert on 03-Aug-2023 18:50:38.487 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/assignment.cert (5.478s) at 03-Aug-2023 18:50:44.014 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/clause.cert on 03-Aug-2023 18:50:44.195 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/clause.cert (6.647s) at 03-Aug-2023 18:50:50.891 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert on 03-Aug-2023 18:50:51.100 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/unit-propagation-correct.cert (7.845s) at 03-Aug-2023 18:50:58.999 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-correct.cert on 03-Aug-2023 18:50:59.164 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/unit-propagation-correct.cert (7.133s) at 03-Aug-2023 18:51:06.338 Making /build/1st/acl2-8.5dfsg/books/system/pcert/mid.cert on 03-Aug-2023 18:51:06.613 Built /build/1st/acl2-8.5dfsg/books/system/pcert/mid.cert (5.123s) at 03-Aug-2023 18:51:11.778 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/models.cert on 03-Aug-2023 18:51:11.945 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/models.cert (6.242s) at 03-Aug-2023 18:51:18.226 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/pstate.cert on 03-Aug-2023 18:51:18.523 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/pstate.cert (12.664s) at 03-Aug-2023 18:51:31.234 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/cstate.cert on 03-Aug-2023 18:51:31.601 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/cstate.cert (21.887s) at 03-Aug-2023 18:51:53.558 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/sets.cert on 03-Aug-2023 18:51:53.823 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/sets.cert (8.737s) at 03-Aug-2023 18:52:02.618 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/fast.cert on 03-Aug-2023 18:52:02.819 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/fast.cert (19.713s) at 03-Aug-2023 18:52:22.568 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert on 03-Aug-2023 18:52:22.801 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuforma-normal.cert (24.113s) at 03-Aug-2023 18:52:46.974 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/exdefs.cert on 03-Aug-2023 18:52:47.241 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/erickson/bprove/exdefs.cert (14.811s) at 03-Aug-2023 18:53:02.102 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/expt-helper.cert on 03-Aug-2023 18:53:02.259 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/expt-helper.cert (5.909s) at 03-Aug-2023 18:53:08.195 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/expt-helper.cert on 03-Aug-2023 18:53:08.458 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/expt-helper.cert (5.034s) at 03-Aug-2023 18:53:13.542 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/numerator-and-denominator-helper.cert on 03-Aug-2023 18:53:13.626 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/numerator-and-denominator-helper.cert (10.075s) at 03-Aug-2023 18:53:23.752 Making /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/acl2-arrays.cert on 03-Aug-2023 18:53:23.968 Built /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/acl2-arrays.cert (29.543s) at 03-Aug-2023 18:53:53.634 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse-list-def.cert on 03-Aug-2023 18:53:53.849 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/reverse-list-def.cert (5.672s) at 03-Aug-2023 18:53:59.550 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/times-and-divides.cert on 03-Aug-2023 18:53:59.791 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/times-and-divides.cert (5.725s) at 03-Aug-2023 18:54:05.566 Making /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/array-to-alist.cert on 03-Aug-2023 18:54:05.749 Built /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/array-to-alist.cert (7.394s) at 03-Aug-2023 18:54:13.187 Making /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/expandable-arrays.cert on 03-Aug-2023 18:54:13.481 Built /build/1st/acl2-8.5dfsg/books/kestrel/acl2-arrays/expandable-arrays.cert (15.005s) at 03-Aug-2023 18:54:28.554 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/pairlis-dollar-fast.cert on 03-Aug-2023 18:54:28.835 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/pairlis-dollar-fast.cert (6.386s) at 03-Aug-2023 18:54:35.266 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mutual-recursion-forms.cert on 03-Aug-2023 18:54:35.496 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/mutual-recursion-forms.cert (10.350s) at 03-Aug-2023 18:54:45.914 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/merge-sort-generic.cert on 03-Aug-2023 18:54:46.163 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/merge-sort-generic.cert (8.653s) at 03-Aug-2023 18:54:54.862 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-subrange2.cert on 03-Aug-2023 18:54:55.222 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/update-subrange2.cert (5.856s) at 03-Aug-2023 18:55:01.102 Making /build/1st/acl2-8.5dfsg/books/kestrel/axe/worklists.cert on 03-Aug-2023 18:55:01.359 Built /build/1st/acl2-8.5dfsg/books/kestrel/axe/worklists.cert (7.253s) at 03-Aug-2023 18:55:08.666 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/append-with-key.cert on 03-Aug-2023 18:55:08.862 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/append-with-key.cert (4.798s) at 03-Aug-2023 18:55:13.722 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-chars-repeatedly.cert on 03-Aug-2023 18:55:13.924 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-chars-repeatedly.cert (5.455s) at 03-Aug-2023 18:55:19.422 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-string.cert on 03-Aug-2023 18:55:19.699 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-string.cert (6.250s) at 03-Aug-2023 18:55:25.994 Making /build/1st/acl2-8.5dfsg/books/projects/equational/prover.cert on 03-Aug-2023 18:55:26.175 Built /build/1st/acl2-8.5dfsg/books/projects/equational/prover.cert (8.892s) at 03-Aug-2023 18:55:35.151 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-base.cert on 03-Aug-2023 18:55:35.350 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-base.cert (6.145s) at 03-Aug-2023 18:55:41.534 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/all-literals.cert on 03-Aug-2023 18:55:41.807 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/all-literals.cert (5.635s) at 03-Aug-2023 18:55:47.491 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-base.cert on 03-Aug-2023 18:55:47.721 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-base.cert (5.966s) at 03-Aug-2023 18:55:53.726 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-base.cert on 03-Aug-2023 18:55:53.936 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-base.cert (4.333s) at 03-Aug-2023 18:55:58.314 Making /build/1st/acl2-8.5dfsg/books/system/pcert/top.pcert0 on 03-Aug-2023 18:55:58.559 Built /build/1st/acl2-8.5dfsg/books/system/pcert/top.pcert0 (5.599s) at 03-Aug-2023 18:56:04.210 Making /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/syntax.cert on 03-Aug-2023 18:56:04.400 Built /build/1st/acl2-8.5dfsg/books/workshops/1999/mu-calculus/book/syntax.cert (8.064s) at 03-Aug-2023 18:56:12.510 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/compile.cert on 03-Aug-2023 18:56:12.796 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/compile.cert (11.079s) at 03-Aug-2023 18:56:23.926 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/lstate.cert on 03-Aug-2023 18:56:24.107 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/lstate.cert (8.525s) at 03-Aug-2023 18:56:32.718 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/outer.cert on 03-Aug-2023 18:56:32.910 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/outer.cert (15.682s) at 03-Aug-2023 18:56:48.657 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fusuma.cert on 03-Aug-2023 18:56:48.943 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fusuma.cert (7.428s) at 03-Aug-2023 18:56:56.421 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/expt.cert on 03-Aug-2023 18:56:56.746 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/expt.cert (8.656s) at 03-Aug-2023 18:57:05.444 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/expt.cert on 03-Aug-2023 18:57:05.624 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/expt.cert (5.472s) at 03-Aug-2023 18:57:11.139 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/numerator-and-denominator.cert on 03-Aug-2023 18:57:11.300 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/numerator-and-denominator.cert (4.696s) at 03-Aug-2023 18:57:16.027 Making /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp2.cert on 03-Aug-2023 18:57:16.185 Built /build/1st/acl2-8.5dfsg/books/kestrel/lists-light/memberp2.cert (5.231s) at 03-Aug-2023 18:57:21.445 Making /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/top.cert on 03-Aug-2023 18:57:21.624 Built /build/1st/acl2-8.5dfsg/books/kestrel/alists-light/top.cert (6.395s) at 03-Aug-2023 18:57:28.043 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defining-forms.cert on 03-Aug-2023 18:57:28.265 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/defining-forms.cert (9.117s) at 03-Aug-2023 18:57:37.434 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-string-repeatedly.cert on 03-Aug-2023 18:57:37.692 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/split-string-repeatedly.cert (6.522s) at 03-Aug-2023 18:57:44.242 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-maybe-shrink-formula.cert on 03-Aug-2023 18:57:44.588 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-maybe-shrink-formula.cert (8.698s) at 03-Aug-2023 18:57:53.316 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/evaluator.cert on 03-Aug-2023 18:57:53.573 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-itp13/supplemental/evaluator.cert (14.469s) at 03-Aug-2023 18:58:08.086 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-rup.cert on 03-Aug-2023 18:58:08.246 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-rup.cert (7.378s) at 03-Aug-2023 18:58:15.663 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-maybe-shrink-formula.cert on 03-Aug-2023 18:58:15.974 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-maybe-shrink-formula.cert (6.911s) at 03-Aug-2023 18:58:22.916 Making /build/1st/acl2-8.5dfsg/books/system/pcert/top.pcert1 on 03-Aug-2023 18:58:23.114 Built /build/1st/acl2-8.5dfsg/books/system/pcert/top.pcert1 (3.542s) at 03-Aug-2023 18:58:26.690 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/mstate.cert on 03-Aug-2023 18:58:26.829 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/mstate.cert (12.181s) at 03-Aug-2023 18:58:39.062 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/sort.cert on 03-Aug-2023 18:58:39.322 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/sort.cert (7.623s) at 03-Aug-2023 18:58:47.002 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-suma.cert on 03-Aug-2023 18:58:47.179 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-suma.cert (5.462s) at 03-Aug-2023 18:58:52.695 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/mini-theories.cert on 03-Aug-2023 18:58:52.918 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/mini-theories.cert (6.754s) at 03-Aug-2023 18:58:59.722 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/non-linear.cert on 03-Aug-2023 18:59:00.047 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/non-linear.cert (7.163s) at 03-Aug-2023 18:59:07.242 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/mini-theories.cert on 03-Aug-2023 18:59:07.490 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/mini-theories.cert (7.117s) at 03-Aug-2023 18:59:14.642 Making /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/top.cert on 03-Aug-2023 18:59:14.917 Built /build/1st/acl2-8.5dfsg/books/kestrel/strings-light/top.cert (6.579s) at 03-Aug-2023 18:59:21.519 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-rup.cert on 03-Aug-2023 18:59:21.784 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/satisfiable-add-proof-clause-rup.cert (4.864s) at 03-Aug-2023 18:59:26.682 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-1.cert on 03-Aug-2023 18:59:26.824 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-1.cert (6.415s) at 03-Aug-2023 18:59:33.277 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-rup.cert on 03-Aug-2023 18:59:33.491 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/satisfiable-add-proof-clause-rup.cert (6.131s) at 03-Aug-2023 18:59:39.655 Making /build/1st/acl2-8.5dfsg/books/system/pcert/top.cert on 03-Aug-2023 18:59:39.834 Built /build/1st/acl2-8.5dfsg/books/system/pcert/top.cert (2.956s) at 03-Aug-2023 18:59:42.826 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/setup.cert on 03-Aug-2023 18:59:43.027 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/setup.cert (8.107s) at 03-Aug-2023 18:59:51.234 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.cert on 03-Aug-2023 18:59:51.416 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc1.cert (21.390s) at 03-Aug-2023 19:00:12.878 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc0.cert on 03-Aug-2023 19:00:13.085 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc0.cert (11.036s) at 03-Aug-2023 19:00:24.162 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/sets.cert on 03-Aug-2023 19:00:24.325 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/sets.cert (9.879s) at 03-Aug-2023 19:00:34.278 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuopuesto.cert on 03-Aug-2023 19:00:34.439 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuopuesto.cert (4.904s) at 03-Aug-2023 19:00:39.380 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/num-and-denom-helper.cert on 03-Aug-2023 19:00:39.513 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/num-and-denom-helper.cert (7.134s) at 03-Aug-2023 19:00:46.711 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/top.cert on 03-Aug-2023 19:00:46.874 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/pass1/top.cert (3.759s) at 03-Aug-2023 19:00:50.679 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-1.cert on 03-Aug-2023 19:00:50.841 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/list-based/sat-drat-claim-1.cert (4.178s) at 03-Aug-2023 19:00:55.066 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2-3.cert on 03-Aug-2023 19:00:55.231 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2-3.cert (11.423s) at 03-Aug-2023 19:01:06.706 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-1.cert on 03-Aug-2023 19:01:06.895 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev2/sat-drat-claim-1.cert (4.336s) at 03-Aug-2023 19:01:11.271 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc2.cert on 03-Aug-2023 19:01:11.443 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepproc2.cert (18.376s) at 03-Aug-2023 19:01:29.886 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/quantify.cert on 03-Aug-2023 19:01:30.098 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/quantify.cert (11.159s) at 03-Aug-2023 19:01:41.302 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/set-order.cert on 03-Aug-2023 19:01:41.480 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/set-order.cert (3.151s) at 03-Aug-2023 19:01:44.671 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuproducto.cert on 03-Aug-2023 19:01:44.780 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuproducto.cert (7.582s) at 03-Aug-2023 19:01:52.403 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/numerator-and-denominator.cert on 03-Aug-2023 19:01:52.585 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/numerator-and-denominator.cert (4.288s) at 03-Aug-2023 19:01:56.922 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/pre.cert on 03-Aug-2023 19:01:57.112 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/pre.cert (6.066s) at 03-Aug-2023 19:02:03.222 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/integerp.cert on 03-Aug-2023 19:02:03.402 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/integerp.cert (7.430s) at 03-Aug-2023 19:02:10.879 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/integerp-meta.cert on 03-Aug-2023 19:02:11.262 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/integerp-meta.cert (21.880s) at 03-Aug-2023 19:02:33.302 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/common-meta.cert on 03-Aug-2023 19:02:33.485 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/common-meta.cert (24.395s) at 03-Aug-2023 19:02:57.950 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/cancel-terms-helper.cert on 03-Aug-2023 19:02:58.201 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/cancel-terms-helper.cert (6.888s) at 03-Aug-2023 19:03:05.142 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/numerator-and-denominator.cert on 03-Aug-2023 19:03:05.376 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/numerator-and-denominator.cert (4.029s) at 03-Aug-2023 19:03:09.454 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/expt-helper.cert on 03-Aug-2023 19:03:09.623 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/expt-helper.cert (4.941s) at 03-Aug-2023 19:03:14.606 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/non-linear.cert on 03-Aug-2023 19:03:14.851 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/non-linear.cert (6.119s) at 03-Aug-2023 19:03:21.038 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/mini-theories.cert on 03-Aug-2023 19:03:21.208 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/mini-theories.cert (3.609s) at 03-Aug-2023 19:03:24.855 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/post.cert on 03-Aug-2023 19:03:25.040 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/post.cert (4.454s) at 03-Aug-2023 19:03:29.562 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2.cert on 03-Aug-2023 19:03:29.744 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/sat-drat-claim-2.cert (5.090s) at 03-Aug-2023 19:03:34.890 Making /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepprocess.cert on 03-Aug-2023 19:03:35.070 Built /build/1st/acl2-8.5dfsg/books/workshops/2000/lusk-mccune/lusk-mccune-final/stepprocess.cert (7.014s) at 03-Aug-2023 19:03:42.131 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/map.cert on 03-Aug-2023 19:03:42.368 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/davis/support/map.cert (17.947s) at 03-Aug-2023 19:04:00.378 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-producto.cert on 03-Aug-2023 19:04:00.643 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fucongruencias-producto.cert (14.527s) at 03-Aug-2023 19:04:15.246 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/top.cert on 03-Aug-2023 19:04:15.520 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/pass1/top.cert (6.423s) at 03-Aug-2023 19:04:21.990 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/cancel-terms-meta.cert on 03-Aug-2023 19:04:22.256 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/cancel-terms-meta.cert (25.468s) at 03-Aug-2023 19:04:47.811 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/collect-terms-meta.cert on 03-Aug-2023 19:04:48.021 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/collect-terms-meta.cert (6.519s) at 03-Aug-2023 19:04:54.586 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/expt.cert on 03-Aug-2023 19:04:54.815 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/expt.cert (8.284s) at 03-Aug-2023 19:05:03.145 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-drat.cert on 03-Aug-2023 19:05:03.405 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause-drat.cert (7.721s) at 03-Aug-2023 19:05:11.150 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio-normalizado.cert on 03-Aug-2023 19:05:11.348 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fupolinomio-normalizado.cert (6.131s) at 03-Aug-2023 19:05:17.534 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/mini-theories-helper.cert on 03-Aug-2023 19:05:17.719 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/mini-theories-helper.cert (5.914s) at 03-Aug-2023 19:05:23.678 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/common.cert on 03-Aug-2023 19:05:23.807 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/common.cert (13.383s) at 03-Aug-2023 19:05:37.258 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/basic-helper.cert on 03-Aug-2023 19:05:37.615 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/basic-helper.cert (5.133s) at 03-Aug-2023 19:05:42.799 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/simplify-helper.cert on 03-Aug-2023 19:05:43.129 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/simplify-helper.cert (7.986s) at 03-Aug-2023 19:05:51.195 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/numerator-and-denominator.cert on 03-Aug-2023 19:05:51.498 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/numerator-and-denominator.cert (6.795s) at 03-Aug-2023 19:05:58.338 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/integerp.cert on 03-Aug-2023 19:05:58.560 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/integerp.cert (16.466s) at 03-Aug-2023 19:06:15.138 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/integerp-meta.cert on 03-Aug-2023 19:06:15.404 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/integerp-meta.cert (53.028s) at 03-Aug-2023 19:07:08.546 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/collect.cert on 03-Aug-2023 19:07:08.740 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/collect.cert (11.348s) at 03-Aug-2023 19:07:20.151 Making /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/top.cert on 03-Aug-2023 19:07:20.418 Built /build/1st/acl2-8.5dfsg/books/arithmetic-2/meta/top.cert (6.569s) at 03-Aug-2023 19:07:27.040 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause.cert on 03-Aug-2023 19:07:27.380 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/satisfiable-add-proof-clause.cert (7.538s) at 03-Aug-2023 19:07:34.958 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuquot-rem.cert on 03-Aug-2023 19:07:35.271 Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2006/cowles-gamboa-euclid/Euclid/fld-u-poly/fuquot-rem.cert (283.907s) at 03-Aug-2023 19:12:19.654 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/mini-theories.cert on 03-Aug-2023 19:12:21.783 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/mini-theories.cert (15.724s) at 03-Aug-2023 19:12:37.546 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/basic.cert on 03-Aug-2023 19:12:37.813 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/basic.cert (7.830s) at 03-Aug-2023 19:12:45.734 Making /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/soundness.cert on 03-Aug-2023 19:12:46.005 Built /build/1st/acl2-8.5dfsg/books/projects/sat/lrat/early/rev1/soundness.cert (6.901s) at 03-Aug-2023 19:12:52.958 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/ltl.cert on 03-Aug-2023 19:12:53.187 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/ltl.cert (21.823s) at 03-Aug-2023 19:13:15.075 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/normalize.cert on 03-Aug-2023 19:13:15.238 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/normalize.cert (17.444s) at 03-Aug-2023 19:13:32.746 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/simplify.cert on 03-Aug-2023 19:13:32.861 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/simplify.cert (37.101s) at 03-Aug-2023 19:14:10.074 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/arithmetic-theory.cert on 03-Aug-2023 19:14:10.247 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/arithmetic-theory.cert (13.167s) at 03-Aug-2023 19:14:23.462 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/bisimilarity.cert on 03-Aug-2023 19:14:23.761 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/bisimilarity.cert (141.197s) at 03-Aug-2023 19:16:45.414 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/conjunction.cert on 03-Aug-2023 19:16:46.796 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/conjunction.cert (85.001s) at 03-Aug-2023 19:18:11.898 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/top.cert on 03-Aug-2023 19:18:12.297 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/bind-free/top.cert (9.660s) at 03-Aug-2023 19:18:22.009 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuit-bisim.cert on 03-Aug-2023 19:18:22.342 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuit-bisim.cert (18.408s) at 03-Aug-2023 19:18:40.864 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/floor-mod/floor-mod.cert on 03-Aug-2023 19:18:41.277 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/floor-mod/floor-mod.cert (88.797s) at 03-Aug-2023 19:20:10.207 Making /build/1st/acl2-8.5dfsg/books/projects/symbolic/tiny-fib/defstobj+.cert on 03-Aug-2023 19:20:10.551 Built /build/1st/acl2-8.5dfsg/books/projects/symbolic/tiny-fib/defstobj+.cert (17.177s) at 03-Aug-2023 19:20:27.842 Making /build/1st/acl2-8.5dfsg/books/proofstyles/invclock/c2i/c2i-partial.cert on 03-Aug-2023 19:20:28.191 Built /build/1st/acl2-8.5dfsg/books/proofstyles/invclock/c2i/c2i-partial.cert (12.200s) at 03-Aug-2023 19:20:40.456 Making /build/1st/acl2-8.5dfsg/books/proofstyles/invclock/i2c/i2c-partial.cert on 03-Aug-2023 19:20:40.713 Built /build/1st/acl2-8.5dfsg/books/proofstyles/invclock/i2c/i2c-partial.cert (11.699s) at 03-Aug-2023 19:20:52.466 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuits.cert on 03-Aug-2023 19:20:52.753 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/circuits.cert (17.293s) at 03-Aug-2023 19:21:10.173 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-mult.cert on 03-Aug-2023 19:21:10.515 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-mult.cert (86.073s) at 03-Aug-2023 19:22:36.650 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-sum.cert on 03-Aug-2023 19:22:36.954 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-alternative-induction-sum.cert (15.470s) at 03-Aug-2023 19:22:52.487 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-mult.cert on 03-Aug-2023 19:22:52.718 Tick Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-mult.cert (2944.123s) at 03-Aug-2023 20:11:57.098 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-sum.cert on 03-Aug-2023 20:12:02.771 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-loop-invariant-sum.cert (97.044s) at 03-Aug-2023 20:13:39.963 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-mult.cert on 03-Aug-2023 20:13:40.555 Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-mult.cert (2202.235s) at 03-Aug-2023 20:50:23.158 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-sum.cert on 03-Aug-2023 20:50:26.608 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/generic-theory-tail-recursion-sum.cert (56.415s) at 03-Aug-2023 20:51:23.052 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/proof-by-generalization-mult.cert on 03-Aug-2023 20:51:23.456 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/proof-by-generalization-mult.cert (192.452s) at 03-Aug-2023 20:54:35.951 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/proof-by-generalization-sum.cert on 03-Aug-2023 20:54:36.580 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/legato/support/proof-by-generalization-sum.cert (20.998s) at 03-Aug-2023 20:54:57.610 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/defstobj+.cert on 03-Aug-2023 20:54:58.015 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/matthews-vroon/support/tiny-fib-example/defstobj+.cert (28.779s) at 03-Aug-2023 20:55:26.959 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/ray/support/generic.cert on 03-Aug-2023 20:55:27.274 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/ray/support/generic.cert (19.754s) at 03-Aug-2023 20:55:47.101 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/mod_lemmas.cert on 03-Aug-2023 20:55:47.543 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/mod_lemmas.cert (13.513s) at 03-Aug-2023 20:56:01.102 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/data.cert on 03-Aug-2023 20:56:01.523 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/data.cert (15.355s) at 03-Aug-2023 20:56:16.934 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum-thms.cert on 03-Aug-2023 20:56:17.400 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/swords-cook/lcsoundness/defsum-thms.cert (12.193s) at 03-Aug-2023 20:56:29.651 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/mod_lemmas.cert on 03-Aug-2023 20:56:30.555 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/mod_lemmas.cert (14.136s) at 03-Aug-2023 20:56:44.742 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/top.cert on 03-Aug-2023 20:56:45.134 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/top.cert (12.863s) at 03-Aug-2023 20:56:58.050 Making /build/1st/acl2-8.5dfsg/books/arithmetic-3/floor-mod/mod-expt-fast.cert on 03-Aug-2023 20:56:58.411 Built /build/1st/acl2-8.5dfsg/books/arithmetic-3/floor-mod/mod-expt-fast.cert (40.016s) at 03-Aug-2023 20:57:38.466 Making /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add-common.cert on 03-Aug-2023 20:57:38.879 Built /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add-common.cert (13.970s) at 03-Aug-2023 20:57:52.907 Making /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add.cert on 03-Aug-2023 20:57:53.102 Built /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add.cert (23.211s) at 03-Aug-2023 20:58:16.370 Making /build/1st/acl2-8.5dfsg/books/data-structures/memories/log2.cert on 03-Aug-2023 20:58:16.572 Built /build/1st/acl2-8.5dfsg/books/data-structures/memories/log2.cert (14.703s) at 03-Aug-2023 20:58:31.382 Making /build/1st/acl2-8.5dfsg/books/data-structures/memories/memtree.cert on 03-Aug-2023 20:58:31.768 Built /build/1st/acl2-8.5dfsg/books/data-structures/memories/memtree.cert (175.324s) at 03-Aug-2023 21:01:27.302 Making /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/mod-expt-fast-unguarded.cert on 03-Aug-2023 21:01:28.282 Built /build/1st/acl2-8.5dfsg/books/kestrel/arithmetic-light/mod-expt-fast-unguarded.cert (21.683s) at 03-Aug-2023 21:01:50.006 Making /build/1st/acl2-8.5dfsg/books/misc/radix.cert on 03-Aug-2023 21:01:50.451 Built /build/1st/acl2-8.5dfsg/books/misc/radix.cert (19.643s) at 03-Aug-2023 21:02:10.154 Making /build/1st/acl2-8.5dfsg/books/misc/random.cert on 03-Aug-2023 21:02:10.693 Built /build/1st/acl2-8.5dfsg/books/misc/random.cert (19.450s) at 03-Aug-2023 21:02:30.206 Making /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/diffie-helman.cert on 03-Aug-2023 21:02:30.789 Built /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/diffie-helman.cert (29.567s) at 03-Aug-2023 21:03:00.478 Making /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/random.cert on 03-Aug-2023 21:03:00.920 Built /build/1st/acl2-8.5dfsg/books/projects/security/jfkr/random.cert (15.881s) at 03-Aug-2023 21:03:16.886 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/cone-of-influence.cert on 03-Aug-2023 21:03:17.464 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/cone-of-influence.cert (49.114s) at 03-Aug-2023 21:04:06.905 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/ray/support/defcoerce.cert on 03-Aug-2023 21:04:07.111 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/ray/support/defcoerce.cert (28.668s) at 03-Aug-2023 21:04:35.878 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/routing_defuns.cert on 03-Aug-2023 21:04:36.373 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/routing_defuns.cert (197.229s) at 03-Aug-2023 21:07:53.654 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/basic.cert on 03-Aug-2023 21:07:54.038 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/basic.cert (13.235s) at 03-Aug-2023 21:08:07.338 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/guarded.cert on 03-Aug-2023 21:08:07.708 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/guarded.cert (14.260s) at 03-Aug-2023 21:08:22.024 Making /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/stobjs.cert on 03-Aug-2023 21:08:22.437 Built /build/1st/acl2-8.5dfsg/books/workshops/2006/gordon-hunt-kaufmann-reynolds/support/stobjs.cert (23.825s) at 03-Aug-2023 21:08:46.318 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_defuns.cert on 03-Aug-2023 21:08:46.736 Tick Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/routing_defuns.cert (349.305s) at 03-Aug-2023 21:14:36.366 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/log2.cert on 03-Aug-2023 21:14:38.548 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/log2.cert (102.551s) at 03-Aug-2023 21:16:21.194 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/r-no-cover.cert on 03-Aug-2023 21:16:21.348 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/r-no-cover.cert (85.605s) at 03-Aug-2023 21:17:47.043 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover.cert on 03-Aug-2023 21:17:47.506 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover.cert (22.978s) at 03-Aug-2023 21:18:10.610 Making /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover1.cert on 03-Aug-2023 21:18:12.636 Built /build/1st/acl2-8.5dfsg/books/workshops/2011/cowles-gamboa-sierpinski/support/s-no-cover1.cert (20.188s) at 03-Aug-2023 21:18:32.935 Making /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add-tests.cert on 03-Aug-2023 21:18:33.218 Built /build/1st/acl2-8.5dfsg/books/clause-processors/bv-add-tests.cert (18.013s) at 03-Aug-2023 21:18:51.283 Making /build/1st/acl2-8.5dfsg/books/coi/records/fast/log2.cert on 03-Aug-2023 21:18:51.651 Built /build/1st/acl2-8.5dfsg/books/coi/records/fast/log2.cert (9.450s) at 03-Aug-2023 21:19:01.163 Making /build/1st/acl2-8.5dfsg/books/coi/records/fast/memtree.cert on 03-Aug-2023 21:19:01.377 Built /build/1st/acl2-8.5dfsg/books/coi/records/fast/memtree.cert (8.625s) at 03-Aug-2023 21:19:10.076 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/reductions.cert on 03-Aug-2023 21:19:10.381 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/reductions.cert (14.018s) at 03-Aug-2023 21:19:24.451 Making /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/getting_rid_of_mod.cert on 03-Aug-2023 21:19:24.679 Built /build/1st/acl2-8.5dfsg/books/workshops/2004/schmaltz-borrione/support/getting_rid_of_mod.cert (395.559s) at 03-Aug-2023 21:26:00.338 Making /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/getting_rid_of_mod.cert on 03-Aug-2023 21:26:01.771 Built /build/1st/acl2-8.5dfsg/books/workshops/2007/schmaltz/genoc-v1.0/instantiations/routing/octagon-routing/getting_rid_of_mod.cert (119.260s) at 03-Aug-2023 21:28:01.098 Making /build/1st/acl2-8.5dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/tri-sq.cert on 03-Aug-2023 21:28:05.035 Built /build/1st/acl2-8.5dfsg/books/workshops/2009/cowles-gamboa-triangle-square/materials/tri-sq.cert (32.687s) at 03-Aug-2023 21:28:37.838 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/impl-hack.cert on 03-Aug-2023 21:28:37.990 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/ray-matthews-tuttle/support/impl-hack.cert (8.949s) at 03-Aug-2023 21:28:46.979 Making /build/1st/acl2-8.5dfsg/books/data-structures/set-defuns.cert on 03-Aug-2023 21:28:47.175 Built /build/1st/acl2-8.5dfsg/books/data-structures/set-defuns.cert (4.123s) at 03-Aug-2023 21:28:51.338 Making /build/1st/acl2-8.5dfsg/books/tools/mv-nth.cert on 03-Aug-2023 21:28:51.536 Built /build/1st/acl2-8.5dfsg/books/tools/mv-nth.cert (5.702s) at 03-Aug-2023 21:28:57.274 Making /build/1st/acl2-8.5dfsg/books/data-structures/set-defthms.cert on 03-Aug-2023 21:28:57.521 Built /build/1st/acl2-8.5dfsg/books/data-structures/set-defthms.cert (5.500s) at 03-Aug-2023 21:29:03.062 Making /build/1st/acl2-8.5dfsg/books/arithmetic/real-listp.cert on 03-Aug-2023 21:29:03.246 Built /build/1st/acl2-8.5dfsg/books/arithmetic/real-listp.cert (4.135s) at 03-Aug-2023 21:29:07.423 Making /build/1st/acl2-8.5dfsg/books/data-structures/set-theory.cert on 03-Aug-2023 21:29:07.538 Built /build/1st/acl2-8.5dfsg/books/data-structures/set-theory.cert (3.316s) at 03-Aug-2023 21:29:10.875 Making /build/1st/acl2-8.5dfsg/books/arithmetic/realp.cert on 03-Aug-2023 21:29:11.058 Built /build/1st/acl2-8.5dfsg/books/arithmetic/realp.cert (3.240s) at 03-Aug-2023 21:29:14.347 Making /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/deps.cert on 03-Aug-2023 21:29:14.563 Built /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/deps.cert (3.659s) at 03-Aug-2023 21:29:18.258 Making /build/1st/acl2-8.5dfsg/books/data-structures/portcullis.cert on 03-Aug-2023 21:29:18.501 Built /build/1st/acl2-8.5dfsg/books/data-structures/portcullis.cert (4.120s) at 03-Aug-2023 21:29:22.651 make[4]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' /usr/bin/make -s -f Makefile \ firewallworks.cert INHIBIT='(set-inhibit-output-lst (list (quote prove) (quote proof-tree) (quote warning) (quote observation) (quote event) (quote history)))' ACL2='/build/1st/acl2-8.5dfsg/saved_acl2' make[5]: Entering directory '/build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' Making /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support/separation.cert on Thu Aug 3 21:29:23 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 2499 Aug 3 21:29 separation.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support/compatible.cert on Thu Aug 3 21:29:27 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 3062 Aug 3 21:29 compatible.cert [GC for 52224 CONTIGUOUS-BLOCKS pages..(T=46).GC finished] Making /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support/firewallspec.cert on Thu Aug 3 21:29:32 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 2590 Aug 3 21:29 firewallspec.cert Making /build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support/firewallworks.cert on Thu Aug 3 21:29:35 -12 2023 -rw-r--r-- 1 pbuilder1 pbuilder1 8502 Aug 3 21:29 firewallworks.cert make[5]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' make[4]: Leaving directory '/build/1st/acl2-8.5dfsg/books/workshops/2003/greve-wilding-vanfleet/support' Making /build/1st/acl2-8.5dfsg/books/acl2s/defdata/mv-proof.cert on 03-Aug-2023 21:29:38.323 Built /build/1st/acl2-8.5dfsg/books/acl2s/defdata/mv-proof.cert (5.403s) at 03-Aug-2023 21:29:43.778 Making /build/1st/acl2-8.5dfsg/books/acl2s/defdata/num-list-fns.cert on 03-Aug-2023 21:29:43.961 Built /build/1st/acl2-8.5dfsg/books/acl2s/defdata/num-list-fns.cert (5.191s) at 03-Aug-2023 21:29:49.198 Making /build/1st/acl2-8.5dfsg/books/acl2s/portcullis.cert on 03-Aug-2023 21:29:49.431 Built /build/1st/acl2-8.5dfsg/books/acl2s/portcullis.cert (5.460s) at 03-Aug-2023 21:29:54.942 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/banner.cert on 03-Aug-2023 21:29:55.137 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/banner.cert (3.371s) at 03-Aug-2023 21:29:58.546 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/mini-theories.cert on 03-Aug-2023 21:29:58.670 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/mini-theories.cert (3.969s) at 03-Aug-2023 21:30:02.646 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/basic-arithmetic-helper.cert on 03-Aug-2023 21:30:02.844 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/basic-arithmetic-helper.cert (3.121s) at 03-Aug-2023 21:30:06.022 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert on 03-Aug-2023 21:30:06.153 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/dynamic-e-d.cert (3.502s) at 03-Aug-2023 21:30:09.669 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/basic-arithmetic.cert on 03-Aug-2023 21:30:09.884 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/basic-arithmetic.cert (3.091s) at 03-Aug-2023 21:30:13.030 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/default-hint.cert on 03-Aug-2023 21:30:13.127 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/default-hint.cert (5.512s) at 03-Aug-2023 21:30:18.655 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/inequalities.cert on 03-Aug-2023 21:30:18.930 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/inequalities.cert (4.302s) at 03-Aug-2023 21:30:23.274 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/elim-hint.cert on 03-Aug-2023 21:30:23.553 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/elim-hint.cert (10.615s) at 03-Aug-2023 21:30:34.246 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/prefer-times.cert on 03-Aug-2023 21:30:34.436 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/prefer-times.cert (3.881s) at 03-Aug-2023 21:30:38.366 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/distributivity.cert on 03-Aug-2023 21:30:38.545 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/distributivity.cert (3.111s) at 03-Aug-2023 21:30:41.698 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/expt-helper.cert on 03-Aug-2023 21:30:41.907 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/expt-helper.cert (4.633s) at 03-Aug-2023 21:30:46.562 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/we-are-here.cert on 03-Aug-2023 21:30:46.840 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/we-are-here.cert (4.192s) at 03-Aug-2023 21:30:51.079 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/expt.cert on 03-Aug-2023 21:30:51.247 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/expt.cert (4.782s) at 03-Aug-2023 21:30:56.084 Making /build/1st/acl2-8.5dfsg/books/xdoc/book-thms.cert on 03-Aug-2023 21:30:56.285 Built /build/1st/acl2-8.5dfsg/books/xdoc/book-thms.cert (4.848s) at 03-Aug-2023 21:31:01.179 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/non-linear.cert on 03-Aug-2023 21:31:01.300 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/non-linear.cert (3.782s) at 03-Aug-2023 21:31:05.114 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/mini-theories.cert on 03-Aug-2023 21:31:05.291 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/mini-theories.cert (4.350s) at 03-Aug-2023 21:31:09.690 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/num-and-denom-helper.cert on 03-Aug-2023 21:31:09.903 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/num-and-denom-helper.cert (9.496s) at 03-Aug-2023 21:31:19.483 Making /build/1st/acl2-8.5dfsg/books/std/portcullis.cert on 03-Aug-2023 21:31:19.748 Built /build/1st/acl2-8.5dfsg/books/std/portcullis.cert (7.066s) at 03-Aug-2023 21:31:26.850 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/numerator-and-denominator.cert on 03-Aug-2023 21:31:27.215 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/numerator-and-denominator.cert (7.827s) at 03-Aug-2023 21:31:35.130 Making /build/1st/acl2-8.5dfsg/books/centaur/clex/portcullis.cert on 03-Aug-2023 21:31:35.472 Built /build/1st/acl2-8.5dfsg/books/centaur/clex/portcullis.cert (6.847s) at 03-Aug-2023 21:31:42.370 Making /build/1st/acl2-8.5dfsg/books/centaur/defrstobj/portcullis.cert on 03-Aug-2023 21:31:42.635 Built /build/1st/acl2-8.5dfsg/books/centaur/defrstobj/portcullis.cert (7.939s) at 03-Aug-2023 21:31:50.639 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/portcullis.cert on 03-Aug-2023 21:31:51.005 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/portcullis.cert (6.656s) at 03-Aug-2023 21:31:57.694 Making /build/1st/acl2-8.5dfsg/books/xdoc/xdoc-error.cert on 03-Aug-2023 21:31:57.940 Built /build/1st/acl2-8.5dfsg/books/xdoc/xdoc-error.cert (13.847s) at 03-Aug-2023 21:32:11.838 Making /build/1st/acl2-8.5dfsg/books/xdoc/verbosep.cert on 03-Aug-2023 21:32:12.195 Built /build/1st/acl2-8.5dfsg/books/xdoc/verbosep.cert (9.386s) at 03-Aug-2023 21:32:21.618 Making /build/1st/acl2-8.5dfsg/books/coi/maps/portcullis.cert on 03-Aug-2023 21:32:21.886 Built /build/1st/acl2-8.5dfsg/books/coi/maps/portcullis.cert (9.469s) at 03-Aug-2023 21:32:31.403 Making /build/1st/acl2-8.5dfsg/books/std/obags/portcullis.cert on 03-Aug-2023 21:32:31.656 Built /build/1st/acl2-8.5dfsg/books/std/obags/portcullis.cert (7.420s) at 03-Aug-2023 21:32:39.150 Making /build/1st/acl2-8.5dfsg/books/std/stobjs/stobj-table.cert on 03-Aug-2023 21:32:39.371 Built /build/1st/acl2-8.5dfsg/books/std/stobjs/stobj-table.cert (13.575s) at 03-Aug-2023 21:32:52.998 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/portcullis.cert on 03-Aug-2023 21:32:53.282 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/portcullis.cert (14.096s) at 03-Aug-2023 21:33:07.426 Making /build/1st/acl2-8.5dfsg/books/kestrel/number-theory/portcullis.cert on 03-Aug-2023 21:33:07.626 Built /build/1st/acl2-8.5dfsg/books/kestrel/number-theory/portcullis.cert (18.251s) at 03-Aug-2023 21:33:25.922 Making /build/1st/acl2-8.5dfsg/books/kestrel/java/portcullis.cert on 03-Aug-2023 21:33:26.140 Built /build/1st/acl2-8.5dfsg/books/kestrel/java/portcullis.cert (5.764s) at 03-Aug-2023 21:33:31.958 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/portcullis.cert on 03-Aug-2023 21:33:32.134 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/portcullis.cert (6.080s) at 03-Aug-2023 21:33:38.270 Making /build/1st/acl2-8.5dfsg/books/kestrel/soft/portcullis.cert on 03-Aug-2023 21:33:38.463 Built /build/1st/acl2-8.5dfsg/books/kestrel/soft/portcullis.cert (6.744s) at 03-Aug-2023 21:33:45.254 Making /build/1st/acl2-8.5dfsg/books/projects/irv/portcullis.cert on 03-Aug-2023 21:33:45.434 Built /build/1st/acl2-8.5dfsg/books/projects/irv/portcullis.cert (5.491s) at 03-Aug-2023 21:33:50.978 Making /build/1st/acl2-8.5dfsg/books/kestrel/acl2pl/portcullis.cert on 03-Aug-2023 21:33:51.277 Built /build/1st/acl2-8.5dfsg/books/kestrel/acl2pl/portcullis.cert (5.111s) at 03-Aug-2023 21:33:56.427 Making /build/1st/acl2-8.5dfsg/books/kestrel/c/portcullis.cert on 03-Aug-2023 21:33:56.638 Built /build/1st/acl2-8.5dfsg/books/kestrel/c/portcullis.cert (4.591s) at 03-Aug-2023 21:34:01.279 Making /build/1st/acl2-8.5dfsg/books/kestrel/json/portcullis.cert on 03-Aug-2023 21:34:01.493 Built /build/1st/acl2-8.5dfsg/books/kestrel/json/portcullis.cert (5.116s) at 03-Aug-2023 21:34:06.682 Making /build/1st/acl2-8.5dfsg/books/kestrel/simpl-imp/portcullis.cert on 03-Aug-2023 21:34:06.931 Built /build/1st/acl2-8.5dfsg/books/kestrel/simpl-imp/portcullis.cert (7.227s) at 03-Aug-2023 21:34:14.198 Making /build/1st/acl2-8.5dfsg/books/kestrel/solidity/portcullis.cert on 03-Aug-2023 21:34:14.412 Built /build/1st/acl2-8.5dfsg/books/kestrel/solidity/portcullis.cert (19.364s) at 03-Aug-2023 21:34:33.855 Making /build/1st/acl2-8.5dfsg/books/kestrel/isar/portcullis.cert on 03-Aug-2023 21:34:34.059 Built /build/1st/acl2-8.5dfsg/books/kestrel/isar/portcullis.cert (7.659s) at 03-Aug-2023 21:34:41.770 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/pfcs/portcullis.cert on 03-Aug-2023 21:34:42.062 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/pfcs/portcullis.cert (7.044s) at 03-Aug-2023 21:34:49.195 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/extract-non-local-events.cert on 03-Aug-2023 21:34:49.432 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/extract-non-local-events.cert (7.402s) at 03-Aug-2023 21:34:56.875 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/remove-event-types.cert on 03-Aug-2023 21:34:57.050 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/remove-event-types.cert (4.679s) at 03-Aug-2023 21:35:01.774 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/function-renamingp.cert on 03-Aug-2023 21:35:01.959 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/function-renamingp.cert (5.687s) at 03-Aug-2023 21:35:07.698 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/set-stobjs-in-declares-to-match.cert on 03-Aug-2023 21:35:07.973 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/set-stobjs-in-declares-to-match.cert (8.611s) at 03-Aug-2023 21:35:16.618 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/drop-corresponding-items.cert on 03-Aug-2023 21:35:16.800 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/drop-corresponding-items.cert (14.311s) at 03-Aug-2023 21:35:31.158 Making /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/maybe-verify-guards2.cert on 03-Aug-2023 21:35:31.434 Built /build/1st/acl2-8.5dfsg/books/kestrel/apt/utilities/maybe-verify-guards2.cert (12.499s) at 03-Aug-2023 21:35:43.990 Making /build/1st/acl2-8.5dfsg/books/projects/regex/portcullis.cert on 03-Aug-2023 21:35:44.298 Built /build/1st/acl2-8.5dfsg/books/projects/regex/portcullis.cert (28.626s) at 03-Aug-2023 21:36:12.966 Making /build/1st/acl2-8.5dfsg/books/projects/stateman/portcullis.cert on 03-Aug-2023 21:36:13.254 Built /build/1st/acl2-8.5dfsg/books/projects/stateman/portcullis.cert (14.691s) at 03-Aug-2023 21:36:28.006 Making /build/1st/acl2-8.5dfsg/books/tools/prettygoals/portcullis.cert on 03-Aug-2023 21:36:28.332 Built /build/1st/acl2-8.5dfsg/books/tools/prettygoals/portcullis.cert (8.059s) at 03-Aug-2023 21:36:36.446 Making /build/1st/acl2-8.5dfsg/books/workshops/2022/gamboa-primitive-roots/portcullis.cert on 03-Aug-2023 21:36:36.684 Built /build/1st/acl2-8.5dfsg/books/workshops/2022/gamboa-primitive-roots/portcullis.cert (9.240s) at 03-Aug-2023 21:36:45.967 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/support/util.cert on 03-Aug-2023 21:36:46.316 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/support/util.cert (9.324s) at 03-Aug-2023 21:36:55.711 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/keccak/keccak-team-test-data.cert on 03-Aug-2023 21:36:55.986 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/keccak/keccak-team-test-data.cert (11.879s) at 03-Aug-2023 21:37:15.542 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert on 03-Aug-2023 21:37:15.738 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/util.cert (5.683s) at 03-Aug-2023 21:37:21.475 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert on 03-Aug-2023 21:37:21.668 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/ground-zero.cert (4.396s) at 03-Aug-2023 21:37:26.098 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert on 03-Aug-2023 21:37:26.281 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rewrite-theory.cert (4.907s) at 03-Aug-2023 21:37:31.222 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert on 03-Aug-2023 21:37:31.388 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/cat-def.cert (6.522s) at 03-Aug-2023 21:37:37.954 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert on 03-Aug-2023 21:37:38.117 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/negative-syntaxp.cert (5.649s) at 03-Aug-2023 21:37:43.798 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert on 03-Aug-2023 21:37:43.976 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/inverted-factor.cert (6.781s) at 03-Aug-2023 21:37:50.810 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert on 03-Aug-2023 21:37:50.952 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/predicate.cert (5.738s) at 03-Aug-2023 21:37:56.734 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert on 03-Aug-2023 21:37:56.930 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logs.cert (6.638s) at 03-Aug-2023 21:38:03.630 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert on 03-Aug-2023 21:38:03.793 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/all-ones.cert (4.647s) at 03-Aug-2023 21:38:08.479 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert on 03-Aug-2023 21:38:08.656 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1-proofs.cert (5.039s) at 03-Aug-2023 21:38:13.735 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert on 03-Aug-2023 21:38:13.924 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/openers.cert (4.302s) at 03-Aug-2023 21:38:18.266 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert on 03-Aug-2023 21:38:18.458 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/package-defs.cert (3.886s) at 03-Aug-2023 21:38:22.402 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert on 03-Aug-2023 21:38:22.583 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/util.cert (5.651s) at 03-Aug-2023 21:38:28.294 Making /build/1st/acl2-8.5dfsg/books/kestrel/std/util/defarbrec-template.cert on 03-Aug-2023 21:38:28.491 Built /build/1st/acl2-8.5dfsg/books/kestrel/std/util/defarbrec-template.cert (5.196s) at 03-Aug-2023 21:38:33.743 Making /build/1st/acl2-8.5dfsg/books/kestrel/std/util/defmapping-templates.cert on 03-Aug-2023 21:38:33.908 Built /build/1st/acl2-8.5dfsg/books/kestrel/std/util/defmapping-templates.cert (7.010s) at 03-Aug-2023 21:38:40.974 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/file-system-lemmas.cert on 03-Aug-2023 21:38:41.101 Tick Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/file-system-lemmas.cert (641.715s) at 03-Aug-2023 21:49:23.166 Making /build/1st/acl2-8.5dfsg/books/projects/regex/defset-macros.cert on 03-Aug-2023 21:49:24.857 Built /build/1st/acl2-8.5dfsg/books/projects/regex/defset-macros.cert (19.144s) at 03-Aug-2023 21:49:44.135 Making /build/1st/acl2-8.5dfsg/books/projects/regex/regex-chartrans.cert on 03-Aug-2023 21:49:44.332 Built /build/1st/acl2-8.5dfsg/books/projects/regex/regex-chartrans.cert (6.552s) at 03-Aug-2023 21:49:50.938 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert on 03-Aug-2023 21:49:51.133 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/openers.cert (5.452s) at 03-Aug-2023 21:49:56.655 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert on 03-Aug-2023 21:49:56.850 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/lib/package-defs.cert (4.350s) at 03-Aug-2023 21:50:01.266 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert on 03-Aug-2023 21:50:01.484 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/openers.cert (7.728s) at 03-Aug-2023 21:50:09.260 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert on 03-Aug-2023 21:50:09.540 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib1/package-defs.cert (6.154s) at 03-Aug-2023 21:50:15.731 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert on 03-Aug-2023 21:50:15.956 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/openers.cert (6.700s) at 03-Aug-2023 21:50:22.695 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert on 03-Aug-2023 21:50:22.936 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib2/package-defs.cert (5.347s) at 03-Aug-2023 21:50:28.331 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert on 03-Aug-2023 21:50:28.429 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/openers.cert (5.006s) at 03-Aug-2023 21:50:33.463 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert on 03-Aug-2023 21:50:33.646 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/lib3/package-defs.cert (5.078s) at 03-Aug-2023 21:50:38.782 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert on 03-Aug-2023 21:50:38.898 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/fast-and.cert (4.452s) at 03-Aug-2023 21:50:43.370 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert on 03-Aug-2023 21:50:43.550 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/log-equal.cert (3.626s) at 03-Aug-2023 21:50:47.210 Making /build/1st/acl2-8.5dfsg/books/std/util/generate-symbol.cert on 03-Aug-2023 21:50:47.349 Built /build/1st/acl2-8.5dfsg/books/std/util/generate-symbol.cert (7.223s) at 03-Aug-2023 21:50:54.598 Making /build/1st/acl2-8.5dfsg/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert on 03-Aug-2023 21:50:54.867 Built /build/1st/acl2-8.5dfsg/books/system/doc/convert-legacy-doc/write-acl2-xdoc.cert (4.740s) at 03-Aug-2023 21:50:59.667 Making /build/1st/acl2-8.5dfsg/books/workshops/2022/stobj-tables/stobj-table-recognizer-issue.cert on 03-Aug-2023 21:50:59.811 Built /build/1st/acl2-8.5dfsg/books/workshops/2022/stobj-tables/stobj-table-recognizer-issue.cert (6.114s) at 03-Aug-2023 21:51:05.970 Making /build/1st/acl2-8.5dfsg/books/xdoc/book-thms-example.cert on 03-Aug-2023 21:51:06.145 Built /build/1st/acl2-8.5dfsg/books/xdoc/book-thms-example.cert (5.683s) at 03-Aug-2023 21:51:11.872 Making /build/1st/acl2-8.5dfsg/books/xdoc/xtopic.cert on 03-Aug-2023 21:51:12.180 Built /build/1st/acl2-8.5dfsg/books/xdoc/xtopic.cert (6.589s) at 03-Aug-2023 21:51:18.791 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/top.cert on 03-Aug-2023 21:51:18.929 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/support/top.cert (4.629s) at 03-Aug-2023 21:51:23.586 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/ecurve/portcullis.cert on 03-Aug-2023 21:51:23.914 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/ecurve/portcullis.cert (6.906s) at 03-Aug-2023 21:51:30.865 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert on 03-Aug-2023 21:51:31.090 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/ground-zero.cert (6.756s) at 03-Aug-2023 21:51:37.876 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert on 03-Aug-2023 21:51:38.077 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/rationalp.cert (4.864s) at 03-Aug-2023 21:51:42.986 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert on 03-Aug-2023 21:51:43.230 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/common-factor-defuns.cert (7.880s) at 03-Aug-2023 21:51:51.163 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert on 03-Aug-2023 21:51:51.368 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/arithmetic/complex-rationalp.cert (4.693s) at 03-Aug-2023 21:51:56.095 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert on 03-Aug-2023 21:51:56.354 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/logior1.cert (4.771s) at 03-Aug-2023 21:52:01.170 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/insert-text.cert on 03-Aug-2023 21:52:01.362 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/insert-text.cert (4.865s) at 03-Aug-2023 21:52:06.266 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/find-n-free-blocks.cert on 03-Aug-2023 21:52:06.438 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/find-n-free-blocks.cert (7.315s) at 03-Aug-2023 21:52:13.806 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/set-indices.cert on 03-Aug-2023 21:52:13.987 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/utilities/set-indices.cert (4.660s) at 03-Aug-2023 21:52:18.682 Making /build/1st/acl2-8.5dfsg/books/projects/regex/defset-encapsulates.cert on 03-Aug-2023 21:52:18.856 Built /build/1st/acl2-8.5dfsg/books/projects/regex/defset-encapsulates.cert (14.008s) at 03-Aug-2023 21:52:32.902 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/building-blocks-helper.cert on 03-Aug-2023 21:52:33.056 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/building-blocks-helper.cert (4.585s) at 03-Aug-2023 21:52:37.668 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simplify-helper.cert on 03-Aug-2023 21:52:37.883 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simplify-helper.cert (5.272s) at 03-Aug-2023 21:52:43.210 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/numerator-and-denominator.cert on 03-Aug-2023 21:52:43.399 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/numerator-and-denominator.cert (5.091s) at 03-Aug-2023 21:52:48.534 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/expt-helper.cert on 03-Aug-2023 21:52:48.715 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/expt-helper.cert (7.641s) at 03-Aug-2023 21:52:56.406 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/types-helper.cert on 03-Aug-2023 21:52:56.589 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/types-helper.cert (4.146s) at 03-Aug-2023 21:53:00.774 Making /build/1st/acl2-8.5dfsg/books/kestrel/bitcoin/portcullis.cert on 03-Aug-2023 21:53:00.965 Built /build/1st/acl2-8.5dfsg/books/kestrel/bitcoin/portcullis.cert (4.892s) at 03-Aug-2023 21:53:05.898 Making /build/1st/acl2-8.5dfsg/books/kestrel/crypto/ecdsa/portcullis.cert on 03-Aug-2023 21:53:06.092 Built /build/1st/acl2-8.5dfsg/books/kestrel/crypto/ecdsa/portcullis.cert (5.188s) at 03-Aug-2023 21:53:11.318 Making /build/1st/acl2-8.5dfsg/books/kestrel/zcash/portcullis.cert on 03-Aug-2023 21:53:11.492 Built /build/1st/acl2-8.5dfsg/books/kestrel/zcash/portcullis.cert (4.604s) at 03-Aug-2023 21:53:16.135 Making /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert on 03-Aug-2023 21:53:16.323 Built /build/1st/acl2-8.5dfsg/books/rtl/rel11/rel9-rtl-pkg/support/support/rtl.cert (12.170s) at 03-Aug-2023 21:53:28.566 Making /build/1st/acl2-8.5dfsg/books/projects/filesystems/l-models/file-system-1.cert on 03-Aug-2023 21:53:28.731 Built /build/1st/acl2-8.5dfsg/books/projects/filesystems/l-models/file-system-1.cert (8.754s) at 03-Aug-2023 21:53:37.523 Making /build/1st/acl2-8.5dfsg/books/projects/regex/equal-based-set.cert on 03-Aug-2023 21:53:37.616 Built /build/1st/acl2-8.5dfsg/books/projects/regex/equal-based-set.cert (4.483s) at 03-Aug-2023 21:53:42.113 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/building-blocks.cert on 03-Aug-2023 21:53:42.278 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/building-blocks.cert (15.222s) at 03-Aug-2023 21:53:57.622 Making /build/1st/acl2-8.5dfsg/books/kestrel/ethereum/portcullis.cert on 03-Aug-2023 21:53:57.820 Built /build/1st/acl2-8.5dfsg/books/kestrel/ethereum/portcullis.cert (4.852s) at 03-Aug-2023 21:54:02.727 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/common.cert on 03-Aug-2023 21:54:02.901 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/common.cert (55.767s) at 03-Aug-2023 21:54:58.782 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/basic.cert on 03-Aug-2023 21:54:58.963 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/basic.cert (3.866s) at 03-Aug-2023 21:55:02.879 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/natp-posp.cert on 03-Aug-2023 21:55:03.073 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/natp-posp.cert (2.857s) at 03-Aug-2023 21:55:05.966 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp-meta.cert on 03-Aug-2023 21:55:06.163 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp-meta.cert (49.830s) at 03-Aug-2023 21:55:56.086 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp-helper.cert on 03-Aug-2023 21:55:56.293 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp-helper.cert (4.317s) at 03-Aug-2023 21:56:00.658 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/collect.cert on 03-Aug-2023 21:56:00.845 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/collect.cert (5.416s) at 03-Aug-2023 21:56:06.330 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/types.cert on 03-Aug-2023 21:56:06.415 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/types.cert (3.239s) at 03-Aug-2023 21:56:09.698 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/remove-weak-inequalities.cert on 03-Aug-2023 21:56:09.870 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/remove-weak-inequalities.cert (4.739s) at 03-Aug-2023 21:56:14.663 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simple-equalities-and-inequalities-helper.cert on 03-Aug-2023 21:56:14.833 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simple-equalities-and-inequalities-helper.cert (4.258s) at 03-Aug-2023 21:56:19.134 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/if-normalization.cert on 03-Aug-2023 21:56:19.265 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/if-normalization.cert (3.823s) at 03-Aug-2023 21:56:23.128 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/forcing-types.cert on 03-Aug-2023 21:56:23.301 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/forcing-types.cert (4.262s) at 03-Aug-2023 21:56:27.611 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/forcing-types.cert on 03-Aug-2023 21:56:27.798 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/forcing-types.cert (6.287s) at 03-Aug-2023 21:56:34.134 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/if-normalization.cert on 03-Aug-2023 21:56:34.313 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/if-normalization.cert (3.775s) at 03-Aug-2023 21:56:38.154 Making /build/1st/acl2-8.5dfsg/books/kestrel/ethereum/semaphore/portcullis.cert on 03-Aug-2023 21:56:38.354 Built /build/1st/acl2-8.5dfsg/books/kestrel/ethereum/semaphore/portcullis.cert (7.225s) at 03-Aug-2023 21:56:45.642 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/normalize.cert on 03-Aug-2023 21:56:45.840 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/normalize.cert (11.207s) at 03-Aug-2023 21:56:57.122 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simplify.cert on 03-Aug-2023 21:56:57.311 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simplify.cert (17.346s) at 03-Aug-2023 21:57:14.758 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/expt.cert on 03-Aug-2023 21:57:15.030 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/expt.cert (11.147s) at 03-Aug-2023 21:57:26.306 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simple-equalities-and-inequalities.cert on 03-Aug-2023 21:57:26.488 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/simple-equalities-and-inequalities.cert (11.552s) at 03-Aug-2023 21:57:38.202 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp.cert on 03-Aug-2023 21:57:38.435 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/integerp.cert (20.878s) at 03-Aug-2023 21:57:59.702 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/arithmetic-theory.cert on 03-Aug-2023 21:57:59.862 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/arithmetic-theory.cert (11.994s) at 03-Aug-2023 21:58:11.958 Making /build/1st/acl2-8.5dfsg/books/centaur/defrstobj2/portcullis.cert on 03-Aug-2023 21:58:12.085 Built /build/1st/acl2-8.5dfsg/books/centaur/defrstobj2/portcullis.cert (4.664s) at 03-Aug-2023 21:58:16.767 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/top.cert on 03-Aug-2023 21:58:16.952 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/basic-ops/top.cert (6.496s) at 03-Aug-2023 21:58:23.498 Making /build/1st/acl2-8.5dfsg/books/centaur/bed/portcullis.cert on 03-Aug-2023 21:58:23.739 Built /build/1st/acl2-8.5dfsg/books/centaur/bed/portcullis.cert (4.327s) at 03-Aug-2023 21:58:28.130 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-basic-helper.cert on 03-Aug-2023 21:58:28.341 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-basic-helper.cert (19.505s) at 03-Aug-2023 21:58:47.956 Making /build/1st/acl2-8.5dfsg/books/kestrel/utilities/omaps/portcullis.cert on 03-Aug-2023 21:58:48.145 Built /build/1st/acl2-8.5dfsg/books/kestrel/utilities/omaps/portcullis.cert (4.708s) at 03-Aug-2023 21:58:52.907 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-basic.cert on 03-Aug-2023 21:58:53.119 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-basic.cert (20.501s) at 03-Aug-2023 21:59:13.714 Making /build/1st/acl2-8.5dfsg/books/centaur/depgraph/portcullis.cert on 03-Aug-2023 21:59:13.901 Built /build/1st/acl2-8.5dfsg/books/centaur/depgraph/portcullis.cert (5.179s) at 03-Aug-2023 21:59:19.122 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-helper.cert on 03-Aug-2023 21:59:19.328 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod-helper.cert (72.088s) at 03-Aug-2023 22:00:31.470 Making /build/1st/acl2-8.5dfsg/books/centaur/nrev/portcullis.cert on 03-Aug-2023 22:00:31.656 Built /build/1st/acl2-8.5dfsg/books/centaur/nrev/portcullis.cert (5.210s) at 03-Aug-2023 22:00:36.902 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod.cert on 03-Aug-2023 22:00:37.109 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/floor-mod.cert (104.159s) at 03-Aug-2023 22:02:21.441 Making /build/1st/acl2-8.5dfsg/books/centaur/bridge/portcullis.cert on 03-Aug-2023 22:02:21.625 Built /build/1st/acl2-8.5dfsg/books/centaur/bridge/portcullis.cert (3.947s) at 03-Aug-2023 22:02:25.614 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/truncate-rem.cert on 03-Aug-2023 22:02:25.827 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/truncate-rem.cert (6.205s) at 03-Aug-2023 22:02:32.070 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/more-floor-mod.cert on 03-Aug-2023 22:02:32.269 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/more-floor-mod.cert (33.315s) at 03-Aug-2023 22:03:05.683 Making /build/1st/acl2-8.5dfsg/books/oslib/portcullis.cert on 03-Aug-2023 22:03:05.854 Built /build/1st/acl2-8.5dfsg/books/oslib/portcullis.cert (3.927s) at 03-Aug-2023 22:03:09.807 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/mod-expt-fast.cert on 03-Aug-2023 22:03:10.024 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/mod-expt-fast.cert (10.424s) at 03-Aug-2023 22:03:20.483 Making /build/1st/acl2-8.5dfsg/books/kestrel/hdwallet/portcullis.cert on 03-Aug-2023 22:03:20.685 Built /build/1st/acl2-8.5dfsg/books/kestrel/hdwallet/portcullis.cert (4.611s) at 03-Aug-2023 22:03:25.334 Making /build/1st/acl2-8.5dfsg/books/centaur/satlink/portcullis.cert on 03-Aug-2023 22:03:25.518 Built /build/1st/acl2-8.5dfsg/books/centaur/satlink/portcullis.cert (3.614s) at 03-Aug-2023 22:03:29.168 Making /build/1st/acl2-8.5dfsg/books/centaur/getopt/portcullis.cert on 03-Aug-2023 22:03:29.314 Built /build/1st/acl2-8.5dfsg/books/centaur/getopt/portcullis.cert (4.574s) at 03-Aug-2023 22:03:33.923 Making /build/1st/acl2-8.5dfsg/books/centaur/ipasir/portcullis.cert on 03-Aug-2023 22:03:34.156 Built /build/1st/acl2-8.5dfsg/books/centaur/ipasir/portcullis.cert (5.154s) at 03-Aug-2023 22:03:39.327 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/logand-helper.cert on 03-Aug-2023 22:03:39.503 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/logand-helper.cert (14.525s) at 03-Aug-2023 22:03:54.059 Making /build/1st/acl2-8.5dfsg/books/build/portcullis.cert on 03-Aug-2023 22:03:54.236 Built /build/1st/acl2-8.5dfsg/books/build/portcullis.cert (4.600s) at 03-Aug-2023 22:03:58.858 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/logand.cert on 03-Aug-2023 22:03:59.035 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/logand.cert (106.716s) at 03-Aug-2023 22:05:45.839 Making /build/1st/acl2-8.5dfsg/books/system/doc/portcullis.cert on 03-Aug-2023 22:05:45.995 Built /build/1st/acl2-8.5dfsg/books/system/doc/portcullis.cert (4.598s) at 03-Aug-2023 22:05:50.637 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/top.cert on 03-Aug-2023 22:05:50.792 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/lib/floor-mod/top.cert (5.207s) at 03-Aug-2023 22:05:56.042 Making /build/1st/acl2-8.5dfsg/books/build/ifdef.cert on 03-Aug-2023 22:05:56.168 Built /build/1st/acl2-8.5dfsg/books/build/ifdef.cert (5.303s) at 03-Aug-2023 22:06:01.485 Making /build/1st/acl2-8.5dfsg/books/arithmetic-5/top.cert on 03-Aug-2023 22:06:01.629 Built /build/1st/acl2-8.5dfsg/books/arithmetic-5/top.cert (3.979s) at 03-Aug-2023 22:06:05.630 Making /build/1st/acl2-8.5dfsg/books/build/test/ifdeftest/defs.cert on 03-Aug-2023 22:06:05.776 Built /build/1st/acl2-8.5dfsg/books/build/test/ifdeftest/defs.cert (2.681s) at 03-Aug-2023 22:06:08.481 Making /build/1st/acl2-8.5dfsg/books/projects/codewalker/m1-version-3.cert on 03-Aug-2023 22:06:08.600 Built /build/1st/acl2-8.5dfsg/books/projects/codewalker/m1-version-3.cert (16.513s) at 03-Aug-2023 22:06:25.143 Making /build/1st/acl2-8.5dfsg/books/projects/leftist-trees/leftist-tree-defthms.cert on 03-Aug-2023 22:06:25.364 Built /build/1st/acl2-8.5dfsg/books/projects/leftist-trees/leftist-tree-defthms.cert (13.814s) at 03-Aug-2023 22:06:39.223 Making /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/literal.cert on 03-Aug-2023 22:06:39.425 Built /build/1st/acl2-8.5dfsg/books/projects/sat/proof-checker-array/supplemental/literal.cert (19.515s) at 03-Aug-2023 22:06:58.977 Making /build/1st/acl2-8.5dfsg/books/projects/stateman/byte-addressed-state.cert on 03-Aug-2023 22:06:59.110 Tick Built /build/1st/acl2-8.5dfsg/books/projects/stateman/byte-addressed-state.cert (264.220s) at 03-Aug-2023 22:11:23.455 Making /build/1st/acl2-8.5dfsg/books/tau/bounders/elementary-bounders.cert on 03-Aug-2023 22:11:23.688 Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Tick Fri Aug 4 18:36:07 UTC 2023 - pbuilder was killed by timeout after 18h.